Time independent universal computing with spin chains: quantum plinko machine
From MaRDI portal
Publication:5855076
DOI10.1088/1367-2630/18/7/073044zbMath1456.81151arXiv1511.05656OpenAlexW3103450852MaRDI QIDQ5855076
Seth Lloyd, Can Gokler, K. F. Thompson, Peter W. Shor
Publication date: 12 March 2021
Published in: New Journal of Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.05656
Related Items
Effective simulation of state distribution in qubit chains ⋮ Algebra and Hilbert space structures induced by quantum probes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Universal Computation by Multiparticle Quantum Walk
- Universal Quantum Simulators
- PERFECT, EFFICIENT, STATE TRANSFER AND ITS APPLICATION AS A CONSTRUCTIVE TOOL
- The Sensitivity of the Matrix Exponential
- Properties of finite Gaussians and the discrete-continuous transition
- Universal quantum computation by scattering in the Fermi–Hubbard model
- The computational complexity of linear optics
This page was built for publication: Time independent universal computing with spin chains: quantum plinko machine