An introduction to variational quantum algorithms for combinatorial optimization problems
From MaRDI portal
Publication:6054009
DOI10.1007/s10288-023-00549-1arXiv2212.11734MaRDI QIDQ6054009
Michael Poss, Eric Bourreau, Camille Grange
Publication date: 24 October 2023
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.11734
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decision-dependent probabilities in stochastic programs with recourse
- Fast quantum subroutines for the simplex method
- Empirical performance bounds for quantum approximate optimization
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
- Multivariate stochastic approximation using a simultaneous perturbation gradient approximation
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Geometry of entangled states, Bloch spheres and Hopf fibrations
- Quantum Speedups for Exponential-Time Dynamic Programming Algorithms
- A Simplex Method for Function Minimization
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
- Application of quantum approximate optimization algorithm to job shop scheduling problem
This page was built for publication: An introduction to variational quantum algorithms for combinatorial optimization problems