Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.34399

Pauli-ball discrepancy and stability of quantum codes

Aryeh Lev Zabokritskiy "Yohananov"

quant-phSubmitted Oct 25, 2026• Announced Oct 27, 2026• 0 citations
arXivHTMLPDF

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.

No sign of AI-generated textUnclear noveltyMissing comparison

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

Related papers

Stability of Quantum LDPC States under Local Pauli Noise

Tai-Hsuan Yang, Andrew D. Kim, Akash Vijay +1 more

Quantum low-density parity-check (qLDPC) codes have a canonical mixed state---the normalized projector onto the code space---that lies at the intersection of quantum error correction and quantum many-body physics, yet the stability of its information-theoretic structure under local noise remains poorly understood. Recent progress on mixed-state phases of matter has identified the spatial decay of conditional mutual information (CMI) $I(A:C|B)$ as a key diagnostic of such stability, analogous to the role of the spectral gap for quantum ground states. We prove that, for the normalized code-projector state of a $\mathbb{Z}_d$ qLDPC stabilizer code under local Pauli noise, the CMI across a buffer $B$ separating $A$ from $C$ decays exponentially with the width of $B$ in two complementary noise regimes independent of system size. At weak noise, this holds for full-system tripartitions, where correlations between the two sides require an error cluster to cross the buffer, an exponentially unlikely event. At strong noise, exponential decay holds whenever the buffer supports no logical operator, since correlations can persist only along rare chains of buffer qudits that remain informative. Under an additional space-uniformity assumption, we establish the robustness of Levin--Wen topological entropy. On finite-dimensional lattices of size $n$, the weak-noise bound further implies a constant-layer quasi-local Petz recovery channel of range $O(\poly(\log n)/\varepsilon)$ that recovers the noiseless state within trace-distance error $\varepsilon$. Both CMI bounds apply to general qLDPC interaction graphs, including geometries where such constant-depth quasi-local recovery need not exist. Thus, the exponential decay of the noise-induced CMI provides a general criterion for mixed-state phase stability.

quant-pharXiv:2610.22357•Oct 16, 2026•1 citation

Proof of a positive coherent-error threshold for topological quantum codes

Shiro Tamiya, Masato Koashi

Threshold analyses of quantum error-correcting codes are well established for stochastic error models, in which errors occur randomly with given probabilities. However, errors in actual devices can also be coherent, such as unwanted $Z$ rotations due to imperfect control, which are not captured by stochastic error models. For the surface code, numerical studies have indicated threshold behavior even under coherent errors, but a rigorous proof of threshold existence is lacking. Here we prove that a positive threshold for coherent $Z$-rotation errors exists for quantum low-density parity-check codes with a bounded number of logical qubits, including the surface code and other topological codes. Specifically, we show that the maximum-likelihood Pauli recovery suppresses the entanglement infidelity exponentially in the code distance up to a prefactor linear in the number of physical qubits whenever the rotation angles lie below a constant that is independent of the code size. The proof combines Fourier analysis to retain the interference among the amplitudes of coherent errors with the cluster expansion of abstract polymer models. Our results expand the theoretical foundation of quantum error correction and offer a statistical-mechanical description of quantum error correction beyond stochastic errors.

quant-pharXiv:2609.20708•Sep 18, 2026•1 citation

Coherent error threshold for quantum LDPC codes

Zhengyi Han, Yuanchen Zhao, Yijia Xu +2 more

A key appeal of quantum low-density parity check (qLDPC) codes is their ability to suppress stochastic Pauli noise below nonzero thresholds. Coherent errors are fundamentally different: they produce superpositions of error patterns whose amplitudes can interfere even after syndrome measurement. Rigorous understanding of coherent errors remains limited. Here we show that general qLDPC codes admit a nonzero code capacity threshold against local coherent noise and more generally local channel noise. For any family of qLDPC codes with distance $d=Ω(\log n)$, we show that there is a constant noise strength below which the logical recovery error in diamond distance decays exponentially with the code distance. The result is established for optimal recovery as well as the minimum-weight decoder. The key technical ingredient is what we call a \emph{cluster resummation}: rather than bounding superposed error configurations one by one, we isolate a large connected error cluster in the channel expansion and exactly resum all errors disconnected from it before taking norms. Standard cluster counting then yields exponential suppression. This work resolves a longstanding challenge in fault tolerance theory, providing general robustness guarantees for qLDPC codes against coherent noise and laying a rigorous foundation for future studies of fault-tolerant quantum technologies.

quant-pharXiv:2609.20537•Sep 18, 2026•1 citation

Error-correcting codes and absolutely maximally entangled states for mixed-dimensional Hilbert spaces

Simeon Ball, Raven Zhang

