Tradeoffs for reliable quantum information storage in 2D systems

High-threshold and low-overhead fault-tolerant quantum memory

The accumulation of physical errors1-3 prevents the execution of large-scale algorithms in current quantum computers. Quantum error correction4 promises a solution by encoding k logical qubits onto a larger number n of physical qubits, such that the physical errors are suppressed enough to allow running a desired computation with tolerable fidelity. Quantum error correction becomes practically realizable once the physical error rate is below a threshold value that depends on the choice of quantum code, syndrome measurement circuit and decoding algorithm5. We present an end-to-end quantum error correction protocol that implements fault-tolerant memory on the basis of a family of low-density parity-check codes6. Our approach achieves an error threshold of 0.7% for the standard circuit-based noise model, on par with the surface code7-10 that for 20 years was the leading code in terms of error threshold. The syndrome measurement cycle for a length-n code in our family requires n ancillary qubits and a depth-8 circuit with CNOT gates, qubit initializations and measurements. The required qubit connectivity is a degree-6 graph composed of two edge-disjoint planar subgraphs. In particular, we show that 12 logical qubits can be preserved for nearly 1 million syndrome cycles using 288 physical qubits in total, assuming the physical error rate of 0.1%, whereas the surface code would require nearly 3,000 physical qubits to achieve said performance. Our findings bring demonstrations of a low-overhead fault-tolerant quantum memory within the reach of near-term quantum processors.

A superconducting quantum simulator based on a photonic-bandgap metamaterial

Synthesizing many-body quantum systems with various ranges of interactions facilitates the study of quantum chaotic dynamics. Such extended interaction range can be enabled by using nonlocal degrees of freedom such as photonic modes in an otherwise locally connected structure. Here, we present a superconducting quantum simulator in which qubits are connected through an extensible photonic-bandgap metamaterial, thus realizing a one-dimensional Bose-Hubbard model with tunable hopping range and on-site interaction. Using individual site control and readout, we characterize the statistics of measurement outcomes from many-body quench dynamics, which enables in situ Hamiltonian learning. Further, the outcome statistics reveal the effect of increased hopping range, showing the predicted crossover from integrability to ergodicity. Our work enables the study of emergent randomness from chaotic many-body evolution and, more broadly, expands the accessible Hamiltonians for quantum simulation using superconducting circuits.

Constant-Overhead Quantum Error Correction with Thin Planar Connectivity

Quantum low density parity check (LDPC) codes may provide a path to build low-overhead fault-tolerant quantum computers. However, as general LDPC codes lack geometric constraints, naïve layouts couple many distant qubits with crossing connections which could be hard to build in hardware and could result in performance-degrading crosstalk. We propose a 2D layout for quantum LDPC codes by decomposing their Tanner graphs into a small number of planar layers. Each layer contains long-range connections which do not cross. For any Calderbank-Shor-Steane code with a degree-δ Tanner graph, we design stabilizer measurement circuits with depth at most (2δ+2) using at most ⌈δ/2⌉ layers. We observe a circuit-noise threshold of 0.28% for a positive-rate code family using 49 physical qubits per logical qubit. For a physical error rate of 10^{-4}, this family reaches a logical error rate of 10^{-15} using fourteen times fewer physical qubits than the surface code.

Quantifying Nonlocality: How Outperforming Local Quantum Codes Is Expensive

Quantum low-density parity-check (LDPC) codes are a promising avenue to reduce the cost of constructing scalable quantum circuits. However, it is unclear how to implement these codes in practice. Seminal results of Bravyi et al. [Phys. Rev. Lett. 104, 050503 (2010)PRLTAO0031-900710.1103/PhysRevLett.104.050503] have shown that quantum LDPC codes implemented through local interactions obey restrictions on their dimension k and distance d. Here we address the complementary question of how many long-range interactions are required to implement a quantum LDPC code with parameters k and d. In particular, in 2D we show that a quantum LDPC code with distance d∝n^{1/2+ϵ} requires Ω(n^{1/2+ϵ}) interactions of length Ω[over ˜](n^{ϵ}). Further, a code satisfying k∝n with distance d∝n^{α} requires Ω[over ˜](n) interactions of length Ω[over ˜](n^{α/2}). As an application of these results, we consider a model called a stacked architecture, which has previously been considered as a potential way to implement quantum LDPC codes. In this model, although most interactions are local, a few of them are allowed to be very long. We prove that limited long-range connectivity implies quantitative bounds on the distance and code dimension.

Distance Bounds for Generalized Bicycle Codes

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.

Low-overhead fault-tolerant quantum computing using long-range connectivity

Vast numbers of qubits will be needed for large-scale quantum computing because of the overheads associated with error correction. We present a scheme for low-overhead fault-tolerant quantum computation based on quantum low-density parity-check (LDPC) codes, where long-range interactions enable many logical qubits to be encoded with a modest number of physical qubits. In our approach, logic gates operate via logical Pauli measurements that preserve both the protection of the LDPC codes and the low overheads in terms of the required number of additional qubits. Compared with surface codes with the same code distance, we estimate order-of-magnitude improvements in the overheads for processing around 100 logical qubits using this approach. Given the high thresholds demonstrated by LDPC codes, our estimates suggest that fault-tolerant quantum computation at this scale may be achievable with a few thousand physical qubits at comparable error rates to what is needed for current approaches.

