Quantum computing Hamiltonian cycles
量子物理
2007-05-23 v1
摘要
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths originating from a chosen vertex, and furthermore to subsequently project out all states not corresponding to Hamiltonian cycles.
引用
@article{arxiv.quant-ph/9603001,
title = {Quantum computing Hamiltonian cycles},
author = {T. Rudolph},
journal= {arXiv preprint arXiv:quant-ph/9603001},
year = {2007}
}
备注
4 pages, LaTex, 2 figures