Shortcuts to Quantum Approximate Optimization Algorithm

Abstract

The Quantum Approximate Optimization Algorithm (QAOA) is a quantum-classical hybrid algorithm intending to find the ground state of a target Hamiltonian. Theoretically, QAOA can obtain the approximate solution if the quantum circuit is deep enough. Actually, the performance of QAOA decreases practically if the quantum circuit is deep since near-term devices are not noise-free and the errors caused by noise accumulate as the quantum circuit increases. In order to reduce the depth of quantum circuits, we propose a new ansatz dubbed as "Shortcuts to QAOA" (S-QAOA), S-QAOA provides shortcuts to the ground state of target Hamiltonian by including more two-body interactions and releasing the parameter freedoms. To be specific, besides the existing ZZ interaction in the QAOA ansatz, other two-body interactions are introduced in the S-QAOA ansatz such that the approximate solutions could be obtained with smaller circuit depth. Considering the MaxCut problem and Sherrington-Kirkpatrick (SK) model, numerically computation shows the YY interaction has the best performance. The reason for this might arise from the counterdiabatic effect generated by YY interaction. On top of this, we release the freedom of parameters of two-body interactions, which a priori do not necessarily have to be fully identical, and numerical results show that it is worth paying the extra cost of having more parameter freedom since one has a greater improvement on success rate.

References in corpus (22)

• Quantum Computing in the NISQ era and beyond
• A Quantum Approximate Optimization Algorithm
• Adiabatic Quantum Computing
• Shortcuts to adiabaticity: concepts, methods, and applications
• Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
• Shortcuts to adiabaticity
• Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
• Geometry and non-adiabatic response in quantum and classical systems
• Minimal Universal Two-qubit Quantum Circuits
• Quantum simulation of time-dependent Hamiltonians and the convenient illusion of Hilbert space
• Minimizing irreversible losses in quantum systems by local counter-diabatic driving
• Floquet-engineering counterdiabatic protocols in quantum many-body systems
• Adiabatic eigenstate deformations as a sensitive probe for quantum chaos
• Superadiabatic Controlled Evolutions and Universal Quantum Computation
• Shortcuts to Adiabaticity in Digitized Adiabatic Quantum Computing
• Digitized-counterdiabatic quantum approximate optimization algorithm
• Counterdiabaticity and the quantum approximate optimization algorithm
• Quantum Algorithms for Fixed Qubit Architectures
• On the Universality of the Quantum Approximate Optimization Algorithm
• Generalized Shortcuts to Adiabaticity and Enhanced Robustness Against Decoherence
• Energetic cost of superadiabatic quantum computation
• An adaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computer

Cited by in corpus (10)

• A Review on Quantum Approximate Optimization Algorithm and its Variants
• Barren Plateaus in Variational Quantum Computing
• Alignment between Initial State and Mixer Improves QAOA Performance for Constrained Optimization
• Optimizing Counterdiabaticity by Variational Quantum Circuits
• Convergence of Digitized-Counterdiabatic QAOA: circuit depth versus free parameters
• Improving the Performance of Digitized Counterdiabatic Quantum Optimization via Algorithm-Oriented Qubit Mapping
• Counterdiabatic driving for long-lived singlet state preparation
• Imaginary Hamiltonian variational ansatz for combinatorial optimization problems
• Evaluating the Practicality of Quantum Optimization Algorithms for Prototypical Industrial Applications
• Efficient Large-Scale Quantum Optimization via Counterdiabatic Ansatz