Noise Threshold for a Fault-Tolerant Two-Dimensional Lattice Architecture

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

20 pages, 11 figures. v2 has some small changes and a link to a website with supplementary material. v3: Corrects earlier erro

Scientific paper

We consider a model of quantum computation in which the set of operations is limited to nearest-neighbor interactions on a 2D lattice. We model movement of qubits with noisy SWAP operations. For this architecture we design a fault-tolerant coding scheme using the concatenated [[7,1,3]] Steane code. Our scheme is potentially applicable to ion-trap and solid-state quantum technologies. We calculate a lower bound on the noise threshold for our local model using a detailed failure probability analysis. We obtain a threshold of 1.85 x 10^-5 for the local setting, where memory error rates are one-tenth of the failure rates of gates, measurement, and preparation steps. For the analogous nonlocal setting, we obtain a noise threshold of 3.61 x 10^-5. Our results thus show that the additional SWAP operations required to move qubits in the local model affect the noise threshold only moderately.

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

Noise Threshold for a Fault-Tolerant Two-Dimensional Lattice Architecture 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 Noise Threshold for a Fault-Tolerant Two-Dimensional Lattice Architecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Noise Threshold for a Fault-Tolerant Two-Dimensional Lattice Architecture will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-225839

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