Time Independent Universal Computing with Spin Chains: Quantum Plinko Machine

TL;DR

This paper proposes a method for universal quantum computing using XY Heisenberg spin chains, where information propagates as packets that interact to perform computations, enabling scalable quantum circuits with minimal error.

Contribution

It introduces a novel scheme for quantum computation with spin chains, encoding circuits into chains of polynomial length with negligible error.

Findings

Quantum gates implemented via propagating packets

Polynomial-length chains for universal computation

Error can be made arbitrarily small

Abstract

We present a scheme for universal quantum computing using XY Heisenberg spin chains. Information is encoded into packets propagating down these chains, and they interact with each other to perform universal quantum computation. A circuit using g gate blocks on m qubits can be encoded into chains of length $O(g^{3+\delta} m^{3+\delta})$ for all $\delta >0$ with vanishingly small error.