Author： Da-Jian Zhang Dian-Min Tong Yao Lu Gui-Lu Long
Publisher： IOP Publishing
E-ISSN： 1572-9494|63|5|554-558
ISSN： 0253-6102
Source： Communications in Theoretical Physics, Vol.63, Iss.5, 2015-05, pp. : 554-558
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
We put forward an alternative quantum algorithm for finding Hamiltonian cycles in any N-vertex graph based on adiabatic quantum computing. With a von Neumann measurement on the final state, one may determine whether there is a Hamiltonian cycle in the graph and pick out a cycle if there is any. Although the proposed algorithm provides a quadratic speedup, it gives an alternative algorithm based on adiabatic quantum computation, which is of interest because of its inherent robustness.
Related content
Access to resources
Recommend
Numerical Studies of the Quantum Adiabatic Algorithm
Journal of Physics: Conference Series , Vol. 640, Iss. 1, 2015-09 ,pp. :
Access to resources
Effects of dissipation on an adiabatic quantum search algorithm
New Journal of Physics, Vol. 12, Iss. 12, 2010-12 ,pp. :