arXiv:2610.34399
Pauli-ball discrepancy and stability of quantum codes
Aryeh Lev Zabokritskiy "Yohananov"
Abstract
The Pauli-ball discrepancy, a quadratic discrepancy summed over all error radii, measures how uniformly the Pauli error images of a $K$-dimensional quantum code cover the $d$-dimensional Hilbert space. At parameters attaining equality in the quantum Singleton bound with minimum code distance $\geq3$, or in the one-error Hamming bound with prime-power local dimension, the discrepancy of every projector of the prescribed rank equals an explicit benchmark plus an exact nonnegative remainder, which vanishes precisely for pure quantum maximum-distance-separable codes and nondegenerate perfect codes, respectively. For a Pauli ball of radius $e$ below half the target distance and size $V_e$, this remainder linearly bounds the squared Hilbert--Schmidt distance of the error-image Gram matrix from the identity. When $KV_e\leq d$, it linearly bounds the diamond error and entanglement infidelity of a noise-independent polar recovery under any noise in that ball's span. For five qubits, we obtain the sharp rank-two Gram constant and exact logical channels of rotated codes attaining this linear order in diamond error. For pure states, the discrepancy equals a pure-state benchmark plus a positive weighted sum of marginal-purity defects, so absolutely maximally entangled states, when they exist, are exactly the minimizers.
AI Summary
The paper studies whether uniform coverage of Hilbert space by Pauli error images characterizes optimal quantum codes, and whether deviations from uniformity control approximate error correction. Its proposed quantity, Pauli-ball discrepancy, is a quadratic discrepancy summed over error radii for a rank-$K$ code projector in dimension $d$. At parameters saturating the quantum Singleton bound with target distance at least three, or the one-error quantum Hamming bound with prime-power local dimension, the stated result decomposes discrepancy into an explicit benchmark plus an exact nonnegative remainder. The remainder vanishes precisely for pure quantum maximum-distance-separable codes and nondegenerate perfect codes, respectively. For an error ball of radius $e$ below half the target distance, containing $V_e$ Pauli errors, the remainder bounds the squared Hilbert–Schmidt deviation of the error-image Gram matrix from identity. When $KV_e\leq d$, it also bounds diamond error and entanglement infidelity linearly for a noise-independent polar recovery, uniformly over noise whose Kraus operators lie in the ball’s span. For five qubits, the paper reports a sharp rank-two Gram constant and exact logical channels for rotated codes exhibiting linear-order diamond error. For pure states, a decomposition into positive weighted marginal-purity defects identifies absolutely maximally entangled states as minimizers whenever they exist. The supplied text contains only the abstract and LaTeX preamble; proof methods, explicit constants, and further stated limitations cannot be assessed from it.
Central claim may not hold: The supplied source contains only a preamble, leaving all substantive claims in the abstract unsupported and unverifiable within the provided paper.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 47 pages