Topological Quantum Computing

A topological quantum computer is a theoretical quantum computer proposed by Russian-American physicist Alexei Kitaev in 1997. It employs quasiparticles in two-dimensional systems, called anyons, whose world lines pass around one another to form braids in a three-dimensional spacetime (i.e., one temporal plus two spatial dimensions). These braids form the logic gates that make up the computer. The advantage of a quantum computer based on quantum braids over using trapped quantum particles is that the former is much more stable. Small, cumulative perturbations can cause quantum states to decohere and introduce errors in the computation, but such small perturbations do not change the braids' topological properties. This is like the effort required to cut a string and reattach the ends to form a different braid, as opposed to a ball (representing an ordinary quantum particle in four-dimensional spacetime) bumping into a wall.

While the elements of a topological quantum computer originate in a purely mathematical realm, experiments in fractional quantum Hall systems indicate these elements may be created in the real world using semiconductors made of gallium arsenide at a temperature of near absolute zero and subjected to strong magnetic fields.

Introduction

Anyons are quasiparticles in a two-dimensional space. Anyons are neither fermions nor bosons, but like fermions, they cannot occupy the same state. Thus, the world lines of two anyons cannot intersect or merge, which allows their paths to form stable braids in space-time. Anyons can form from excitations in a cold, two-dimensional electron gas in a very strong magnetic field, and carry fractional units of magnetic flux. This phenomenon is called the fractional quantum Hall effect. In typical laboratory systems, the electron gas occupies a thin semiconducting layer sandwiched between layers of aluminium gallium arsenide.

When anyons are braided, the transformation of the quantum state of the system depends only on the topological class of the anyons' trajectories (which are classified according to the braid group). Therefore, the quantum information which is stored in the state of the system is impervious to small errors in the trajectories. In 2005, Sankar Das Sarma, Michael Freedman, and Chetan Nayak proposed a quantum Hall device that would realize a topological qubit. In a key development for topological quantum computers, in 2005 Vladimir J. Goldman, Fernando E. Camino, and Wei Zhou claimed to have created and observed the first experimental evidence for using a fractional quantum Hall effect to create actual anyons, although others have suggested their results could be the product of phenomena not involving anyons. Non-abelian anyons, a species required for topological quantum computers, have yet to be experimentally confirmed. Possible experimental evidence has been found, but the conclusions remain contested. In 2018, scientists again claimed to have isolated the required Majorana particles, but the finding was retracted in 2021. ''Quanta Magazine'' stated in 2021 that "no one has convincingly shown the existence of even a single (Majorana zero-mode) quasiparticle".

Topological vs. standard quantum computer

Topological quantum computers are equivalent in computational power to other standard models of quantum computation, in particular to the quantum circuit model and to the quantum Turing machine model. That is, any of these models can efficiently simulate any of the others. Nonetheless, certain algorithms may be a more natural fit to the topological quantum computer model. For example, algorithms for evaluating the Jones polynomial were first developed in the topological model, and only later converted and extended in the standard quantum circuit model.

Computations

To live up to its name, a topological quantum computer must provide the unique computation properties promised by a conventional quantum computer design, which uses trapped quantum particles. In 2000, Michael H. Freedman, Alexei Kitaev, Michael J. Larsen, and Zhenghan Wang proved that a topological quantum computer can, in principle, perform any computation that a conventional quantum computer can do, and vice versa.

They found that a conventional quantum computer device, given an error-free operation of its logic circuits, will give a solution with an absolute level of accuracy, whereas a topological quantum computing device with flawless operation will give the solution with only a finite level of accuracy. However, any level of precision for the answer can be obtained by adding more braid twists (logic circuits) to the topological quantum computer, in a simple linear relationship. In other words, a reasonable increase in elements (braid twists) can achieve a high degree of accuracy in the answer. Actual computation atesare done by the edge states of a fractional quantum Hall effect. This makes models of one-dimensional anyons important. In one space dimension, anyons are defined algebraically.

Error correction and control

Even though quantum braids are inherently more stable than trapped quantum particles, there is still a need to control for error inducing thermal fluctuations, which produce random stray pairs of anyons which interfere with adjoining braids. Controlling these errors is simply a matter of separating the anyons to a distance where the rate of interfering strays drops to near zero. Simulating the dynamics of a topological quantum computer may be a promising method of implementing fault-tolerant quantum computation even with a standard quantum information processing scheme. Raussendorf, Harrington, and Goyal have studied one model, with promising simulation results.

