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:2210.12145

Experimental realization of a topologically protected Hadamard gate via braiding Fibonacci anyons

Yu-ang Fan, Li, Yingcheng, Yuting Hu, Yishan Li, Xinyue Long, Hongfeng Liu, Xiaodong Yang, Xinfang Nie, Jun Li, Tao Xin, Dawei Lu, Yidun Wan

Published Oct 21, 2022• 2 citations
arXivHTMLPDF

Abstract

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 rather 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 realize 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 proposal is platform-independent. As a demonstration, we implement a topological Hadamard gate on a logical qubit through a sequence of $15$ braiding operations of three Fibonacci anyons with merely $2$ nuclear spin qubits. The gate fidelity reaches 97.18% 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. Our work is a proof of principle of TQC and paves the way towards fault-tolerant quantum computation.

DOI
10.48550/arxiv.2210.12145

Related papers

Experimental quantum simulation of a topologically protected Hadamard gate via braiding Fibonacci anyons

Yu-ang Fan, Yingcheng Li, Yuting Hu +9 more

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.

The Innovation•Jul 12, 2023•7 citations

Quantum Topological Logic Devices: A Novel Approach to Fault-Tolerant Quantum Computing

Jincheng Zhang

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.

•Sep 6, 2026•0 citations

Universal Gates from Braiding and Fusing Anyons on Quantum Hardware

Chiu Fan Bowen Lo, Anasuya Lyons, Dan Gresh +8 more

Topological quantum computation encodes quantum information in the internal fusion space of non-Abelian anyonic quasiparticles, whose braiding implements logical gates. This goes beyond Abelian topological order (TO) such as the toric code, as its anyons lack internal structure. However, the simplest non-Abelian generalizations of the toric code do not support universality via braiding alone. Here we demonstrate that such minimally non-Abelian TOs can be made universal by treating anyon fusion as a computational primitive. We prepare a 54-qubit TO wavefunction associated with the smallest non-Abelian group, $S_3$, on Quantinuum's H2 quantum processor. This phase of matter exhibits cyclic anyon fusion rules, known to underpin universality, which we evidence by trapping a single non-Abelian anyon on the torus. We encode logical qutrits in the nonlocal fusion space of non-Abelian fluxes and, by combining an entangling braiding operation with anyon charge measurements, realize a universal topological gate set and read-out, which we further demonstrate by topologically preparing a magic state. This work establishes $S_3$ TO as simple enough to be prepared efficiently, yet rich enough to enable universal topological quantum computation.

quant-pharXiv:2601.20956•Nature•Jan 30, 2026•0 citations

Introduction to topological quantum computation with non-Abelian anyons

Bernard Field, Tapio Simula

Abstract Topological quantum computers promise a fault tolerant means to perform quantum computation. Topological quantum computers use particles with exotic exchange statistics called non-Abelian anyons, and the simplest anyon model which allows for universal quantum computation by particle exchange or braiding alone is the Fibonacci anyon model. One classically hard problem that can be solved efficiently using quantum computation is finding the value of the Jones polynomial of knots at roots of unity. We aim to provide a pedagogical, self-contained, review of topological quantum computation with Fibonacci anyons, from the braiding statistics and matrices to the layout of such a computer and the compiling of braids to perform specific operations. Then we use a simulation of a topological quantum computer to explicitly demonstrate a quantum computation using Fibonacci anyons, evaluating the Jones polynomial of a selection of simple knots. In addition to simulating a modular circuit-style quantum algorithm, we also show how the magnitude of the Jones polynomial at specific points could be obtained exactly using Fibonacci or Ising anyons. Such an exact algorithm seems ideally suited for a proof of concept demonstration of a topological quantum computer.

arXiv:1802.06176•Quantum Science and Technology•Jun 6, 2018•135 citations

Non-Abelian braiding of Fibonacci anyons with a superconducting processor

Shibo Xu, Zheng-Zhi Sun, Ke Wang +29 more

Abstract Quantum many-body systems with a non-Abelian topological order can host anyonic quasiparticles. It has been proposed that anyons could be used to encode and manipulate information in a topologically protected manner that is immune to local noise, with quantum gates performed by braiding and fusing anyons. Unfortunately, realizing non-Abelian topologically ordered states is challenging, and it was not until recently that the signatures of non-Abelian statistics were observed through digital quantum simulation approaches. However, not all forms of topological order can be used to realize universal quantum computation. Here we use a superconducting quantum processor to simulate non-Abelian topologically ordered states of the Fibonacci string-net model and demonstrate braidings of Fibonacci anyons featuring universal computational power. We demonstrate the non-trivial topological nature of the quantum states by measuring the topological entanglement entropy. In addition, we create two pairs of Fibonacci anyons and demonstrate their fusion rule and non-Abelian braiding statistics by applying unitary gates on the underlying physical qubits. Our results establish a digital approach to explore non-Abelian topological states and their associated braiding statistics with current noisy intermediate-scale quantum processors.

arXiv:2404.00091•Nature Physics•Jul 1, 2024•55 citations

Compiling single-qubit braiding gate for Fibonacci anyons topological quantum computation

