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.

Highlights

  • Heisenberg spin chains have many applications in quantum computing

  • One application considered by several authors [1,2,3,4,5,6,7,8,9, 37] is the transmission of data through a quantum computer, or using them as ‘wires’ for the transmission of data

  • This is an attractive approach to quantum communication becuase it could avoid the problem of converting ‘stationary’ qubits into ‘flying’ qubits

Read more

Summary

25 July 2016

02139, USA 3 Department of Mathematics, Room 2-375 Massachusetts Institute of Technology 77 Massachusetts Ave. Cambridge, MA 02139, USA. Any further distribution of We present a scheme for universal quantum computing using XY Heisenberg spin chains. This work must maintain Information is encoded into packets propagating down these chains, and they interact with each other attribution to the author(s) and the title of to perform universal quantum computation. A circuit using g gate blocks on m qubits can be encoded the work, journal citation and DOI. Into chains of length O (g3+dm3+d) for all d > 0 with vanishingly small error

Introduction
Background
Description of our scheme
Z Gate
X gate
Description of bounds
Circuit error bound
Conclusion
Basic theory
This å 1
H V2 e
Findings
Big picture
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call