Universal fault tolerant quantum computation on bilinear nearest neighbor arrays

Details Universal fault tolerant quantum computation on bilinear nearest neighbor arrays Universal fault tolerant quantum computation on bilinear nearest neighbor arrays

2007-02-21

arxiv.org/abs/quant-ph/0702201v2

QIC 8, 330 (2008)

Physics

Quantum Physics

9 pages, 17 figures, minor revisions

Scientific paper

Assuming an array that consists of two parallel lines of qubits and that permits only nearest neighbor interactions, we construct physical and logical circuitry to enable universal fault tolerant quantum computation under the [[7,1,3]] quantum code. A rigorous lower bound to the fault tolerant threshold for this array is determined in a number of physical settings. Adversarial memory errors, two-qubit gate errors, and readout errors are included in our analysis. In the setting where the physical memory failure rate is equal to one-tenth of the physical gate error rate, the physical readout error rate is equal to the physical gate error rate, and the duration of physical readout is ten times the duration of a physical gate, we obtain a lower bound to the asymptotic threshold of 1.96x10^-6.

Affiliated with

Also associated with

No associations

Rating

Universal fault tolerant quantum computation on bilinear nearest neighbor arrays 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 fault tolerant quantum computation on bilinear nearest neighbor arrays, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Universal fault tolerant quantum computation on bilinear nearest neighbor arrays will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-102692