Quantum Algorithm Processors to Reveal Hamiltonian Cycles
| dc.creator | Burger, John Robert | |
| dc.date | 2005-08-25 | |
| dc.date.accessioned | 2026-07-07T03:23:23Z | |
| dc.date.available | 2026-07-07T03:23:23Z | |
| dc.description | Quantum computer versus quantum algorithm processor in CMOS are compared to find (in parallel) all Hamiltonian cycles in a graph with m edges and n vertices, each represented by k bits. A quantum computer uses quantum states analogous to CMOS registers. With efficient initialization, number of CMOS registers is proportional to (n-1)! Number of qubits in a quantum computer is approximately proportional to kn+2mn in the approach below. Using CMOS, the bits per register is about proportional to kn, which is less since bits can be irreversibly reset. In either concept, number of gates, or operations to identify Hamiltonian cycles is proportional to kmn. However, a quantum computer needs an additional exponentially large number of operations to accomplish a probabilistic readout. In contrast, CMOS is deterministic and readout is comparable to ordinary memory. | |
| dc.description | 10 pages | |
| dc.identifier | https://arxiv.org/abs/cs/0508116 | |
| dc.identifier | http://arxiv.org/abs/cs/0508116 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/32922 | |
| dc.subject | Hardware Architecture | |
| dc.subject | Computational Geometry | |
| dc.subject | B.7.1; C.1.2 | |
| dc.title | Quantum Algorithm Processors to Reveal Hamiltonian Cycles | |
| dc.type | text |