The travelling salesman problem and adiabatic quantum computation: an algorithm

An explicit algorithm for the travelling salesman problem is constructed in the framework of adiabatic quantum computation, AQC. The initial Hamiltonian for the AQC process admits canonical coherent states as the ground state, and the target Hamiltonian has the shortest tour as the desirable ground...

Full description

Saved in:
Bibliographic Details
Published in:Quantum information processing Vol. 18; no. 3; pp. 1 - 19
Main Author: Kieu, Tien D.
Format: Journal Article
Language:English
Published: New York Springer US 01.03.2019
Springer Nature B.V
Subjects:
Adiabatic flow
Algorithms
Complexity
Computation
Data Structures and Information Theory
Energy sources
Ground state
Mathematical Physics
Physics
Physics and Astronomy
Quantum Computing
Quantum Information Technology
Quantum Physics
Spintronics
Traveling salesman problem
Travelling salesman problem
Quantum algorithms
Adiabatic quantum computation
ISSN:1570-0755, 1573-1332
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:An explicit algorithm for the travelling salesman problem is constructed in the framework of adiabatic quantum computation, AQC. The initial Hamiltonian for the AQC process admits canonical coherent states as the ground state, and the target Hamiltonian has the shortest tour as the desirable ground state. Some estimates/bounds are also given for the computational complexity of the algorithm with particular emphasis on the required energy resources, besides the space and time complexity, for the physical process of (quantum) computation in general.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1570-0755
1573-1332
DOI:10.1007/s11128-019-2206-9