We study the phase structure of the random-plaquette Z_2 lattice gauge model in three dimensions. In this model, the "gauge coupling" for each plaquette is a quenched random variable that takes the value βwith the probability 1-p and -βwith the probability p. This model is relevant for the recently proposed quantum memory of toric code. The parameter p is the concentration of the plaquettes with "wrong-sign" couplings -β, and interpreted as the error probability per qubit in quantum code. In the gauge system with p=0, i.e., with the uniform gauge couplings β, it is known that there exists a second-order phase transition at a certain critical "temperature", T(\equiv β^{-1}) = T_c =1.31, which separates an ordered(Higgs) phase at T<T_c and a disordered(confinement) phase at T>T_c. As p increases, the critical temperature T_c(p) decreases. In the p-T plane, the curve T_c(p) intersects with the Nishimori line T_{N}(p) at the certain point (p_c, T_{N}(p_c)). The value p_c is just the accuracy threshold for a fault-tolerant quantum memory and associated quantum computations. By the Monte-Carlo simulations, we calculate the specific heat and the expectation values of the Wilson loop to obtain the phase-transition line T_c(p) numerically. The accuracy threshold is estimated as p_c \simeq 0.033.
In this paper we study the symmetry protected Majorana edge states for the Z2 topological order of the Wen-plaquette model and the toric-code model and calculate the dispersion of the Majorana edge states. For the system with translational symmetry, the Majorana edge states are gapless and have the nodal points at k=0 and k=pi. For the edge states of the toric-code model without translational symmetry, the edge modes become gapped.
We study the four-dimensional Z_2 random-plaquette lattice gauge theory as a model of topological quantum memory, the toric code in particular. In this model, the procedure of quantum error correction works properly in the ordered (Higgs) phase, and phase boundary between the ordered (Higgs) and disordered (confinement) phases gives the accuracy threshold of error correction. Using self-duality of the model in conjunction with the replica method, we show that this model has exactly the same mathematical structure as that of the two dimensional random-bond Ising model, which has been studied ve…
Kitaev's toric code is an exactly solvable model with $\mathbb{Z}_2$-topological order, which has potential applications in quantum computation and error correction. However, a direct experimental realization remains an open challenge. Here, we propose a building block for $\mathbb{Z}_2$ lattice gauge theories coupled to dynamical matter and demonstrate how it allows for an implementation of the toric-code ground state and its topological excitations. This is achieved by introducing separate matter excitations on individual plaquettes, whose motion induce the required plaquette terms. The prop…
Quantum computers are predicted to utilize quantum states to perform memory and to process tasks far faster than those of conventional classical computers. In this paper we show a new road towards building fault tolerance quantum computer by tuning quantum tunneling effect of the degenerate quantum states in topological order, instead of by braiding anyons. Using a designer Hamiltonian - the Wen-Plaquette model as an example, we study its quantum tunneling effect of the toric codes and show how to control the toric code to realize topological quantum computation (TQC). In particular, we give a…
In the present paper, we shall study the 4-dimensional Z_2 lattice gauge model with a random gauge coupling; the random-plaquette gauge model(RPGM). The random gauge coupling at each plaquette takes the value J with the probability 1-p and -J with p. This model exhibits a confinement-Higgs phase transition. We numerically obtain a phase boundary curve in the (p-T)-plane where T is the "temperature" measured in unit of J/k_B. This model plays an important role in estimating the accuracy threshold of a quantum memory of a toric code. In this paper, we are mainly interested in its "self-duality" …
A decade ago Kitaev's toric code model established the new paradigm of topological quantum computation. Due to remarkable theoretical and experimental progress, the quantum simulation of such complex many-body systems is now within the realms of possibility. Here we consider the question, to which extent the ground states of small toric code systems differ from LU-equivalent graph states. We argue that simplistic (though experimentally attractive) setups obliterate the differences between the toric code and equivalent graph states; hence we search for the smallest setups on the square- and tri…
Condensation of quantum loops naturally leads to topological phases with Abelian excitations. Here, I propose that non-Abelian topological phases can arise from merging two (or several) identical Abelian quantum loop condensates. I define merging through a symmetrization operation, which makes the two loop condensates indistinguishable, inducing the possibility of a topological degeneracy in the space of quasiparticles. To illustrate the construction, the case of two identical toric-code quantum loop gases is considered. A spin-1 model for the two dimensional square lattice is presented for wh…
The surface code scheme for quantum computation features a 2d array of nearest-neighbor coupled qubits yet claims a threshold error rate approaching 1% (NJoP 9:199, 2007). This result was obtained for the toric code, from which the surface code is derived, and surpasses all other known codes restricted to 2d nearest-neighbor architectures by several orders of magnitude. We describe in detail an error correction procedure for the toric and surface codes, which is based on polynomial-time graph matching techniques and is efficiently implementable as the classical feed-forward processing step in …
We analyze the properties of a 2D topological code derived by concatenating the [[4, 2, 2]] code with the toric/surface code, or alternatively by removing check operators from the 2D square-octagon or 4.8.8 color code. We show that the resulting code has a circuit-based noise threshold of $\sim 0.41\%$ (compared to $\sim 0.6\%$ for the toric code in a similar scenario), which is higher than any known 2D color code. We believe that the construction may be of interest for hardware in which one wants to use both long-range two-qubit gates as well as short-range gates between small clusters of qub…
We describe a computationally-efficient heuristic algorithm based on a renormalization-group procedure which aims at solving the problem of finding minimal surface given its boundary (curve) in any hypercubic lattice of dimension $D>2$. We use this algorithm to correct errors occurring in a four-dimensional variant of the toric code, having open as opposed to periodic boundaries. For a phenomenological error model which includes measurement errors we use a five-dimensional version of our algorithm, achieving a threshold of $4.35\pm0.1\%$. For this error model, this is the highest known thresho…
Phenomenological Noise Models and Optimal Thresholds of the 3D Toric Code
Hefei National Research Center for Physical Sciences at the Microscale and School of Physical Sciences, University of Science and Technology of China（中国科学技术大学物理科学学院和微尺度物质科学国家研究中心）；Hefei National Laboratory, University of Science and Technology of China（中国科学技术大学合肥国家实验室）；Departamento de Física Teórica, Universidad Complutense（马德里康普顿斯大学理论物理系）；CCS-Center for Computational Simulation, Universidad Politécnica de Madrid（马德里理工大学计算模拟中心）；Institute of Theoretical Physics, Chinese Academy of Sciences（中国科学院理论物理研究所）；Shanghai Research Center for Quantum Science and CAS Center for Excellence in Quantum Information and Quantum Physics, University of Science and Technology of China（中国科学技术大学上海量子科学研究中心及中国科学院量子信息与量子物理学前沿卓越中心）
We introduce an efficient decoder of the color code in $d\geq 2$ dimensions, the Restriction Decoder, which uses any $d$-dimensional toric code decoder combined with a local lifting procedure to find a recovery operation. We prove that the Restriction Decoder successfully corrects errors in the color code if and only if the corresponding toric code decoding succeeds. We also numerically estimate the Restriction Decoder threshold for the color code in two and three dimensions against the bit-flip and phase-flip noise with perfect syndrome extraction. We report that the 2D color code threshold $…
We study the +/- J random-plaquette Z_2 gauge model (RPGM) in three spatial dimensions, a three-dimensional analog of the two-dimensional +/- J random-bond Ising model (RBIM). The model is a pure Z_2 gauge theory in which randomly chosen plaquettes (occuring with concentration p) have couplings with the ``wrong sign'' so that magnetic flux is energetically favored on these plaquettes. Excitations of the model are one-dimensional ``flux tubes'' that terminate at ``magnetic monopoles.'' Electric confinement can be driven by thermal fluctuations of the flux tubes, by the quenched background of ma…
We propose a new cellular automaton (CA), the Sweep Rule, which generalizes Toom's rule to any locally Euclidean lattice. We use the Sweep Rule to design a local decoder for the toric code in $d\geq 3$ dimensions, the Sweep Decoder, and rigorously establish a lower bound on its performance. We also numerically estimate the Sweep Decoder threshold for the three-dimensional toric code on the cubic and body-centered cubic lattices for phenomenological phase-flip noise. Our results lead to new CA decoders with provable error-correction thresholds for other topological quantum codes including the c…
We apply deep reinforcement learning techniques to design high threshold decoders for the toric code under uncorrelated noise. By rewarding the agent only if the decoding procedure preserves the logical states of the toric code, and using deep convolutional networks for the training phase of the agent, we observe near-optimal performance for uncorrelated noise around the theoretically optimal threshold of 11%. We observe that, by and large, the agent implements a policy similar to that of minimum weight perfect matchings even though no bias towards any policy is given a priori.
Quantum error correction requires decoders that are both accurate and efficient. To this end, union-find decoding has emerged as a promising candidate for error correction on the surface code. In this work, we benchmark a weighted variant of the union-find decoder on the toric code under circuit-level depolarizing noise. This variant preserves the almost-linear time complexity of the original while significantly increasing the performance in the fault-tolerance setting. In this noise model, weighting the union-find decoder increases the threshold from 0.38% to 0.62%, compared to an increase fr…
We examine the performance of the single-mode GKP code and its concatenation with the toric code for a noise model of Gaussian shifts, or displacement errors. We show how one can optimize the tracking of errors in repeated noisy error correction for the GKP code. We do this by examining the maximum-likelihood problem for this setting and its mapping onto a 1D Euclidean path-integral modeling a particle in a random cosine potential. We demonstrate the efficiency of a minimum-energy decoding strategy as a proxy for the path integral evaluation. In the second part of this paper, we analyze and nu…
It is known that noisy topological quantum codes are related to random bond Ising models where the order-disorder phase transition in the classical model is mapped to the error threshold of the corresponding topological code. On the other hand, there is a dual mapping between classical spin models and quantum Calderbank-Shor-Stean (CSS) states where the partition function of a classical model defined on a hypergraph $H$ is written as an inner product of a product state and a CSS state on dual hypergraph $\tilde{H}$. It is then interesting to see what is the interpretation of the classical phas…
The recent years have seen a growing interest in quantum codes in three dimensions (3D). One of the earliest proposed 3D quantum codes is the 3D toric code. It has been shown that 3D color codes can be mapped to 3D toric codes. The 3D toric code on cubic lattice is also a building block for the welded code which has highest energy barrier to date. Although well known, the performance of the 3D toric code has not been studied extensively. In this paper, we propose efficient decoding algorithms for the 3D toric code on a cubic lattice with and without boundaries and report their performance for …
Qudit toric codes are a natural higher-dimensional generalization of the well-studied qubit toric code. However standard methods for error correction of the qubit toric code are not applicable to them. Novel decoders are needed. In this paper we introduce two renormalization group decoders for qudit codes and analyze their error correction thresholds and efficiency. The first decoder is a generalization of a "hard-decisions" decoder due to Bravyi and Haah [arXiv:1112.3252]. We modify this decoder to overcome a percolation effect which limits its threshold performance for high dimensions. The s…
We introduce a new topological quantum code, the three-dimensional subsystem toric code (3D STC), which is a generalization of the stabilizer toric code. The 3D STC can be realized by measuring geometrically-local parity checks of weight at most three on the cubic lattice with open boundary conditions. We prove that single-shot quantum error correction (QEC) is possible with the 3D STC, i.e., one round of local parity-check measurements suffices to perform reliable QEC even in the presence of measurement errors. We also propose an efficient single-shot QEC strategy for the 3D STC and investiga…
Quantum error correcting codes have a distance parameter, conveying the minimum number of single spin errors that could cause error correction to fail. However, the success thresholds of finite per-qubit error rate that have been proven for the likes of the Toric code require them to work well beyond this limit. We argue that without the assumption of being below the distance limit, the success of error correction is not only contingent on the noise model, but what the noise model is believed to be. Any discrepancy must adversely affect the threshold rate, and risks invalidating existing thres…
Local decoder for the toric code via signal exchange
Laboratoire de Physique de l’Ecole normale supérieure, ENS-PSL, CNRS, Inria, Centre Automatique et Systèmes (CAS), Mines Paris, Université PSL, Sorbonne Université, Université Paris Cité（巴黎高等师范学院物理实验室、ENS-PSL、法国国家科学研究中心、Inria、自动与系统中心（CAS）、巴黎矿业学院、巴黎文理研究大学、索邦大学、巴黎西岱大学）
To date, a great deal of attention has focused on characterizing the performance of quantum error correcting codes via their thresholds, the maximum correctable physical error rate for a given noise model and decoding strategy. Practical quantum computers will necessarily operate below these thresholds meaning that other performance indicators become important. In this work we consider the scaling of the logical error rate of the toric code and demonstrate how, in turn, this may be used to calculate a key performance indicator. We use a perfect matching decoding algorithm to find the scaling o…
Quantum codes excel at correcting local noise but fail to correct leakage faults that excite qubits to states outside the computational space. Aliferis and Terhal have shown that an accuracy threshold exists for leakage faults using gadgets called leakage reduction units (LRUs). However, these gadgets reduce the accuracy threshold and can increase overhead and experimental complexity, and these costs have not been thoroughly understood. Our work explores a variety of techniques for leakage-resilient, fault-tolerant error correction in the context of topological codes. Our contributions are thr…
We study the error threshold of color codes, a class of topological quantum codes that allow a direct implementation of quantum Clifford gates suitable for entanglement distillation, teleportation and fault-tolerant quantum computation. We map the error-correction process onto a statistical mechanical random 3-body Ising model and study its phase diagram via Monte Carlo simulations. The obtained error threshold of p_c = 0.109(2) is very close to that of Kitaev's toric code, showing that enhanced computational capabilities does not necessarily imply lower resistance to noise.
We study the quantum error correction threshold of Kitaev's toric code over the group Z_d subject to a generalized bit-flip noise. This problem requires novel decoding techniques, and for this purpose we generalize the renormalization group method we previously introduced for Z_2 topological codes.
We introduce a technique that uses gauge fixing to significantly improve the quantum error correcting performance of subsystem codes. By changing the order in which check operators are measured, valuable additional information can be gained, and we introduce a new method for decoding which uses this information to improve performance. Applied to the subsystem toric code with three-qubit check operators, we increase the threshold under circuit-level depolarising noise from $0.67\%$ to $0.81\%$. The threshold increases further under a circuit-level noise model with small finite bias, up to $2.22…
We show how a hyperbolic surface code could be used for overhead-efficient quantum storage. We give numerical evidence for a noise threshold of 1.3% for the {4,5}-hyperbolic surface code in a phenomenological noise model (as compared to 2.9% for the toric code). In this code family parity checks are of weight 4 and 5 while each qubit participates in 4 different parity checks. We introduce a family of semi-hyperbolic codes which interpolate between the toric code and the {4,5}-hyperbolic surface code in terms of encoding rate and threshold. We show how these hyperbolic codes outperform the tori…
We compute the error threshold for the semion code, the companion of the Kitaev toric code with the same gauge symmetry group $\mathbb{Z}_2$. The application of statistical mechanical mapping methods is highly discouraged for the semion code, since the code is non-Pauli and non-CSS. Thus, we use machine learning methods, taking advantage of the near-optimal performance of some neural network decoders: multilayer perceptrons and convolutional neural networks (CNNs). We find the values $p_{\text {eff}}=9.5\%$ for uncorrelated bit-flip and phase-flip noise, and $p_{\text {eff}}=10.5\%$ for depola…
In some quantum computing (QC) architectures, entanglement of an arbitrary number of qubits can be generated in a single operation. This property has many potential applications, and may specifically be useful for quantum error correction (QEC). Stabilizer measurements can then be implemented using a single multi-qubit gate instead of several two-qubit gates, thus reducing circuit depth. In this study, the toric code is used as a benchmark to compare the performance of two-qubit and five-qubit gates within parity-check circuits. We consider trapped ion qubits that are controlled via Raman tran…
We show that belief propagation combined with ordered statistics post-processing is a general decoder for quantum low density parity check codes constructed from the hypergraph product. To this end, we run numerical simulations of the decoder applied to three families of hypergraph product code: topological codes, fixed-rate random codes and a new class of codes that we call semi-topological codes. Our new code families share properties of both topological and random hypergraph product codes, with a construction that allows for a finely-controlled trade-off between code threshold and stabilize…
We demonstrate the existence of a finite temperature threshold for a 1D stabilizer code under an error correcting protocol that requires only a fraction of the syndrome measurements. Below the threshold temperature, encoded states have exponentially long lifetimes, as demonstrated by numerical and analytical arguments. We sketch how this algorithm generalizes to higher dimensional stabilizer codes with string-like excitations, like the toric code.
PhD thesis investigating homological quantum codes derived from curved and higher dimensional geometries. In the first part we will consider closed surfaces with constant negative curvature. We show how such surfaces can be constructed and enumerate all quantum codes derived from them which have less than 10.000 physical qubits. For codes that are extremal in a certain sense we perform numerical simulations to determine the value of their threshold. Furthermore, we give evidence that these codes can be used for more overhead efficient storage as compared to the surface code by orders of magnit…
Measurement-Free Toric-Code Memory in Array Globally Controlled Rydberg Array
The Hong Kong University of Science and Technology (Guangzhou)（香港科技大学（广州））；International Quantum Academy, and Shenzhen Branch, Hefei National Laboratory（国际量子学院，合肥国家实验室深圳分部）
Disorder-induced quantum Fisher information in topological quantum systems
BITS Pilani KK Birla Goa Campus（比拉戈亚校园）；Harish-Chandra Research Institute（哈里什-昌德拉研究所）；Homi Bhabha National Institute（霍米·巴巴国立研究所）；Università di Trento（特伦托大学）；INFN-TIFPA, Trento Institute for Fundamental Physics and Applications（意大利国家核物理研究所-基础物理与应用特伦托研究所）
Error-Adaptive Quasi-local Decoding of the Toric Code
QuEra Computing Inc.（QuEra计算公司）；University of Maryland（马里兰大学）；Joint Quantum Institute, NIST/University of Maryland（NIST/马里兰大学联合量子研究所）；Joint Center for Quantum Information and Computer Science, NIST/University of Maryland（NIST/马里兰大学联合量子信息与计算科学中心）；Princeton University（普林斯顿大学）；National Institute of Standards and Technology（美国国家标准与技术研究院）
We analyze several high dimensional generalizations of the toric code at nonzero temperature. We find that in large enough dimension, there can be a distinct separation between the critical temperature $T_c$, given by thermodynamic singularities, and the percolation temperature $T_p$, given by the percolation of defects. We argue that the regime $T_p<T<T_c$ is a range of temperatures where a self-correcting quantum memory can operate despite having percolating defects. We present analytic arguments and numerical evidence in support of this scenario, including a mean-field treatment and Monte C…
Fracton models provide examples of novel gapped quantum phases of matter that host intrinsically immobile excitations and therefore lie beyond the conventional notion of topological order. Here, we calculate optimal error thresholds for quantum error correcting codes based on fracton models. By mapping the error-correction process for bit-flip and phase-flip noises into novel statistical models with Ising variables and random multi-body couplings, we obtain models that exhibit an unconventional subsystem symmetry instead of a more usual global symmetry. We perform large-scale parallel temperin…
We present and analyze protocols for fault-tolerant quantum computing using color codes. We present circuit-level schemes for extracting the error syndrome of these codes fault-tolerantly. We further present an integer-program-based decoding algorithm for identifying the most likely error given the syndrome. We simulated our syndrome extraction and decoding algorithms against three physically-motivated noise models using Monte Carlo methods, and used the simulations to estimate the corresponding accuracy thresholds for fault-tolerant quantum error correction. We also used a self-avoiding walk …
