• Corpus ID: 239050455

Predicting parameters for the Quantum Approximate Optimization Algorithm for MAX-CUT from the infinite-size limit

  title={Predicting parameters for the Quantum Approximate Optimization Algorithm for MAX-CUT from the infinite-size limit},
  author={Sami Boulebnane and Ashley Montanaro},
Combinatorial optimization is regarded as a potentially promising application of near and long-term quantum computers. The best-known heuristic quantum algorithm for combinatorial optimization on gate-based devices, the Quantum Approximate Optimization Algorithm (QAOA), has been the subject of many theoretical and empirical studies. Unfortunately, its application to specific combinatorial optimization problems poses several difficulties: among these, few performance guarantees are known, and… 
1 Citations

Figures from this paper

The Quantum Approximate Optimization Algorithm at High Depth for MaxCut on Large-Girth Regular Graphs and the Sherrington-Kirkpatrick Model
Looking at random D-regular graphs, at optimal parameters and as D goes to infinity, it is found that the p = 11 QAOA beats all classical algorithms that are free of unproven conjectures.


For Fixed Control Parameters the Quantum Approximate Optimization Algorithm's Objective Function Value Concentrates for Typical Instances
The Quantum Approximate Optimization Algorithm, QAOA, uses a shallow depth quantum circuit to produce a parameter dependent state. For a given combinatorial optimization problem instance, the quantum
Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
An in-depth study of the performance of QAOA on MaxCut problems is provided by developing an efficient parameter-optimization procedure and revealing its ability to exploit non-adiabatic operations, illustrating that optimization will be important only for problem sizes beyond numerical simulations, but accessible on near-term devices.
The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: A Typical Case
This work focuses on finding big independent sets in random graphs with dn/2 edges keeping d fixed and n large, and shows that if p is less than a d-dependent constant times log n, the QAOA cannot do better than finding an independent set of size .854 times the optimal for d large.
The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: Worst Case Examples
The Quantum Approximate Optimization Algorithm can be applied to search problems on graphs with a cost function that is a sum of terms corresponding to the edges. When conjugating an edge term, the
Quantum Supremacy through the Quantum Approximate Optimization Algorithm
The Quantum Approximate Optimization Algorithm (QAOA) is designed to run on a gate model quantum computer and has shallow depth. It takes as input a combinatorial optimization problem and outputs a
Training Variational Quantum Algorithms Is NP-Hard.
This work shows that the training landscape can have many far from optimal persistent local minima, which means gradient and higher order descent algorithms will generally converge to farFrom optimal solutions.
Improving Variational Quantum Optimization using CVaR
This paper empirically shows that the Conditional Value-at-Risk as an aggregation function leads to faster convergence to better solutions for all combinatorial optimization problems tested in this study.
Variational Quantum Algorithms
An overview of the field of Variational Quantum Algorithms is presented and strategies to overcome their challenges as well as the exciting prospects for using them as a means to obtain quantum advantage are discussed.
Reinforcement-Learning-Based Variational Quantum Circuits Optimization for Combinatorial Problems
This work proposes an approach based on reinforcement learning (RL) to train a policy network that can be used to quickly find high-quality variational parameters for unseen combinatorial problem instances and demonstrates that the trained RL policy can reduce the optimality gap by up to 8.61 compared with other off-the-shelf optimizers tested.
The theory of variational hybrid quantum-classical algorithms
Many quantumalgorithms have daunting resource requirements when compared towhat is available today. To address this discrepancy, a quantum-classical hybrid optimization scheme known as ‘the