Quantum computing Hamiltonian cycles

Simple item page
dc.creatorRudolph, T.
dc.date1996-03-03
dc.date.accessioned2026-07-07T06:13:46Z
dc.date.available2026-07-07T06:13:46Z
dc.descriptionAn 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.
dc.description4 pages, LaTex, 2 figures
dc.identifierhttps://arxiv.org/abs/quant-ph/9603001
dc.identifierhttp://arxiv.org/abs/quant-ph/9603001
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/93220
dc.subjectQuantum Physics
dc.titleQuantum computing Hamiltonian cycles
dc.typetext

Files

Collections

arXiv