Mohamed Taha Rouabah, Nacer Eddine Belaloui, Abdellah Tounsi

Abstract Topological quantum computation is an implementation of a quantum computer in a way that radically reduces decoherence. Topological qubits are encoded in the topological evolution of two-dimensional quasi-particles called anyons and universal set of quantum gates can be constructed by braiding these anyons yielding to a topologically protected circuit model. In the present study we remind the basics of this emerging quantum computation scheme and illustrate how a topological qubit built with three Fibonacci anyons might be adopted to achieve leakage free braiding gate by exchanging the anyons composing it. A single-qubit braiding gate that approximates the Hadamard quantum gate to a certain accuracy is numerically implemented using a brute force search method. The algorithms utilized for that purpose are explained and the numerical programs are publicly shared for reproduction and further use.

arXiv:2008.03542•Journal of Physics Conference Series•Jan 1, 2021•9 citations
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 rather 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 realize 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 proposal is platform-independent. As a demonstration, we implement a topological Hadamard gate on a logical qubit through a sequence of 151515 braiding operations of three Fibonacci anyons with merely 222 nuclear spin qubits. The gate fidelity reaches 97.18% 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. Our work is a proof of principle of TQC and paves the way towards fault-tolerant quantum computation.
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.
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.
Topological quantum computation encodes quantum information in the internal fusion space of non-Abelian anyonic quasiparticles, whose braiding implements logical gates. This goes beyond Abelian topological order (TO) such as the toric code, as its anyons lack internal structure. However, the simplest non-Abelian generalizations of the toric code do not support universality via braiding alone. Here we demonstrate that such minimally non-Abelian TOs can be made universal by treating anyon fusion as a computational primitive. We prepare a 54-qubit TO wavefunction associated with the smallest non-Abelian group, S3S_3S3​, on Quantinuum's H2 quantum processor. This phase of matter exhibits cyclic anyon fusion rules, known to underpin universality, which we evidence by trapping a single non-Abelian anyon on the torus. We encode logical qutrits in the nonlocal fusion space of non-Abelian fluxes and, by combining an entangling braiding operation with anyon charge measurements, realize a universal topological gate set and read-out, which we further demonstrate by topologically preparing a magic state. This work establishes S3S_3S3​ TO as simple enough to be prepared efficiently, yet rich enough to enable universal topological quantum computation.
Abstract Topological quantum computers promise a fault tolerant means to perform quantum computation. Topological quantum computers use particles with exotic exchange statistics called non-Abelian anyons, and the simplest anyon model which allows for universal quantum computation by particle exchange or braiding alone is the Fibonacci anyon model. One classically hard problem that can be solved efficiently using quantum computation is finding the value of the Jones polynomial of knots at roots of unity. We aim to provide a pedagogical, self-contained, review of topological quantum computation with Fibonacci anyons, from the braiding statistics and matrices to the layout of such a computer and the compiling of braids to perform specific operations. Then we use a simulation of a topological quantum computer to explicitly demonstrate a quantum computation using Fibonacci anyons, evaluating the Jones polynomial of a selection of simple knots. In addition to simulating a modular circuit-style quantum algorithm, we also show how the magnitude of the Jones polynomial at specific points could be obtained exactly using Fibonacci or Ising anyons. Such an exact algorithm seems ideally suited for a proof of concept demonstration of a topological quantum computer.
Abstract Quantum many-body systems with a non-Abelian topological order can host anyonic quasiparticles. It has been proposed that anyons could be used to encode and manipulate information in a topologically protected manner that is immune to local noise, with quantum gates performed by braiding and fusing anyons. Unfortunately, realizing non-Abelian topologically ordered states is challenging, and it was not until recently that the signatures of non-Abelian statistics were observed through digital quantum simulation approaches. However, not all forms of topological order can be used to realize universal quantum computation. Here we use a superconducting quantum processor to simulate non-Abelian topologically ordered states of the Fibonacci string-net model and demonstrate braidings of Fibonacci anyons featuring universal computational power. We demonstrate the non-trivial topological nature of the quantum states by measuring the topological entanglement entropy. In addition, we create two pairs of Fibonacci anyons and demonstrate their fusion rule and non-Abelian braiding statistics by applying unitary gates on the underlying physical qubits. Our results establish a digital approach to explore non-Abelian topological states and their associated braiding statistics with current noisy intermediate-scale quantum processors.
Abstract Topological quantum computation is an implementation of a quantum computer in a way that radically reduces decoherence. Topological qubits are encoded in the topological evolution of two-dimensional quasi-particles called anyons and universal set of quantum gates can be constructed by braiding these anyons yielding to a topologically protected circuit model. In the present study we remind the basics of this emerging quantum computation scheme and illustrate how a topological qubit built with three Fibonacci anyons might be adopted to achieve leakage free braiding gate by exchanging the anyons composing it. A single-qubit braiding gate that approximates the Hadamard quantum gate to a certain accuracy is numerically implemented using a brute force search method. The algorithms utilized for that purpose are explained and the numerical programs are publicly shared for reproduction and further use.