We put forward an alternative quantum algorithm for finding ttamiltonian cycles in any N-vertex graph based on adiabatic quantum computing. With a yon Neumann measurement on the final state, one may determine whether ...We put forward an alternative quantum algorithm for finding ttamiltonian cycles in any N-vertex graph based on adiabatic quantum computing. With a yon Neumann measurement on the final state, one may determine whether there is a HamiRonian 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.展开更多
文摘We put forward an alternative quantum algorithm for finding ttamiltonian cycles in any N-vertex graph based on adiabatic quantum computing. With a yon Neumann measurement on the final state, one may determine whether there is a HamiRonian 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.
