- Topological quantum computer
A topological quantum computer is a theoretical
quantum computerthat employs two-dimensional quasiparticles called anyons, whose world lines cross over 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. The smallest perturbations can cause a quantum particle to decohere and introduce errors in the computation, such small perturbations do not change the topological properties of the braids. 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) simply bumping into a wall. While the elements of a topological quantum computer originate in a purely mathematical realm, recent experiments indicate these elements can be created in the real world using semiconductors made of gallium arsenidenear absolute zeroand subjected to strong magnetic fields.
Anyons are quasiparticles in a two-dimensional space. Anyons are not strictly fermions or bosons, but do share the characteristic of fermions in that they cannot occupy the same state. Thus, the world linesof two anyons cannot cross or merge. This allows braids to be made that make up a particular circuit. In the real world, anyons form from the excitations in an electron gas in a very strong magnetic field, and carry fractional units of magnetic flux in a particle-like manner. This phenomenon is called the fractional quantum Hall effect. The electron "gas" is sandwiched between two flat plates of gallium arsenide, which create the two-dimensional space required for anyons, and is cooled and subjected to intense transverse magnetic fields.
When anyons are braided, the transformation of the quantum state of the systemdepends only on the topological class of the anyons' trajectories (which are classifiedaccording 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 Nayakproposed a quantum Hall device which would realize a topological qubit.In a key development for topological quantum computers, in 2005 Vladimir J. Goldman, Fernando E. Camino, and Wei Zhou were said to have created the first experimental evidence for using fractional quantum Hall effect to create actual anyons, although others have suggested their results could be the product of phenomena not involving anyons. It should also be noted that nonabelian anyons, a species required for topological quantum computers, have yet to be experimentally confirmed.
The original proposal for topological quantum computation is due to
Alexei Kitaevin 1997.
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.
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. Fortunately in 2002, Michael H. Freedman along with Zhenghan Wang, both with Microsoft, and Michael Larson of Indiana University proved that a topological quantum computer can, in principle, perform any computation that a conventional quantum computer can do.
They found that conventional quantum computer device, given a flawless (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.
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. It has been estimated that the error rate for a logical NOT operation of a
qubitstate could be as low as 10-30 or less. Although this number has been criticized as being strongly overstated, there is nonetheless good reason to believe that topologically protected systems will be particularly immune to many sources of error that plague other schemes for quantum information processing.
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.
*"Computing with Quantum Knots" Graham P. Collins, Scientific American, April 2006. [http://info.phys.unm.edu/~thedude/topo/sciamTQC.pdf]
* "Topologically Protected Qubits from a Possible Non-Abelian Fractional Quantum Hall State", Sankar Das Sarma, Michael Freedman, and Chetan Nayak [http://stationq.cnsi.ucsb.edu/~nayak/] , Phys. Rev. Lett. 94, 166802 (2005).
*"Non-Abelian Anyons and Topological Quantum Computation", Chetan Nayak [http://stationq.cnsi.ucsb.edu/~nayak/] , Steven H. Simon, Ady Stern, Michael Freedman, Sankar Das Sarma, http://www.arxiv.org/abs/0707.1889, 2007
*"Topological fault-tolerance in cluster state quantum computation", Robert Raussendorf, Jim Harrington, Kovid Goyal, http://arxiv.org/abs/quant-ph/0703143, 2007
Wikimedia Foundation. 2010.
Look at other dictionaries:
Quantum computer — A quantum computer is a device for computation that makes direct use of distinctively quantum mechanical phenomena, such as superposition and entanglement, to perform operations on data. In a classical (or conventional) computer, information is… … Wikipedia
One-way quantum computer — The one way or measurement based quantum computer is a method of quantum computing that first prepares an entangled resource state, usually a cluster state or graph state, then performs single qubit measurements on it. It is one way because the… … Wikipedia
Nuclear magnetic resonance quantum computer — Molecule of alanine used in NMR implementation of quantum computing. Qubits are implemented by spin states of the black carbon atoms NMR quantum computing uses the spin states of molecules as qubits. NMR differs from other implementation … Wikipedia
Quantum error correction — is used in quantum computing to protect quantum information from errors due to decoherence and other quantum noise. Quantum error correction is essential if one is to achieve fault tolerant quantum computation that can deal not only with noise on … Wikipedia
Quantum finite automata — In quantum computing, quantum finite automata or QFA are a quantum analog of probabilistic automata. They are related to quantum computers in a similar fashion as finite automata are related to Turing machines. Several types of automata may be… … Wikipedia
Quantum information — For the journal with this title, see Historical Social Research. In quantum mechanics, quantum information is physical information that is held in the state of a quantum system. The most popular unit of quantum information is the qubit, a two… … Wikipedia
Quantum channel — In quantum information theory, a quantum channel is a communication channel which can transmit quantum information, as well as classical information. An example of quantum information is the state of a qubit. An example of classical information… … Wikipedia
Quantum circuit — In quantum information theory, a quantum circuit is a model for quantum computation in which a computation is a sequence of reversible transformations on a quantum mechanical analog of an n bit register. This analogous structure is referred to as … Wikipedia
Topological sorting — Dependency resolution redirects here. For other uses, see Dependency (disambiguation). In computer science, a topological sort or topological ordering of a directed graph is a linear ordering of its vertices such that, for every edge uv, u comes… … Wikipedia
Fractional quantum Hall effect — The fractional quantum Hall effect (FQHE) is a physical phenomenon in which a certain system behaves as if it were composed of particles with charge smaller than the elementary charge. Its discovery and explanation were recognized by the 1998… … Wikipedia