Arbitrary-Distance Quantum Error Correction with Gauss's Law for $\mathbb Z_2$ Lattice Gauge Theory
TL;DR
Compared to using a domain-agnostic code for every lattice degree of freedom, this work finds that the Gauss's law code primarily excels at reducing the locality of the encoded Hamiltonian.
Abstract
It has previously been shown by Rajput, Roggero, and Wiebe that $\mathbb Z_2$ Gauss's law constraints can be used to build efficient quantum error-correcting codes (QECCs) that are robust against arbitrary single-qubit errors. In this work, we generalize the construction to be robust against arbitrary $t$-qubit errors, where $t$ is any positive integer. This includes a derivation of the optimal Gauss's law code within the considered family by minimizing the number of physical qubits required for a given code distance. Finally, we compare our codes against other efficient QECCs on metrics such as the number of physical qubits, the locality of the encoded Hamiltonian, and the logical error rate in the code capacity setting. Compared to using a domain-agnostic code for every lattice degree of freedom, we find that the Gauss's law code primarily excels at reducing the locality of the encoded Hamiltonian. Moreover, the physical qubit overhead is also reduced for $t \le 3$ (distance $d \le 7$).