Quantum-Statistical Computation

Abstract

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.