Corpus ID: 116987142

A Blueprint for a Topologically Fault-tolerant Quantum Computer

  title={A Blueprint for a Topologically Fault-tolerant Quantum Computer},
  author={Parsa Bonderson and Sankar Das Sarma and Michael H. Freedman and C. Nayak},
  journal={arXiv: Quantum Physics},
The advancement of information processing into the realm of quantum mechanics promises a transcendence in computational power that will enable problems to be solved which are completely beyond the known abilities of any "classical" computer, including any potential non-quantum technologies the future may bring. However, the fragility of quantum states poses a challenging obstacle for realization of a fault-tolerant quantum computer. The topological approach to quantum computation proposes to… Expand

Figures from this paper

Fault-Tolerant Quantum Error Correction for non-Abelian Anyons
While topological quantum computation is intrinsically fault-tolerant at zero temperature, it loses its topological protection at any finite temperature. We present a scheme to protect theExpand
Systematic distillation of composite Fibonacci anyons using one mobile quasiparticle
  • B. Reichardt
  • Physics, Computer Science
  • Quantum Inf. Comput.
  • 2012
It is shown how to simulate universal quantum computation by braiding one quasiparticle and with only one measurement, to read out the result. Expand
Non-Abelian statistics and topological quantum information processing in 1D wire networks
The synthesis of a quantum computer remains an ongoing challenge in modern physics. Whereas decoherence stymies most approaches, topological quantum computation schemes evade decoherence at theExpand
Universal Geometric Path to a Robust Majorana Magic Gate
A universal quantum computer requires a full set of basic quantum gates. With Majorana bound states one can form all necessary quantum gates in a topologically protected way, bar one. In this paper,Expand
Low-depth quantum architectures for factoring
Quantum computing is a new field which combines computer science and quantum physics. Its most famous result, Shor's factoring algorithm, would enable us to one day compromise the widely-used RSAExpand
Mathematics of Topological Quantum Computing
In topological quantum computing, information is encoded in "knotted" quantum states of topological phases of matter, thus being locked into topology to prevent decay. Topological precision has beenExpand
The ABCs of the Color Code: A Study of Topological Quantum Codes as Toy Models for Fault-Tolerant Quantum Computation and Quantum Phases Of Matter
This thesis is devoted to studying a class of quantum error-correcting codes — topological quantum codes. We explore the question of how one can achieve fault- tolerant quantum computation withExpand
Topological quantum gate construction by iterative pseudogroup hashing
We describe the hashing technique for obtaining a fast approximation of a target quantum gate in the unitary group SU(2) represented by a product of the elements of a universal basis. The hashingExpand
The search for strong topological insulators
Topological insulators [1-6] is a new quantum phase of matter with exotic properties such as dissipationless transport and protection against Anderson localization [7]. These new states of quantumExpand
Half-Heusler ternary compounds as new multifunctional experimental platforms for topological quantum phenomena.
The results suggest that half-Heuslers provide a new platform for deriving a host of topologically exotic compounds and their nanoscale or thin-film device versions through the inherent flexibility of their lattice parameter, spin-orbit strength and magnetic moment tunability paving the way for the realization of multifunctional topological devices. Expand


Non-Abelian Anyons and Topological Quantum Computation
Topological quantum computation has emerged as one of the most exciting approaches to constructing a fault-tolerant quantum computer. The proposal relies on the existence of topological states ofExpand
Towards universal topological quantum computation in the ν = 5 2 fractional quantum Hall state
The Pfaffian state, which may describe the quantized Hall plateau observed at Landau level filling fraction $\ensuremath{\nu}=\frac{5}{2}$, can support topologically-protected qubits with extremelyExpand
Universal quantum computation with ideal Clifford gates and noisy ancillas (14 pages)
We consider a model of quantum computation in which the set of elementary operations is limited to Clifford unitaries, the creation of the state |0>, and qubit measurement in the computational basis.Expand
Fault-Tolerant Quantum Computation
Fault tolerance techniques will be essential for achieving the considerable potential of quantum computers and will need to control high noise rates and do so with low overhead, since qubits are expensive. Expand
Universal quantum computation with the v=5/2 fractional quantum Hall state
We consider topological quantum computation (TQC) with a particular class of anyons that are believed to exist in the fractional quantum Hall effect state at Landau-level filling fraction v =5/2.Expand
On Universal and Fault-Tolerant Quantum Computing
A novel universal and fault-tolerant basis (set of gates) for quantum computation is described. Such a set is necessary to perform quantum computation in a realistic noisy environment. The new basisExpand
Implementing arbitrary phase gates with Ising anyons.
This work proposes a method of implementing arbitrary single-qubit phase gates for Ising anyons by running a current of anyons with interfering paths around computational anyons. Expand
Resilient quantum computation: error models and thresholds
  • E. Knill, R. Laflamme, W. Zurek
  • Mathematics, Physics
  • Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
  • 1998
Recent research has demonstrated that quantum computers can solve certain types of problems substantially faster than the known classical algorithms. These problems include factoring integers andExpand
Fault-tolerant quantum computation with constant error
This paper shows how to perform fault tolerant quantum computation when the error probability, q, is smaller than some constant threshold, q.. the cost is polylogarithmic in time and space, and no measurements are used during the quantum computation. Expand
P/NP, and the quantum field computer
  • M. Freedman
  • Computer Science, Medicine
  • Proc. Natl. Acad. Sci. USA
  • 1998
This work proposes that each physical theory supports computational models whose power is limited by the physical theory, and suggests that some physical system whose effective Lagrangian contains a non-Abelian topological term might be manipulated to serve as an analog computer capable of solving NP or even #P-hard problems in polynomial time. Expand