@MISC{Finkelstein01quantumstatistical, author = {David Ritz Finkelstein}, title = {Quantum statistical computation}, year = {2001} }

Share

OpenURL

Abstract

In quantum ground-mode computation, the logical relations among qubits that must be satisfied by the solution are realized in the ground mode of a quantum network representing the problem. In quantum statistical computation some of the logical relations are satisfied identically in virtue of quantum statistics, which takes no time. For example triplet pairs of spin-1/2 fermions as in orthohydrogen make useful three-terminal elements for quantum computation. When interconnected by qubit equality relations these become universal for quantum computation. We show that quantum-statistical groundmode computation is substantially faster than pure ground-mode computation when the ground mode is reached by annealing. I.