Jump to content

Toric code

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Woottonjames (talk | contribs) at 12:50, 19 October 2010 (Created page with 'The '''Toric Code''' is a topological quantum error correcting code defined on a two dimensional [[Spin_(physics)...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

The Toric Code is a topological quantum error correcting code defined on a two dimensional spin lattice [1] Though many more examples of such codes exist [2], the toric code is the simplest and most well studied.

Error correcting and computation

The toric code is defined on a two dimensional lattice, usually chosen to be the square lattice, with a spin-½ particle located on each edge. The periodic boundary conditions of the lattice are chosen such that it is wrapped around a torus, giving the code its name. Stabilizer operators are defined on the spins around each vertex and plaquette (or face) of the lattice as follows,

Where here we use to denote the edges touching the vertex , and to denote the edges surrounding the plaquette . The stabilizer space of the code is that for which all stabilizers act trivially, hence,

for any state . For the toric code, this space is four dimensional, and so can be used to store two qubits of quantum information. The occurrence of errors will move the state out of the stabilizer space, resulting in vertices and plaquettes for which the above condition does not hold. The positions of these violations is the syndrome of the code, which can be used for error correction.

The unique nature of the topological codes, such as the toric code, is that stabilizer violations can be interpreted as quasiparticles. Specifically, if the code is in a state such that,

,

a quasiparticle known as an anyon can be said to exist on the vertex . Similarly violations of the are associated with so called anyons on the plaquettes. The stabilizer space therefore corresponds to the anyonic vacuum. Single spin errors cause pairs of anyons to be created and transported around the lattice.

If the pairs of anyons are sparsely distributed, and if the anyons are not moved far, error correction may be performed with a high success rate by first using minimum weight perfect matching to identify the pairs of anyons and then reannhilating them. [3] However, if the movement or annihilation of anyons causes loops to form around topologically non-trivial paths of the torus, logical errors will occur and error correction will fail. This sets a bound on the number of errors the code can successfully correct. For an lattice, the minimum number of spins on which errors must act to cause a logical error is then , enough to create an anyon pair and transport one half way around the lattice. If, however, the errors occur randomly on each spin with a probability , large will allow errors to be successfully corrected almost surely for [4]

The means to perform quantum computation on logical information stored within the toric code has also been considered. It has been shown that extending the stabilizer space using 'holes', vertices or plaquettes on which stabilizers are not enforced, allows a universal set of gates to be performed. A measurement based scheme for quantum computation based upon this principle has been found, whose error threshold is the highest known for a two dimensional architecture. [5]

Hamiltonian

Since the stabilizer operators of the toric code are quasilocal, acting only on spins located near each other on a two dimensional lattice, it is not unrealistic to define the following Hamiltonian,

The ground state of this Hamiltonian is the stabilizer space of the code. Excited states correspond to those of anyons, with the energy proportional to their number. Local errors are therefore energetically suppressed by the gap, which has been shown to be stable against local perturbations. [6] However, the dynamic effects of such perturbations can still cause problems for the code. [7]

The gap also gives the code a certain resilience against thermal errors, allowing it to be correctable almost surely for a certain critical time. This time increases with , but since arbitrary increases of this coupling are unrealistic, the code still has its limits. Accordingly, many attempts are being made to make the toric code fully thermally stable [8][9].

Other uses

As a simple model of anyons, the toric code can be used in studies of anyonic behaviour and topologically ordered systems. For example, it has been used to study the effects of thermalization on the topological entropy of states. [10] It has also been shown that, using superposition states of the Abelian toric code anyons, some properties of the more complex non-Abelian anyons can be realized. [11]

Generalizations

The use of a torus is not required to form an error correcting code. Other surfaces may also be used, with their topological properties determining the degeneracy of the stabilizer space. In general, quantum error correcting codes defined on two dimensional spin lattices according to the principles above are known as surface codes.

It is also possible to define similar codes using higher dimensional spins. [12] These allow a greater richness in the behaviour of anyons, which may be used for quantum computation and error correction. [13] These not only include models with Abelian anyons, but also those with non-Abelian statistics. [14]


References

  1. ^ A. Y. Kitaev, Proceedings of the 3rd International Conference of Quantum Communication and Measurement, Ed. O. Hirota, A. S. Holevo, and C. M. Caves (New York, Plenum, 1997).
  2. ^ A. Kitaev, Ann. Phys. 321, 2 (2006).
  3. ^ Edmonds, Jack (1965). "Paths, trees, and flowers". Canad. J. Math. 17: 449–467.
  4. ^ E. Dennis, A. Kitaev, A. Landahl, J. Preskill, J. Math. Phys. 43, 4452 (2002).
  5. ^ R. Raussendorf, J. Harrington, Phys. Rev. Lett. 98, 190504 (2007); R. Raussendorf, J. Harrington and K. Goyal, New J. Phys. 9, 199, (2007).
  6. ^ S. Bravyi, M. Hastings and S. Michalakis, J. Math. Phys. 51, 093512 (2010)
  7. ^ F. Pastawski, A. Kay, N. Schuch, I. Cirac, arXiv:0911.3843 (2009).
  8. ^ A. Hamma, C. Castelnovo, C. Chamon, Phys. Rev. B 79, 245122 (2009).
  9. ^ S. Chesi, B. Rothlisberger, D. Loss, Phys. Rev. A 82, 022305 (2010).
  10. ^ S. Iblisdir, D. Perez-Garcia, M. Aguado and J. Pachos, Phys. Rev. B 79, 134303 (2009).
  11. ^ J. R. Wootton, V. Lahtinen, Z. Wang and J. K. Pachos, Phys. Rev. B 78, 161102(R) (2008).
  12. ^ S. S. Bullock and G. K. Brennen, J. Phys. A 40, 3481-3505 (2007).
  13. ^ J. R. Wootton, V. Lahtinen, B. Doucot and J. K. Pachos, arXiv:0908.0708 (2009).
  14. ^ M. Aguado, G. K. Brennen, F. Verstraete and J. I. Cirac, Rev. Lett. 101, 260501 (2008); G. K. Brennen, M. Aguado, and J. I. Cirac, New J. Phys. 11, 053009 (2009).