Quantum Error Correction Research Articles

Quantum Lego Expansion Pack: Enumerators from Tensor Networks

We provide the first tensor-network method for computing quantum weight enumerator polynomials in the most general form. If a quantum code has a known tensor-network construction of its encoding map, our method is far more efficient, and in some cases exponentially faster than the existing approach. As a corollary, it produces decoders and an algorithm that computes the code distance. For non-(Pauli)-stabilizer codes, this constitutes the current best algorithm for computing the code distance. For degenerate stabilizer codes, it can be substantially faster compared to the current methods. We also introduce novel weight enumerators and their applications. In particular, we show that these enumerators can be used to compute logical error rates exactly and thus construct (optimal) decoders for any independent and identically distributed single qubit or qudit error channels. The enumerators also provide a more efficient method for computing nonstabilizerness in quantum many-body states. As the power for these speedups rely on a quantum Lego decomposition of quantum codes, we further provide systematic methods for decomposing quantum codes and graph states into a modular construction for which our technique applies. As a proof of principle, we perform exact analyses of the deformed surface codes, the holographic pentagon code, and the two-dimensional Bacon-Shor code under (biased) Pauli noise and limited instances of coherent error at sizes that are inaccessible by brute force. Published by the American Physical Society 2024

Classical product code constructions for quantum Calderbank-Shor-Steane codes

Several notions of code products are known in quantum error correction, such as hypergraph products, homological products, lifted products, balanced products, to name a few. In this paper we introduce a new product code construction which is a natural generalization of classical product codes to quantum codes: starting from a set of component Calderbank-Shor-Steane (CSS) codes, a larger CSS code is obtained where both X parity checks and Z parity checks are associated to classical product codes. We deduce several properties of product CSS codes from the properties of the component codes, including bounds to the code distance, and show that built-in redundancies in the parity checks result in so-called meta-checks which can be exploited to correct syndrome read-out errors. We then specialize to the case of single-parity-check (SPC) product codes which in the classical domain are a common choice for constructing product codes. Logical error rate simulations of a SPC 3-fold product CSS code having parameters [[512,174,8]] are shown under both a maximum likelihood decoder for the erasure channel and belief propagation decoding for depolarizing noise. We compare the results with other codes of comparable length and dimension, including a code from the family of asymptotically good Tanner codes. We observe that our reference product CSS code outperforms all the other examined codes.

New quantum codes from Hermitian dual-containing matrix-product codes

New quantum codes from Hermitian dual-containing matrix-product codes

Recovery of damaged information via scrambling in indefinite causal order

Scrambling prevents the access to local information with local operators and therefore can be used to protect quantum information from damage caused by local perturbations. Even though partial quantum information can be recovered if the type of the damage is known, the initial target state cannot be completely recovered, because the obtained state is a mixture of the initial state and a maximally mixed state. Here, we demonstrate an improved scheme to recover damaged quantum information via scrambling in indefinite causal order. We show that scheme with indefinite causal order can record information of the damage and distill the initial state from the damaged state simultaneously. It allows us to retrieve initial information versus any damage. Moreover, by iterating the schemes, the initial quantum state can be completely recovered. In addition, we experimentally demonstrate our schemes on the cloud-based quantum computer, named as Quafu. Our work proposes a feasible scheme to protect whole quantum information from damage, which is also compatible with other techniques such as quantum error corrections and entanglement purification protocols. We expect that our scheme will be useful in the both quantum information recovery from the damage and systems bench-marking.

Quantum Codes from Twisted Unitary t-Groups.

We introduce twisted unitary t-groups, a generalization of unitary t-groups under a twisting by an irreducible representation. We then apply representation theoretic methods to the Knill-Laflamme error correction conditions to show that twisted unitary t-groups automatically correspond to quantum codes with distance d=t+1. By construction these codes have many transversal gates, which naturally do not spread errors and thus are useful for fault tolerance.

Candidate for a Passively Protected Quantum Memory in Two Dimensions.

