The apparent computational power of Quantum computers suggests a significant speed- up in calculations by leveraging the principles of superposition and entanglement, proper of Quantum Mechanics. However, the quantum information stored is very fragile to thermal excitations (also referred to as noise) and accuracy errors when information is processed via quantum logical gates. Many research areas develop techniques to correct and mitigate such errors; however, progress on the scalability and efficiency of quantum chips is slow. On the other hand, a relatively new technology has been proposed, directly targeting the prob- lem of decoherence by an inherently fault-tolerant quantum processor, Topological quantum Computing (TQC). In this overview, we trace State of the Art, the fundamental concepts, and the theoretical framework to understand systematically the physical consequence of its constituent qubits, non-Abelian anyons, and how to perform computation. The notion of topologically ordered states is built from a toy model, the Toric code, to a physical system exhibiting topological states, the Quantum Hall Effect (QHE). Once topological order is de- rived, the connection of non-Abelian anyons as qubits is bridged by a qualitative explanation, and the comprehension of the fundamental pillars of TQC flows more naturally. Concepts are reviewed under a comprehensive perspective, using clear language, without repetitive expla- nations found in other sources, and at a technisism level readable for a profile with a strong basic Quantum Mechanics background. Finally, a temporal sequence of the most cited and important achievements on topologically ordered systems and states with the perspective on building the first topological quantum computer closes this document, offering a wide picture of today’s state of the art on Topological Quantum Computing.
The apparent computational power of Quantum computers suggests a significant speed- up in calculations by leveraging the principles of superposition and entanglement, proper of Quantum Mechanics. However, the quantum information stored is very fragile to thermal excitations (also referred to as noise) and accuracy errors when information is processed via quantum logical gates. Many research areas develop techniques to correct and mitigate such errors; however, progress on the scalability and efficiency of quantum chips is slow. On the other hand, a relatively new technology has been proposed, directly targeting the prob- lem of decoherence by an inherently fault-tolerant quantum processor, Topological quantum Computing (TQC). In this overview, we trace State of the Art, the fundamental concepts, and the theoretical framework to understand systematically the physical consequence of its constituent qubits, non-Abelian anyons, and how to perform computation. The notion of topologically ordered states is built from a toy model, the Toric code, to a physical system exhibiting topological states, the Quantum Hall Effect (QHE). Once topological order is de- rived, the connection of non-Abelian anyons as qubits is bridged by a qualitative explanation, and the comprehension of the fundamental pillars of TQC flows more naturally. Concepts are reviewed under a comprehensive perspective, using clear language, without repetitive expla- nations found in other sources, and at a technisism level readable for a profile with a strong basic Quantum Mechanics background. Finally, a temporal sequence of the most cited and important achievements on topologically ordered systems and states with the perspective on building the first topological quantum computer closes this document, offering a wide picture of today’s state of the art on Topological Quantum Computing.
Quantum computers have shown great promise as a resource providing exponential speedup over classical computers for certain problems.Akin to their classical counterparts, quantum computers will be prone to errors.There are two major sources of errors.First, the most formidable source of error is decoherence.To perform quantum computation, quantum information must be stored, processed and read out while protecting it from the debilitating effects of decoherence.Second, even if the system is protected from decoherence, it is almost certain that all the operations performed on the quantum information during its processing will be imperfect.These errors will accumulate over the duration of the computation, eventually causing failure.Thus, for a quantum computing scheme to be feasible, it needs to be fault-tolerant.What this means is that the quantum computer can still perform its task effectively while its components are imperfect.A major breakthrough in this field is the threshold theorem, which asserts that ideal quantum circuits can be simulated efficiently by noisy ones provided the error rates of individual gates are below a certain threshold [1,2,3].Topological quantum computing is an approach to fault-tolerant quantum computation, where the protection from errors occurs not from active intervention, but at a hardware level.The advantage of this approach is that it is robust to localized imperfections.First envisioned by Alexei Kitaev [4], this scheme makes use of a non-abelian exchange statistics of elementary excitations of some two-dimensional quantum many-body system.These excitations form the degenerate ground-space of this topologically ordered system, and all other states are separated from this space by a finite excitation gap.In order to perform computation in this scheme, one needs to create pairs of these non-abelian excitations (called non-abelian anyons) from vacuum, separating them spatially, transporting them around each other to implement the logical gates and finally, fusing them together for measurements.In order for this scheme to be viable, there are two conditions that must be fulfilled.First, there could be errors due to quantum tunneling between the non-abelian anyons.These processes can take place even at zero temperature.But, the amplitude of these processes are exponentially suppressed with the spatial separation of these particles and goes as e -L/l 0 , where L is the spatial separation and l 0 is some characteristic length scale of topological ordering of the system.Thus, to prevent such tunneling during quantum information processing and storage, L has to be much larger than l 0 .Second, at finite temperature, undesired thermally excited quasiparticles can lead to errors.The generation rate of these particles are exponentially suppressed by a Boltzmann factor e -∆/T , where ∆ is the excitation energy and T is the temperature.Therefore, the temperature must be low enough so that there are sufficiently low number of these undesired excitations.There are several physical systems where these excitations could, in principle, be found, manipulated and measured.Non-abelian anyons were proposed as elementary excitations of the ν = 5/2 state in the fractional quantum hall effect [5].The braiding statistics of these particles and their possible use in quantum computing has been investigated thoroughly.For more information on this topic, the reader is invited to consult [6,7].In a pathbreaking work [8], it was proposed that the non-abelian statistics of the excitations of the ν = 5/2 state are shared by the Majorana excitations of a 2D spinless p + ip superconductor.Since then, there have been other theoretical models [9,10] which also support these non-abelian excitations.Moreover, several experimental realizations of these Majorana excitations in solid state systems have also been proposed (for a comprehensive review, see [11]).In this lecture note, we will focus on implementation of topological quantum computation with
The superposition principle of quantum mechanics implies that the amount of classical (i.e., non-quantum) information needed to describe a quantum system is in general exponentially large in the size of the system. This makes simulating quantum physics on a classical computer quickly infeasible, even for moderately-sized systems and using the best present-day supercomputers in the world. This is unfortunate, since systems for which quantum effects are relevant are of interest in many areas of science and engineering, ranging from drug design to materials research. In 1982, Richard Feynman gave birth to the idea of a quantum computer, when he realized that simulating quantum physics could be achieved much more efficiently with a computer that was itself a quantum system. Since then, the number of problems for which a quantum computer is known to enjoy an advantage over a classical computer has steadily increased, ranging now far beyond the task of simulating quantum physics. A quantum computation of any interest will need to create complicated superposition states, for otherwise it would not achieve anything that could not be simulated on a classical computer. These superposition states, however, are highly fragile, and this fragility is the main obstacle that the scientific community faces on the road towards a useful quantum computer. Quantum computing will only be possible if it can be performed in a fault-tolerant way. It is due to seminal work by Alexei Kitaev from 1997 that the modern theory of quantum fault-tolerance is closely related to the term topology. Topology, as a sub-field of mathematics, is concerned with the properties of space that are preserved under continuous deformations. Topological order, a purely quantum phenomenon, refers to states which cannot be distinguished or evolved into each other locally, yet are globally distinct. The information that distinguishes between these states is stored in non-local degrees of freedom. If it were possible to store quantum information in these non-local degrees of freedom, this would be hugely attractive from a practical perspective, as it would mean that the information stored this way is immune to many forms of local errors. Two-dimensional topologically ordered states support excitations known as anyons. These are exotic quasi-particles that defy the dichotomy between fermions and bosons that applies to quantum particles in three spatial dimensions. In a topological quantum computer, the non-locally stored quantum information is processed by braiding these anyons around each other. Such a computation would be insensitive to small perturbations of the path along which anyons are braided, but would only depend on its topological properties. An open problem is whether topological order can persist at finite temperature. Equivalently, one can ask whether it is possible to build a system in which quantum information can be stored in a stable manner for arbitrarily long times, without performing active error correction and despite constant influence of a thermal environment. Such a system would constitute a self-correcting quantum memory and would extend the concept of a hard disk drive to the quantum realm. Whether nature allows for such a system to be built is of tremendous interest from both a fundamental and a practical perspective. Two-dimensional topologically ordered systems – those hosting anyons – do not qualify as self-correcting quantum memories; any finite temperature corrupts them in a time that is independent of the size of the system. In the present thesis, we propose and study systems in which the thermal stability of a simple toy model of an anyonic system, Kitaev’s toric code, is enhanced in various ways. We consider coupling it to optical cavity modes, to bosonic particles, or to a ferromagnet. These auxiliary systems then induce long-ranged interactions between the anyons, which allow to increase the finite-temperature lifetime of the stored quantum information arbitrarily by increasing the size of the system. While a topological quantum computer is naturally immune to many forms of imperfections and perturbations, accidental creation of anyonic quasi-particles due to coupling to an external environment is a form of error that requires active correction. This problem has seen surprisingly little attention until recently and is still poorly understood. In this thesis, we develop algorithms that are able to perform this task and provide the first proofs of its in-principle feasibility. Furthermore, we develop a system with the rare property that it both supports anyons that can be used for topological quantum computing, and allows for error correction with well-established techniques. Historically, the first proposals for building a fault-tolerant quantum \ncomputer involved an array of qubits (quantum bits) and a set of elementary operations that can be performed on individual and pairs of qubits. Fault-tolerant qubit-based quantum computing has been inspired tremendously from the insights gained in the study of topological quantum information processing. The surface code, which combines a qubit-based architecture with topological methods, is now at the forefront of the quest towards a fault-tolerant, scalable quantum computer. In the surface code, a large number of measurements are performed on a continuous basis to get some information about what errors have occurred. This information then needs to be converted by a classical algorithm into a prescription for performing error correction. In this thesis, we develop such an algorithm that, at the time of its publication, was the best efficient algorithm known for the surface code. Error correction for qubit-based quantum computers is typically studied with simplistic error models in which the errors on each qubit are independent from each other. We study what kinds of spatial and temporal correlations between the errors arise when a surface code is coupled to a typical model of an environment, and how they affect its correctability.
Topological quantum computation relies on the concepts of non-Abelian anyons and topological superconductors, holding great promise for noise-protected computation scalable since it stores quantum information coherently, irrespective of position. Included in this review are fundamentals like Majorana fermion zero modes, current innovations at Microsoft regarding nanowires, along with challenges and plans for scaling quantum computation at the level of million-qubits by the year 2030. It employs the use of anyons, a kind of quasi particle that exists in a two-dimensional setting. The world lines of the anyons cross each other in a braid fashion in the three-dimensional spacetime (one time-dimensional and two space-dimensional). The braids correspond to the logic gates in a computer. The one big advantage that the use of the quantum braid has over the trapped quantum particles has to do with stability. A small disturbance in a system may cause the decoherence of the quantum states and errors in calculation in a regular quantum computer, but in the braids, the disturbance does not affect the topological properties because it is like the difference between cutting and reconnecting a string to create a new braid compared to a ball (standing in place for a regular trapped quantum particle in four-dimensional spacetime) hitting a wall. 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.
Quantum computation represents a paradigm shift in information processing, promising exponential speedups for specific computational tasks. However, a significant hurdle to realizing practical quantum computers lies in the phenomenon of quantum decoherence – the loss of quantum information due to interactions with the surrounding environment. This work explores the potential of topological quantum computation (TQC) as a robust solution to mitigate decoherence. TQC leverages exotic states of matter, specifically surface states of topological insulators and quantum spin Hall systems, to create protected quantum bits (qubits). These states exhibit inherent topological protection, meaning their quantum properties are robust against local perturbations, drastically reducing the detrimental effects of decoherence. We detail the core principles of TQC, focusing on how the topological nature of these materials safeguards quantum information. We will demonstrate how this approach minimizes the influence of environmental noise, leading to improved qubit coherence times and, consequently, enhanced fidelity in quantum computations. This research contributes to the ongoing exploration of TQC as a viable pathway towards scalable and fault-tolerant quantum computing.
Quantum computation is a proposed model of computation that applies quantum\nmechanics to perform information processing and store information in quantum\nstates. Quantum mechanics applies for many different phenomena, with\nmany possible systems in which it is possible to model and manipulate the\nfundamental quantum information bit - the qubit - and thus there are hypothetically\nmany ways to construct a quantum computer. One proposed way of\nquantum computation is to use non-abelian anyons to model qubits. These are\nexotic quasi-particles whose wave functions evolve non-trivially when permuting\ntheir positions. This allows for computation with qubits simply by permuting\nanyons, a process called braiding since their trajectories in spacetime resemble\nbraids. The quantum states associated with the anyons evolve only when the\npositions of anyons are permuted and do not depend on the paths the anyons\ntake. For this reason this model of quantum computation is called topological\nquantum computation (TQC). One of the main advantages of TQC is that computations\nare inherently fault tolerant: there is no noise due to anyons taking\nstrange paths since the quantum evolution is path independent. The goal of\nthis text is to investigate the mathematical framework for this proposed model\nof quantum computation. The main results are the possible gates that can be\napplied to two one-qubit topological computers. Given the key properties of\nthe anyons used, Theorem 5.2 states the possible one-qubit gates in an Ising\ncomputer, and Theorem 7.1 states the possible one-qubit gates in a Fibonacci\ncomputer.
This paper proposes a novel architecture for quantum computing based on topological crystalline transistors protected by topological principles. The core concept leverages non-Abelian anyons to implement a topological quantum error correction code, offering a pathway to robust quantum computation resistant to local disturbances. We detail the theoretical framework, focusing on the design principles and mathematical formalism underlying this approach. The architecture utilizes specially engineered topological crystals to confine and manipulate anyons, enabling reliable quantum operations. We present a rigorous analysis of the error correction mechanisms, demonstrating the potential for significantly improved fault tolerance compared to conventional qubit designs. Key aspects include the encoding scheme using braiding operations of anyons, the topological redundancy for error detection and correction, and the resulting improved qubit fidelity. The proposed design represents a significant step towards practical, scalable quantum computers capable of enduring the inherent challenges of quantum decoherence. The presented model highlights the crucial role of topological protection in realizing a stable and reliable quantum computing platform. Our focus is on the theoretical development and the underlying mathematical structure of this approach, laying the groundwork for future experimental investigations.