Higher-Dimensional Quantum Hypergraph-Product Codes with Finite Rates

We describe a family of quantum error-correcting codes which generalize both the quantum hypergraph-product codes by Tillich and Zémor and all families of toric codes on m-dimensional hypercubic lattices. Parameters of the constructed codes, including the minimum distances, are given explicitly in terms of those of binary codes associated with the matrices used in the construction.

Foliated Quantum Error-Correcting Codes

We show how to construct a large class of quantum error-correcting codes, known as Calderbank-Steane-Shor codes, from highly entangled cluster states. This becomes a primitive in a protocol that foliates a series of such cluster states into a much larger cluster state, implementing foliated quantum error correction. We exemplify this construction with several familiar quantum error-correction codes and propose a generic method for decoding foliated codes. We numerically evaluate the error-correction performance of a family of finite-rate Calderbank-Steane-Shor codes known as turbo codes, finding that they perform well over moderate depth foliations. Foliated codes have applications for quantum repeaters and fault-tolerant measurement-based quantum computation.

Thresholds for Correcting Errors, Erasures, and Faulty Syndrome Measurements in Degenerate Quantum Codes

We suggest a technique for constructing lower (existence) bounds for the fault-tolerant threshold to scalable quantum computation applicable to degenerate quantum codes with sublinear distance scaling. We give explicit analytic expressions combining probabilities of erasures, depolarizing errors, and phenomenological syndrome measurement errors for quantum low-density parity-check codes with logarithmic or larger distances. These threshold estimates are parametrically better than the existing analytical bound based on percolation.

Quantum error suppression with commuting Hamiltonians: two local is too local

We consider error suppression schemes in which quantum information is encoded into the ground subspace of a Hamiltonian comprising a sum of commuting terms. Since such Hamiltonians are gapped, they are considered natural candidates for protection of quantum information and topological or adiabatic quantum computation. However, we prove that they cannot be used to this end in the two-local case. By making the favorable assumption that the gap is infinite, we show that single-site perturbations can generate a degeneracy splitting in the ground subspace of this type of Hamiltonian which is of the same order as the magnitude of the perturbation, and is independent of the number of interacting sites and their Hilbert space dimensions, just as in the absence of the protecting Hamiltonian. This splitting results in decoherence of the ground subspace, and we demonstrate that for natural noise models the coherence time is proportional to the inverse of the degeneracy splitting. Our proof involves a new version of the no-hiding theorem which shows that quantum information cannot be approximately hidden in the correlations between two quantum systems. The main reason that two-local commuting Hamiltonians cannot be used for quantum error suppression is that their ground subspaces have only short-range (two-body) entanglement.

Long-range entanglement is necessary for a topological storage of quantum information

A general inequality between entanglement entropy and a number of topologically ordered states is derived, even without using the properties of the parent Hamiltonian or the formalism of topological quantum field theory. Given a quantum state |ψ], we obtain an upper bound on the number of distinct states that are locally indistinguishable from |ψ]. The upper bound is determined only by the entanglement entropy of some local subsystems. As an example, we show that log N≤2γ for a large class of topologically ordered systems on a torus, where N is the number of topologically protected states and γ is the constant subcorrection term of the entanglement entropy. We discuss applications to quantum many-body systems that do not have any low-energy topological quantum field theory description, as well as tradeoff bounds for general quantum error correcting codes.

Classification of topologically protected gates for local stabilizer codes

Given a quantum error correcting code, an important task is to find encoded operations that can be implemented efficiently and fault tolerantly. In this Letter we focus on topological stabilizer codes and encoded unitary gates that can be implemented by a constant-depth quantum circuit. Such gates have a certain degree of protection since propagation of errors in a constant-depth circuit is limited by a constant size light cone. For the 2D geometry we show that constant-depth circuits can only implement a finite group of encoded gates known as the Clifford group. This implies that topological protection must be "turned off" for at least some steps in the computation in order to achieve universality. For the 3D geometry we show that an encoded gate U is implementable by a constant-depth circuit only if UPU(†) is in the Clifford group for any Pauli operator P. This class of gates includes some non-Clifford gates such as the π/8 rotation. Our classification applies to any stabilizer code with geometrically local stabilizers and sufficiently large code distance.

Local topological order inhibits thermal stability in 2D

We study the robustness of quantum information stored in the degenerate ground space of a local, frustration-free Hamiltonian with commuting terms on a 2D spin lattice. On one hand, a macroscopic energy barrier separating the distinct ground states under local transformations would protect the information from thermal fluctuations. On the other hand, local topological order would shield the ground space from static perturbations. Here we demonstrate that local topological order implies a constant energy barrier, thus inhibiting thermal stability.

Topological order at nonzero temperature

We propose a definition for topological order at nonzero temperature in analogy to the usual zero temperature definition that a state is topologically ordered, or "nontrivial", if it cannot be transformed into a product state (or a state close to a product state) using a local (or approximately local) quantum circuit. We prove that any two-dimensional Hamiltonian which is a sum of commuting local terms is not topologically ordered at T > 0. We show that such trivial states cannot be used to store quantum information using certain stringlike operators. This definition is not too restrictive, however, as the four dimensional toric code does have a nontrivial phase at nonzero temperature.