The key obstacle to the realization of a scalable quantum computer is overcoming environmental and control errors. Topological quantum computation attracts great attention because it emerges as one of the most promising approaches to solving these problems. Various theoretical schemes for building topological quantum computation have been proposed. However, experimental implementation has always been a great challenge because it has proved to be extremely difficult to create and manipulate topological qubits in real systems. Therefore, topological quantum computation has not been realized in experiments yet. Herein, the first experimental simulation of topological quantum computation with classical circuits is reported. Based on the proposed new scheme with circuits, not only Majorana‐like edge states are simulated experimentally, but also T junctions are constructed for simulating the braiding process. Furthermore, the feasibility of simulated topological quantum computing through a set of one‐ and two‐qubit unitary operations is demonstrated. Finally, the simulation of Grover's search algorithm demonstrates that simulated topological quantum computation is ideally suited for such tasks. The developed circuit‐based topological quantum‐computing simulator can provide important references for developing future topological quantum circuits.
The key obstacle to the realization of a scalable quantum computer is overcoming environmental and control errors. Topological quantum computation attracts great attention because it emerges as one of the most promising approaches to solving these problems. Various theoretical schemes for building topological quantum computation have been proposed. However, experimental implementation has always been a great challenge because it has proved to be extremely difficult to create and manipulate topological qubits in real systems. Therefore, topological quantum computation has not been realized in experiments yet. Herein, the first experimental simulation of topological quantum computation with classical circuits is reported. Based on the proposed new scheme with circuits, not only Majorana‐like edge states are simulated experimentally, but also T junctions are constructed for simulating the braiding process. Furthermore, the feasibility of simulated topological quantum computing through a set of one‐ and two‐qubit unitary operations is demonstrated. Finally, the simulation of Grover's search algorithm demonstrates that simulated topological quantum computation is ideally suited for such tasks. The developed circuit‐based topological quantum‐computing simulator can provide important references for developing future topological quantum circuits.
The key obstacle to the realization of a scalable quantum computer is overcoming environmental and control errors. Topological quantum computation has attracted great attention because it has emerged as one of the most promising approaches to solving these problems. Various theoretical schemes for building topological quantum computation have been proposed. However, experimental implementation has always been a great challenge because it has proved to be extremely difficult to create and manipulate topological qubits in real systems. Therefore, topological quantum computation has not been realized in experiments yet. Here, we report the first experimental realization of topological quantum computation with electric circuits. Based on our proposed new scheme with circuits, Majorana-like edge states are not only observed experimentally, but also T junctions are constructed for the braiding process. Furthermore, we demonstrate the feasibility of topological quantum computing through a set of one- and two-qubit unitary operations. Finally, our implementation of Grover's search algorithm demonstrates that topological quantum computation is ideally suited for such tasks.
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.
Majorana fermions subject to the non-Abelian braid group are believed to be the basic ingredients of future topological quantum computations. In this work, we propose to simulate Majorana fermions of the Kitaev model in electric circuits based on the observation that the circuit Laplacian can be made identical to the Hamiltonian. A set of AC voltages along the chain plays the role of the wave function. We generate an arbitral number of topological segments in a Kitaev chain. A pair of topological edge states emerge at the edges of a topological segment. Its wave function is observable by the position and the phase of a peak in impedance measurement. It is possible to braid any pair of neighboring edge states with the aid of T-junction geometry. By calculating the Berry phase acquired by their eigenfunctions, the braiding is shown to generate one-qubit and two-qubit unitary operations. We explicitly construct Clifford quantum gates based on them. We also present an operator formalism by regarding a topological edge state as a topological soliton intertwining the trivial segment and the topological segment. Our analysis shows that the electric-circuit approach can simulate the Majorana-fermion approach to topological quantum computations.
This paper explores the potential of simulating topological qubits within computer networks as a viable strategy for quantum error correction (QEC). The core argument presented is that simulating topological qubits provides a scalable pathway to QEC, circumventing the significant challenges associated with the physical fabrication and maintenance of actual topological qubits. The work details the development of a network simulation environment designed to implement the fundamental principles of topological QEC. Specifically, it focuses on designing and testing encoding and decoding schemes for a simulated topological code. The research represents a computationally feasible approach to QEC prior to the realization of practical topological qubits, offering a valuable tool for theoretical exploration and algorithm development within the field of quantum computing. The simulation framework allows for investigating complex error dynamics and optimizing correction protocols in a controlled environment, ultimately contributing to a deeper understanding of topological QEC and its potential for future implementation.
Quantum computing promises a new approach to solving difficult computational problems, and the quest of building a quantum computer has started. While the first attempts on construction were succesful, scalability has never been achieved, due to the inherent fragile nature of the quantum bits (qubits). From the multitude of approaches to achieve scalability topological quantum computing (TQC) is the most promising one, by being based on an flexible approach to error-correction and making use of the straightforward measurement-based computing technique. TQC circuits are defined within a large, uniform, 3-dimensional lattice of physical qubits produced by the hardware and the physical volume of this lattice directly relates to the resources required for computation. Circuit optimization may result in non-intuitive mismatches between circuit specification and implementation. In this paper we introduce the first method for cross-level validation of TQC circuits. The specification of the circuit is expressed based on the stabilizer formalism, and the stabilizer table is checked by mapping the topology on the physical qubit level, followed by quantum circuit simulation. Simulation results show that cross-level validation of error-corrected circuits is feasible.
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