Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2309.04896

Experimental topological quantum computing with electric circuits

Deyuan Zou, Naiqiao Pan, Tian Chen, Houjun Sun, Xiangdong Zhang

Published Sep 9, 2023• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2309.04896

Related papers

Experimental Simulation of Topological Quantum Computing with Classical Circuits

Deyuan Zou, Naiqiao Pan, Tian Chen +2 more

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.

Advanced Intelligent Systems•Sep 8, 2023•16 citations

Non-Abelian braiding of Majorana-like edge states and topological quantum computations in electric circuits

Motohiko Ezawa

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.

arXiv:1907.06911•Physical review. B./Physical review. B•Aug 11, 2020•38 citations

Non-Abelian braiding of Majorana-like edge states and quantum gates in electric circuits

Motohiko Ezawa

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. We generate an arbitral number of segments in a Kitaev chain which are in the topological phase. A pair of Majorana-like edge states emerge at the edges of a topological sector, which is observed by impedance peaks. When the Kitaev chain contains $N$ topological sectors, the degeneracy of the zero-admittance states is $2^{N}$. A set of AC voltages along the chain plays a role of the wave function. An \textit{LC} resonator attached to each Majorana-like edge state registers the phase and the absolute value of the voltage. One qubit consists of the in-phase and opposite-phase states made of two \textit{LC} resonators installed in one topological sector. 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. The present scheme may simulate topological quantum computations based on electric circuits.

•Jul 16, 2019•0 citations

ADVANCEMENTS IN QUANTUM COMPUTING WITH THE DEVELOPMENT OF TOPOLOGICAL QUBITS FOR SCALABLE AND FAULT-TOLERANT SYSTEMS

DR. KONGARA SRINIVASA RAO,DR K SREERAMA MURTHY, CHETLA CHANDRA MOHAN,G. VASUNDHARA DEVI, YADAVALLI SURESH KUMAR,VEERAMACHINENI VENKATA RAGHU, MANASA BANDLAMUDI, UDAYA LAKSHMI SAKALA

Quantum computing can help solve complex problems classical computers cannot solve. Current quantum systems, especially when using conventional qubits sensitive to environmental noise, face key scalability and fault tolerance hurdles. This has been identified as a promising path and is, in principle, fault-tolerant, but it still suffers from control and scalability issues. This work presents a new paradigm of quantum computation based on a hybrid quantum system combining topological qubits for error correction and traditional qubits for computing. The final hybrid system can reduce the bit-flip error probability from 0.05 to 0.02 and the phase-flip error probability from 0.08 to 0.01. The fidelity of quantum states after gate operations reached 0.92, surpassing both that of conventional (0.85) and topological (0.90) qubits. Moreover, this approach achieved a strength of interaction (0.90) and operation time (0.01 ms) higher than conventional qubits. Hybrid architecture significantly improves quantum systems' efficiency, scalability, and fault tolerance. Even with these advancements, controlling topological qubits and measuring the braiding of anyons are still challenging. Soon, research will concentrate on overcoming these technical challenges and paving the way for scaling up the hybrid system to more complex quantum computations.

Journal of Theoretical and Applied Information Technology•Jan 31, 2026•0 citations

Cross-level Validation of Topological Quantum Circuits

Alexandru Paler, Simon J. Devitt, Kae Nemoto +1 more

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.

arXiv:1407.8296•Jul 31, 2014•1 citation

Topological Quantum Computing: Foundations, Research Trends, and Long-Term Impact

Boda T. S. S. Srihari Krishna Gopal, Talabattula Divya Sai Sri Akanksha

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.

Indian Journal of Computer Science•Apr 30, 2026•0 citations
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.
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.
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.
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. We generate an arbitral number of segments in a Kitaev chain which are in the topological phase. A pair of Majorana-like edge states emerge at the edges of a topological sector, which is observed by impedance peaks. When the Kitaev chain contains NNN topological sectors, the degeneracy of the zero-admittance states is 2N2^{N}2N. A set of AC voltages along the chain plays a role of the wave function. An \textit{LC} resonator attached to each Majorana-like edge state registers the phase and the absolute value of the voltage. One qubit consists of the in-phase and opposite-phase states made of two \textit{LC} resonators installed in one topological sector. 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. The present scheme may simulate topological quantum computations based on electric circuits.
Quantum computing can help solve complex problems classical computers cannot solve. Current quantum systems, especially when using conventional qubits sensitive to environmental noise, face key scalability and fault tolerance hurdles. This has been identified as a promising path and is, in principle, fault-tolerant, but it still suffers from control and scalability issues. This work presents a new paradigm of quantum computation based on a hybrid quantum system combining topological qubits for error correction and traditional qubits for computing. The final hybrid system can reduce the bit-flip error probability from 0.05 to 0.02 and the phase-flip error probability from 0.08 to 0.01. The fidelity of quantum states after gate operations reached 0.92, surpassing both that of conventional (0.85) and topological (0.90) qubits. Moreover, this approach achieved a strength of interaction (0.90) and operation time (0.01 ms) higher than conventional qubits. Hybrid architecture significantly improves quantum systems' efficiency, scalability, and fault tolerance. Even with these advancements, controlling topological qubits and measuring the braiding of anyons are still challenging. Soon, research will concentrate on overcoming these technical challenges and paving the way for scaling up the hybrid system to more complex quantum computations.
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.
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.