Good approximate quantum LDPC codes from spacetime circuit Hamiltonians

Abstract

We study approximate quantum low-density parity-check (QLDPC) codes, which are approximate quantum error-correcting codes specified as the ground space of a frustration-free local Hamiltonian, whose terms do not necessarily commute. Such codes generalize stabilizer QLDPC codes, which are exact quantum error-correcting codes with sparse, low-weight stabilizer generators (i.e. each stabilizer generator acts on a few qubits, and each qubit participates in a few stabilizer generators). Our investigation is motivated by an important question in Hamiltonian complexity and quantum coding theory: do stabilizer QLDPC codes with constant rate, linear distance, and constant-weight stabilizers exist?We show that obtaining such optimal scaling of parameters (modulo polylogarithmic corrections) is possible if we go beyond stabilizer codes: we prove the existence of a family of [[N, k, d, ε]] approximate QLDPC codes that encode k = Ω(N) logical qubits into N physical qubits with distance d = Ω(N) and approximation infidelity ε = O(1/ polylog(N)). The code space is stabilized by a set of 10-local noncommuting projectors, with each physical qubit only participating in O(polylog N) projectors. We prove the existence of an efficient encoding map and show that the spectral gap of the code Hamiltonian scales as Ω(N −3.09 ). We also show that arbitrary Pauli errors can be locally detected by circuits of polylogarithmic depth.Our family of approximate QLDPC codes is based on applying a recent connection between circuit Hamiltonians and approximate quantum codes (Nirkhe, et al., ICALP 2018) to a result showing that random Clifford circuits of polylogarithmic depth yield asymptotically good quantum codes (Brown and Fawzi, ISIT 2013). Then, in order to obtain a code with sparse checks and strong detection of local errors, we use a spacetime circuit Hamiltonian construction in order to take advantage of the parallelism of the Brown-Fawzi circuits.The analysis of the spectral gap of the code Hamiltonian is the main technical contribution of this work. We show that for any depth D quantum circuit on n qubits there is an associated spacetime circuit-to-Hamiltonian construction with spectral gap Ω(n −3.09 D −2 log −6 (n)). To lower bound this gap we use a Markov chain decomposition method to divide the state space of partially completed circuit configurations into overlapping subsets corresponding to uniform circuit segments of depth log n, which are based on bitonic sorting circuits. We use the combinatorial properties of these circuit configurations to show rapid mixing between the subsets, and within the subsets we develop a novel isomorphism between the local update Markov chain on bitonic circuit configurations and the edge-flip Markov chain on equal-area dyadic tilings, whose mixing time was recently shown to be polynomial (Cannon, Levin, and Stauffer, RANDOM 2017). Previous lower bounds on the spectral gap of spacetime circuit Hamiltonians have all been based on a connection to exactly solvable quantum spin chains and applied only to ...

Approximate Bacon-Shor code and holography

“…Therefore, it is worthwhile to explore whether such approaches can be used to generate codes that have special properties in encoding/decoding, error detection and correction. It is also interesting to establish connections with existing codes that are somewhat graphical in nature, such as low-density parity-check codes and variants [96][97][98].…”

Balanced Product Quantum Codes

“…where δS = {{u, v} ∈ X 1 | u ∈ S, v ∈ X 0 − S} is the set of edges connecting S with its complement. 4 When h(X) is small it means that we can disconnect a relatively large number of vertices (those in S) from the rest of the graph by removing a relatively small number of edges (those in δS).…”

“…Their codes are derived from fiber bundles over the torus T 2 . The fibers are hyperbolic surfaces twisted along geodesics, giving rise to a quantum code family with distance 4 √ log N √ N . Evra-Kaufman-Zémor [6] and Kaufman-Tessler [7] further improved this to √ log N √ N and log k (N ) √ N , respectively.…”

“…It has sparse gauge operators but it is not LDPC. There are other interesting constructions using a mapping of quantum circuits to Hamiltonians [3] where the LDPC condition is slightly weakened, see [4].…”

Quantum error-detection at low energies

“…When the spatial dimension d ≥ 2, there are ground spaces that have topological order, e.g. Toric code, and even for higher dimensions good quantum LDPC codes are shown to exist in the ground space of frustration free Hamiltonians [76]. 6 A simple yet illustrative example of the excitation ansatz states is the following.…”