Abstract
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.
Subject
Electrical and Electronic Engineering,Physics and Astronomy (miscellaneous),Materials Science (miscellaneous),Atomic and Molecular Physics, and Optics
Reference76 articles.
1. Parameterized quantum circuits as machine learning models;Benedetti;Quantum Sci. Technol.,2019
2. Variational quantum algorithms;Cerezo;Nat. Rev. Phys,2021
3. Quantum singular value decomposer;Bravo-Prieto;Phys. Rev. A,2020
4. Noisy intermediate-scale quantum (NISQ) algorithms;Bharti,2021
Cited by
47 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献