Asier Ozaeta
Research Subjects
Asier Ozaeta has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Peter L. McMahon
School of Applied and Engineering Physics, Cornell University, Ithaca, NY 14853, USA
3 shared publications Peter L McMahon
Applied Physics, Stanford University, Stanford, California, 94305, UNITED STATES
1 shared publication- Wim van Dam
Microsoft Quantum, Redmond, WA, USA
1 shared publication - Wim van Dam
QC Ware Corp 550 Hamilton Ave 94301 Palo Alto CA USA
1 shared publication
Latest Publications
- 26 September 2022
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 7 (4) , 045036
Expectation values from the single-layer quantum approximate optimization algorithm on Ising problems
We report on the energy-expectation-value landscapes produced by the single-layer ( p = 1) quantum approximate optimization algorithm ( QAOA ) when being used to solve Ising problems. The landscapes are obtained using an analytical formula that we derive. The formula allows us to predict the landscape for any given Ising problem instance and consequently predict the optimal QAOA parameters for heuristically solving that instance using the single-layer QAOA . We have validated our analytical formula by showing that it accurately reproduces the landscapes published in recent experimental reports. We then applied our methods to address the question: how well is the single-layer QAOA able to solve large benchmark problem instances? We used our analytical formula to calculate the optimal energy-expectation values for benchmark M AX -C UT problems containing up to 7000 vertices and 41 459 edges. We also calculated the optimal energy expectations for general Ising problems with up to 100 000 vertices and 150 000 edges. Our results provide an estimate for how well the single-layer QAOA may work when run on a quantum computer with thousands of qubits. In addition to providing performance estimates when optimal angles are used, we are able to use our analytical results to investigate the difficulties one may encounter when running the QAOA in practice for different classes of Ising instances. We find that depending on the parameters of the Ising Hamiltonian, the expectation-value landscapes can be rather complex, with sharp features that necessitate highly accurate rotation gates in order for the QAOA to be run optimally on quantum hardware. We also present analytical results that explain some of the qualitative landscape features that are observed numerically.
- 26 September 2022
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 7 (4) , 045036
Expectation values from the single-layer quantum approximate optimization algorithm on Ising problems
We report on the energy-expectation-value landscapes produced by the single-layer ( p = 1) quantum approximate optimization algorithm ( QAOA ) when being used to solve Ising problems. The landscapes are obtained using an analytical formula that we derive. The formula allows us to predict the landscape for any given Ising problem instance and consequently predict the optimal QAOA parameters for heuristically solving that instance using the single-layer QAOA . We have validated our analytical formula by showing that it accurately reproduces the landscapes published in recent experimental reports. We then applied our methods to address the question: how well is the single-layer QAOA able to solve large benchmark problem instances? We used our analytical formula to calculate the optimal energy-expectation values for benchmark M AX -C UT problems containing up to 7000 vertices and 41 459 edges. We also calculated the optimal energy expectations for general Ising problems with up to 100 000 vertices and 150 000 edges. Our results provide an estimate for how well the single-layer QAOA may work when run on a quantum computer with thousands of qubits. In addition to providing performance estimates when optimal angles are used, we are able to use our analytical results to investigate the difficulties one may encounter when running the QAOA in practice for different classes of Ising instances. We find that depending on the parameters of the Ising Hamiltonian, the expectation-value landscapes can be rather complex, with sharp features that necessitate highly accurate rotation gates in order for the QAOA to be run optimally on quantum hardware. We also present analytical results that explain some of the qualitative landscape features that are observed numerically.
- Open Access
Expectation Values from the Single-Layer Quantum Approximate Optimization Algorithm on Ising Problems
We report on the energy-expectation-value landscapes produced by the single-layer ($p=1$) Quantum Approximate Optimization Algorithm (QAOA) when being used to solve Ising problems. The landscapes are obtained using an analytical formula that we derive. The formula allows us to predict the landscape for any given Ising problem instance and consequently predict the optimal QAOA parameters for heuristically solving that instance using the single-layer QAOA. We have validated our analytical formula by showing that it accurately reproduces the landscapes published in recent experimental reports. We then applied our methods to address the question: how well is the single-layer QAOA able to solve large benchmark problem instances? We used our analytical formula to calculate the optimal energy-expectation values for benchmark MAX-CUT problems containing up to $7\,000$ vertices and $41\,459$ edges. We also calculated the optimal energy expectations for general Ising problems with up to $100\,000$ vertices and $150\,000$ edges. Our results provide an estimate for how well the single-layer QAOA may work when run on a quantum computer with thousands of qubits. In addition to providing performance estimates when optimal angles are used, we are able to use our analytical results to investigate the difficulties one may encounter when running the QAOA in practice for different classes of Ising instances. We find that depending on the parameters of the Ising Hamiltonian, the expectation-value landscapes can be rather complex, with sharp features that necessitate highly accurate rotation gates in order for the QAOA to be run optimally on quantum hardware. We also present analytical results that explain some of the qualitative landscape features that are observed numerically.Open AccessExpectation Values from the Single-Layer Quantum Approximate Optimization Algorithm on Ising Problems
We report on the energy-expectation-value landscapes produced by the single-layer ($p=1$) Quantum Approximate Optimization Algorithm (QAOA) when being used to solve Ising problems. The landscapes are obtained using an analytical formula that we derive. The formula allows us to predict the landscape for any given Ising problem instance and consequently predict the optimal QAOA parameters for heuristically solving that instance using the single-layer QAOA. We have validated our analytical formula by showing that it accurately reproduces the landscapes published in recent experimental reports. We then applied our methods to address the question: how well is the single-layer QAOA able to solve large benchmark problem instances? We used our analytical formula to calculate the optimal energy-expectation values for benchmark MAX-CUT problems containing up to $7\,000$ vertices and $41\,459$ edges. We also calculated the optimal energy expectations for general Ising problems with up to $100\,000$ vertices and $150\,000$ edges. Our results provide an estimate for how well the single-layer QAOA may work when run on a quantum computer with thousands of qubits. In addition to providing performance estimates when optimal angles are used, we are able to use our analytical results to investigate the difficulties one may encounter when running the QAOA in practice for different classes of Ising instances. We find that depending on the parameters of the Ising Hamiltonian, the expectation-value landscapes can be rather complex, with sharp features that necessitate highly accurate rotation gates in order for the QAOA to be run optimally on quantum hardware. We also present analytical results that explain some of the qualitative landscape features that are observed numerically. - 1 April 2019
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 4 (2) , 025015
Decoherence of up to 8-qubit entangled states in a 16-qubit superconducting quantum processor
We report on the coherence of Greenberger–Horne–Zeilinger (GHZ) states comprised of up to 8 qubits in the IBM ibmqx5 16-qubit quantum processor. In particular, we evaluate the coherence of GHZ states with N = 1, …, 8 qubits 4 , as a function of a delay time between state creation and measurement. We find that the decay in coherence occurs at a rate that is linear in the number of qubits. This is consistent with a model in which the dominant noise affecting the system is uncorrelated across qubits.
- 1 April 2019
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 4 (2) , 025015
Decoherence of up to 8-qubit entangled states in a 16-qubit superconducting quantum processor
We report on the coherence of Greenberger–Horne–Zeilinger (GHZ) states comprised of up to 8 qubits in the IBM ibmqx5 16-qubit quantum processor. In particular, we evaluate the coherence of GHZ states with N = 1, …, 8 qubits 4 , as a function of a delay time between state creation and measurement. We find that the decay in coherence occurs at a rate that is linear in the number of qubits. This is consistent with a model in which the dominant noise affecting the system is uncorrelated across qubits.
- Open Access
Decoherence of up to 8-qubit entangled states in a 16-qubit superconducting quantum processor
We report on the coherence of Greenberger-Horne-Zeilinger (GHZ) states comprised of up to 8 qubits in the IBM ibmqx5 16-qubit quantum processor. In particular, we evaluate the coherence of GHZ states with $N=1,\ldots,8$ qubits, as a function of a delay time between state creation and measurement. We find that the decay in coherence occurs at a rate that is linear in the number of qubits. This is consistent with a model in which the dominant noise affecting the system is uncorrelated across qubits.Open AccessDecoherence of up to 8-qubit entangled states in a 16-qubit superconducting quantum processor
We report on the coherence of Greenberger-Horne-Zeilinger (GHZ) states comprised of up to 8 qubits in the IBM ibmqx5 16-qubit quantum processor. In particular, we evaluate the coherence of GHZ states with $N=1,\ldots,8$ qubits, as a function of a delay time between state creation and measurement. We find that the decay in coherence occurs at a rate that is linear in the number of qubits. This is consistent with a model in which the dominant noise affecting the system is uncorrelated across qubits.