Topological Error Correction Research Articles

Bulk-to-boundary anyon fusion from microscopic models

Topological quantum error correction based on the manipulation of the anyonic defects constitutes one of the most promising frameworks towards realizing fault-tolerant quantum devices. Hence, it is crucial to understand how these defects interact with external defects such as boundaries or domain walls. Motivated by this line of thought, in this work, we study the fusion events between anyons in the bulk and at the boundary in fixed-point models of 2 + 1-dimensional non-chiral topological order defined by arbitrary fusion categories. Our construction uses generalized tube algebra techniques to construct a bi-representation of bulk and boundary defects. We explicitly derive a formula to calculate the fusion multiplicities of a bulk-to-boundary fusion event for twisted quantum double models and calculate some exemplary fusion events for Abelian models and the (twisted) quantum double model of S3, the simplest non-Abelian group-theoretical model. Moreover, we use the folding trick to study the anyonic behavior at non-trivial domain walls between twisted S3 and twisted Z2 as well as Z3 models. A recurring theme in our construction is an isomorphism relating twisted cohomology groups to untwisted ones. The results of this work can directly be applied to study logical operators in two-dimensional topological error correcting codes with boundaries described by a twisted gauge theory of a finite group.

Quantum Teleportation Error Suppression Algorithm Based on Convolutional Neural Networks and Quantum Topological Semion Codes

Quantum error correction (QEC) is a key technique for building scalable quantum computers that can be used to mitigate the effects of errors on physical quantum bits. Since quantum states are more or less affected by noise, errors are inevitable. Traditional QEC codes face huge challenges. Therefore, designing an error suppression algorithm based on neural networks (NN) and quantum topological error correction (QTEC) codes is particularly important for quantum teleportation. In this paper, QTEC codes: semion codes—a greater than 2 dimensional (2D) error correction code based on the double semion model—are used to suppress errors during quantum teleportation, using a NN to build a decoder based on semion codes and to simulate the quantum information error suppression process and the suppression effect. The proposed convolutional neural network (CNN) decoder is suitable for small distance topological semion codes. The aim is to optimize the NN for better decoder performance while deriving the relationship between decoder performance and slope and pseudothreshold during training and calculate the thresholds for different noise areas when the code distances are the same, P t h r e s h o l d = 0.082 for A r e a < 0.007 d B and P t h r e s h o l d = 0.096 for A r e a < 0.01 d B . This paper demonstrates the ability of CNNs to suppress errors in quantum transmission information and the great potential of NNs in the field of quantum computing.

Error-correction properties of an interacting topological insulator

We analyze the phase diagram of a topological insulator model including antiferromagnetic interactions in the form of an extended Su-Schrieffer Heeger model. To this end, we employ a recently introduced operational definition of topological order based on the ability of a system to perform topological error correction. We show that the necessary error correction statistics can be obtained efficiently using a Monte-Carlo sampling of a matrix product state representation of the ground state wave function. Specifically, we identify two distinct symmetry-protected topological phases corresponding to two different fully dimerized reference states. Finally, we extend the notion of error correction to classify thermodynamic phases to those exhibiting local order parameters, finding a topologically trivial antiferromagnetic phase for sufficiently strong interactions.

Operational definition of topological order

The unrivaled robustness of topologically ordered states of matter against perturbations has immediate applications in quantum computing and quantum metrology, yet their very existence poses a challenge to our understanding of phase transitions. However, a comprehensive understanding of what actually constitutes topological order is still lacking. Here we show that one can interpret topological order as the ability of a system to perform topological error correction. We find that this operational approach corresponding to a measurable both lays the conceptual foundations for previous classifications of topological order and also leads to a successful classification in the hitherto inaccessible case of topological order in open quantum systems. We demonstrate the existence of topological order in open systems and their phase transitions to topologically trivial states. Our results demonstrate the viability of topological order in nonequilibrium quantum systems and thus substantially broaden the scope of possible technological applications.

