Iterative classical superadiabatic algorithm for combinatorial optimization
From MaRDI portal
Publication:5869986
Recommendations
- Different adiabatic quantum optimization algorithms for the NP-complete exact cover and 3SAT problems
- The complexity of the quantum adiabatic algorithm
- Quantum optimization
- Combinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems
- The quantum adiabatic optimization algorithm and local minima
Cites work
- scientific article; zbMATH DE number 5953558 (Why is no real title available?)
- scientific article; zbMATH DE number 5320186 (Why is no real title available?)
- A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
- Colloquium: Quantum annealing and analog quantum computation
- Transitionless quantum driving
This page was built for publication: Iterative classical superadiabatic algorithm for combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5869986)