Quantum-Statistical Computation

Simple item page
dc.creatorCastagnoli, Giuseppe
dc.creatorFinkelstein, David Ritz
dc.date2001-11-22
dc.date2002-01-30
dc.date.accessioned2026-07-07T06:03:05Z
dc.date.available2026-07-07T06:03:05Z
dc.descriptionSystems of spin 1, such as triplet pairs of spin-1/2 fermions (like orthohydrogen nuclei) make useful three-terminal elements for quantum computation, and when interconnected by qubit equality relations are universal for quantum computation. This is an instance of quantum-statistical computation: some of the logical relations of the problem are satisfied identically in virtue of quantum statistics, which takes no time. We show heuristically that quantum-statistical ground-mode computation is substantially faster than pure ground-mode computation when the ground mode is reached by annealing.
dc.description12 pages, LaTeX Minor changes for journal
dc.identifierhttps://arxiv.org/abs/quant-ph/0111120
dc.identifierhttp://arxiv.org/abs/quant-ph/0111120
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/89855
dc.subjectQuantum Physics
dc.titleQuantum-Statistical Computation
dc.typetext

Files

Collections

arXiv