The travelling salesman problem and adiabatic quantum computation: an algorithm

被引：0

作者：

Tien D. Kieu

机构：

[1] Swinburne University of Technology,Centre for Quantum and Optical Science

来源：

Quantum Information Processing | 2019年 / 18卷

关键词：

Travelling salesman problem; Quantum algorithms; Adiabatic quantum computation;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

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.

引用