An interesting problem in the field of quantum error correction involves finding a physical system that hosts a "passively protected quantum memory," defined as an encoded qubit coupled to an environment that naturally wants to correct errors. To date, a quantum memory stable against finite-temperature effects is known only in four spatial dimensions or higher. Here, we take a different approach to realize a stable quantum memory by relying on a driven-dissipative environment. We propose a new model, the photonic-Ising model, which appears to passively correct against both bit-flip and phase-flip errors in two dimensions: a square lattice composed of photonic "cat qubits" coupled via dissipative terms which tend to fix errors locally. Inspired by the presence of two distinct Z_{2}-symmetry-broken phases, our scheme relies on Ising-like dissipators to protect against bit flips and on a driven-dissipative photonic environment to protect against phase flips. We also discuss possible ways to realize the photonic-Ising model.

Relational bulk reconstruction from modular flow

The entanglement wedge reconstruction paradigm in AdS/CFT states that for a bulk qudit within the entanglement wedge of a boundary subregion A¯\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$ \\overline{A} $$\\end{document}, operators acting on the bulk qudit can be reconstructed as CFT operators on A¯\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$ \\overline{A} $$\\end{document}. This naturally fits within the framework of quantum error correction, with the CFT states containing the bulk qudit forming a code protected against the erasure of the boundary subregion A. In this paper, we set up and study a framework for relational bulk reconstruction in holography: given two code subspaces both protected against erasure of the boundary region A, the goal is to relate the operator reconstructions between the two spaces. To accomplish this, we assume that the two code subspaces are smoothly connected by a one-parameter family of codes all protected against the erasure of A, and that the maximally-entangled states on these codes are all full-rank. We argue that such code subspaces can naturally be constructed in holography in a “measurement-based” setting. In this setting, we derive a flow equation for the operator reconstruction of a fixed code subspace operator using modular theory which can, in principle, be integrated to relate the reconstructed operators all along the flow. We observe a striking resemblance between our formulas for relational bulk reconstruction and the infinite-time limit of Connes cocycle flow, and take some steps towards making this connection more rigorous. We also provide alternative derivations of our reconstruction formulas in terms of a canonical reconstruction map we call the modular reflection operator.

Quantum Error Correction Realized by the Renormalization Group in Scalar Field Theories

Abstract We demonstrate that quantum error correction is realized by the renormalization group in scalar field theories. We construct q-level states by using coherent states in the IR region. By acting on them the inverse of the unitary operator U that describes the renormalization group flow of the ground state, we encode them into states in the UV region. We find the situations in which the Knill–Laflamme condition is satisfied for operators that create coherent states. We verify this to the first order in the perturbation theory. This result suggests a general relationship between the renormalization group and quantum error correction and should give insights into understanding the role played by them in the gauge/gravity correspondence.

A new twist on the Majorana surface code: Bosonic and fermionic defects for fault-tolerant quantum computation

Majorana zero modes (MZMs) are promising candidates for topologically-protected quantum computing hardware, however their large-scale use will likely require quantum error correction. Majorana surface codes (MSCs) have been proposed to achieve this. However, many MSC properties remain unexplored. We present a unified framework for MSC "twist defects" – anyon-like objects encoding quantum information. We show that twist defects in MSCs can encode twice the amount of topologically protected information as in qubit-based codes or other MSC encoding schemes. This is due to twists encoding both logical qubits and "logical MZMs," with the latter enhancing the protection microscopic MZMs can offer. We explain how to perform universal computation with logical qubits and logical MZMs while potentially using far fewer resources than in other MSC schemes. All Clifford gates can be implemented on logical qubits by braiding twist defects. We introduce lattice-surgery-based techniques for computing with logical MZMs and logical qubits, achieving the effect of Clifford gates with zero time overhead. We also show that logical MZMs may result in improved spatial overheads for sufficiently low rates of quasi-particle poisoning. Finally, we introduce a novel MSC analogue of transversal gates that achieves encoded Clifford gates in small codes by braiding microscopic MZMs. MSC twist defects thus open new paths towards fault-tolerant quantum computation.

Subsystem CSS codes, a tighter stabilizer-to-CSS mapping, and Goursat's Lemma