Determining quantum topological semion code decoder performance and error correction effectiveness with reinforcement learning

Quantum error correction technology is a vital method to eliminate noise during the operation of quantum computers. To solve the problem caused by noise, in this paper, reinforcement learning is used to encode defects of Semion codes, and the experience replay technique is used to realize the design of decoder. Semion codes are quantum topological error correction codes with the same symmetry group Z2 as Kitaev toric codes, we used the topological characteristics of error correction codes to map qubits to multi-dimensional space, and error correction accuracy of the decoder is calculated to be 77.5%. Calculate the threshold of topological quantum Semion code, depending on the code distance, resulting in different thresholds, pthreshold = 0.081574 when the code distance is d = 3, 5, 7 and threshold pthreshold = 0.09542 when the code distance is d = 5, 7, 9. And we design the Q-network to optimize the cost of quantum circuit gates and compare the size of the cost reduction under different thresholds. Reinforcement learning is an important method for designing Semion code decoders and optimizing numerical values, providing more general error models and error correction codes for future machine engineering decoders.

Quantum Information Protection Scheme Based on Reinforcement Learning for Periodic Surface Codes

Quantum information transfer is an information processing technology with high speed and high entanglement with the help of quantum mechanics principles. To solve the problem of quantum information getting easily lost during transmission, we choose topological quantum error correction codes as the best candidate codes to improve the fidelity of quantum information. The stability of topological error correction codes brings great convenience to error correction. The quantum error correction codes represented by surface codes have produced very good effects in the error correction mechanism. In order to solve the problem of strong spatial correlation and optimal decoding of surface codes, we introduced a reinforcement learning decoder that can effectively characterize the spatial correlation of error correction codes. At the same time, we use a double-layer convolutional neural network model in the confrontation network to find a better error correction chain, and the generation network can approach the best correction model, to ensure that the discriminant network corrects more nontrivial errors. To improve the efficiency of error correction, we introduced a double-Q algorithm and ResNet network to increase the error correction success rate and training speed of the surface code. Compared with the previous MWPM 0.005 decoder threshold, the success rate has slightly improved, which can reach up to 0.0068 decoder threshold. By using the residual neural network architecture, we saved one-third of the training time and increased the training accuracy to about 96.6%. Using a better training model, we have successfully increased the decoder threshold from 0.0068 to 0.0085, and the depolarized noise model being used does not require a priori basic noise, so that the error correction efficiency of the entire model has slightly improved. Finally, the fidelity of the quantum information has successfully improved from 0.2423 to 0.7423 by using the error correction protection schemes.

Fault-Tolerant Continuous-Variable Measurement-based Quantum Computation Architecture

Continuous variable measurement-based quantum computation on cluster states has in recent years shown great potential for scalable, universal, and fault-tolerant quantum computation when combined with the Gottesman-Kitaev-Preskill (GKP) code and quantum error correction. However, no complete fault-tolerant architecture exists that includes everything from cluster state generation with finite squeezing to gate implementations with realistic noise and error correction. In this work, we propose a simple architecture for the preparation of a cluster state in three dimensions in which gates by gate teleportation can be efficiently implemented. To accommodate scalability, we propose architectures that allow for both spatial and temporal multiplexing, with the temporal encoded version requiring as little as two squeezed light sources. Due to its three-dimensional structure, the architecture supports topological qubit error correction, while GKP error correction is efficiently realized within the architecture by teleportation. To validate fault-tolerance, the architecture is simulated using surface-GKP codes, including noise from GKP-states as well as gate noise caused by finite squeezing in the cluster state. We find a fault-tolerant squeezing threshold of 12.7 dB with room for further improvement.

Graph-state representation of the toric code