Example: Computing with Fibonacci anyons

One of the prominent examples in topological quantum computing is with a system of Fibonacci anyons. In the context of conformal field theory, fibonacci anyons are described by the Yang–Lee model, the SU(2) special case of the Chern–Simons theory and Wess–Zumino–Witten models. These anyons can be used to create generic gates for topological quantum computing. There are three main steps for creating a model:
* Choose our basis and restrict our Hilbert space
* Braid the anyons together
* Fuse the anyons at the end, and detect how they fuse in order to read the output of the system.

State preparation

Fibonacci anyons are defined by three qualities:
# They have a topological charge of $\tau$. In this discussion, we consider another charge called $1$ which is the ‘vacuum’ charge if anyons are annihilated with each-other.
# Each of these anyons are their own antiparticle. $\tau = \tau^*$ and $1 = 1^*$.
# If brought close to each-other, they will ‘fuse’ together in a nontrivial fashion. Specifically, the ‘fusion’ rules are:
## $1 \otimes 1 = 1$
## $1 \otimes \tau = \tau \otimes 1 = \tau$
## $\tau \otimes \tau = 1 \oplus \tau$
# Many of the properties of this system can be explained similarly to that of two spin 1/2 particles. Particularly, we use the same tensor product $\otimes$ and direct sum $\oplus$ operators.
The last ‘fusion’ rule can be extended this to a system of three anyons:

:$\tau \otimes \tau \otimes \tau = \tau \otimes (1 \oplus \tau) = \tau \otimes 1 \oplus \tau \otimes \tau = \tau \oplus 1 \oplus \tau = 1 \oplus 2 \cdot \tau$

Thus, fusing three anyons will yield a final state of total charge $\tau$ in 2 ways, or a charge of $1$ in exactly one way. We use three states to define our basis. However, because we wish to encode these three anyon states as superpositions of 0 and 1, we need to limit the basis to a two-dimensional Hilbert space. Thus, we consider only two states with a total charge of $\tau$. This choice is purely phenomenological. In these states, we group the two leftmost anyons into a 'control group', and leave the rightmost as a 'non-computational anyon'. We classify a $, 0\rangle$ state as one where the control group has total 'fused' charge of $1$, and a state of $, 1 \rangle$ has a control group with a total 'fused' charge of $\tau$. For a more complete description, see Nayak.

Gates

Following the ideas above, adiabatically braiding these anyons around each-other will result in a unitary transformation. These braid operators are a result of two subclasses of operators:
* The ''F'' matrix
* The ''R'' matrix
The ''R'' matrix can be conceptually thought of as the topological phase that is imparted onto the anyons during the braid. As the anyons wind around each-other, they pick up some phase due to the Aharonov–Bohm effect.

The ''F'' matrix is a result of the physical rotations of the anyons. As they braid between each-other, it is important to realize that the bottom two anyons—the control group—will still distinguish the state of the qubit. Thus, braiding the anyons will change which anyons are in the control group, and therefore change the basis. We evaluate the anyons by always fusing the control group (the bottom anyons) together first, so exchanging which anyons these are will rotate the system. Because these anyons are non-abelian, the order of the anyons (which ones are within the control group) will matter, and as such they will transform the system.

The complete braid operator can be derived as:

$B=F^ R F$

In order to mathematically construct the ''F'' and ''R'' operators, we can consider permutations of these F and R operators. We know that if we sequentially change the basis that we are operating on, this will eventually lead us back to the same basis. Similarly, we know that if we braid anyons around each-other a certain number of times, this will lead back to the same state. These axioms are called the pentagonal and hexagonal axioms respectively as performing the operation can be visualized with a pentagon/hexagon of state transformations. Although mathematically difficult, these can be approached much more successfully visually.

With these braid operators, we can finally formalize the notion of braids in terms of how they act on our Hilbert space and construct arbitrary universal quantum gates.Explicit braids that perform particular quantum computations with Fibonacci anyons have been given by

See also

* Ginzburg–Landau theory
* Husimi Q representation
* Random matrix
* Topological defect
* Toric code

References

Further reading

*
*
*
*
*
*
*
*

{{Quantum mechanics topics

Quantum information science
Classes of computers
Models of computation
Topology
Quantum computing