Quantum computers are predicted to utilize quantum states to perform memory and to process tasks far faster than those of conventional classical computers. In this paper we show a new road towards building fault tolerance quantum computer by tuning quantum tunneling effect of the degenerate quantum states in topological order, instead of by braiding anyons. Using a designer Hamiltonian - the Wen-Plaquette model as an example, we study its quantum tunneling effect of the toric codes and show how to control the toric code to realize topological quantum computation (TQC). In particular, we give a proposal to the measurement of TQC. In the end the realization of the Wen-Plaquette model in cold atoms is discussed.
Quantum computers are predicted to utilize quantum states to perform memory and to process tasks far faster than those of conventional classical computers. In this paper we show a new road towards building fault tolerance quantum computer by tuning quantum tunneling effect of the degenerate quantum states in topological order, instead of by braiding anyons. Using a designer Hamiltonian - the Wen-Plaquette model as an example, we study its quantum tunneling effect of the toric codes and show how to control the toric code to realize topological quantum computation (TQC). In particular, we give a proposal to the measurement of TQC. In the end the realization of the Wen-Plaquette model in cold atoms is discussed.
Quantum computers are predicted to utilize quantum states to process tasks far faster than those of conventional classical computers. In this Letter we show an alternative approach towards building topological quantum computers by tuning the quantum tunneling effect of degenerate quantum states in topological order, instead of braiding anyons. Using a designer Hamiltonian-the Wen-Plaquette model as an example, we study its quantum tunneling effect of the toric codes and show how to control the toric codes to realize topological quantum computation. In particular, we give a proposal to the measurement of the toric codes from Aharonov-Bohm interferences of quasiparticles.
In this paper, the degenerate ground states of Z2 topological order on a plane with holes (the so-called planar codes) are used as the protected code subspace to build a topological quantum computer by tuning their quantum tunneling effect. Using a designer Hamiltonian---the Kitaev toric-code model as an example, we study quantum tunneling effects of the planar codes and obtain its effective theory. Finally, we show how to do topological quantum computation including the initialization, the unitary transformation and the measurement.
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.
A paradigm to build a quantum computer, based on topological invariants is highlighted. The identities in the ensemble of knots, links and braids originally discovered in relation to topological quantum field theory are shown: how they define Artin braid group -- the mathematical basis of topological quantum computation (TQC). Vector spaces of TQC correspond to associated strings of particle interactions, and TQC operates its calculations on braided strings of special physical quasiparticles -- anyons -- with non-Abelian statistics. The physical platform of TQC is to use the topological quantum numbers of such small groups of anyons as qubits and to perform operations on these qubits by exchanging the anyons, both within the groups that form the qubits and, for multi-qubit gates, between groups. By braiding two or more anyons, they acquire up a topological phase or Berry phase similar to that found in the Aharonov-Bohm effect. Topological matter such as fractional quantum Hall systems and novel discovered topological insulators open the way to form system of anyons -- Majorana fermions -- with the unique property of encoding and processing quantum information in a naturally fault-tolerant way. In the topological insulators, due to its fundamental attribute of topological surface state occurrence of the bound, Majorana fermions are generated at its heterocontact with superconductors. One of the key operations of TQC -- braiding of non-Abelian anyons: it is illustrated how it can be implemented in one-dimensional topological isolator wire networks.
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.
Topological quantum computation (TQC) is one of the most striking architectures that can realize fault-tolerant quantum computers. In TQC, the logical space and the quantum gates are topologically protected, i.e., robust against local disturbances. The topological protection, however, requires complicated lattice models and hard-to-manipulate dynamics; even the simplest system that can realize universal TQC—the Fibonacci anyon system—lacks a physical realization, let alone braiding the non-Abelian anyons. Here, we propose a disk model that can simulate the Fibonacci anyon system and construct the topologically protected logical spaces with the Fibonacci anyons. Via braiding the Fibonacci anyons, we can implement universal quantum gates on the logical space. Our disk model merely requires two physical qubits to realize three Fibonacci anyons at the boundary. By 15 sequential braiding operations, we construct a topologically protected Hadamard gate, which is to date the least-resource requirement for TQC. To showcase, we implement a topological Hadamard gate with two nuclear spin qubits, which reaches 97.18 % fidelity by randomized benchmarking. We further prove by experiment that the logical space and Hadamard gate are topologically protected: local disturbances due to thermal fluctuations result in a global phase only. As a platform-independent proposal, our work is a proof of principle of TQC and paves the way toward fault-tolerant quantum computation.