Universal quantum computation with ordered spin-chain networks

Physics – Condensed Matter – Mesoscale and Nanoscale Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

9 pages, 3 figures

Scientific paper

10.1103/PhysRevA.84.032333

It is shown that anisotropic spin chains with gapped bulk excitations and magnetically ordered ground states offer a promising platform for quantum computation, which bridges the conventional single-spin-based qubit concept with recently developed topological Majorana-based proposals. We show how to realize the single-qubit Hadamard, phase, and pi/8 gates as well as the two-qubit CNOT gate, which together form a fault-tolerant universal set of quantum gates. The gates are implemented by judiciously controlling Ising exchange and magnetic fields along a network of spin chains, with each individual qubit furnished by a spin-chain segment. A subset of single-qubit operations is geometric in nature, relying on control of anisotropy of spin interactions rather than their strength. We contrast topological aspects of the anisotropic spin-chain networks to those of p-wave superconducting wires discussed in the literature.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Universal quantum computation with ordered spin-chain networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Universal quantum computation with ordered spin-chain networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Universal quantum computation with ordered spin-chain networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-717640

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.