An introduction to variational quantum algorithms for combinatorial optimization problems
From MaRDI portal
Cites work
- A review on quantum approximate optimization algorithm and its variants
- A Simplex Method for Function Minimization
- An introduction to variational quantum algorithms for combinatorial optimization problems
- Application of quantum approximate optimization algorithm to job shop scheduling problem
- Decision-dependent probabilities in stochastic programs with recourse
- Empirical performance bounds for quantum approximate optimization
- Fast quantum subroutines for the simplex method
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
- Geometry of entangled states, Bloch spheres and Hopf fibrations
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 653035 (Why is no real title available?)
- scientific article; zbMATH DE number 2121076 (Why is no real title available?)
- scientific article; zbMATH DE number 274379 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Multivariate stochastic approximation using a simultaneous perturbation gradient approximation
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
- Quantum speedups for exponential-time dynamic programming algorithms
This page was built for publication: An introduction to variational quantum algorithms for combinatorial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7030966)
