Title Complementarity and Rigidity of Rank-Two Quantum Codes under Collective and Differential Dephasing Description This preprint studies rank-two quantum codes in a two-qubit Hilbert space under the dephasing generators $$L_{+}=Z_{1}+Z_{2},\qquad L_{-}=Z_{1}-Z_{2},$$ which represent collective and differential phase noise. For an isometric encoding $V:\mathbb{C}^{2}\to\mathbb{C}^{4}$, the paper introduces uniform scalar-compression defects $\Delta_{+}(V)$ and $\Delta_{-}(V)$ for the corresponding unitary error families. The main result is the sharp complementarity inequality $$\Delta_{+}(V)+\Delta_{-}(V)\ge 1.$$ Equality holds exactly when the code subspace is isoclinic to the even-parity sector. The paper also determines the complete attainable defect region: $$\mathcal{R}=\{(\Delta_{+}(V),\Delta_{-}(V)):V^\dagger V=I_2\}=\{(x,y)\in[0,1]^2:x+y\ge 1\}.$$ An explicit rank-two code is constructed for every point in this region. A complete metric analysis of the saturating code family is obtained. If $d_{\mathrm{sat}}(V)$ denotes the operator-norm distance from the code projector to the saturating family, then $$d_{\mathrm{sat}}(V)=\sin\left(\frac{\theta_{2}-\theta_{1}}{2}\right),$$ where $\theta_{1}\le\theta_{2}$ are the principal angles between the code subspace and the even-parity sector. The complementarity excess $$\delta(V)=\Delta_{+}(V)+\Delta_{-}(V)-1$$ satisfies the sharp global rigidity inequality $$\delta(V)\ge 2d_{\mathrm{sat}}(V)^{2},$$ with optimal stability constant $1/\sqrt{2}$. For binary random-unitary branch channels, the geometric defects are connected to operational quantum-error-correction quantities. The environment leakage is computed exactly as $$\mathcal{L}_{p,U}(V)=\sqrt{p(1-p)},\operatorname{diam}W!\left(V^{\dagger}UV\right),$$ where $W(\cdot)$ denotes the numerical range. Quantitative lower and upper bounds are then established for the individually optimized worst-case recovery error. The collective and differential dephasing mechanisms considered here are established physical noise models. The contribution of this work is their joint scalar-compression geometry for arbitrary rank-two codes, including the exact orientation envelope, equality classification, complete attainable region, exact metric projection, sharp global rigidity, and an operational environment-leakage bridge.
Title Complementarity and Rigidity of Rank-Two Quantum Codes under Collective and Differential Dephasing Description This preprint studies rank-two quantum codes in a two-qubit Hilbert space under the dephasing generators L+=Z1+Z2,L−=Z1−Z2, which represent collective and differential phase noise. For an isometric encoding V:C2→C4, the paper introduces uniform scalar-compression defects Δ+(V) and Δ−(V) for the corresponding unitary error families. The main result is the sharp complementarity inequality Δ+(V)+Δ−(V)≥1. Equality holds exactly when the code subspace is isoclinic to the even-parity sector. The paper also determines the complete attainable defect region: R={(Δ+(V),Δ−(V)):V†V=I2}={(x,y)∈[0,1]2:x+y≥1}. An explicit rank-two code is constructed for every point in this region. A complete metric analysis of the saturating code family is obtained. If dsat(V) denotes the operator-norm distance from the code projector to the saturating family, then dsat(V)=sin(2θ2−θ1), where θ1≤θ2 are the principal angles between the code subspace and the even-parity sector. The complementarity excess δ(V)=Δ+(V)+Δ−(V)−1 satisfies the sharp global rigidity inequality δ(V)≥2dsat(V)2, with optimal stability constant 1/2. For binary random-unitary branch channels, the geometric defects are connected to operational quantum-error-correction quantities. The environment leakage is computed exactly as Lp,U(V)=p(1−p),diamW!(V†UV), where W(⋅) denotes the numerical range. Quantitative lower and upper bounds are then established for the individually optimized worst-case recovery error. The collective and differential dephasing mechanisms considered here are established physical noise models. The contribution of this work is their joint scalar-compression geometry for arbitrary rank-two codes, including the exact orientation envelope, equality classification, complete attainable region, exact metric projection, sharp global rigidity, and an operational environment-leakage bridge.
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 ≥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 e below half the target distance and size Ve, this remainder linearly bounds the squared Hilbert--Schmidt distance of the error-image Gram matrix from the identity. When KVe≤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.
We study the reconstruction of a qubit factor from global operator relations without presupposing a tensor-product structure. Given two Hermitian operators (A,B) on an unpartitioned finite-dimensional Hilbert space, we quantify how approximate involution and anticommutation relations,[|A^2-I|,\qquad |B^2-I|,\qquad |{A,B}|,]control the existence of a nearby exact same-space qubit representation. The construction is explicit and yields quantitative upper and lower bounds relating observable relation defects to distance from an exact marked qubit factor. A central obstruction is then exhibited: arbitrarily small perturbations of an exact qubit-factor pair can generate the full ambient matrix algebra, causing the exact commutant of the raw operators to collapse discontinuously from the complementary matrix factor to the scalars. Thus exact-algebra or exact-commutant reconstruction from noisy operators is intrinsically unstable. Despite this discontinuity, the complementary factor remains quantitatively recoverable from a soft commutant. For the commutator map associated with an exact rounded pair, we determine the complete singular-value structure and use its fixed spectral separation to control the low-singular-value subspace of the original unrounded operators. If[\rho=2\sqrt{p^2+q^2}<1,]where (p) and (q) bound the same-space rounding errors, the reconstructed complementary subspace satisfies[\left|P_{\widehat{\mathcal C}}-P_{\mathcal A’}\right|_{2\to2}\le\frac{\rho}{2-\rho},]while the observed spectral gap is at least (2-2\rho). Composing the rounding bounds with the relation defects gives an explicit relation-defect-to-complement certificate. The results separate three notions that coincide only in the noiseless idealization: exact generated algebra, exact commutant, and robustly recoverable complementary factor structure. The paper also clarifies the distinction between factor existence and tensor-product-structure uniqueness and positions the result relative to stability of approximate qubit relations, almost-commuting operator algebras, finite-dimensional (C^*)-algebra stability, and numerical commutant reconstruction.
Overview This preprint develops a finite-history framework for quantifying how coherently stored environment records reveal logical quantum information. Instead of considering only which error occurred, the analysis treats the full complementary environment channel associated with a labeled family of finite quantum-error histories. For two selected history labels, the leakage is expressed exactly through the numerical-range diameter of the compressed relative operator. This yields global finite-history compression bounds, a zero-leakage characterization equivalent to Knill–Laflamme scalarity, and lower and upper bounds for recovery by a single common channel. Main results For a balanced independent two-step dephasing model on one logical qubit encoded into two physical qubits, the paper solves the worst-case optimization over the full rank-two code Grassmannian: infV∈Gr(2,4)supϕ,ψLhist(V)=21. The transverse leakage is determined exactly by Ltr(η,t)=max{21,2η,41−η21+t}. All global minimizers are classified. Besides the parity-isoclinic orthogonal-axis family, the minimizer set contains a genuine non-isoclinic region characterized by 0<η≤41,ez=oz=0,∣e⋅o∣≤1−4η24η2. A universal quartic inequality needed for the all-code theorem is reduced analytically to an exact polynomial-positivity problem and closed using rational Bernstein-basis verification. Distributional stability On a fixed labeled history-operator family, the complementary channel, worst-parameter leakage, and all-code minimax value are Lipschitz-stable under changes of the history probability distribution. With dA(p,q)=[∑h(ph−qh)2]1/2, the minimax value satisfies ∣Λ(p)−Λ(q)∣≤2dA(p,q). Consequently, key quantitative implications of the balanced complete solution—including the minimax value, principal near-minimizer coordinate constraints, and a universal operational recovery lower bound—remain stable under nearby biased or correlated perturbations.
Molecular spin systems exhibit a natural hierarchy of decoherence channels: fast pure dephasing (characterized by the transverse relaxation time T₂) and comparatively slow energy relaxation (characterized by T₁). A recent proposal argues that fault-tolerant quantum computing with molecules requires a hybrid two-level encoding: a first-level *dephasing-tolerant unit* (DTU) that suppresses the leading pure-dephasing channel, followed by a second-level multi-qubit code that corrects residual off-diagonal (relaxation-like) errors [1,2]. This paper provides an independent quantitative assessment of that scheme. Using assumed representative parameters (T₂ = 100 μs, T₁ = 10 ms, within ranges reported in the experimental molecular-spin-qubit literature), a projected dephasing suppression factor S = 100 (an assumption, not a value reported in [1]), and a 1 μs correction cycle, we derive an explicit logical error probability of 2.9998 × 10⁻⁸ per cycle (Γ_L = 2.9998 × 10⁻² s⁻¹, six physical spins per logical qubit) for a three-unit repetition code, valid only when S ≫ R, because the repetition code leaves residual dephasing uncorrected; at S = R the uncorrected single-Z channel contributes p_L = 1 − (1 − p_Z)³ ≈ 2.9997 × 10⁻⁴ per cycle (Γ_L ≈ 2.9997 × 10² s⁻¹). We further derive the *hierarchy condition*: the first-level suppression must satisfy S ≥ γ_φ/γ₁; with our parameters the equality S = γ_φ/γ₁ = 100 holds exactly, placing the scheme at the threshold where residual dephasing and relaxation contribute equally in the correctable relaxation channel. A computed comparison with a five-qubit outer code, which also corrects single Z errors (P_fail ≈ 4.5 × 10⁻⁷ per cycle, Γ_L ≈ 0.45 s⁻¹, 10 physical spins), shows the five-qubit code is preferable at S = R. We identify failure modes, falsifiable predictions, and open questions regarding synthesis and correlated noise. ## 1. Introduction Quantum information processing demands physical platforms combining long coherence times wit Full text and updates: papers.qnfo.org/papers/beyond-pure-dephasing-a-quantitative-analysis-of-two-level-error-correction-for-/
One of the last open problems concerning two qubits in a pure state is to find the exact local content of their correlation, in the sense of Elitzur, Popescu, and Rohrlich (EPR2) [A. C. Elitzur, S. Popescu, and D. Rohrlich, Phys. Lett. A162, 25 (1992)]. We propose an EPR2 decomposition that allows us to prove, for a wide range of states $|\ensuremath{\psi}(\ensuremath{\theta})\ensuremath{\rangle}=\mathrm{cos}\ensuremath{\theta}|00\ensuremath{\rangle}+\mathrm{sin}\ensuremath{\theta}|11\ensuremath{\rangle}$, that their local content is $\overline{{p}_{L}}(\ensuremath{\theta})=\mathrm{cos}2\ensuremath{\theta}$. We also share reflections on how to possibly extend this result to all two-qubit pure states.
## Overview This paper studies when a reduction of a finite quantum error-history model preserves the local direction of quantum-code optimization, and when it reverses that direction. For finite coactive spectral branches, the paper first proves a second-order local truncation-safety certificate. A strict optimizer of a truncated model persists when the full-versus-truncated effective-jet discrepancy is smaller than the coercivity margin of the truncated objective. Opposite leading jets provide a certificate of local optimizer reversal. The paper then identifies an exact boundary between genuine temporal structure and removable path redundancy. For a finite projective unitary error group, any open-loop path operator has the form Wγ=eiθγUc(γ), where c(γ) is the final group product. Consequently, an arbitrary temporally correlated path law is isometrically equivalent, for complete complementary leakage and for every code, to the single-shot distribution of the final projective product: Lpath(V)=Lπ(V). For Pauli trajectories, this remains true even when ordered errors do not commute, because different orderings can differ only by projective phases after contraction to the final channel. Thus open-loop final-channel leakage cannot identify temporal organization beyond the final projective Pauli-product distribution. Intermediate measurements, controls, syndrome extraction, or adaptive recovery are required for genuinely intervention-resolved multi-time code geometry. ## Distribution-robust optimizer reversal For an arbitrary three-location bit-flip trajectory law, let π denote the induced final-parity distribution on F23, let c=(1,1,1), and define Λπ:=∑t∈F23πtπt⊕c. For the three-qubit repetition code E=span{∣000⟩,∣111⟩}, the complete complementary leakage is exactly Lπ(E)=Λπ. For every fixed full-support final-parity law, the intrinsic Fourier-syndrome graph coordinate w satisfies Lπ(V(w))=Λπ−2Λπ∣w∣2+o(∣w∣2). Hence the repetition code is a strict local maximum throughout this two-real-dimensional graph chart for every full-support final-parity distribution, independently of temporal correlations, stationarity, roundwise independence, identical error rates, or cyclic spatial symmetry. By contrast, a conditioned zero-and-one-fault truncation with positive coarse single-location weights has L≤1(E)=0 and strictly positive leakage at every nonzero sufficiently nearby graph code. The same reference code is therefore a strict local minimum for the truncated model and a strict local maximum for the complete process. The central conclusion is: > Exact aggregation of paths that implement the same projective physical operator preserves the entire code-optimization landscape, whereas deletion of higher-fault history fibers can reverse the local optimizer geometry. ## Scope The results concern random-unitary, open-loop finite-history models and complete complementary-channel leakage. The optimizer reversal is proved in a specified Fourier-syndrome graph chart around the three-qubit repetition code. The paper does not claim: - a full-Grassmannian classification for the three-qubit model;- a decoder or recovery-circuit construction;- a logical-error threshold;- a circuit-level hardware noise model;- collapse of an intervention-resolved process tensor;- equivalence in the presence of intermediate syndrome measurements, controls, or adaptive recovery. These intervention-resolved settings form the natural next boundary of the theory. ## Relation to the preceding research program This paper is a concluding bridge theorem paper connected to a six-paper exact finite-history QEC and spectral-minimax research line. ### 1. Compression-geometric foundation **Sharp Complementarity, Complete Attainable Region, and Metric Rigidity of Rank-Two Quantum Codes under Collective and Differential Dephasing** Version v0.5r2b DOI: 10.5281/zenodo.21523950 This paper determined the complete attainable compression-defect region for rank-two codes under collective and differential two-qubit dephasing, classified the equality geometry, and established sharp metric rigidity. ### 2. Balanced finite-history minimax **Environment-Record Leakage for Finite Quantum Error Histories: Balanced Global Minimax, Complete Minimizer Geometry, and Distributional Stability** Version v0.5r2 DOI: 10.5281/zenodo.21560397 This paper introduced the complete environment-record leakage objective for finite error histories, solved the balanced two-step minimax problem globally over Gr(2,4), classified all balanced minimizers, and established distributional stability. ### 3. Bias-induced geometric selection **Bias-Induced Non-Isoclinic Optimality in Finite Quantum Error Histories: Exact Separation, Thresholdless Bifurcation, and Near-Balanced All-Code Minimax** Version v0.3r2 DOI: 10.5281/zenodo.21598820 This paper proved exact non-isoclinic separation, an open non-isoclinic parameter region, thresholdless loss of isoclinic optimality under arbitrarily small bias, and the leading full-Grassmannian near-balanced minimax selector. ### 4. Fourth-order overlap selection **Flat-Interior Persistence and Singular Overlap Selection in Near-Balanced Quantum Error Histories: Fourth-Order Transition Curves and Full-Grassmannian Minimax Closure** Version v0.1r3 DOI: 10.5281/zenodo.21622029 This sequel resolved the higher-order overlap degeneracy, established flat-interior persistence, derived singular boundary-layer transition curves, and closed the near-balanced full-Grassmannian minimax expansion through fourth order. ### 5. Abstract reflected spectral-jet framework **Reflected Spectral-Jet Realization for Degenerate Minimax Problems: Hard-Normal Selection, Flat Tangential Persistence, and Coactive Boundary Transitions** Version v0.2r1 DOI: 10.5281/zenodo.21636022 This paper extracted a reusable abstract framework for hard-normal isolation, soft tangential persistence, reflected active branches, and coactive boundary transitions in degenerate spectral minimax problems. ### 6. Finite-orbit generalization and first QEC truncation reversal **Beyond Reflected Pairs: Finite-Orbit Spectral Jets, Quadratic Isolation, and Multi-Branch Coactivity in Degenerate Minimax Problems** Version v0.4r1 DOI: 10.5281/zenodo.21644364 This paper generalized the reflected-pair theory to finite transitive orbits, developed multi-branch coactivity and representation-theoretic jet obstructions, and exhibited an exact three-location QEC realization in which restoring omitted multi-fault histories reverses the local optimizer geometry. ### 7. Present bridge theorem The present paper determines which open-loop temporal path information is exactly removable and which history reductions remain unsafe. It extends the earlier single-process reversal from independent or cyclic models to arbitrary correlated projective-unitary paths and arbitrary full-support final-parity laws. The resulting research progression is compression geometry⟶balanced global minimax⟶bias-induced selection⟶fourth-order closure⟶reflected spectral jets⟶finite-orbit coactivity⟶projective path collapse and distribution-robust reversal. ## Reproducibility package The accompanying bundle contains: - the manuscript PDF;- the LaTeX source;- an exact symbolic verification script;- a machine-readable verification report;- a README describing the proof-artifact contract;- a SHA-256 manifest;- version and package-audit records. The verifier performs 72 exact symbolic checks, including projective Pauli phase identities, phase-covariant path compression, arbitrary-parity polar factors, translation orthogonality, Fourier-syndrome graph compressions, and coefficient bookkeeping for the distribution-robust local expansion. The verifier deliberately rejects optimized Python mode. PASS decisions do not rely on floating-point tolerances. Compactness, maximizing-direction localization, trace-norm differentiability, and uniform asymptotic assembly remain analytic parts of the manuscript proof rather than delegated computational claims.