Quantum Approximate Optimization Algorithm with Adaptive Bias Fields
arXiv:2105.11946 · doi:10.1103/PhysRevResearch.4.023249
Abstract
The quantum approximate optimization algorithm (QAOA) transforms a simple many-qubit wavefunction into one which encodes a solution to a difficult classical optimization problem. It does this by optimizing the schedule according to which two unitary operators are alternately applied to the qubits. In this paper, the QAOA is modified by updating the operators themselves to include local fields, using information from the measured wavefunction at the end of one iteration step to improve the operators at later steps. It is shown by numerical simulation on MaxCut problems that, for a fixed accuracy, this procedure decreases the runtime of QAOA very substantially. This improvement appears to increase with the problem size. Our method requires essentially the same number of quantum gates per optimization step as the standard QAOA, and no additional measurements. This modified algorithm enhances the prospects for quantum advantage for certain optimization problems.
arXiv comment16 pages, 13 figures
References in corpus (44)
- Adam: A Method for Stochastic Optimization
- Quantum Computing in the NISQ era and beyond
- A variational eigenvalue solver on a quantum processor
- Variational Quantum Algorithms
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Ising formulations of many NP problems
- A Quantum Approximate Optimization Algorithm
- Noisy intermediate-scale quantum (NISQ) algorithms
- Adiabatic Quantum Computing
- An adaptive variational algorithm for exact molecular simulations on a quantum computer
- From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
- Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
- Quantum optimization using variational algorithms on near-term quantum devices
- Large-scale silicon quantum photonics implementing arbitrary two-qubit processing
- Quantum autoencoders for efficient compression of quantum data
- Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
- qubit-ADAPT-VQE: An adaptive algorithm for constructing hardware-efficient ansatze on a quantum processor
- QAOA for Max-Cut requires hundreds of qubits for quantum speed-up
- Subspace-search variational quantum eigensolver for excited states
- Obstacles to State Preparation and Variational Optimization from Symmetry Protection
- Quantum Approximate Optimization of the Long-Range Ising Model with a Trapped-Ion Quantum Simulator
- Accelerated Variational Quantum Eigensolver
- Unsupervised Machine Learning on a Hybrid Quantum Computer
- Variational Quantum State Diagonalization
- Noise Resilience of Variational Quantum Compiling
- Optimizing Variational Quantum Algorithms using Pontryagin's Minimum Principle
- Variational Quantum State Eigensolver
- Benchmarking the Quantum Approximate Optimization Algorithm
- Quantum autoencoders to denoise quantum data
- Optimal Protocols in Quantum Annealing and QAOA Problems
- Variational Quantum Fidelity Estimation
- Quantum Optimization with a Novel Gibbs Objective Function and Ansatz Architecture Search
- MAXCUT QAOA performance guarantees for p >1
- Implementation of the XY interaction family with calibration of a single pulse
- Quantum Algorithms for Fixed Qubit Architectures
- Training A Quantum Optimizer
- Improved success probability with greater circuit depth for the quantum approximate optimization algorithm
- Noise-Assisted Quantum Autoencoder
- Quantum annealing with longitudinal bias fields
- Lyapunov control-inspired strategies for quantum combinatorial optimization
- An adaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computer
- Steering random spin systems to speed up the quantum adiabatic algorithm
- A variational quantum algorithm for Hamiltonian diagonalization
- When Diabatic Trumps Adiabatic in Quantum Optimization
Cited by in corpus (18)
- A Review on Quantum Approximate Optimization Algorithm and its Variants
- An Expressive Ansatz for Low-Depth Quantum Approximate Optimisation
- Mitigating algorithmic errors in quantum optimization through energy extrapolation
- Solution of SAT Problems with the Adaptive-Bias Quantum Approximate Optimization Algorithm
- Convergence of Digitized-Counterdiabatic QAOA: circuit depth versus free parameters
- Variational quantum eigensolver with linear depth problem-inspired ansatz for solving portfolio optimization in finance
- Improving the performance of quantum approximate optimization for preparing non-trivial quantum states without translational symmetry
- Simulation of a feedback-based algorithm for quantum optimization for a realistic neutral atom system with an optimized small-angle controlled-phase gate
- Benchmarking hybrid digitized-counterdiabatic quantum optimization
- Quantum annealing sampling with a bias field
- Warm Start Adaptive-Bias Quantum Approximate Optimization Algorithm
- Atom Cavity Encoding for NP-Complete Problems
- Constraint-Aware Quantum Optimization via Hamming Weight Operators
- Exploiting many-body localization for scalable variational quantum simulation
- Digitized Counter-Diabatic Quantum Optimization for Bin Packing Problem
- Depth Optimized Ansatz Circuit in QAOA for Max-Cut
- Efficient Digital Quadratic Unconstrained Binary Optimization Solvers for SAT Problems
- Constrained Quantum Optimization via Iterative Warm-Start XY-Mixers