Adapting the traveling salesman problem to an adiabatic quantum computer
From MaRDI portal
Publication:352991
DOI10.1007/S11128-012-0490-8zbMATH Open1267.81102OpenAlexW2011507806MaRDI QIDQ352991FDOQ352991
Authors: Richard H. Warren 
Publication date: 5 July 2013
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-012-0490-8
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
Combinatorial optimization (90C27) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)
Cites Work
- A concise guide to the Traveling Salesman Problem
- A unified modeling and solution framework for combinatorial optimization problems
- ``Neural computation of decisions in optimization problems
- Special cases of the traveling salesman problem
- On the efficiency of Hamiltonian-based quantum computation for low-rank matrices
- In pursuit of the traveling salesman. Mathematics at the limits of computation
Cited In (8)
- Mapping a logical representation of TSP to quantum annealing
- Solving the traveling salesman problem with a hybrid quantum-classical feedforward neural network
- Unconstrained binary models of the travelling salesman problem variants for quantum optimization
- Quantum branch-and-bound algorithm and its application to the travelling salesman problem
- ON THE PRACTICALITY OF ADIABATIC QUANTUM COMPUTING WITH OPTICAL SCHEMES
- An improved noise quantum annealing method for TSP
- Quantum optimization
- The travelling salesman problem and adiabatic quantum computation: an algorithm
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)