Given their potential for fault-tolerant operations, topological quantum states are currently a focus of intense activity. Of particular interest are topological quantum error correction codes, such as the surface and planar stabilizer codes that are equivalent to the celebrated toric code. While every stabilizer state maps to a graph state under local Clifford operations, the graphs associated with topological stabilizer codes remain unknown. We show that the toric code graph is composed of only two kinds of subgraphs: star graphs (which encode Greenberger-Horne-Zeilinger states) and half graphs. The topological order is identified with the existence of multiple star graphs, which reveals a connection between the repetition and toric codes. The graph structure readily yields a log-depth quantum circuit for state preparation, assuming geometrically nonlocal gates, which can be reduced to a constant depth including ancillae and measurements at the cost of increasing the circuit width. The results provide a graph-theoretic framework for the investigation of topological order and the development of topological error correction codes.

Topological error correction with a Gaussian cluster state

Topological error correction provides an effective method to correct errors in quantum computation. It allows quantum computation to be implemented with higher error threshold and high tolerating loss rates. We present a topological a error correction scheme with continuous variables based on an eight-partite Gaussian cluster state. We show that topological quantum correlation between two modes can be protected against a single quadrature phase displacement error occurring on any mode and some of two errors occurring on two modes. More interestingly, some cases of errors occurring on three modes can also be recognised and corrected, which is different from the topological error correction with discrete variables. We show that the final error rate after correction can be further reduced if the modes are subjected to identical errors occurring on all modes with equal probability. The presented results provide a feasible scheme for topological error correction with continuous variables and it can be experimentally demonstrated with a Gaussian cluster state.

Soluble limit and criticality of fermions in Z2 gauge theories

Quantum information theory and strongly correlated electron systems share a common theme of macroscopic quantum entanglement. In both topological error correction codes and theories of quantum materials (spin liquid, heavy fermion and high-$T_c$ systems) entanglement is implemented by means of an emergent gauge symmetry. Inspired by these connections, we introduce a simple model for fermions moving in the deconfined phase of a $\mathbb Z_2$ gauge theory, by coupling Kitaev's toric code to mobile fermions. This permits us to exactly solve the ground state of this system and map out its phase diagram. Reversing the sign of the plaquette term in the toric code, permits us to tune the groundstate between an orthogonal metal and an orthogonal semimetal, in which gapless quasiparticles survive despite a gap in the spectrum of original fermions. The small-to-large Fermi surface transition between these two states occurs in a stepwise fashion with multiple intermediate phases. By using a novel diagrammatic technique we are able to explore physics beyond the integrable point, to examine various instabilities of the deconfined phase and to derive the critical theory at the transition between deconfined and confined phases. We outline how the fermionic toric code can be implemented as a quantum circuit thus providing an important link between quantum materials and quantum information theory.

Spin read-out in atomic qubits in an all-epitaxial three-dimensional transistor.

The realization of the surface code for topological error correction is an essential step towards a universal quantum computer1-3. For single-atom qubits in silicon4-7, the need to control and read out qubits synchronously and in parallel requires the formation of a two-dimensional array of qubits with control electrodes patterned above and below this qubit layer. This vertical three-dimensional device architecture8 requires the ability to pattern dopants in multiple, vertically separated planes of the silicon crystal with nanometre precision interlayer alignment. Additionally, the dopants must not diffuse or segregate during the silicon encapsulation. Critical components of this architecture-such as nanowires9, single-atom transistors4 and single-electron transistors10-have been realized on one atomic plane by patterning phosphorus dopants in silicon using scanning tunnelling microscope hydrogen resist lithography11,12. Here, we extend this to three dimensions and demonstrate single-shot spin read-out with 97.9% measurement fidelity of a phosphorus dopant qubit within a vertically gated single-electron transistor with <5 nm interlayer alignment accuracy. Our strategy ensures the formation of a fully crystalline transistor using just two atomic species: phosphorus and silicon.

Quantum Topological Error Correction Codes are Capable of Improving the Performance of Clifford Gates

