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

Kitaev の toric code について

Jun Ichi Fujii

Published Feb 29, 2020• 0 citations
Publisher

Abstract

Kitaev's toric code is not only a basic model for modular tensor categories but also a basic quantum error-correcting code in the stabilizer ones. Though it is a well-known and attractive quantum code, it is seldom described from the educational point of view. So we try to explain them in detail plainly and propose some new method for error corrections.

DOI
10.32287/td00031565

Related papers

The Toric Code at Finite Temperature

C. Daniel Freeman

Alexei Kitaev's toric code is a rich model, that has birthed and stimulated the development of topological quantum computing, error correction, and field theory. It was also the first example of a quantum error correcting code that could resiliently store quantum information in certain types of noisy environments without the need for active error correction. Unfortunately, the toric code loses much of its power as a noise-resilient quantum memory at any finite temperature. Many of the problems with the toric code at finite temperature are likewise shared among its cousin stabilizer codes. These problems can be traced to the proliferation of stringlike ``defects'' in these codes at finite temperature. The aim of this thesis is then twofold.First, I characterize both numerically and theoretically the failure modes of the toric code at finite temperature with fairly modest bath assumptions. I achieve this by numerically sampling the nonequilibrium dynamics of the toric code using a continuous time monte carlo algorithm. From this analysis, I was able to derive an exact expression for the low and high temperature dynamics of the toric code, as well as a regime over which the toric code is ``most'' stable to noise.Secondly, by leveraging the results of this analysis, I construct algorithms that aim to suppress these noise channels. These algorithms are broadly separated into measurement-free and few-measurement protocols. The measurement-free algorithms are reminiscent of dynamical-decoupling pulse sequences, applied in parallel or in serial to a target stabilizer code, and are entirely unitary. I find that measurement-free algorithms can provide a constant factor increase to the lifetime of a large class of stabilizer codes at finite temperature. The few-measurement protocols are more complex, but I provide evidence that they can provide a threshold for the toric code with asymptotically fewer measurements than was previously known to be achievable.

•Jan 1, 2018•0 citations

Topological quantum error correction in the Kitaev honeycomb model

Yi-Chan Lee, Courtney G Brell, Steven T. Flammia

Abstract The Kitaev honeycomb model is an approximate topological quantum error correcting code in the same phase as the toric code, but requiring only a 2-body Hamiltonian. As a frustrated spin model, it is well outside the commuting models of topological quantum codes that are typically studied, but its exact solubility makes it more amenable to analysis of effects arising in this noncommutative setting than a generic topologically ordered Hamiltonian. Here we study quantum error correction in the honeycomb model using both analytic and numerical techniques. We first prove explicit exponential bounds on the approximate degeneracy, local indistinguishability, and correctability of the code space. These bounds are tighter than can be achieved using known general properties of topological phases. Our proofs are specialized to the honeycomb model, but some of the methods may nonetheless be of broader interest. Following this, we numerically study noise caused by thermalization processes in the perturbative regime close to the toric code renormalization group fixed point. The appearance of non-topological excitations in this setting has no significant effect on the error correction properties of the honeycomb model in the regimes we study. Although the behavior of this model is found to be qualitatively similar to that of the standard toric code in most regimes, we find numerical evidence of an interesting effect in the low-temperature, finite-size regime where a preferred lattice direction emerges and anyon diffusion is geometrically constrained. We expect this effect to yield an improvement in the scaling of the lifetime with system size as compared to the standard toric code.

arXiv:1705.01563•Journal of Statistical Mechanics Theory and Experiment•Aug 1, 2017•18 citations

Quantum Lego: Building Quantum Error Correction Codes from Tensor Networks

ChunJun Cao, Brad Lackey

