2001/11/22 by Giuseppe Castagnoli, David Finkelstein, David Ritz Finkelstein +2
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph) #quant-ph
paper · pdf · doi:10.48550/arxiv.quant-ph/0111120
12 pages, LaTeX Minor changes for journal
openalex publication_date 2001/11/22 · arxiv created 2002/01/30 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Systems 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.