A major difficulty in quantum computation is the ability to implement fault tolerant computations, protecting information against undesired interactions with the environment. Stabiliser codes were introduced as a means to protect information when storing or applying computations in Hilbert spaces where the local dimension is fixed, i.e. in Hilbert spaces of the form $({\mathbb C}^D)^{\otimes n}$. If $D$ is a prime power then one can consider stabiliser codes over finite fields \cite{KKKS2006}, which allows a deeper mathematical structure to be used to develop stabiliser codes. However, there is no practical reason that the subsystems should have the same local dimension and in this article we introduce a stabiliser formalism for mixed dimensional Hilbert spaces, i.e. of the form ${\mathbb C}^{D_1} \otimes \cdots \otimes {\mathbb C}^{D_n}$. More generally, we define and prove a Singleton bound for quantum error-correcting codes of mixed dimensional Hilbert spaces. We redefine entanglement measures for these Hilbert spaces and follow \cite{HESG2018} and define absolutely maximally entangled states as states which maximise this entanglement measure. We provide examples of absolutely maximally entangled states in spaces of dimensions not previously known to have absolutely maximally entangled states.

arXiv:2510.17231•Physical Review A•Dec 23, 2025•3 citations

Proof of a positive coherent-error threshold for topological quantum codes — E8 Intelligence Research

Andrew Stewart Caldin

Threshold analyses of quantum error-correcting codes are well established for stochastic error models, in which errors occur randomly with given probabilities. However, errors in actual devices can also be coherent, such as unwanted $Z$ rotations due to imperfect control, which are not captured by stochastic error models. For the surface code, numerical studies have indicated threshold behavior even under coherent errors, but a rigorous proof of threshold existence is lacking. Here we prove that a positive threshold for coherent $Z$-rotation errors exists for quantum low-density parity-check codes with a bounded number of logical qubits, including the surface code and other topological codes. Specifically, we show that the maximum-likelihood Pauli recovery suppresses the entanglement infidelity exponentially in the code distance up to a prefactor linear in the number of physical qubits whenever the rotation angles lie below a constant that is independent of the code size. The proof com Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 7, 2026•0 citations

Degenerate quantum codes and the quantum channel capacity problem

Graeme Smith, John A. Smolin

A striking feature of quantum error correcting codes is that they can sometimes be used to correct more errors than they can uniquely identify. Indeed, such degenerate codes are known to outperform all non-degenerate codes for very noisy quantum channels. As a result, rather than being chosen randomly according to some i.i.d. distribution, capacity achieving quantum codes must be chosen in a highly structured fashion. While there is no systematic understanding of how to design such codes, I will describe our best understanding of the problem. I will also briefly discuss a single-letter upper bound on the quantum capacity and its relation to the capacitypsilas possible additivity.