The CSS code construction is a powerful framework used to express features of a quantum code in terms of a pair of underlying classical codes. Its subsystem extension allows for similar expressions, but the general case has not been fully explored. Extending previous work of Aly, Klappenecker, and Sarvepalli \cite{AKS06}, we determine subsystem CSS code parameters, express codewords, and develop a Steane-type decoder using only data from the two underlying classical codes. Generalizing a result of Kovalev and Pryadko \cite{KP13}, we show that any subsystem stabilizer code can be "doubled" to yield a subsystem CSS code with twice the number of physical, logical, and gauge qudits and up to twice the code distance. This mapping preserves locality and is tighter than the Majorana-based mapping of Bravyi, Terhal, and Leemhuis \cite{BTL10}. Using Goursat's Lemma, we show that every subsystem stabilizer code can be constructed from two nested subsystem CSS codes satisfying certain constraints, and we characterize subsystem stabilizer codes based on the nested codes' properties.

Catalyst: a Python JIT compiler for auto-differentiable hybrid quantum programs

Catalyst: a Python JIT compiler for auto-differentiable hybrid quantum programs

Artificial neural network syndrome decoding on IBM quantum processors

Syndrome decoding is an integral but computationally demanding step in the implementation of quantum error correction for fault-tolerant quantum computing. Here, we report the development and benchmarking of Artificial Neural Network (ANN) decoding on IBM quantum processors. We demonstrate that ANNs can efficiently decode syndrome measurement data from heavy-hexagonal code architecture and apply appropriate corrections to facilitate error protection. The current physical error rates of IBM devices are above the code's threshold and restrict the scope of our ANN decoder for logical error rate suppression. However, our work confirms the applicability of ANN decoding methods of syndrome data retrieved from experimental devices and establishes machine learning as a promising pathway for quantum error correction when quantum devices with below threshold error rates become available in the near future. Published by the American Physical Society 2024

Bases for optimising stabiliser decompositions of quantum states

Stabiliser states play a central role in the theory of quantum computation. For example, they are used to encode computational basis states in the most common quantum error correction schemes. Arbitrary quantum states admit many stabiliser decompositions: ways of being expressed as a superposition of stabiliser states. Understanding the structure of stabiliser decompositions has significant applications in verifying and simulating near-term quantum computers. We introduce and study the vector space of linear dependencies of n-qubit stabiliser states. These spaces have canonical bases containing vectors whose size grows exponentially in n. We construct elegant bases of linear dependencies of constant size three. Critically, our sparse bases can be computed without first compiling a dictionary of all n-qubit stabiliser states. We utilise them to explicitly compute the stabiliser extent of states of more qubits than is feasible with existing techniques. Finally, we delineate future applications to improving theoretical bounds on the stabiliser rank of magic states.

Construction of Hermitian Self-Orthogonal Codes and Application

We introduce some methods for constructing quaternary Hermitian self-orthogonal (HSO) codes, and construct quaternary [n, 5] HSO for 342≤n≤492. Furthermore, we present methods of constructing Hermitian linear complementary dual (HLCD) codes from known HSO codes, and obtain many HLCD codes with good parameters. As an application, 31 classes of entanglement-assisted quantum error correction codes (EAQECCs) with maximal entanglement can be obtained from these HLCD codes. These new EAQECCs have better parameters than those in the literature.

Good Gottesman-Kitaev-Preskill codes from the NTRU cryptosystem

We introduce a new class of random Gottesman-Kitaev-Preskill (GKP) codes derived from the cryptanalysis of the so-called NTRU cryptosystem. The derived codes are good in that they exhibit constant rate and average distance scaling Δ∝n with high probability, where n is the number of bosonic modes, which is a distance scaling equivalent to that of a GKP code obtained by concatenating single mode GKP codes into a qubit-quantum error correcting code with linear distance. The derived class of NTRU-GKP codes has the additional property that decoding for a stochastic displacement noise model is equivalent to decrypting the NTRU cryptosystem, such that every random instance of the code naturally comes with an efficient decoder. This construction highlights how the GKP code bridges aspects of classical error correction, quantum error correction as well as post-quantum cryptography. We underscore this connection by discussing the computational hardness of decoding GKP codes and propose, as a new application, a simple public key quantum communication protocol with security inherited from the NTRU cryptosystem.

Error-corrected Hadamard gate simulated at the circuit level

