dorsal/arxiv
View SchemaQuantum computing Hamiltonian cycles
| Authors | T. Rudolph |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/9603001 |
| URL | https://arxiv.org/abs/quant-ph/9603001 |
Abstract
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.
{
"annotation_id": "06daa0dd-8192-4cb7-84ba-107a5b4f224a",
"date_created": "2026-03-02T18:02:37.909000Z",
"date_modified": "2026-03-02T18:02:37.909000Z",
"file_hash": "57220f429406c7c045e1ccbab86f6d04fdfd4add7050fe9b85b9db630f337a9c",
"private": false,
"record": {
"abstract": "An algorithm for quantum computing Hamiltonian cycles of simple, cubic,\nbipartite graphs is discussed. It is shown that it is possible to evolve a\nquantum computer into an entanglement of states which map onto the set of all\npossible paths originating from a chosen vertex, and furthermore to\nsubsequently project out all states not corresponding to Hamiltonian cycles.",
"arxiv_id": "quant-ph/9603001",
"authors": [
"T. Rudolph"
],
"categories": [
"quant-ph"
],
"title": "Quantum computing Hamiltonian cycles",
"url": "https://arxiv.org/abs/quant-ph/9603001"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "c89c6465-2881-4a6a-8eaa-e89bac798314",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}