The employment of quantum error correction codes (QECCs) within quantum computers potentially offers a reliability improvement for both quantum computation and communications tasks. However, incorporating quantum gates for performing error correction potentially introduces more sources of quantum decoherence into the quantum computers. In this scenario, the primary challenge is to find the sufficient condition required by each of the quantum gates for beneficially employing QECCs in order to yield reliability improvements given that the quantum gates utilized by the QECCs also introduce quantum decoherence. In this treatise, we approach this problem by firstly presenting the general framework of protecting quantum gates by the amalgamation of the transversal configuration of quantum gates and quantum stabilizer codes (QSCs), which can be viewed as syndrome-based QECCs. Secondly, we provide examples of the advocated framework by invoking quantum topological error correction codes (QTECCs) for protecting both transversal Hadamard gates and CNOT gates. The simulation and analytical results explicitly show that by utilizing QTECCs, the fidelity of the quantum gates can be beneficially improved, provided that quantum gates satisfying a certain minimum depolarization fidelity threshold (F th ) are available. For instance, for protecting transversal Hadamard gates, the minimum fidelity values required for each of the gates in order to attain fidelity improvements are 99.74%, 99.73%, 99.87%, and 99.86%, when they are protected by colour, rotated-surface, surface, and toric codes, respectively. These specific F th values are obtained for a very large number of physical qubits (n → ∞), when the quantum coding rate of the QTECCs approaches zero (r Q → 0). Ultimately, the framework advocated can be beneficially exploited for employing QSCs to protect large-scale quantum computers.

Quantum Topological Error Correction Codes: The Classical-to-Quantum Isomorphism Perspective

We conceive and investigate the family of classical topological error correction codes (TECCs), which have the bits of a codeword arranged in a lattice structure. We then present the classical-to-quantum isomorphism to pave the way for constructing their quantum dual pairs, namely, the quantum TECCs (QTECCs). Finally, we characterize the performance of QTECCs in the face of the quantum depolarizing channel in terms of both the quantum-bit error rate (QBER) and fidelity. Specifically, from our simulation results, the threshold probability of the QBER curves for the color codes, rotated-surface codes, surface codes, and toric codes are given by $1.8 \times 10^{-2}$ , $1.3 \times 10^{-2}$ , $6.3 \times 10^{-2}$ , and $6.8 \times 10^{-2}$ , respectively. Furthermore, we also demonstrate that we can achieve the benefit of fidelity improvement at the minimum fidelity of 0.94, 0.97, and 0.99 by employing the 1/7-rate color code, the 1/9-rate rotated-surface code, and 1/13-rate surface code, respectively.

Braiding by Majorana tracking and long-range CNOT gates with color codes

Color-code quantum computation seamlessly combines Majorana-based hardware with topological error correction. Specifically, as Clifford gates are transversal in two-dimensional color codes, they enable the use of the Majoranas' nonabelian statistics for gate operations at the code level. Here, we discuss the implementation of color codes in arrays of Majorana nanowires that avoid branched networks such as T-junctions, thereby simplifying their realization. We show that, in such implementations, nonabelian statistics can be exploited without ever performing physical braiding operations. Physical braiding operations are replaced by Majorana tracking, an entirely software-based protocol which appropriately updates the Majoranas involved in the color-code stabilizer measurements. This approach minimizes the required hardware operations for single-qubit Clifford gates. For Clifford completeness, we combine color codes with surface codes, and use color-to-surface-code lattice surgery for long-range multi-target CNOT gates which have a time overhead that grows only logarithmically with the physical distance separating control and target qubits. With the addition of magic state distillation, our architecture describes a fault-tolerant universal quantum computer in systems such as networks of tetrons, hexons, or Majorana box qubits, but can also be applied to non-topological qubit platforms.

Fault-tolerant interface between quantum memories and quantum processors

Topological error correction codes are promising candidates to protect quantum computations from the deteriorating effects of noise. While some codes provide high noise thresholds suitable for robust quantum memories, others allow straightforward gate implementation needed for data processing. To exploit the particular advantages of different topological codes for fault-tolerant quantum computation, it is necessary to be able to switch between them. Here we propose a practical solution, subsystem lattice surgery, which requires only two-body nearest-neighbor interactions in a fixed layout in addition to the indispensable error correction. This method can be used for the fault-tolerant transfer of quantum information between arbitrary topological subsystem codes in two dimensions and beyond. In particular, it can be employed to create a simple interface, a quantum bus, between noise resilient surface code memories and flexible color code processors.

