A review on quantum approximate optimization algorithm and its variants
DOI10.1016/j.physrep.2024.03.002zbMath1548.81008MaRDI QIDQ6546559
Alessandro Summer, Chiao-Hui Chou, Kostas Blekos, Komal Pandya, Andrea Ceschini, Dean Brand, Rui-Hao Li
Publication date: 29 May 2024
Published in: Physics Reports (Search for Journal in Brave)
combinatorial optimization problemsquantum optimizationquantum approximate optimization algorithmvariational quantum algorithmsNISQ algorithms
Numerical optimization and variational techniques (65K10) Quantum computation (81P68) Research exposition (monographs, survey articles) pertaining to quantum theory (81-02) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum algorithms and complexity in the theory of computing (68Q12)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- The unconstrained binary quadratic programming problem: a survey
- Efficiently embedding QUBO problems on adiabatic quantum computers
- Some rigorous results on the Sherrington-Kirkpatrick spin glass model.
- An interior-point algorithm for nonconvex nonlinear programming
- A unified modeling and solution framework for combinatorial optimization problems
- Worst-case comparison of valid inequalities for the TSP
- A study of the performance of classical minimizers in the quantum approximate optimization algorithm
- Optimization of mean-field spin glasses
- The variational quantum eigensolver: a review of methods and best practices
- Classical symmetries and the quantum approximate optimization algorithm
- Empirical performance bounds for quantum approximate optimization
- The overlap gap property and approximate message passing algorithms for \(p\)-spin models
- Large cuts with local algorithms on triangle-free graphs
- Extremal cuts of sparse random graphs
- Suboptimality of local algorithms for a class of max-cut problems
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
- Benchmarking the quantum approximate optimization algorithm
- Impact of graph structures for QAOA on maxcut
- Lower bounds on circuit depth of the quantum approximate optimization algorithm
- A comparison of various classical optimizers for a variational quantum linear solver
- Resource efficient gadgets for compiling adiabatic quantum optimization problems
- Performance of Sequential Local Algorithms for the Random NAE-$K$-SAT Problem
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- MAX CUT in cubic graphs
- How Good is the Goemans--Williamson MAX CUT Algorithm?
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Quantum Algorithm for Systems of Linear Equations with Exponentially Improved Dependence on Precision
- Fixed-Point Quantum Search
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
- Optimization of the Sherrington--Kirkpatrick Hamiltonian
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
- Semidefinite programs on sparse random graphs and their application to community detection
- Some optimal inapproximability results
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
- The theory of variational hybrid quantum-classical algorithms
- Combinatorial optimization. Theory and algorithms.
- Limits of local algorithms over sparse random graphs
- Quantum approximate optimization for combinatorial problems with constraints
- Quantum Computers
- Limitations of local quantum algorithms on random MAX-\(k\)-XOR and beyond
- The quantum approximate optimization algorithm at high depth for maxcut on large-girth regular graphs and the Sherrington-Kirkpatrick model
Related Items (3)
This page was built for publication: A review on quantum approximate optimization algorithm and its variants
