Universal Resources for QAOA and Quantum Annealing

Abstract

The Quantum Approximate Optimization Algorithm (QAOA) is a variational ansatz that resembles the Trotterized dynamics of a Quantum Annealing (QA) protocol. This work formalizes this connection formally and empirically, showing the angles of a multilayer QAOA circuit converge to universal QA trajectories. Furthermore, the errors in both QAOA circuits and QA paths act as thermal excitations in pseudo-Boltzmann probability distributions whose temperature decreases with the invested resource -- i.e. integrated angles or total time -- and which in QAOA also contain a higher temperature arising from the Trotterization. This also means QAOA and QA are cooling protocols and simulators of partition functions whose target temperature can be tuned by rescaling the universal trajectory. The average cooling power of both methods exhibits favorable algebraic scalings with respect to the target temperature and problem size, whereby in QAOA the coldest temperature is inversely proportional to the number of layers, $T\sim 1/p$, and to the integrated angles -- or integrated interactions in QA.

12 pages, 9 Figures

References in corpus (23)

• SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
• Adiabatic Quantum Computing
• Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
• Training variational quantum algorithms is NP-hard
• Warm-starting quantum optimization
• Quantum Approximate Optimization of the Long-Range Ising Model with a Trapped-Ion Quantum Simulator
• The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size
• Towards Fault Tolerant Adiabatic Quantum Computation
• Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem
• Parameter Concentration in Quantum Approximate Optimization
• Polynomial-Time Simulation of Pairing Models on a Quantum Computer
• Parameter Transfer for Quantum Approximate Optimization of Weighted MaxCut
• Quantum approximate optimization via learning-based adaptive optimization
• Parameter Setting in Quantum Approximate Optimization of Weighted Problems
• Variational optimization of the quantum annealing schedule for the Lechner-Hauke-Zoller scheme
• Quantum Approximate Optimization Algorithm pseudo-Boltzmann states
• Designing Quantum Annealing Schedules using Bayesian Optimization
• Scaling Whole-Chip QAOA for Higher-Order Ising Spin Glass Models on Heavy-Hex Graphs
• Symmetry-informed transferability of optimal parameters in the Quantum Approximate Optimization Algorithm
• Instance Independence of Single Layer Quantum Approximate Optimization Algorithm on Mixed-Spin Models at Infinite Size
• Performance of Quantum Approximate Optimization with Quantum Error Detection
• Connection between single-layer Quantum Approximate Optimization Algorithm interferometry and thermal distributions sampling
• Effective temperature in approximate quantum many-body states

Cited by in corpus (3)

• Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms
• Quantum annealing and condensed matter physics
• Pilot-Wave Simulator: Exact Classical Sampling from Ideal and Noisy Quantum Circuits up to Hundreds of Qubits