Filtering variational quantum algorithms for combinatorial optimization
Top Cited Papers
Open Access
- 1 January 2022
- journal article
- research article
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 7 (1) , 015021
Abstract
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.Keywords
All Related Versions
This publication has 63 references indexed in Scilit:
- The unconstrained binary quadratic programming problem: a surveyJournal of Combinatorial Optimization, 2014
- Ising formulations of many NP problemsFrontiers in Physics, 2014
- Generalized Householder transformations for the complex symmetric eigenvalue problemThe European Physical Journal Plus, 2013
- Class of Quantum Many-Body States That Can Be Efficiently SimulatedPhysical Review Letters, 2008
- The kernel polynomial methodReviews of Modern Physics, 2006
- Some optimal inapproximability resultsJournal of the ACM, 2001
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete ProblemScience, 2001
- Semidefinite programming and combinatorial optimizationApplied Numerical Mathematics, 1999
- Quantum annealing in the transverse Ising modelPhysical Review E, 1998
- Optimization by Simulated AnnealingScience, 1983