A review on quantum approximate optimization algorithm and its variants
From MaRDI portal
combinatorial optimization problemsNISQ algorithmsquantum approximate optimization algorithmquantum optimizationvariational quantum algorithms
Numerical optimization and variational techniques (65K10) Quantum algorithms and complexity in the theory of computing (68Q12) Research exposition (monographs, survey articles) pertaining to quantum theory (81-02) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum computation (81P68)
Recommendations
- The variational quantum eigensolver: a review of methods and best practices
- Variational quantum algorithms: fundamental concepts, applications and challenges
- A study of the performance of classical minimizers in the quantum approximate optimization algorithm
- Lower bounds on circuit depth of the quantum approximate optimization algorithm
Cites work
- A comparison of various classical optimizers for a variational quantum linear solver
- A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
- A study of the performance of classical minimizers in the quantum approximate optimization algorithm
- A unified modeling and solution framework for combinatorial optimization problems
- An interior-point algorithm for nonconvex nonlinear programming
- Benchmarking the quantum approximate optimization algorithm
- Classical symmetries and the quantum approximate optimization algorithm
- Combinatorial optimization. Theory and algorithms.
- Efficiently embedding QUBO problems on adiabatic quantum computers
- Empirical performance bounds for quantum approximate optimization
- Extremal cuts of sparse random graphs
- Fixed-point quantum search
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
- How Good is the Goemans--Williamson MAX CUT Algorithm?
- scientific article; zbMATH DE number 5971212 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 7489400 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3249560 (Why is no real title available?)
- scientific article; zbMATH DE number 7650426 (Why is no real title available?)
- Impact of graph structures for QAOA on maxcut
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Large cuts with local algorithms on triangle-free graphs
- Limitations of local quantum algorithms on random MAX-k-XOR and beyond
- Limits of local algorithms over sparse random graphs
- Lower bounds on circuit depth of the quantum approximate optimization algorithm
- MAX CUT in cubic graphs
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
- Optimization by simulated annealing
- Optimization of mean-field spin glasses
- Optimization of the Sherrington--Kirkpatrick Hamiltonian
- Performance of sequential local algorithms for the random NAE-K-SAT problem
- Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
- Quantum approximate optimization for combinatorial problems with constraints
- Quantum Computers
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
- Resource efficient gadgets for compiling adiabatic quantum optimization problems
- Semidefinite programs on sparse random graphs and their application to community detection
- Some optimal inapproximability results
- Some rigorous results on the Sherrington-Kirkpatrick spin glass model.
- Suboptimality of local algorithms for a class of max-cut problems
- The overlap gap property and approximate message passing algorithms for \(p\)-spin models
- The quantum approximate optimization algorithm at high depth for maxcut on large-girth regular graphs and the Sherrington-Kirkpatrick model
- The theory of variational hybrid quantum-classical algorithms
- The unconstrained binary quadratic programming problem: a survey
- The variational quantum eigensolver: a review of methods and best practices
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
- Worst-case comparison of valid inequalities for the TSP
Cited in
(11)- Variational quantum algorithms: fundamental concepts, applications and challenges
- Comment on Feynman's ``Simulating physics with computers
- Near-term quantum algorithm for solving the MaxCut problem with fewer quantum resources
- Quantum cache memory: a framework for enhancing DNA analysis through quantum computing
- Introduction to quantum error correction with stabilizer codes
- Quantum computing for discrete optimization: a highlight of three technologies
- A finite state automaton for quantum computing
- Interference and measurement: changing amplitude phase information to amplitude magnitude information
- Two-way telecomputation: bidirectional teleportation of unitary gates
- An introduction to variational quantum algorithms for combinatorial optimization problems
- Operator-projected variational quantum imaginary time evolution
This page was built for publication: A review on quantum approximate optimization algorithm and its variants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6546559)
