skip to main content

Title: New perspectives on covariant quantum error correction
Covariant codes are quantum codes such that a symmetry transformation on the logical system could be realized by a symmetry transformation on the physical system, usually with limited capability of performing quantum error correction (an important case being the Eastin–Knill theorem). The need for understanding the limits of covariant quantum error correction arises in various realms of physics including fault-tolerant quantum computation, condensed matter physics and quantum gravity. Here, we explore covariant quantum error correction with respect to continuous symmetries from the perspectives of quantum metrology and quantum resource theory, establishing solid connections between these formerly disparate fields. We prove new and powerful lower bounds on the infidelity of covariant quantum error correction, which not only extend the scope of previous no-go results but also provide a substantial improvement over existing bounds. Explicit lower bounds are derived for both erasure and depolarizing noises. We also present a type of covariant codes which nearly saturates these lower bounds.
 ;  ;  
Award ID(s):
1936118 1640959
Publication Date:
Journal Name:
Sponsoring Org:
National Science Foundation
More Like this
  1. Generalized bicycle (GB) codes is a class of quantum error-correcting codes constructed from a pair of binary circulant matrices. Unlike for other simple quantum code ansätze, unrestricted GB codes may have linear distance scaling. In addition, low-density parity-check GB codes have a naturally overcomplete set of low-weight stabilizer generators, which is expected to improve their performance in the presence of syndrome measurement errors. For such GB codes with a given maximum generator weight w, we constructed upper distance bounds by mapping them to codes local in D≤w−1 dimensions, and lower existence bounds which give d≥O(n1/2). We have also conducted an exhaustive enumeration of GB codes for certain prime circulant sizes in a family of two-qubit encoding codes with row weights 4, 6, and 8; the observed distance scaling is consistent with A(w)n1/2+B(w), where n is the code length and A(w) is increasing with w.
  2. Abstract

    We study the effectiveness of quantum error correction against coherent noise. Coherent errors (for example, unitary noise) can interfere constructively, so that in some cases the average infidelity of a quantum circuit subjected to coherent errors may increase quadratically with the circuit size; in contrast, when errors are incoherent (for example, depolarizing noise), the average infidelity increases at worst linearly with circuit size. We consider the performance of quantum stabilizer codes against a noise model in which a unitary rotation is applied to each qubit, where the axes and angles of rotation are nearly the same for all qubits. In particular, we show that for the toric code subject to such independent coherent noise, and for minimal-weight decoding, the logical channel after error correction becomes increasingly incoherent as the length of the code increases, provided the noise strength decays inversely with the code distance. A similar conclusion holds for weakly correlated coherent noise. Our methods can also be used for analyzing the performance of other codes and fault-tolerant protocols against coherent noise. However, our result does not show that the coherence of the logical channel is suppressed in the more physically relevant case where the noise strength is heldmore »constant as the code block grows, and we recount the difficulties that prevented us from extending the result to that case. Nevertheless our work supports the idea that fault-tolerant quantum computing schemes will work effectively against coherent noise, providing encouraging news for quantum hardware builders who worry about the damaging effects of control errors and coherent interactions with the environment.

    « less
  3. Abstract We study the stability with respect to a broad class of perturbations of gapped ground-state phases of quantum spin systems defined by frustration-free Hamiltonians. The core result of this work is a proof using the Bravyi–Hastings–Michalakis (BHM) strategy that under a condition of local topological quantum order (LTQO), the bulk gap is stable under perturbations that decay at long distances faster than a stretched exponential. Compared to previous work, we expand the class of frustration-free quantum spin models that can be handled to include models with more general boundary conditions, and models with discrete symmetry breaking. Detailed estimates allow us to formulate sufficient conditions for the validity of positive lower bounds for the gap that are uniform in the system size and that are explicit to some degree. We provide a survey of the BHM strategy following the approach of Michalakis and Zwolak, with alterations introduced to accommodate more general than just periodic boundary conditions and more general lattices. We express the fundamental condition known as LTQO by means of an indistinguishability radius, which we introduce. Using the uniform finite-volume results, we then proceed to study the thermodynamic limit. We first study the case of a unique limiting groundmore »state and then also consider models with spontaneous breaking of a discrete symmetry. In the latter case, LTQO cannot hold for all local observables. However, for perturbations that preserve the symmetry, we show stability of the gap and the structure of the broken symmetry phases. We prove that the GNS Hamiltonian associated with each pure state has a non-zero spectral gap above the ground state.« less
  4. Current, near-term quantum devices have shown great progress in the last several years culminating recently with a demonstration of quantum supremacy. In the medium-term, however, quantum machines will need to transition to greater reliability through error correction, likely through promising techniques like surface codes which are well suited for near-term devices with limited qubit connectivity. We discover quantum memory, particularly resonant cavities with transmon qubits arranged in a 2.5D architecture, can efficiently implement surface codes with substantial hardware savings and performance/fidelity gains. Specifically, we virtualize logical qubits by storing them in layers of qubit memories connected to each transmon. Surprisingly, distributing each logical qubit across many memories has a minimal impact on fault tolerance and results in substantially more efficient operations. Our design permits fast transversal application of CNOT operations between logical qubits sharing the same physical address (same set of cavities) which are 6x faster than standard lattice surgery CNOTs. We develop a novel embedding which saves approximately 10x in transmons with another 2x savings from an additional optimization for compactness. Although qubit virtualization pays a 10x penalty in serialization, advantages in the transversal CNOT and in area efficiency result in fault-tolerance and performance comparable to conventional 2D transmon-onlymore »architectures. Our simulations show our system can achieve fault tolerance comparable to conventional two-dimensional grids while saving substantial hardware. Furthermore, our architecture can produce magic states at 1.22x the baseline rate given a fixed number of transmon qubits. This is a critical benchmark for future fault-tolerant quantum computers as magic states are essential and machines will spend the majority of their resources continuously producing them. This architecture substantially reduces the hardware requirements for fault-tolerant quantum computing and puts within reach a proof-of-concept experimental demonstration of around 10 logical qubits, requiring only 11 transmons and 9 attached cavities in total.« less
  5. Abstract The transfer of information between quantum systems is essential for quantum communication and computation. In quantum computers, high connectivity between qubits can improve the efficiency of algorithms, assist in error correction, and enable high-fidelity readout. However, as with all quantum gates, operations to transfer information between qubits can suffer from errors associated with spurious interactions and disorder between qubits, among other things. Here, we harness interactions and disorder between qubits to improve a swap operation for spin eigenstates in semiconductor gate-defined quantum-dot spins. We use a system of four electron spins, which we configure as two exchange-coupled singlet–triplet qubits. Our approach, which relies on the physics underlying discrete time crystals, enhances the quality factor of spin-eigenstate swaps by up to an order of magnitude. Our results show how interactions and disorder in multi-qubit systems can stabilize non-trivial quantum operations and suggest potential uses for non-equilibrium quantum phenomena, like time crystals, in quantum information processing applications. Our results also confirm the long-predicted emergence of effective Ising interactions between exchange-coupled singlet–triplet qubits.