Toric code

Error correction and computation

The toric code is defined on a two-dimensional lattice, usually chosen to be the square lattice, with a spin-½ degree of freedom located on each edge. They are chosen to be periodic. Stabilizer operators are defined on the spins around each vertex v and plaquette (or face) p of the lattice as follows,

A v = ∏ i ∈ v σ i x , B p = ∏ i ∈ p σ i z .

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

A v | ψ ⟩ = | ψ ⟩ , ∀ v , B p | ψ ⟩ = | ψ ⟩ , ∀ p ,

for any state | ψ ⟩ . For the toric code, this space is four-dimensional, and so can be used to store two qubits of quantum information. This can be proven by considering the number of independent stabilizer operators. 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 v | ϕ ⟩ = − | ϕ ⟩ ,

a quasiparticle known as an e anyon can be said to exist on the vertex v . Similarly violations of the B p are associated with so called m 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.

When errors create an anyon pair and move the anyons, one can imagine a path connecting the two composed of all links acted upon. If the anyons then meet and are annihilated, this path describes a loop. If the loop is topologically trivial, it has no effect on the stored information. The annihilation of the anyons in this case corrects all of the errors involved in their creation and transport. However, if the loop is topologically non-trivial, though reannihilation of the anyons returns the state to the stabilizer space it also implements a logical operation on the stored information. The errors in this case are therefore not corrected, but consolidated.

Let us consider the noise model for which bit and phase errors occur independently on each spin, both with probability p. When p is low, this will create sparsely distributed pairs of anyons which have not moved far from their point of creation. Correction can be achieved by identifying the pairs that the anyons were created in (up to an equivalence class), and then reannihilating them to remove the errors. As p increases, however, it becomes more ambiguous as to how the anyons may be paired without risking the formation of topologically non-trivial loops. This gives a threshold probability, under which the error correction will almost certainly succeed. Through a mapping to the random bond Ising model, this critical probability has been found to be around 11%.

Other error models may also be considered, and thresholds found. In all cases studied so far, the code has been found to saturate the Hashing bound. For some error models, such as biased errors where bit errors occur more often than phase errors or vice versa, lattices other than the square lattice must be used to achieve the optimal thresholds.

These thresholds are upper limits, and are useless unless efficient algorithms are found to achieve them. The most well-used algorithm is minimum weight perfect matching. When applied to the noise model with independent bit and flip errors, a threshold of around 10.5% is achieved. This falls only a little short of the 11% maximum. However, matching does not work so well when there are correlations between the bit and phase errors, such as with depolarizing noise.

The means to perform quantum computation on logical information stored within the toric code has been considered, with the properties of the code providing fault-tolerance. It has been shown that extending the stabilizer space using 'holes', vertices or plaquettes on which stabilizers are not enforced, allows many qubits to be encoded into the code. However, a universal set of unitary gates can not be fault-tolerantly implemented by unitary operations and so additional techniques are required to achieve quantum computing. For example, universal quantum computing can be achieved by preparing magic states used to teleport in the required additional gates. Furthermore, preparation of magic states must be fault tolerant, which can be achieved by magic state distillation on noisy magic states. 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.

Hamiltonian and self-correction

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,

H T C = − J ∑ v A v − J ∑ p B p , J > 0.

The ground state space 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. However, the dynamic effects of such perturbations can still cause problems for the code.

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 J , but since arbitrary increases of this coupling are unrealistic, the protection given by the Hamiltonian still has its limits.

The means to make the toric code, or the planar code, into a fully self-correcting quantum memory is often considered. Self-correction means that the Hamiltonian will naturally suppress errors indefinitely, leading to a lifetime that diverges in the thermodynamic limit. It has been found that this is possible in the toric code only if long range interactions are present between anyons. Proposals have been made for realization of these in the lab Another approach is the generalization of the model to higher dimensions, with self-correction possible in 4D with only quasi-local interactions.

Anyon model

As mentioned above, so called e and m quasiparticles are associated with the vertices and plaquettes of the model, respectively. These quasiparticles can be described as anyons, due to the non-trivial effect of their braiding. Specifically, though both species of anyons are bosonic with respect to themselves, the braiding of two e 's or m 's having no effect, a full monodromy of an e and an m will yield a phase of − 1 . Such a result is not consistent with either bosonic or fermionic statistics, and hence is anyonic.

The anyonic mutual statistics of the quasiparticles demonstrate the logical operations performed by topologically non-trivial loops. Consider the creation of a pair of e anyons followed by the transport of one around a topologically nontrivial loop, such as that shown on the torus in blue on the figure above, before the pair are reannhilated. The state is returned to the stabilizer space, but the loop implements a logical operation on one of the stored qubits. If m anyons are similarly moved through the red loop above a logical operation will also result. The phase of − 1 resulting when braiding the anyons shows that these operations do not commute, but rather anticommute. They may therefore be interpreted as logical Z and X Pauli operators on one of the stored qubits. The corresponding logical Pauli's on the other qubit correspond to an m anyon following the blue loop and an e anyon following the red. No braiding occurs when e and m pass through parallel paths, the phase of − 1 therefore does not arise and the corresponding logical operations commute. This is as should be expected since these form operations acting on different qubits.

Due to the fact that both e and m anyons can be created in pairs, it is clear to see that both these quasiparticles are their own antiparticles. A composite particle composed of two e anyons is therefore equivalent to the vacuum, since the vacuum can yield such a pair and such a pair will annihilate to the vacuum. Accordingly, these composites have bosonic statistics, since their braiding is always completely trivial. A composite of two m anyons is similarly equivalent to the vacuum. The creation of such composites is known as the fusion of anyons, and the results can be written in terms of fusion rules. In this case, these take the form,

e × e = 1 , m × m = 1.

Where 1 denotes the vacuum. A composite of an e and an m is not trivial. This therefore constitutes another quasiparticle in the model, sometimes denoted ψ , with fusion rule,

e × m = ψ .

From the braiding statistics of the anyons we see that, since any single exchange of two ψ 's will involve a full monodromy of a constituent e and m , a phase of − 1 will result. This implies fermionic self-statistics for the ψ 's.

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. These are the quantum double models and string-net models, which allow a greater richness in the behaviour of anyons, and so may be used for more advanced quantum computation and error correction proposals. These not only include models with Abelian anyons, but also those with non-Abelian statistics.

Experimental progress

The most explicit demonstration of the properties of the toric code has been in state based approaches. Rather than attempting to realize the Hamiltonian, these simply prepare the code in the stabilizer space. Using this technique, experiments have been able to demonstrate the creation, transport and statistics of the anyons. More recent experiments have also been able to demonstrate the error correction properties of the code

For realizations of the toric code and its generalizations with a Hamiltonian, much progress has been made using Josephson junctions. The theory of how the Hamiltonians may be implemented has been developed for a wide class of topological codes. An experiment has also been performed, realizing the toric code Hamiltonian for a small lattice, and demonstrating the quantum memory provided by its degenerate ground state.

Other theoretical work towards experimental realizations is based on cold atoms. A toolkit of methods that may be used to realize topological codes with optical lattices has been explored, as have experiments concerning minimal instances of topological order. Progress is also being made into simulations of the toric model with Rydberg atoms, in which the Hamiltonian and the effects of dissipative noise can be demonstrated.