Analytic asymptotic performance of topological codes

@article{Fowler2013AnalyticAP,
  title={Analytic asymptotic performance of topological codes},
  author={Austin G. Fowler},
  journal={Physical Review A},
  year={2013},
  volume={87},
  pages={040301}
}
  • A. Fowler
  • Published 7 August 2012
  • Computer Science
  • Physical Review A
Topological quantum error correction codes are extremely practical, typically requiring only a 2-D lattice of qubits with tunable nearest neighbor interactions yet tolerating high physical error rates p. It is computationally expensive to simulate the performance of such codes at low p, yet this is a regime we wish to study as low physical error rates lead to low qubit overhead. We present a very general method of analytically estimating the low p performance of the most promising class of… 
View PDF on arXiv
12 Citations
Highly Influential Citations
1
Background Citations
2
Methods Citations
4

Figures and Tables from this paper

12 Citations

Citation Type

Citation Type

Performance of topological quantum error correction in the presence of correlated noise
TLDR
It is found that in the presence of noise correlation, one cannot guarantee arbitrary high computational accuracy simply by incrementing the codeword size while retaining constant noise level per qubit operation, so progressively reducing noise level in qubits and gates is as important as continuously integrating more qubits to realize scalable and reliable quantum computer.
Reconfiguring quantum error-correcting codes for real-life errors
TLDR
A scheme of decoupling transversal encoded gate errors from state-preparation noise is articulate and experimentally validate its use-case for IBMQ quantum processors and enables quantum CSS code to principally correct longer strings of errors without increasing the codeword size.
Surface codes: Towards practical large-scale quantum computation
TLDR
The concept of the stabilizer, using two qubits, is introduced, and the single-qubit Hadamard, S and T operators are described, completing the set of required gates for a universal quantum computer.
Low overhead Clifford gates from joint measurements in surface, color, and hyperbolic codes
TLDR
It is shown that within any encoding scheme for the logical qubits, the full Clifford group can be fault-tolerantly implemented by using joint measurements involving a single appropriately encoded logical ancilla, which allows for new low overhead implementations of thefull Clifford group in surface and color codes.
Quantum Algorithms, Architecture, and Error Correction
Quantum algorithms have the potential to provide exponential speedups over some of the best known classical algorithms. These speedups may enable quantum devices to solve currently intractable…
Quantum computing by color-code lattice surgery
TLDR
Against uncorrelated circuit-level depolarizing noise, color-code lattice surgery uses fewer qubits to achieve the same degree of fault-tolerant error suppression as surface- code lattice Surgery when the noise rate is low enough and the error suppression demand is high enough.
Universal quantum computation by the unitary control of ancilla qubits and using a fixed ancilla-register interaction
We characterize a model of universal quantum computation where the register (computational) qubits are controlled by ancillary qubits, using only a single fixed interaction between register and…
Quantum stabilizer codes from Abelian group association schemes
TLDR
A new method for the construction of the binary quantum stabilizer codes is provided, where the construction is based on Abelian and non-Abelian groups association schemes, and it is shown that one can construct any binary stabilizer code with any distance by using the commutative structure of association schemes.
Constructions of pure asymmetric quantum alternant codes based on subclasses of Alternant codes
  • Jihao Fan, Hanwu Chen
  • Computer Science
    2014 IEEE International Symposium on Information Theory
  • 2014
TLDR
It is shown that when dx = 2, Z-parts of the AQCs can attain the classical Gilbert-Varshamov bound, and asymptotically good binary expansions of asymmetric quantum GRS codes are obtained, which are quantum generalizations of Retter's classical results.
Quantum stabilizer codes from Abelian and non-Abelian groups association schemes
TLDR
A new method for the construction of the binary quantum stabilizer codes is provided, where the construction is based on Abelian and non-Abelian groups association schemes, and it is shown that one can construct any binary stabilizer code with any distance by using the commutative structure of association schemes.
...
1
2
...

References

SHOWING 1-10 OF 18 REFERENCES
New
and A
  • Rabbani, arXiv:1202.6111
  • 2012
Phys
  • Rev. Lett. 108, 180501
  • 2012
Phys
  • Rev. X 2, 031007
  • 2012
and L
  • C. L. Hollenberg, arXiv:1202.5602
  • 2012
New J
  • Phys. 13, 073043
  • 2011
Phys
  • Rev. A 83, 020302(R)
  • 2011
New J
  • Phys. 12, 033031
  • 2010
and 4 M
  • A. Martin-Delgado, Phys. Rev. A 81, 012319
  • 2010
Phys
  • Rev. E 80, 011141
  • 2009
...
1
2
...