Journal
SCIENTIFIC REPORTS
Volume 12, Issue 1, Pages -Publisher
NATURE PORTFOLIO
DOI: 10.1038/s41598-022-20853-w
Keywords
-
Categories
Funding
- DoE ASCR Accelerated Research in Quantum Computing program [DE-SC0020312]
- DoE QSA
- NSL QLCI [OMA-2120757]
- NSF PFCQC program
- DoE ASCR Quantum Testbed Pathfinder program [DE-SC0019040]
- U.S. Department of Energy [DE-SC0019499]
- AFOSR
- ARO MURI
- AFOSR MURI
- DARPA SAVaNT ADVENT
- U.S. Department of Energy (DOE) [DE-SC0019499] Funding Source: U.S. Department of Energy (DOE)
Ask authors/readers for more resources
This work explores the potential of near-term quantum computers to solve constrained-optimization problems and demonstrates the largest execution of a quantum optimization algorithm that preserves constraints on quantum hardware. By encoding the constraints directly into the quantum circuit, the necessity for this approach is shown. Different optimization algorithms are compared, and the implications of their execution on near-term quantum hardware are discussed.
Realizing the potential of near-term quantum computers to solve industry-relevant constrained-optimization problems is a promising path to quantum advantage. In this work, we consider the extractive summarization constrained-optimization problem and demonstrate the largest-to-date execution of a quantum optimization algorithm that natively preserves constraints on quantum hardware. We report results with the Quantum Alternating Operator Ansatz algorithm with a Hamming-weight-preserving XY mixer (XY-QAOA) on trapped-ion quantum computer. We successfully execute XY-QAOA circuits that restrict the quantum evolution to the in-constraint subspace, using up to 20 qubits and a two-qubit gate depth of up to 159. We demonstrate the necessity of directly encoding the constraints into the quantum circuit by showing the trade-off between the in-constraint probability and the quality of the solution that is implicit if unconstrained quantum optimization methods are used. We show that this trade-off makes choosing good parameters difficult in general. We compare XY-QAOA to the Layer Variational Quantum Eigensolver algorithm, which has a highly expressive constant-depth circuit, and the Quantum Approximate Optimization Algorithm. We discuss the respective trade-offs of the algorithms and implications for their execution on near-term quantum hardware.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available