Recognition: unknown
Time Independent Universal Computing with Spin Chains: Quantum Plinko Machine
classification
🪐 quant-ph
keywords
chainsdeltaquantumuniversalcomputingencodedspinblocks
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.