Fault-tolerance thresholds for the surface code with fabrication errors

The construction of topological error correction codes requires the ability to fabricate a lattice of physical qubits embedded on a manifold with a non-trivial topology such that the quantum information is encoded in the global degrees of freedom (i.e. the topology) of the manifold. However, the manufacturing of large-scale topological devices will undoubtedly suffer from fabrication errors---permanent faulty components such as missing physical qubits or failed entangling gates---introducing permanent defects into the topology of the lattice and hence significantly reducing the distance of the code and the quality of the encoded logical qubits. In this work we investigate how fabrication errors affect the performance of topological codes, using the surface code as the testbed. A known approach to mitigate defective lattices involves the use of primitive SWAP gates in a long sequence of syndrome extraction circuits. Instead, we show that in the presence of fabrication errors the syndrome can be determined using the supercheck operator approach and the outcome of the defective gauge stabilizer generators without any additional computational overhead or the use of SWAP gates. We report numerical fault-tolerance thresholds in the presence of both qubit fabrication and gate fabrication errors using a circuit-based noise model and the minimum-weight perfect matching decoder. Our numerical analysis is most applicable to 2D chip-based technologies, but the techniques presented here can be readily extended to other topological architectures. We find that in the presence of 8% qubit fabrication errors, the surface code can still tolerate a computational error rate of up to 0.1%.

High-speed quantum networking by ship.

Networked entanglement is an essential component for a plethora of quantum computation and communication protocols. Direct transmission of quantum signals over long distances is prevented by fibre attenuation and the no-cloning theorem, motivating the development of quantum repeaters, designed to purify entanglement, extending its range. Quantum repeaters have been demonstrated over short distances, but error-corrected, global repeater networks with high bandwidth require new technology. Here we show that error corrected quantum memories installed in cargo containers and carried by ship can provide a exible connection between local networks, enabling low-latency, high-fidelity quantum communication across global distances at higher bandwidths than previously proposed. With demonstrations of technology with sufficient fidelity to enable topological error-correction, implementation of the quantum memories is within reach, and bandwidth increases with improvements in fabrication. Our approach to quantum networking avoids technological restrictions of repeater deployment, providing an alternate path to a worldwide Quantum Internet.

Topological Code Autotune

A powerful software-based tool transforms the so-far extremely laborious task of optimizing real quantum-computing hardware for topological error correction into a highly automated and efficient one for a broad range of hardware platforms.

Experimental demonstration of topological error correction

Scalable quantum computing can be achieved only if quantum bits are manipulated in a fault-tolerant fashion. Topological error correction--a method that combines topological quantum computation with quantum error correction--has the highest known tolerable error rate for a local architecture. The technique makes use of cluster states with topological properties and requires only nearest-neighbour interactions. Here we report the experimental demonstration of topological error correction with an eight-photon cluster state. We show that a correlation can be protected against a single error on any quantum bit. Also, when all quantum bits are simultaneously subjected to errors with equal probability, the effective error rate can be significantly reduced. Our work demonstrates the viability of topological error correction for fault-tolerant quantum information processing.

A topological route to error correction

Quantum computing is plagued by noise and small errors. An approach based on topological techniques reduces the sensitivity to errors and boosts the prospects for building practical quantum computers. See Article p.489 Quantum computation is more prone to error than are the processes involved in classical computers, so scalable quantum computing requires the fault-tolerant manipulation of the quantum bits or qubits that carry the information. One of the most promising methods for minimizing the rate of errors caused by qubit decoherence is topological error correction, which combines topological quantum computation with error correction. This paper reports the first proof-of-principle demonstration of topological error correction, using an eight-photon cluster state. This is an important demonstration, requiring state-of-the-art quantum optics technology.