A practitioner’s guide to quantum algorithms for optimisation problems
DOI10.1088/1751-8121/ad00f0arXiv2305.07323MaRDI QIDQ6063352
No author found.
Publication date: 7 November 2023
Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2305.07323
combinatorial optimisationquantum optimisationgate-based quantum computingquantum alternating operator ansatzquantum approximate optimisation algorithm
Generalized linear models (logistic models) (62J12) Quantum computation (81P68) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25) Quantum algorithms and complexity in the theory of computing (68Q12) Mathematical modeling or simulation for problems pertaining to quantum theory (81-10) Quantum gates (81P65) Regularization by noise (60H50)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The variational quantum eigensolver: a review of methods and best practices
- Classical symmetries and the quantum approximate optimization algorithm
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
- Benchmarking the quantum approximate optimization algorithm
- The Vehicle Routing Problem
- Colloquium: Quantum annealing and analog quantum computation
- Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
- Ottimizzazione Combinatoria
- Complexity of Stoquastic Frustration-Free Hamiltonians
- Quantum computations: algorithms and error correction
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Optimization using quantum mechanics: quantum annealing through adiabatic evolution
- The theory of variational hybrid quantum-classical algorithms
- Combinatorial optimization. Theory and algorithms
This page was built for publication: A practitioner’s guide to quantum algorithms for optimisation problems