IEEE Information Theory Workshop (ITW)•May 1, 2008•0 citations
The Pauli-ball discrepancy, a quadratic discrepancy summed over all error radii, measures how uniformly the Pauli error images of a KKK-dimensional quantum code cover the ddd-dimensional Hilbert space. At parameters attaining equality in the quantum Singleton bound with minimum code distance ≥3\geq3≥3, 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 eee below half the target distance and size VeV_eVe​, this remainder linearly bounds the squared Hilbert--Schmidt distance of the error-image Gram matrix from the identity. When KVe≤dKV_e\leq dKVe​≤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.
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-KKK code projector in dimension ddd.
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 eee below half the target distance, containing VeV_eVe​ Pauli errors, the remainder bounds the squared Hilbert–Schmidt deviation of the error-image Gram matrix from identity. When KVe≤dKV_e\leq dKVe​≤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.
Quantum low-density parity-check (qLDPC) codes have a canonical mixed state---the normalized projector onto the code space---that lies at the intersection of quantum error correction and quantum many-body physics, yet the stability of its information-theoretic structure under local noise remains poorly understood. Recent progress on mixed-state phases of matter has identified the spatial decay of conditional mutual information (CMI) I(A:C∣B)I(A:C|B)I(A:C∣B) as a key diagnostic of such stability, analogous to the role of the spectral gap for quantum ground states. We prove that, for the normalized code-projector state of a Zd\mathbb{Z}_dZd​ qLDPC stabilizer code under local Pauli noise, the CMI across a buffer BBB separating AAA from CCC decays exponentially with the width of BBB in two complementary noise regimes independent of system size. At weak noise, this holds for full-system tripartitions, where correlations between the two sides require an error cluster to cross the buffer, an exponentially unlikely event. At strong noise, exponential decay holds whenever the buffer supports no logical operator, since correlations can persist only along rare chains of buffer qudits that remain informative. Under an additional space-uniformity assumption, we establish the robustness of Levin--Wen topological entropy. On finite-dimensional lattices of size nnn, the weak-noise bound further implies a constant-layer quasi-local Petz recovery channel of range $O(\poly(\log n)/\varepsilon)$ that recovers the noiseless state within trace-distance error ε\varepsilonε. Both CMI bounds apply to general qLDPC interaction graphs, including geometries where such constant-depth quasi-local recovery need not exist. Thus, the exponential decay of the noise-induced CMI provides a general criterion for mixed-state phase stability.
Threshold analyses of quantum error-correcting codes are well established for stochastic error models, in which errors occur randomly with given probabilities. However, errors in actual devices can also be coherent, such as unwanted ZZZ rotations due to imperfect control, which are not captured by stochastic error models. For the surface code, numerical studies have indicated threshold behavior even under coherent errors, but a rigorous proof of threshold existence is lacking. Here we prove that a positive threshold for coherent ZZZ-rotation errors exists for quantum low-density parity-check codes with a bounded number of logical qubits, including the surface code and other topological codes. Specifically, we show that the maximum-likelihood Pauli recovery suppresses the entanglement infidelity exponentially in the code distance up to a prefactor linear in the number of physical qubits whenever the rotation angles lie below a constant that is independent of the code size. The proof combines Fourier analysis to retain the interference among the amplitudes of coherent errors with the cluster expansion of abstract polymer models. Our results expand the theoretical foundation of quantum error correction and offer a statistical-mechanical description of quantum error correction beyond stochastic errors.
A key appeal of quantum low-density parity check (qLDPC) codes is their ability to suppress stochastic Pauli noise below nonzero thresholds. Coherent errors are fundamentally different: they produce superpositions of error patterns whose amplitudes can interfere even after syndrome measurement. Rigorous understanding of coherent errors remains limited. Here we show that general qLDPC codes admit a nonzero code capacity threshold against local coherent noise and more generally local channel noise. For any family of qLDPC codes with distance d=Ω(log⁡n)d=Ω(\log n)d=Ω(logn), we show that there is a constant noise strength below which the logical recovery error in diamond distance decays exponentially with the code distance. The result is established for optimal recovery as well as the minimum-weight decoder. The key technical ingredient is what we call a \emph{cluster resummation}: rather than bounding superposed error configurations one by one, we isolate a large connected error cluster in the channel expansion and exactly resum all errors disconnected from it before taking norms. Standard cluster counting then yields exponential suppression. This work resolves a longstanding challenge in fault tolerance theory, providing general robustness guarantees for qLDPC codes against coherent noise and laying a rigorous foundation for future studies of fault-tolerant quantum technologies.
A major difficulty in quantum computation is the ability to implement fault tolerant computations, protecting information against undesired interactions with the environment. Stabiliser codes were introduced as a means to protect information when storing or applying computations in Hilbert spaces where the local dimension is fixed, i.e. in Hilbert spaces of the form (CD)⊗n({\mathbb C}^D)^{\otimes n}(CD)⊗n. If DDD is a prime power then one can consider stabiliser codes over finite fields \cite{KKKS2006}, which allows a deeper mathematical structure to be used to develop stabiliser codes. However, there is no practical reason that the subsystems should have the same local dimension and in this article we introduce a stabiliser formalism for mixed dimensional Hilbert spaces, i.e. of the form CD1⊗⋯⊗CDn{\mathbb C}^{D_1} \otimes \cdots \otimes {\mathbb C}^{D_n}CD1​⊗⋯⊗CDn​. More generally, we define and prove a Singleton bound for quantum error-correcting codes of mixed dimensional Hilbert spaces. We redefine entanglement measures for these Hilbert spaces and follow \cite{HESG2018} and define absolutely maximally entangled states as states which maximise this entanglement measure. We provide examples of absolutely maximally entangled states in spaces of dimensions not previously known to have absolutely maximally entangled states.
Threshold analyses of quantum error-correcting codes are well established for stochastic error models, in which errors occur randomly with given probabilities. However, errors in actual devices can also be coherent, such as unwanted ZZZ rotations due to imperfect control, which are not captured by stochastic error models. For the surface code, numerical studies have indicated threshold behavior even under coherent errors, but a rigorous proof of threshold existence is lacking. Here we prove that a positive threshold for coherent ZZZ-rotation errors exists for quantum low-density parity-check codes with a bounded number of logical qubits, including the surface code and other topological codes. Specifically, we show that the maximum-likelihood Pauli recovery suppresses the entanglement infidelity exponentially in the code distance up to a prefactor linear in the number of physical qubits whenever the rotation angles lie below a constant that is independent of the code size. The proof com Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
A striking feature of quantum error correcting codes is that they can sometimes be used to correct more errors than they can uniquely identify. Indeed, such degenerate codes are known to outperform all non-degenerate codes for very noisy quantum channels. As a result, rather than being chosen randomly according to some i.i.d. distribution, capacity achieving quantum codes must be chosen in a highly structured fashion. While there is no systematic understanding of how to design such codes, I will describe our best understanding of the problem. I will also briefly discuss a single-letter upper bound on the quantum capacity and its relation to the capacitypsilas possible additivity.