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:1206.6048 · Physical Review B

Quantum circuits for measuring Levin-Wen operators

N. E. Bonesteel, David Peter Divincenzo

Published Oct 10, 2012• 42 citations
arXivHTMLPDF

Abstract

We construct quantum circuits for measuring the commuting set of vertex and plaquette operators that appear in the Levin-Wen model for doubled Fibonacci anyons. Such measurements can be viewed as syndrome measurements for the quantum error-correcting code defined by the ground states of this model (the Fibonacci code). We quantify the complexity of these circuits with gate counts using different universal gate sets and find these measurements become significantly easier to perform if $n$-qubit Toffoli gates with $n=3,\phantom{\rule{0.28em}{0ex}}4$, and 5 can be carried out directly. In addition to measurement circuits, we construct simplified quantum circuits requiring only a few qubits that can be used to verify that certain self-consistency conditions, including the pentagon equation, are satisfied by the Fibonacci code.

DOI
10.1103/physrevb.86.165113

Related papers

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•1 citation

A universal circuit set using the S3 quantum double

Liyuan Chen, Yuanjie Ren, Ruihua Fan +1 more

One potential route toward fault-tolerant universal quantum computation is to use non-Abelian topological codes. In this work, we investigate how to achieve this goal with the quantum double model $${\mathcal{D}}({S}_{3})$$ . By embedding each on-site Hilbert space into a qubit-qutrit pair, we explicitly construct circuits for creating, moving, and locally measuring all non-trivial anyons. We also design a specialized anyon interferometer to remotely measure the total charge of well-separated anyons; this avoids fusion, which compromises fault tolerance. These protocols enable the implementation of a universal gate set proposed by Cui et al. and active correction of the circuit-level noise during computation. To further suppress errors, we encode each physical degree of freedom of $${\mathcal{D}}({S}_{3})$$ into a novel error-correcting code, enabling fault-tolerant realization, at the logical level, of all gates in the anyon manipulation circuits. Our proposal offers a promising path to realize robust universal topological quantum computation in the NISQ era.

arXiv:2411.09697•npj Quantum Information•Jul 3, 2025•11 citations

Quantum Error Correction Thresholds for the Universal Fibonacci Turaev-Viro Code

Alexis Schotte, Guanyu Zhu, Lander Burgelman +1 more

We consider a two-dimensional quantum memory of qubits on a torus which encode the extended Fibonacci string-net code and devise strategies for error correction when those qubits are subjected to depolarizing noise.Building on the concept of tube algebras, we construct a set of measurements and of quantum gates which map arbitrary qubit errors to the string-net subspace and allow for the characterization of the resulting error syndrome in terms of doubled Fibonacci anyons.Tensor network techniques then allow us to quantitatively study the action of Pauli noise on the string-net subspace.We perform Monte Carlo simulations of error correction in this Fibonacci code and compare the performance of several decoders.For the case of a fixed-rate sampling depolarizing noise model, we find an error correction threshold of 4.7% using a clustering decoder.

arXiv:2012.04610•Physical Review X•Apr 15, 2022•41 citations

Single-step parity check gate set for quantum error correction

Gözde Üstün, Andrea Morello, Simon J. Devitt

Abstract A key requirement for an effective quantum error correction (QEC) scheme is that the physical qubits have error rates below a certain threshold. The value of this threshold depends on the details of the specific QEC scheme, and its hardware-level implementation. This is especially important with parity-check circuits, which are the fundamental building blocks of QEC codes. The standard way of constructing the parity check circuit is using a universal set of gates, namely sequential CNOT gates, single-qubit rotations and measurements. We exploit the insight that a QEC code does not require universal logic gates, but can be simplified to perform the sole task of error detection and correction. By building gates that are fundamental to QEC, we can boost the threshold and ease the experimental demands on the physical hardware. We present a rigorous formalism for constructing and verifying the error behavior of these gates, linking the physical measurement of a process matrix to the abstract error models commonly used in QEC analysis. This allows experimentalists to directly map the gates used in their systems to thresholds derived for a broad-class of QEC codes. We give an example of these new constructions using the model system of two nuclear spins, coupled to an electron spin, showing the potential benefits of redesigning fundamental gate sets using QEC primitives, rather than traditional gate sets reliant on simple single and two-qubit gates.

