Quantum Local Search with the Quantum Alternating Operator Ansatz
- Department of Computer Science, Princeton University, Princeton, NJ 08540, USA.
- Argonne National Laboratory, 9700 S. Cass Ave., Lemont, IL 60439, USA.
We present a new hybrid, local search algorithm for quantum approximate optimization of constrained combinatorial optimization problems. We focus on the Maximum Independent Set problem and demonstrate the ability of quantum local search to solve large problem instances on quantum devices with few qubits. This hybrid algorithm iteratively finds independent sets over carefully constructed neighborhoods and combines these solutions to obtain a global solution. We study the performance of this algorithm on 3-regular, Community, and Erdős-Rényi graphs with up to 100 nodes.
- Sponsoring Organization:
- USDOE
- Grant/Contract Number:
- AC02-06CH11357
- OSTI ID:
- 1882740
- Journal Information:
- Quantum, Journal Name: Quantum Vol. 6; ISSN 2521-327X
- Publisher:
- Verein zur Forderung des Open Access Publizierens in den QuantenwissenschaftenCopyright Statement
- Country of Publication:
- Austria
- Language:
- English
Similar Records
Multilevel Combinatorial Optimization across Quantum Architectures
Red-QAOA: Efficient Variational Optimization through Circuit Reduction
Journal Article
·
Fri Feb 12 19:00:00 EST 2021
· ACM Transactions on Quantum Computing
·
OSTI ID:1805725
Red-QAOA: Efficient Variational Optimization through Circuit Reduction
Conference
·
Sat Apr 27 00:00:00 EDT 2024
·
OSTI ID:2426427