Time independent universal computing with spin chains: quantum plinko machine
From MaRDI portal
(Redirected from Publication:5855076)
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 for all with vanishingly small error.
Recommendations
- Universal quantum computation with spin-1/2 pairs and Heisenberg exchange
- Spin-chain-based full quantum computation by accessing only two spins
- Universal quantum computing in linear nearest neighbor architectures
- METHOD FOR IMPLEMENTATION OF UNIVERSAL QUANTUM LOGIC GATES IN A SCALABLE ISING SPIN QUANTUM COMPUTER
- Fast universal quantum computation with railroad-switch local Hamiltonians
Cites work
- scientific article; zbMATH DE number 5899272 (Why is no real title available?)
- scientific article; zbMATH DE number 3002434 (Why is no real title available?)
- scientific article; zbMATH DE number 1776257 (Why is no real title available?)
- Perfect, efficient, state transfer and its application as a constructive tool
- Properties of finite Gaussians and the discrete-continuous transition
- The computational complexity of linear optics
- The Sensitivity of the Matrix Exponential
- Universal computation by multiparticle quantum walk
- Universal quantum computation by scattering in the Fermi–Hubbard model
- Universal Quantum Simulators
Cited in
(4)
This page was built for publication: Time independent universal computing with spin chains: quantum plinko machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5855076)