We introduce a flexible and graphically intuitive framework that constructs complex quantum error correction codes from simple codes or states, generalizing code concatenation.More specifically, we represent the complex code constructions as tensor networks built from the tensors of simple codes or states in a modular fashion.Using a set of local moves known as operator pushing, one can derive properties of the more complex codes, such as transversal non-Clifford gates, by tracing the flow of operators in the network.The framework endows a network geometry to any code it builds and is valid for constructing stabilizer codes as well as nonstabilizer codes over qubits and qudits.For a contractible tensor network, the sequence of contractions also constructs a decoding or encoding circuit.To highlight the framework's range of capabilities and to provide a tutorial, we lay out some examples where we glue together simple stabilizer codes to construct nontrivial codes.These examples include the toric code and its variants, a holographic code with transversal non-Clifford operators, a three-dimensional stabilizer code, and other stabilizer codes with interesting properties.Surprisingly, we find that the surface code is equivalent to the two-dimensional Bacon-Shor code after "dualizing" its tensor-network encoding map.

arXiv:2109.08158•PRX Quantum•May 11, 2022•46 citations

Parafermion stabilizer codes

Utkan Güngördü, Rabindra Nepal, Alexey A. Kovalev

We define and study parafermion stabilizer codes, which can be viewed as generalizations of Kitaev's one-dimensional (1D) model of unpaired Majorana fermions. Parafermion stabilizer codes can protect against low-weight errors acting on a small subset of parafermion modes in analogy to qudit stabilizer codes. Examples of several smallest parafermion stabilizer codes are given. A locality-preserving embedding of qudit operators into parafermion operators is established that allows one to map known qudit stabilizer codes to parafermion codes. We also present a local 2D parafermion construction that combines topological protection of Kitaev's toric code with additional protection relying on parity conservation.

arXiv:1409.4724•Physical Review A•Oct 21, 2014•5 citations

Kitaev の toric code についての補足

Jun Ichi Fujii

We show that the ground state Ω which is explicitly represented by Xv and |0〉 in toric code is not unit vector. In addition, from the viewpoint of education, we observe that the toric code is constructed as a typical Drinfeld quantum double of finite groups as Kitaev stated in his original paper.

•Feb 28, 2022•0 citations

Kitaev Quantum Double Model

Steven H. Simon

Abstract One generalization of the toric code is the so-called Kitaev Quantum Double model which realizes the Drinfeld double of a group. In this model edges of a lattice are directed and labeled with elements of a group G which then give us a planar diagram algebra. We consider mainly the “untwisted” case where the F-matrices (or equivalently 3-cocyles) are trivial. This generalizes the toric code where the group is Z2. Again we have vertex and plaquette operators, and a code space which satisfies both. As with the toric code, the ground state is topological although here (depending on the group G) the quasiparticles may be nonabelian. We turn to a continuum model for a more detailed analysis of the ground state space and the quasiparticles using the tube algebra, which, using some amount of group theory, is easily tractable. We discuss the so-called quasiparticle “ribbon operators” which generalize the error strings of the toric code. We relate the Kitaev quantum double model to lattice gauge theory and briefly discuss its generalization to higher dimensions.

