Adapting the traveling salesman problem to an adiabatic quantum computer

DOI10.1007/s11128-012-0490-8zbMath1267.81102OpenAlexW2011507806MaRDI QIDQ352991

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

zbMATH Keywords

traveling salesman problemadiabatic quantum computeroptimal tour

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Related Items (1)

An improved noise quantum annealing method for TSP

Cites Work

• ``Neural computation of decisions in optimization problems
• Special cases of the traveling salesman problem
• A unified modeling and solution framework for combinatorial optimization problems
• On the efficiency of Hamiltonian-based quantum computation for low-rank matrices
• A concise guide to the Traveling Salesman Problem
• In Pursuit of the Traveling Salesman

This page was built for publication: Adapting the traveling salesman problem to an adiabatic quantum computer