arXiv:2306.08849•Quantum Science and Technology•May 3, 2024•14 citations

New methods for Quantum Compiling

Vadym Kliuchnikov

The efficiency of compiling high-level quantum algorithms into instruction sets native to quantum computers defines the moment in the future when we will be able to solve interesting and important problems on quantum computers. In my work I focus on the new methods for compiling single qubit operations that appear in many quantum algorithms into single qubit operations natively supported by several popular architectures. In addition, I study several questions related to synthesis and optimization of multiqubit operations. \n \n \nWhen studying the single qubit case, I consider two native instruction sets. The first one is Clifford+T; it is supported by conventional quantum computers implementing fault tolerance protocols based on concatenated and surface codes, and by topological quantum computers based on Ising anyons. The second instruction set is the one supported by topological quantum computers based on Fibonacci anyons. I show that in both cases one can use the number theoretic structure of the problem and methods of computational algebraic number theory to achieve improvements over the previous state of the art by factors ranging from 10 to 1000 for instances of the problem interesting in practice. This order of improvement might make certain interesting quantum computations possible several years earlier. \n \n \nThe work related to multiqubit operations is on exact synthesis and optimization of Clifford+T and Clifford circuits. I show an exact synthesis algorithm for unitaries generated by Clifford+T circuits requiring exponentially less number of gates than previous state of the art. For Clifford circuits two directions are studied: the algorithm for finding optimal circuits acting on a small number of qubits and heuristics for larger circuits optimization. The techniques developed allows one to reduce the size of encoding and decoding circuits for quantum error correcting codes by 40-50\\% and also finds their applications in randomized benchmarking protocols.

•Apr 30, 2014•3 citations

Doubled Color Codes

Sergey B. Bravyi, Andrew W. Cross

We show how to perform a fault-tolerant universal quantum computation in 2D architectures using only transversal unitary operators and local syndrome measurements. Our approach is based on a doubled version of the 2D color code. It enables a transversal implementation of all logical gates in the Clifford+T basis using the gauge fixing method proposed recently by Paetznick and Reichardt. The gauge fixing requires six-qubit parity measurements for Pauli operators supported on faces of the honeycomb lattice with two qubits per site. Doubled color codes are promising candidates for the experimental demonstration of logical gates since they do not require state distillation. Secondly, we propose a Maximum Likelihood algorithm for the error correction and gauge fixing tasks that enables a numerical simulation of logical circuits in the Clifford+T basis. The algorithm can be used in the online regime such that a new error syndrome is revealed at each time step. We estimate the average number of logical gates that can be implemented reliably for the smallest doubled color code and a toy noise model that includes depolarizing memory errors and syndrome measurement errors.

