量子计算哈密顿圈
Quantum computing Hamiltonian cycles
摘要：
讨论了简单图、立方图、二部图的哈密顿圈的量子计算算法。它表明，它是可能的量子计算机演化成一个纠缠的状态映射到一组所有可能的路径起源于一个选定的顶点，并进一步随后投影出所有的状态不对应于哈密尔顿圈。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