We simulate the logical Hadamard gate in the surface code under a circuit-level noise model, compiling it to a physical circuit on square-grid connectivity hardware. Our paper is the first to do this for a logical unitary gate on a quantum error-correction code. We consider two proposals, both via patch-deformation: one that applies a transversal Hadamard gate (i.e. a domain wall through time) to interchange the logical X and Z strings, and another that applies a domain wall through space to achieve this interchange. We explain in detail why they perform the logical Hadamard gate by tracking how the stabilisers and the logical operators are transformed in each quantum error-correction round. We optimise the physical circuits and evaluate their logical failure probabilities, which we find to be comparable to those of a quantum memory experiment for the same number of quantum error-correction rounds. We present syndrome-extraction circuits that maintain the same effective distance under circuit-level noise as under phenomenological noise. We also explain how a SWAP-quantum error-correction round (required to return the patch to its initial position) can be compiled to only four two-qubit gate layers. This can be applied to more general scenarios and, as a byproduct, explains from first principles how the "stepping" circuits of the recent Google paper \cite{McEwenBaconGidney} can be constructed.

Protecting coherence from the environment via Stark many-body localization in a Quantum-Dot Simulator

Semiconductor platforms are emerging as a promising architecture for storing and processing quantum information, e.g., in quantum dot spin qubits. However, charge noise coming from interactions between the electrons is a major limiting factor, along with the scalability of many qubits, for a quantum computer. We show that a magnetic field gradient can be implemented in a semiconductor quantum dot array to induce a local quantum coherent dynamical ℓ−bit exhibiting the potential to be used as logical qubits. These dynamical ℓ−bits are responsible for the model being many-body localized. We show that these dynamical ℓ−bits and the corresponding many-body localization are protected from all noises, including phonons, for sufficiently long times if electron-phonon interaction is not non-local. We further show the implementation of thermalization-based self-correcting logical gates. This thermalization-based error correction goes beyond the standard paradigm of decoherence-free and noiseless subsystems. Our work thus opens a new venue for passive quantum error correction in semiconductor-based quantum computers.

Several Families of Self-Orthogonal Codes and Their Applications in Optimal Quantum Codes and LCD Codes

Several Families of Self-Orthogonal Codes and Their Applications in Optimal Quantum Codes and LCD Codes

Integrated preparation and manipulation of high-dimensional flying structured photons

The hope for a futuristic global quantum internet that provides robust and high-capacity quantum information transfer lies largely on qudits, the fundamental quantum information carriers prepared in high-dimensional superposition states. However, preparing and manipulating N-dimensional flying qudits as well as subsequently establishing their entanglement are still challenging tasks, which require precise and simultaneous maneuver of 2 (N-1) parameters across multiple degrees of freedom. Here, using an integrated approach, we explore the synergy from two degrees of freedom of light, spatial mode and polarization, to generate, encode, and manipulate flying structured photons and their formed qudits in a four-dimensional Hilbert space with high quantum fidelity, intrinsically enabling enhanced noise resilience and higher quantum data rates. The four eigen spin–orbit modes of our qudits possess identical spatial–temporal characteristics in terms of intensity distribution and group velocity, thereby preserving long-haul coherence within the entirety of the quantum data transmission link. Judiciously leveraging the bi-photon entanglement, which is well preserved in the integrated manipulation process, we present versatile spin–orbit cluster states in an extensive dimensional Hilbert space. Such cluster states hold the promise for quantum error correction which can further bolster the channel robustness in long-range quantum communication.

Survey on Redundancy Based-Fault tolerance methods for Processors and Hardware accelerators - Trends in Quantum Computing, Heterogeneous Systems and Reliability

Rapid progress in CMOS technology since the late 1990s has increased the vulnerability of processors toward faults. Subsequently, the focus of computer architects has shifted toward designing fault-tolerance methods for processor architectures. Concurrently, chip designers have encountered high-order challenges for designing fault-tolerant processor architectures. For processor cores, redundancy-based fault-tolerance methods for fault detection at the core, micro-architectural, thread, and software levels are discussed. Similar applicable redundancy-based fault-tolerance methods for cache memory and hardware accelerators are also presented in the article. Recent trends in fault-tolerant quantum computing and quantum error correction are also discussed. The classification of state-of-the-art techniques presented will help researchers organize their work on established lines.