Adapting the traveling salesman problem to an adiabatic quantum computer
From MaRDI portal
(Redirected from Publication:352991)
Recommendations
- The travelling salesman problem and adiabatic quantum computation: an algorithm
- Quantum optimization
- Mapping a logical representation of TSP to quantum annealing
- Quantum branch-and-bound algorithm and its application to the travelling salesman problem
- A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
Cites work
- A concise guide to the Traveling Salesman Problem
- A unified modeling and solution framework for combinatorial optimization problems
- In pursuit of the traveling salesman. Mathematics at the limits of computation
- On the efficiency of Hamiltonian-based quantum computation for low-rank matrices
- Special cases of the traveling salesman problem
- ``Neural computation of decisions in optimization problems
Cited in
(8)- The travelling salesman problem and adiabatic quantum computation: an algorithm
- ON THE PRACTICALITY OF ADIABATIC QUANTUM COMPUTING WITH OPTICAL SCHEMES
- Solving the traveling salesman problem with a hybrid quantum-classical feedforward neural network
- An improved noise quantum annealing method for TSP
- Unconstrained binary models of the travelling salesman problem variants for quantum optimization
- Quantum optimization
- Mapping a logical representation of TSP to quantum annealing
- Quantum branch-and-bound algorithm and its application to the travelling salesman problem
This page was built for publication: Adapting the traveling salesman problem to an adiabatic quantum computer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q352991)
