Topological quantum computer
≈ 5 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
A topological quantum computer is a type of quantum computer. It utilizes anyons, a type of quasiparticle that occurs in two-dimensional systems. The anyons' world lines intertwine to form braids in a three-dimensional spacetime (one temporal and two spatial dimensions). The braids act as the logic gates of the computer. The primary advantage of using quantum braids over trapped quantum particles is in their stability.
While small but cumulative perturbations can cause quantum states to decohere and introduce errors in traditional quantum computations, such perturbations do not alter the topological properties of the braids. This stability is akin to the difference between cutting and reattaching a string to form a different braid versus a ball (representing an ordinary quantum particle in four-dimensional spacetime) colliding with a wall. It was proposed by Russian-American physicist Alexei Kitaev in 1997.
While the elements of a topological quantum computer originate in a purely mathematical realm, experiments in fractional quantum Hall systems indicate that these elements may be created in the real world by using semiconductors made of gallium arsenide at a temperature of nearly absolute zero and subject to strong magnetic fields.
A topological quantum computer is a type of quantum computer. It utilizes anyons, a type of quasiparticle that occurs in two-dimensional systems. The anyons' world lines intertwine to form braids in a three-dimensional spacetime (one temporal and two spatial dimensions). The braids act as the logic gates of the computer. The primary advantage of using quantum braids over trapped quantum particles is in their stability.
While small but cumulative perturbations can cause quantum states to decohere and introduce errors in traditional quantum computations, such perturbations do not alter the topological properties of the braids. This stability is akin to the difference between cutting and reattaching a string to form a different braid versus a ball (representing an ordinary quantum particle in four-dimensional spacetime) colliding with a wall. It was proposed by Russian-American physicist Alexei Kitaev in 1997.
While the elements of a topological quantum computer originate in a purely mathematical realm, experiments in fractional quantum Hall systems indicate that these elements may be created in the real world by using semiconductors made of gallium arsenide at a temperature of nearly absolute zero and subject to strong magnetic fields. 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.
Impact
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.
B=F^{-1} 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.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1378852896 under CC BY-SA 4.0; modifications have been made.