arXiv:2610.04834
Quantum codes in the Lee metric
Jinkang Guo, Yiqiu Han, Aranya Chakraborty, Shubham P. Jain, Tianhao Liu, Victor V. Albert, Andrew Lucas
Abstract
We introduce a quantum coding framework for discrete small-shift noise, in which errors on qudits are modeled as low-weight $X$- and $Z$-type Pauli shifts, analogous to small phase-space displacements in continuous-variable systems. This structure is approximately respected by nuclear-spin noise and captured by the Lee metric, motivating a quantum extension of classical Lee-metric coding theory. We develop such a formalism for stabilizer codes over $\mathbb{Z}_q$ for arbitrary $q$, using joint and separate Lee metrics for the $X$- and $Z$-components of errors. For qubits, the joint metric counts $Y$ errors twice and can yield codes that detect and correct $X$ and $Z$ errors with fewer physical qubits than codes designed for the conventional Hamming metric. We discuss Lee-weight spreading under Clifford gates and qubitize codes over $\mathbb{Z}_4$ via the Gray map, finding codes with two-fold transversal non-qubit-Clifford gates. For quantum CSS Lee-LDPC codes on $n$ qudits, we prove that the Lee distance cannot exceed $O(n)$, uniformly in $q$, demonstrating an unexpected obstruction to using the large internal Hilbert space of a large-$q$ qudit to make high-Lee-distance codes. Under local Metropolis dynamics, certain classical $q$-ary ``helical repetition codes'' have exponentially long memory times at fixed temperature for sufficiently large $q$ (that grows with system length), which can be understood as spontaneous symmetry breaking at finite temperature, even in local one-dimensional models. Hypergraph products of these helical repetition codes provide local two-dimensional quantum codes that inherit self-correction for $Z$ errors, but self-correction for $X$ errors remains an open question.
AI Summary
The paper asks how quantum codes should be characterized when elementary qudit errors are small clock and shift operations, rather than arbitrary single-qudit Paulis. It develops stabilizer and CSS coding over $\mathbb Z_q$, including composite $q$, using Lee weight: the cyclic magnitude of Pauli exponents. Joint weight sums the $X$ and $Z$ contributions; separate weight treats them independently. Spin-noise expansions motivate this model, while retaining nonzero higher-weight tails. Results include sphere-packing bounds, perfect-code constructions, Smith-normal-form descriptions of logical spaces with torsion, and a correspondence with multimode GKP codes. Exhaustive optimization of qubit stabilizer codes through nine qubits finds joint-Lee-distance examples $[[6,1,4]]$ and $[[9,1,5]]$, where $Y$ counts twice. A unitary Gray map converts $\mathbb Z_4$ codes into qubit codes, including nonadditive $((14,4,4))$ and $((46,4,10))$ codes with two-qubit-transversal non-Clifford gates. Clifford error amplification is characterized by the maximum Lee weight of a symplectic-matrix column; transversality alone does not guarantee Lee-noise fault tolerance. For Lee-LDPC codes with bounded row and column Lee weights independent of $n,q$, geometry-of-numbers transference gives distance $O(n)$ uniformly in $q$; CSS codes also have a nontrivial logical operator with energy barrier $O(n)$. Classical local helical repetition codes have exponentially long memory under single-site $\pm1$ Metropolis dynamics at fixed temperature with growing $q$. Their two-dimensional hypergraph products inherit exponential protection for $Z$ errors when $q\gg n^2\log q$, with $n$ the linear size. Protection of both quantum error sectors remains open. Circuit-level performance and suitable syndrome-extraction circuits are not established.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.