arXiv:1509.03239•Bulletin of the American Physical Society•Sep 10, 2015•79 citations
We construct quantum circuits for measuring the commuting set of vertex and plaquette operators that appear in the Levin-Wen model for doubled Fibonacci anyons. Such measurements can be viewed as syndrome measurements for the quantum error-correcting code defined by the ground states of this model (the Fibonacci code). We quantify the complexity of these circuits with gate counts using different universal gate sets and find these measurements become significantly easier to perform if nnn-qubit Toffoli gates with n=3,4n=3,\phantom{\rule{0.28em}{0ex}}4n=3,4, and 5 can be carried out directly. In addition to measurement circuits, we construct simplified quantum circuits requiring only a few qubits that can be used to verify that certain self-consistency conditions, including the pentagon equation, are satisfied by the Fibonacci code.
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.
One potential route toward fault-tolerant universal quantum computation is to use non-Abelian topological codes. In this work, we investigate how to achieve this goal with the quantum double model D(S3){\mathcal{D}}({S}_{3})D(S3​) . By embedding each on-site Hilbert space into a qubit-qutrit pair, we explicitly construct circuits for creating, moving, and locally measuring all non-trivial anyons. We also design a specialized anyon interferometer to remotely measure the total charge of well-separated anyons; this avoids fusion, which compromises fault tolerance. These protocols enable the implementation of a universal gate set proposed by Cui et al. and active correction of the circuit-level noise during computation. To further suppress errors, we encode each physical degree of freedom of D(S3){\mathcal{D}}({S}_{3})D(S3​) into a novel error-correcting code, enabling fault-tolerant realization, at the logical level, of all gates in the anyon manipulation circuits. Our proposal offers a promising path to realize robust universal topological quantum computation in the NISQ era.
We consider a two-dimensional quantum memory of qubits on a torus which encode the extended Fibonacci string-net code and devise strategies for error correction when those qubits are subjected to depolarizing noise.Building on the concept of tube algebras, we construct a set of measurements and of quantum gates which map arbitrary qubit errors to the string-net subspace and allow for the characterization of the resulting error syndrome in terms of doubled Fibonacci anyons.Tensor network techniques then allow us to quantitatively study the action of Pauli noise on the string-net subspace.We perform Monte Carlo simulations of error correction in this Fibonacci code and compare the performance of several decoders.For the case of a fixed-rate sampling depolarizing noise model, we find an error correction threshold of 4.7% using a clustering decoder.
Abstract A key requirement for an effective quantum error correction (QEC) scheme is that the physical qubits have error rates below a certain threshold. The value of this threshold depends on the details of the specific QEC scheme, and its hardware-level implementation. This is especially important with parity-check circuits, which are the fundamental building blocks of QEC codes. The standard way of constructing the parity check circuit is using a universal set of gates, namely sequential CNOT gates, single-qubit rotations and measurements. We exploit the insight that a QEC code does not require universal logic gates, but can be simplified to perform the sole task of error detection and correction. By building gates that are fundamental to QEC, we can boost the threshold and ease the experimental demands on the physical hardware. We present a rigorous formalism for constructing and verifying the error behavior of these gates, linking the physical measurement of a process matrix to the abstract error models commonly used in QEC analysis. This allows experimentalists to directly map the gates used in their systems to thresholds derived for a broad-class of QEC codes. We give an example of these new constructions using the model system of two nuclear spins, coupled to an electron spin, showing the potential benefits of redesigning fundamental gate sets using QEC primitives, rather than traditional gate sets reliant on simple single and two-qubit gates.
The efficiency of compiling high-level quantum algorithms into instruction sets native to quantum computers defines the moment in the future when we will be able to solve interesting and important problems on quantum computers. In my work I focus on the new methods for compiling single qubit operations that appear in many quantum algorithms into single qubit operations natively supported by several popular architectures. In addition, I study several questions related to synthesis and optimization of multiqubit operations. \n \n \nWhen studying the single qubit case, I consider two native instruction sets. The first one is Clifford+T; it is supported by conventional quantum computers implementing fault tolerance protocols based on concatenated and surface codes, and by topological quantum computers based on Ising anyons. The second instruction set is the one supported by topological quantum computers based on Fibonacci anyons. I show that in both cases one can use the number theoretic structure of the problem and methods of computational algebraic number theory to achieve improvements over the previous state of the art by factors ranging from 10 to 1000 for instances of the problem interesting in practice. This order of improvement might make certain interesting quantum computations possible several years earlier. \n \n \nThe work related to multiqubit operations is on exact synthesis and optimization of Clifford+T and Clifford circuits. I show an exact synthesis algorithm for unitaries generated by Clifford+T circuits requiring exponentially less number of gates than previous state of the art. For Clifford circuits two directions are studied: the algorithm for finding optimal circuits acting on a small number of qubits and heuristics for larger circuits optimization. The techniques developed allows one to reduce the size of encoding and decoding circuits for quantum error correcting codes by 40-50\\% and also finds their applications in randomized benchmarking protocols.
We show how to perform a fault-tolerant universal quantum computation in 2D architectures using only transversal unitary operators and local syndrome measurements. Our approach is based on a doubled version of the 2D color code. It enables a transversal implementation of all logical gates in the Clifford+T basis using the gauge fixing method proposed recently by Paetznick and Reichardt. The gauge fixing requires six-qubit parity measurements for Pauli operators supported on faces of the honeycomb lattice with two qubits per site. Doubled color codes are promising candidates for the experimental demonstration of logical gates since they do not require state distillation. Secondly, we propose a Maximum Likelihood algorithm for the error correction and gauge fixing tasks that enables a numerical simulation of logical circuits in the Clifford+T basis. The algorithm can be used in the online regime such that a new error syndrome is revealed at each time step. We estimate the average number of logical gates that can be implemented reliably for the smallest doubled color code and a toy noise model that includes depolarizing memory errors and syndrome measurement errors.