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:1608.06932 · Physical Review Letters

Experimental Identification of Non-Abelian Topological Orders on a Quantum Simulator

Keren Li, Yidun Wan, Ling-Yan Hung, Tian Lan, Guilu Long, Dawei Lu, Bei Zeng, Raymond Laflamme

Published Feb 23, 2017• 39 citations
arXivHTMLPDF

Abstract

Topological orders can be used as media for topological quantum computing-a promising quantum computation model due to its invulnerability against local errors. Conversely, a quantum simulator, often regarded as a quantum computing device for special purposes, also offers a way of characterizing topological orders. Here, we show how to identify distinct topological orders via measuring their modular S and T matrices. In particular, we employ a nuclear magnetic resonance quantum simulator to study the properties of three topologically ordered matter phases described by the string-net model with two string types, including the Z_{2} toric code, doubled semion, and doubled Fibonacci. The third one, non-Abelian Fibonacci order is notably expected to be the simplest candidate for universal topological quantum computing. Our experiment serves as the basic module, built on which one can simulate braiding of non-Abelian anyons and ultimately, topological quantum computation via the braiding, and thus provides a new approach of investigating topological orders using quantum computers.

DOI
10.1103/physrevlett.118.080502

Related papers

Identifying Abelian and non-Abelian topological orders in the string-net model using a quantum scattering circuit

Ze Zhang, Xinyue Long, Xiuzhu Zhao +10 more

Realizing universal topological quantum computers requires the manipulation of non-Abelian topological orders in a physical system, which presents great challenges. Conversely, the rapid development in circuit-based quantum computing offers a reliable quantum simulation approach to study these topological orders. The preliminary problem is how to identify distinct topological orders. Here, we develop a framework based on the quantum scattering circuit to directly and efficiently measure the modular transformation matrix, which is widely deemed as the fingerprint of a given topological order. The information of the modular transformation matrix is encoded in the probe qubit, and the readout merely requires single-qubit Pauli measurements. We further implement the scheme in a nuclear magnetic resonance quantum simulator to emulate the string-net model, where an Abelian ${\mathbb{Z}}_{2}$ toric code and a non-Abelian Fibonacci order emerge. In particular, the latter is predicted to be the simplest candidate for universal topological quantum computers. The two topological orders are unambiguously distinguished by the experimentally measured modular transformation matrices. As an experimental demonstration of a non-Abelian topological order with efficient readout, our work may open avenues toward investigating topological orders in circuit-based quantum simulators.

Physical Review A•Mar 29, 2022•8 citations

Minimal Quantum Circuits for Simulating Fibonacci Anyons

Sary Bseiso, Joel C. Pommerening, Richard R. Allen +2 more

The Fibonacci topological order is the prime candidate for the realization of universal topological quantum computation. We devise minimal quantum circuits to demonstrate the non-Abelian nature of the doubled Fibonacci topological order, as realized in the Levin-Wen string net model. Our circuits effectively initialize the ground state, create excitations, twist and braid them, all in the smallest lattices possible. We further design methods to determine the fusion amplitudes and braiding phases of multiple excitations by carrying out a single qubit measurement. We show that the fusion channels of the doubled Fibonacci model can be detected using only three qubits, twisting phases can be measured using five, and braiding can be demonstrated using nine qubits. These designs provide the simplest possible settings for demonstrating the properties of Fibonacci anyons and can be used as realistic blueprints for implementation on many modern quantum architectures.

arXiv:2407.21761•Jul 31, 2024•0 citations

Identifying Topological Order by Measuring the Modular Matrices

Zhihuang Luo, Jun Li, Zhaokai Li +4 more

