pith. machine review for the scientific record. sign in

arxiv: 1003.2856 · v1 · submitted 2010-03-15 · 🪐 quant-ph · cond-mat.mes-hall· cond-mat.str-el

A Blueprint for a Topologically Fault-tolerant Quantum Computer

classification 🪐 quant-ph cond-mat.mes-hallcond-mat.str-el
keywords quantumcomputersystemsfault-tolerantoperationsapplicationsblueprintclassical
0
0 comments X
read the original abstract

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 surmount this obstacle by using special physical systems -- non-Abelian topologically ordered phases of matter -- that would provide intrinsic fault-tolerance at the hardware level. The so-called "Ising-type" non-Abelian topological order is likely to be physically realized in a number of systems, but it can only provide a universal gate set (a requisite for quantum computation) if one has the ability to perform certain dynamical topology-changing operations on the system. Until now, practical methods of implementing these operations were unknown. Here we show how the necessary operations can be physically implemented for Ising-type systems realized in the recently proposed superconductor-semiconductor and superconductor-topological insulator heterostructures. Furthermore, we specify routines employing these methods to generate a computationally universal gate set. We are consequently able to provide a schematic blueprint for a fully topologically-protected Ising based quantum computer using currently available materials and techniques. This may serve as a starting point for attempts to construct a fault-tolerant quantum computer, which will have applications to cryptanalysis, drug design, efficient simulation of quantum many-body systems, solution of large systems of linear equations, searching large databases, engineering future quantum computers, and -- most importantly -- those applications which no one in our classical era has the prescience to foresee.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Lower overhead fault-tolerant building blocks for noisy quantum computers

    quant-ph 2026-05 unverdicted novelty 5.0

    New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.