DADavid Amaro

David Amaro

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


David Amaro has a total of 21 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Performance analysis of a filtering variational quantum algorithm

    by Gabriel Marin-Sanchez, David Amaro

    Even a minor boost in solving combinatorial optimization problems can greatly benefit multiple industries. Quantum computers, with their unique information processing capabilities, hold promise for delivering such enhancements. The filtering variational quantum eigensolver (F-VQE) is a variational hybrid quantum algorithm designed to solve combinatorial optimization problems on existing quantum computers with limited qubit number, connectivity, and fidelity. In this work we employ instantaneous quantum polynomial circuits as our parameterized quantum circuits. We propose a hardware-efficient implementation that respects limited qubit connectivity and show that they halve the number of circuits necessary to evaluate the gradient with the parameter-shift rule. To assess the potential of this protocol in the context of combinatorial optimization, we conduct extensive numerical analysis. We compare the performance against three classical baseline algorithms on weighted MaxCut and the asymmetric traveling salesperson problem (ATSP). We employ noiseless simulators for problems encoded on 13–29 qubits, and up to 37 qubits on the IBMQ real quantum devices. The ATSP encoding employed reduces the number of qubits and avoids the need of constraints compared to the standard quadratic unconstrained binary optimization/Ising model. Despite some observed positive signs, we conclude that significant development is necessary for a practical advantage with F-VQE.


  • Open Access

    Exploring the neighborhood of 1-layer QAOA with Instantaneous Quantum Polynomial circuits

    by Sebastian Leontica, David Amaro

    We embed 1-layer QAOA circuits into the larger class of parameterized Instantaneous Quantum Polynomial circuits to produce an improved variational quantum algorithm for solving combinatorial optimization problems. The use of analytic expressions to find optimal parameters classically makes our protocol robust against barren plateaus and hardware noise. The average overlap with the ground state scales as $\mathcal{O}(2^{-0.31 N})$ with the number of qubits $N$ for random Sherrington-Kirkpatrick (SK) Hamiltonians of up to 29 qubits, a polynomial improvement over 1-layer QAOA. Additionally, we observe that performing variational imaginary time evolution on the manifold approximates low-temperature pseudo-Boltzmann states. Our protocol outperforms 1-layer QAOA on the recently released Quantinuum H2 trapped-ion quantum hardware and emulator, where we obtain an average approximation ratio of $0.985$ across 312 random SK instances of 7 to 32 qubits, from which almost $44\%$ are solved optimally using 4 to 1208 shots per instance.

  • Open Access

    Exploring the neighborhood of 1-layer QAOA with instantaneous quantum polynomial circuits

    by Sebastian Leontica, David Amaro

    We embed 1-layer QAOA circuits into the larger class of parametrized instantaneous quantum polynomial circuits to produce an improved variational quantum algorithm for solving combinatorial optimization problems. The use of analytic expressions to find optimal parameters classically makes our protocol robust against barren plateaus and hardware noise. The average overlap with the ground state scales as 2−0.31(2)N with the number of qubits N for random Sherrington-Kirkpatrick (SK) Hamiltonians of up to 29 qubits, a polynomial improvement over 1-layer QAOA. Additionally, we observe that performing variational imaginary time evolution on the manifold approximates low-temperature pseudo-Boltzmann states. Our protocol outperforms 1-layer QAOA on the recently released Quantinuum H2 trapped-ion quantum hardware and emulator, where we obtain an average approximation ratio of 0.985 across 312 random SK instances of 7 to 32 qubits, from which almost 44% are solved optimally using only 4 to 1208 shots per instance.


  • Protecting expressive circuits with a quantum error detection code

    by Chris N. Self, Marcello Benedetti, David Amaro


  • Open Access

    Protecting Expressive Circuits with a Quantum Error Detection Code

    by Chris N. Self, Marcello Benedetti, David Amaro

    Quantum error correction opens the way for quantum computers to speed up relevant tasks like simulating quantum systems. However, fully fault-tolerant quantum error correction is too resource intensive for existing quantum computers. In this context we develop the $[[k+2,k,2]]$ quantum error detection code, for implementations on existing trapped-ion computers. Encoding $k$ logical qubits into $k+2$ physical qubits, this code presents fault-tolerant state initialisation and syndrome measurement circuits that can detect any single-qubit error. It provides a universal set of local and global logical rotations that, notably, have physical support on only two qubits. A high-fidelity -- though non fault-tolerant -- compilation of this universal gate set is possible thanks to the two-qubit physical rotations present in trapped-ion computers with all-to-all connectivity. Given the particular structure of the logical operators, we nickname it the Iceberg code. On the 12-qubit Quantinuum H1-2 hardware we demonstrate the protection of circuits of 8 logical qubits with up to 256 layers, saturate the logical quantum volume of $2^8$, and show the positive effect of increasing the frequency of syndrome measurements within the circuit. These results illustrate the practical usefulness of the Iceberg code to protect expressive circuits on existing trapped-ion quantum computers.


  • Open Access

    A case study of variational quantum algorithms for a job shop scheduling problem

    by David Amaro, Matthias Rosenkranz, Nathan Fitzpatrick, Koji Hirano, Mattia Fiorentini

    Combinatorial optimization models a vast range of industrial processes aiming at improving their efficiency. In general, solving this type of problem exactly is computationally intractable. Therefore, practitioners rely on heuristic solution approaches. Variational quantum algorithms are optimization heuristics that can be demonstrated with available quantum hardware. In this case study, we apply four variational quantum heuristics running on IBM's superconducting quantum processors to the job shop scheduling problem. Our problem optimizes a steel manufacturing process. A comparison on 5 qubits shows that the recent filtering variational quantum eigensolver (F-VQE) converges faster and samples the global optimum more frequently than the quantum approximate optimization algorithm (QAOA), the standard variational quantum eigensolver (VQE), and variational quantum imaginary time evolution (VarQITE). Furthermore, F-VQE readily solves problem sizes of up to 23 qubits on hardware without error mitigation post processing.

  • Open Access

    Filtering variational quantum algorithms for combinatorial optimization

    by David Amaro, Carlo Modica, Matthias Rosenkranz, Mattia Fiorentini, Marcello Benedetti, Michael Lubasch

    Current gate-based quantum computers have the potential to provide a computational advantage if algorithms use quantum hardware efficiently. To make combinatorial optimization more efficient, we introduce the Filtering Variational Quantum Eigensolver (F-VQE) which utilizes filtering operators to achieve faster and more reliable convergence to the optimal solution. Additionally we explore the use of causal cones to reduce the number of qubits required on a quantum computer. Using random weighted MaxCut problems, we numerically analyze our methods and show that they perform better than the original VQE algorithm and the Quantum Approximate Optimization Algorithm (QAOA). We also demonstrate the experimental feasibility of our algorithms on a Honeywell trapped-ion quantum processor.

  • Open Access

    A case study of variational quantum algorithms for a job shop scheduling problem

    by David Amaro, Matthias Rosenkranz, Nathan Fitzpatrick, Koji Hirano, Mattia Fiorentini

    Combinatorial optimization models a vast range of industrial processes aiming at improving their efficiency. In general, solving this type of problem exactly is computationally intractable. Therefore, practitioners rely on heuristic solution approaches. Variational quantum algorithms are optimization heuristics that can be demonstrated with available quantum hardware. In this case study, we apply four variational quantum heuristics running on IBM’s superconducting quantum processors to the job shop scheduling problem. Our problem optimizes a steel manufacturing process. A comparison on 5 qubits shows that the recent filtering variational quantum eigensolver (F-VQE) converges faster and samples the global optimum more frequently than the quantum approximate optimization algorithm (QAOA), the standard variational quantum eigensolver (VQE), and variational quantum imaginary time evolution (VarQITE). Furthermore, F-VQE readily solves problem sizes of up to 23 qubits on hardware without error mitigation post processing.


  • Top Cited Papers
    Open Access

    Filtering variational quantum algorithms for combinatorial optimization

    by David Amaro, Carlo Modica, Matthias Rosenkranz, Mattia Fiorentini, Marcello Benedetti, Michael Lubasch

    Current gate-based quantum computers have the potential to provide a computational advantage if algorithms use quantum hardware efficiently. To make combinatorial optimization more efficient, we introduce the filtering variational quantum eigensolver which utilizes filtering operators to achieve faster and more reliable convergence to the optimal solution. Additionally we explore the use of causal cones to reduce the number of qubits required on a quantum computer. Using random weighted MaxCut problems, we numerically analyze our methods and show that they perform better than the original VQE algorithm and the quantum approximate optimization algorithm. We also demonstrate the experimental feasibility of our algorithms on a Quantinuum trapped-ion quantum processor powered by Honeywell.


  • Open Access

    Scalable characterization of localizable entanglement in noisy topological quantum codes

    by David Amaro, Markus Mueller, Amit Kumar Pal

    Topological quantum error correcting codes have emerged as leading candidates towards the goal of achieving large-scale fault-tolerant quantum computers. However, quantifying entanglement in these systems of large size in the presence of noise is a challenging task. In this paper, we provide two different prescriptions to characterize noisy stabilizer states, including the surface and the color codes, in terms of localizable entanglement over a subset of qubits. In one approach, we exploit appropriately constructed entanglement witness operators to estimate a witness-based lower bound of localizable entanglement, which is directly accessible in experiments. In the other recipe, we use graph states that are local unitary equivalent to the stabilizer state to determine a computable measurement-based lower bound of localizable entanglement. If used experimentally, this translates to a lower bound of localizable entanglement obtained from single-qubit measurements in specific bases to be performed on the qubits outside the subsystem of interest. Towards computing these lower bounds, we discuss in detail the methodology of obtaining a local unitary equivalent graph state from a stabilizer state, which includes a new and scalable geometric recipe as well as an algebraic method that applies to general stabilizer states of arbitrary size. Moreover, as a crucial step of the latter recipe, we develop a scalable graph-transformation algorithm that creates a link between two specific nodes in a graph using a sequence of local complementation operations. We develop open-source Python packages for these transformations, and illustrate the methodology by applying it to a noisy topological color code, and study how the witness and measurement-based lower bounds of localizable entanglement varies with the distance between the chosen qubits.