Topological quantum memory

@article{Dennis2002TopologicalQM,
  title={Topological quantum memory},
  author={Eric Dennis and Alexei Y. Kitaev and Andrew J. Landahl and John Preskill},
  journal={Journal of Mathematical Physics},
  year={2002},
  volume={43},
  pages={4452-4505}
}
We analyze surface codes, the topological quantum error-correcting codes introduced by Kitaev. In these codes, qubits are arranged in a two-dimensional array on a surface of nontrivial topology, and encoded quantum operations are associated with nontrivial homology cycles of the surface. We formulate protocols for error recovery, and study the efficacy of these protocols. An order-disorder phase transition occurs in this system at a nonzero critical value of the error rate; if the error rate is… Expand
Constructions and noise threshold of topological subsystem codes
Topological subsystem codes proposed recently by Bombin are quantum error-correcting codes defined on a two-dimensional grid of qubits that permit reliable quantum information storage with a constantExpand
Fast Decoding Algorithm for Subspace and Subsystem Color Codes and Local Equivalence of Topological Phases
Topological codes introduced by Kitaev [9] are among the most promising family of quantum error correcting codes that could lead to realistic quantum computer architectures. Many features of theseExpand
Equivalence of Topological Codes and Fast Decoding Algorithms [ 1 ]
Topological stabilizer codes (TSC), introduced by Kitaev [14], are among the most promising quantum error correcting codes that could lead to realistic quantum computer architectures. In particular,Expand
Qudit surface codes and gauge theory with finite cyclic groups
Surface codes describe quantum memory stored as a global property of interacting spins on a surface. The state space is fixed by a complete set of quasi-local stabilizer operators and the codeExpand
Lattice quantum codes and exotic topological phases of matter
This thesis addresses whether it is possible to build a robust memory device for quantum information. Many schemes for fault-tolerant quantum information processing have been developed so far, one ofExpand
Energetics and Error Rates of Self-Correcting Quantum Memories
Quantum codes allow for the robust storage of quantum information despite interaction with the environment. In a quantum code, a large number of physical qubits is used to encode a smaller number ofExpand
The role of entropy in topological quantum error correction
The performance of a quantum error-correction process is determined by the likelihood that a random configuration of errors introduced to the system will lead to the corruption of encoded logicalExpand
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. Expand
Stability of topologically-protected quantum computing proposals as seen through spin glasses
Sensitivity to noise makes most of the current quantum computing schemes prone to error and nonscalable, allowing only for small proof-of-principle devices. Topologically-protected quantum computingExpand
Scalable fermionic error correction in Majorana surface codes
We study the error correcting properties of Majorana Surface Codes (MSC), topological quantum codes constructed out of interacting Majorana fermions, which can be used to store quantum informationExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 40 REFERENCES
Topological Quantum Computation
The theory of quantum computation can be constructed from the abstract study of anyonic systems. In mathematical terms, these are unitary topological modular functors. They underlie the Jones poly-Expand
Reliable quantum computers
  • J. Preskill
  • Physics, Mathematics
  • Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
  • 1998
The new field of quantum error correction has developed spectacularly since its origin less than two years ago. Encoded quantum information can be protected from errors that arise due to uncontrolledExpand
Fault-tolerant quantum computation
  • P. Shor
  • Computer Science, Physics
  • Proceedings of 37th Conference on Foundations of Computer Science
  • 1996
TLDR
For any quantum computation with t gates, it is shown how to build a polynomial size quantum circuit that tolerates O(1/log/sup c/t) amounts of inaccuracy and decoherence per gate, for some constant c; the previous bound was O( 1/t). Expand
Fault-tolerant quantum computation with constant error
TLDR
This paper shows how to perform fault tolerant quantum computation when the error probability, q, is smaller than some constant threshold, q.. the cost is polylogarithmic in time and space, and no measurements are used during the quantum computation. Expand
Good quantum error-correcting codes exist.
  • Calderbank, Shor
  • Physics, Medicine
  • Physical review. A, Atomic, molecular, and optical physics
  • 1996
TLDR
The techniques investigated in this paper can be extended so as to reduce the accuracy required for factorization of numbers large enough to be difficult on conventional computers appears to be closer to one part in billions. Expand
The Heisenberg Representation of Quantum Computers
Since Shor`s discovery of an algorithm to factor numbers on a quantum computer in polynomial time, quantum computation has become a subject of immense interest. Unfortunately, one of the key featuresExpand
Stabilizer Codes and Quantum Error Correction
TLDR
An overview of the field of quantum error correction and the formalism of stabilizer codes is given and a number of known codes are discussed, the capacity of a quantum channel, bounds on quantum codes, and fault-tolerant quantum computation are discussed. Expand
Topological Quantum Computation
TLDR
The connection between fault-tolerant quantum computation and nonabelian quantum statistics in two spatial dimensions is explored and it is shown that if information is encoded in pairs of quasiparticles, then the Aharonov-Bohm interactions can be adequate for universal fault-Tolerance quantum computation. Expand
Resilient quantum computation: error models and thresholds
  • E. Knill, R. Laflamme, W. Zurek
  • Mathematics, Physics
  • Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
  • 1998
Recent research has demonstrated that quantum computers can solve certain types of problems substantially faster than the known classical algorithms. These problems include factoring integers andExpand
Multiple-particle interference and quantum error correction
  • A. Steane
  • Physics, Mathematics
  • Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
  • 1996
The concept of multiple-particle interference is discussed, using insights provided by the classical theory of error correcting codes. This leads to a discussion of error correction in a quantumExpand
...
1
2
3
4
...