The modern conception of phases of matter has undergone tremendous developments since the first observation of topologically ordered state in fractional quantum Hall systems in the 1980s. Topological orders are exotic states of matter characterized by patterns of long-range entanglement that lie beyond Landau's symmetry breaking paradigm. In 2+1 dimensions, these phases support signature anyonic excitations with fractional statistics or even non-Abelian braiding effects. One important theoretical question is how we should characterize these phases. In 2+1 dimensions, plenty of evidence suggests that the \emph{modular matrices}, S and T, suffice to characterize the order completely. It is thus of equal importance to find out if these quantities are experimental observables. Here we demonstrate how such measurements can indeed be achieved using only the given Hamiltonian, allowing one to identify the corresponding topological order using a nuclear magnetic resonance simulator. This is a first experimental realization of these fundamental signatures of a topological order; it opens up new future avenues toward identifying more generic topological orders based purely on experimental measurements.

•Aug 24, 2016•0 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

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
Topological orders can be used as media for topological quantum computing-a promising quantum computation model due to its invulnerability against local errors. Conversely, a quantum simulator, often regarded as a quantum computing device for special purposes, also offers a way of characterizing topological orders. Here, we show how to identify distinct topological orders via measuring their modular S and T matrices. In particular, we employ a nuclear magnetic resonance quantum simulator to study the properties of three topologically ordered matter phases described by the string-net model with two string types, including the Z_{2} toric code, doubled semion, and doubled Fibonacci. The third one, non-Abelian Fibonacci order is notably expected to be the simplest candidate for universal topological quantum computing. Our experiment serves as the basic module, built on which one can simulate braiding of non-Abelian anyons and ultimately, topological quantum computation via the braiding, and thus provides a new approach of investigating topological orders using quantum computers.
Realizing universal topological quantum computers requires the manipulation of non-Abelian topological orders in a physical system, which presents great challenges. Conversely, the rapid development in circuit-based quantum computing offers a reliable quantum simulation approach to study these topological orders. The preliminary problem is how to identify distinct topological orders. Here, we develop a framework based on the quantum scattering circuit to directly and efficiently measure the modular transformation matrix, which is widely deemed as the fingerprint of a given topological order. The information of the modular transformation matrix is encoded in the probe qubit, and the readout merely requires single-qubit Pauli measurements. We further implement the scheme in a nuclear magnetic resonance quantum simulator to emulate the string-net model, where an Abelian Z2{\mathbb{Z}}_{2}Z2​ toric code and a non-Abelian Fibonacci order emerge. In particular, the latter is predicted to be the simplest candidate for universal topological quantum computers. The two topological orders are unambiguously distinguished by the experimentally measured modular transformation matrices. As an experimental demonstration of a non-Abelian topological order with efficient readout, our work may open avenues toward investigating topological orders in circuit-based quantum simulators.
The Fibonacci topological order is the prime candidate for the realization of universal topological quantum computation. We devise minimal quantum circuits to demonstrate the non-Abelian nature of the doubled Fibonacci topological order, as realized in the Levin-Wen string net model. Our circuits effectively initialize the ground state, create excitations, twist and braid them, all in the smallest lattices possible. We further design methods to determine the fusion amplitudes and braiding phases of multiple excitations by carrying out a single qubit measurement. We show that the fusion channels of the doubled Fibonacci model can be detected using only three qubits, twisting phases can be measured using five, and braiding can be demonstrated using nine qubits. These designs provide the simplest possible settings for demonstrating the properties of Fibonacci anyons and can be used as realistic blueprints for implementation on many modern quantum architectures.
The modern conception of phases of matter has undergone tremendous developments since the first observation of topologically ordered state in fractional quantum Hall systems in the 1980s. Topological orders are exotic states of matter characterized by patterns of long-range entanglement that lie beyond Landau's symmetry breaking paradigm. In 2+1 dimensions, these phases support signature anyonic excitations with fractional statistics or even non-Abelian braiding effects. One important theoretical question is how we should characterize these phases. In 2+1 dimensions, plenty of evidence suggests that the \emph{modular matrices}, S and T, suffice to characterize the order completely. It is thus of equal importance to find out if these quantities are experimental observables. Here we demonstrate how such measurements can indeed be achieved using only the given Hamiltonian, allowing one to identify the corresponding topological order using a nuclear magnetic resonance simulator. This is a first experimental realization of these fundamental signatures of a topological order; it opens up new future avenues toward identifying more generic topological orders based purely on experimental measurements.
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.
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.