Oxford University Press eBooks•Sep 29, 2023•0 citations
Kitaev's toric code is not only a basic model for modular tensor categories but also a basic quantum error-correcting code in the stabilizer ones. Though it is a well-known and attractive quantum code, it is seldom described from the educational point of view. So we try to explain them in detail plainly and propose some new method for error corrections.
Alexei Kitaev's toric code is a rich model, that has birthed and stimulated the development of topological quantum computing, error correction, and field theory. It was also the first example of a quantum error correcting code that could resiliently store quantum information in certain types of noisy environments without the need for active error correction. Unfortunately, the toric code loses much of its power as a noise-resilient quantum memory at any finite temperature. Many of the problems with the toric code at finite temperature are likewise shared among its cousin stabilizer codes. These problems can be traced to the proliferation of stringlike ``defects'' in these codes at finite temperature. The aim of this thesis is then twofold.First, I characterize both numerically and theoretically the failure modes of the toric code at finite temperature with fairly modest bath assumptions. I achieve this by numerically sampling the nonequilibrium dynamics of the toric code using a continuous time monte carlo algorithm. From this analysis, I was able to derive an exact expression for the low and high temperature dynamics of the toric code, as well as a regime over which the toric code is ``most'' stable to noise.Secondly, by leveraging the results of this analysis, I construct algorithms that aim to suppress these noise channels. These algorithms are broadly separated into measurement-free and few-measurement protocols. The measurement-free algorithms are reminiscent of dynamical-decoupling pulse sequences, applied in parallel or in serial to a target stabilizer code, and are entirely unitary. I find that measurement-free algorithms can provide a constant factor increase to the lifetime of a large class of stabilizer codes at finite temperature. The few-measurement protocols are more complex, but I provide evidence that they can provide a threshold for the toric code with asymptotically fewer measurements than was previously known to be achievable.
Abstract The Kitaev honeycomb model is an approximate topological quantum error correcting code in the same phase as the toric code, but requiring only a 2-body Hamiltonian. As a frustrated spin model, it is well outside the commuting models of topological quantum codes that are typically studied, but its exact solubility makes it more amenable to analysis of effects arising in this noncommutative setting than a generic topologically ordered Hamiltonian. Here we study quantum error correction in the honeycomb model using both analytic and numerical techniques. We first prove explicit exponential bounds on the approximate degeneracy, local indistinguishability, and correctability of the code space. These bounds are tighter than can be achieved using known general properties of topological phases. Our proofs are specialized to the honeycomb model, but some of the methods may nonetheless be of broader interest. Following this, we numerically study noise caused by thermalization processes in the perturbative regime close to the toric code renormalization group fixed point. The appearance of non-topological excitations in this setting has no significant effect on the error correction properties of the honeycomb model in the regimes we study. Although the behavior of this model is found to be qualitatively similar to that of the standard toric code in most regimes, we find numerical evidence of an interesting effect in the low-temperature, finite-size regime where a preferred lattice direction emerges and anyon diffusion is geometrically constrained. We expect this effect to yield an improvement in the scaling of the lifetime with system size as compared to the standard toric code.
We introduce a flexible and graphically intuitive framework that constructs complex quantum error correction codes from simple codes or states, generalizing code concatenation.More specifically, we represent the complex code constructions as tensor networks built from the tensors of simple codes or states in a modular fashion.Using a set of local moves known as operator pushing, one can derive properties of the more complex codes, such as transversal non-Clifford gates, by tracing the flow of operators in the network.The framework endows a network geometry to any code it builds and is valid for constructing stabilizer codes as well as nonstabilizer codes over qubits and qudits.For a contractible tensor network, the sequence of contractions also constructs a decoding or encoding circuit.To highlight the framework's range of capabilities and to provide a tutorial, we lay out some examples where we glue together simple stabilizer codes to construct nontrivial codes.These examples include the toric code and its variants, a holographic code with transversal non-Clifford operators, a three-dimensional stabilizer code, and other stabilizer codes with interesting properties.Surprisingly, we find that the surface code is equivalent to the two-dimensional Bacon-Shor code after "dualizing" its tensor-network encoding map.
We define and study parafermion stabilizer codes, which can be viewed as generalizations of Kitaev's one-dimensional (1D) model of unpaired Majorana fermions. Parafermion stabilizer codes can protect against low-weight errors acting on a small subset of parafermion modes in analogy to qudit stabilizer codes. Examples of several smallest parafermion stabilizer codes are given. A locality-preserving embedding of qudit operators into parafermion operators is established that allows one to map known qudit stabilizer codes to parafermion codes. We also present a local 2D parafermion construction that combines topological protection of Kitaev's toric code with additional protection relying on parity conservation.
Abstract One generalization of the toric code is the so-called Kitaev Quantum Double model which realizes the Drinfeld double of a group. In this model edges of a lattice are directed and labeled with elements of a group G which then give us a planar diagram algebra. We consider mainly the “untwisted” case where the F-matrices (or equivalently 3-cocyles) are trivial. This generalizes the toric code where the group is Z2. Again we have vertex and plaquette operators, and a code space which satisfies both. As with the toric code, the ground state is topological although here (depending on the group G) the quasiparticles may be nonabelian. We turn to a continuum model for a more detailed analysis of the ground state space and the quasiparticles using the tube algebra, which, using some amount of group theory, is easily tractable. We discuss the so-called quasiparticle “ribbon operators” which generalize the error strings of the toric code. We relate the Kitaev quantum double model to lattice gauge theory and briefly discuss its generalization to higher dimensions.