Quantum-Statistical Computation

TL;DR

This paper introduces quantum-statistical computation using spin-1 systems, demonstrating that certain logical relations are satisfied instantly due to quantum statistics, leading to faster ground-mode computation via annealing.

Contribution

It presents the concept of quantum-statistical computation with spin-1 systems and heuristically shows its potential for faster annealing-based ground-mode computation.

Findings

Quantum-statistical relations are satisfied instantly, reducing computation time.

Quantum-statistical ground-mode computation is faster than pure ground-mode methods.

The approach leverages quantum statistics for efficient logical relation satisfaction.

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.