This work determines the sharp finite-dimensional onset of incompatibility for finite families of U(1)-covariant phase observables. In dimension two, every covariant phase observable is shown to be a convolutional postprocessing of a single canonical qubit phase observable. Consequently, every finite family of qubit covariant phase observables, including arbitrary finite coarse-grainings, is jointly measurable. In dimension three this universal compatibility breaks down. Four rank-two qutrit covariant phase observables are constructed whose binary interval coarse-grainings form a rigorously certified four-Specker family. Triple compatibility is established using explicit parent POVMs with exact-rational positivity tests and interval-bounded affine corrections, while four-way incompatibility is certified by independent dual semidefinite witnesses with exact rational normalization and interval evaluation. The work therefore establishes the sharp threshold d_min = 3 for finite-family incompatibility within this phase-covariant class. It also characterizes the qutrit canonical-smearing sector, proves robustness on a full-dimensional 28-parameter neighborhood, and provides a common-commutant certificate excluding a hidden qubit reduction. Supplementary material contains detailed analytic derivations and certificates. The accompanying reproducibility package provides verification code, exact/interval certificates, numerical summaries, and machine-readable outputs.
This work determines the sharp finite-dimensional onset of incompatibility for finite families of U(1)-covariant phase observables. In dimension two, every covariant phase observable is shown to be a convolutional postprocessing of a single canonical qubit phase observable. Consequently, every finite family of qubit covariant phase observables, including arbitrary finite coarse-grainings, is jointly measurable. In dimension three this universal compatibility breaks down. Four rank-two qutrit covariant phase observables are constructed whose binary interval coarse-grainings form a rigorously certified four-Specker family. Triple compatibility is established using explicit parent POVMs with exact-rational positivity tests and interval-bounded affine corrections, while four-way incompatibility is certified by independent dual semidefinite witnesses with exact rational normalization and interval evaluation. The work therefore establishes the sharp threshold d_min = 3 for finite-family incompatibility within this phase-covariant class. It also characterizes the qutrit canonical-smearing sector, proves robustness on a full-dimensional 28-parameter neighborhood, and provides a common-commutant certificate excluding a hidden qubit reduction. Supplementary material contains detailed analytic derivations and certificates. The accompanying reproducibility package provides verification code, exact/interval certificates, numerical summaries, and machine-readable outputs.
We construct a rank-one minimal informationally complete measurement (MIC) with an invertible dual operator and prove that, for arbitrary finite input and output dimensions, a channel universally preserves measurement incompatibility if and only if its input space contains a noiseless code subspace of the full output dimension. Preserving the compatibility threshold of a finite family of binary measurements already guarantees such a code. Furthermore, for every d≥2, there exists a family of binary measurements that is incompatible on the full space but compatible after compression to any proper subspace. These results resolve the conjecture of Chitambar and Zhang and the existence question posed by Uola and coauthors. We also give an explicit construction of exact encodings and show that, for a sufficiently small shift in the compatibility threshold, the transmission error of an approximate encoding is bounded by a constant times the square of the shift. These results establish a connection between measurement compatibility, quantum steering, and quantum error correction.
We establish a qubit–qutrit equivalence for centrally symmetric prepare-and-measure correlations involving two fixed binary queries and no shared randomness between preparation and measurement devices. For arbitrary pairs of Hermitian contractions on a three-dimensional Hilbert space, we prove a spectral-domination result that implies the following: any centrally symmetric family of target expectation pairs approximable by two binary POVMs on a qutrit, within a common compact convex centrally symmetric tolerance, is equally approximable using two fixed projective measurements on a qubit. As an exact consequence, for the four rectangular targets (±a, ±b), the optimal worst-cell total-variation error in dimensions two and three is ε₂ = ε₃ = max{0, [a + b − √(2 − (a − b)²)] / 4}, whereas dimension four permits exact reproduction. In particular, a qutrit with arbitrary binary POVMs cannot improve upon the optimal qubit worst-case success probability of (1 + 1/√2)/2 for the 2-to-1 random-access code without shared randomness. The proof uses spectral subspace intersection in dimension three and does not require the measurement operators to possess common reducing subspaces. Explicit counterexamples establish the importance of the dimensional and operational assumptions. The results provide a mathematical characterization of quantum carrier-dimension constraints, with applications to prepare-and-measure correlations and operationally recoverable historical information. Status: Research preprint, prepared for independent peer review. Not peer-reviewed. Reproducibility: Supplementary proofs, exact symbolic certificates, verification scripts and a SHA-256 manifest accompany the manuscript.
We prove a spectral majorization law for compatible three-qubit marginals: for every global state, every common single-qubit replacement state, and arbitrary nonnegative weights on all eight supports, the weighted marginal sum is majorized by its perfectly aligned counterpart. For normalized weights, this simultaneously minimizes every Schur-concave output entropy. We characterize equality, establish stability bounds and an incompatibility witness, and determine the single-block Holevo information for correlated unbiased replacement. We also develop input-certification protocols with explicit measurement, noise, calibration, and sample-complexity assumptions, together with rigorously delimited four-qubit results and a channel-compatibility example. The unrestricted noncommuting four-qubit middle-rank problem remains open. Complete proofs, exact certificates, and reproducible source are included.
This preprint establishes a Lorentzian factorization theorem for balanced antipodal quantum-state pairs in three-dimensional Hilbert space, with consequences for qubit–qutrit equivalence, prepare-and-measure correlations, and quantum dimension witnesses. We define a pair of qutrit states as balanced when tr(ρ₊ρ₋)² ≤ (1 − tr ρ₊²)(1 − tr ρ₋²). This class includes orthogonal pure-state pairs and pairs with orthogonal supports. Main contributions: Universal factorization theorem. We prove that every prepare-and-measure correlation table generated by balanced qutrit pairs and admissible binary measurements, without shared randomness, satisfies the Euclidean factorization bound γ₂(T) ≤ 1, regardless of the number of pairs or measurement queries. Exact qubit reproducibility. Combining the factorization theorem with an earlier exact qubit criterion, we establish that balanced qutrit configurations are qubit-reproducible whenever there are at most three antipodal pairs or at most three binary queries. In particular, three orthogonal pure-state pairs cannot distinguish a qutrit from a qubit in this setting. Lorentzian geometric construction. The proof uses the quadratic form Q(X) = 2 tr(X²) − (tr X)² on Hermitian 3 × 3 matrices, with signature (8,1). Its dual representation and the spectral inequality −e₂(A) ≤ 1 yield an explicit Euclidean Gram factorization. Unconditional equality classification. We show that every equality configuration of three orthogonal pure-state pairs belongs, up to unitary equivalence, to an embedded-qubit configuration or one of two previously constructed genuinely three-dimensional families: the spin-1 family and the common-vector family. This removes an additional hypothesis required in the preceding note. Reduction of the remaining open problem. We show that any possible three-pair separation can be reduced to configurations containing pure states paired with states of rank at most two, with at least one overlapping pair. We also introduce a semidefinite-programmable certificate whose conjectured universal validity is supported by numerical experiments but remains unproved. The general conjecture that three arbitrary antipodal qutrit state pairs never separate a qutrit from a qubit remains open. The proved results are independent of the numerical investigations. The accompanying reproducibility archive contains preregistered B4h experiments, symbolic and numerical verification scripts, computational results, and SHA-256 manifests. This is the fifth preprint in a research series on qubit–qutrit equivalence, separation, and the geometry of quantum correlations. Status: Research preprint, version 1 (13 November 2026); not peer reviewed.
Quantum measurements can remain incompatible yet become impossible to certify when all probe states first pass through a quantum channel. We formulate this loss of certifiability as operational concealment and identify its exact finite-dimensional threshold. Under tomographically complete input access, a channel conceals some incompatible binary POVM pair if and only if its Heisenberg adjoint has nontrivial kernel. Thus, in this channel restricted single-use setting, rank loss rather than contraction is the universal transition for exact concealment: injective dissipative dynamics may render the effective measurements compatible while leaving exact concealment impossible. We quantify this distinction through a minimum-gain lower bound and show that regular time-local dynamics cannot produce exact concealment at finite time. We then classify all qubit channels whose adjoint fibres admit a positive unital retraction, reducing concealment to ordinary joint measurability of canonical representatives. For orthogonal projected qubit measurements we obtain an exact robustness formula and a strict separation from ordinary incompatibility robustness. Finally, quotient-space duality expresses this robustness as an experimentally accessible additive advantage in positive-payoff channel-output games. We also prove invariance under adjoining a passive finite-dimensional reference system for lifted target measurements, even when arbitrary joint compatible simulators are allowed on the enlarged output space. These results establish rank-sensitive criteria for certifying measurement incompatibility under restricted channel access.
We study the canonical USp(4)-covariant quantum compression problem in which the fifteen-dimensional carrier W = V5 ⊕ V10 is encoded through a four-dimensional covariant memory M = V4 and decoded, and we ask for the optimal entanglement fidelity F*(p) of the composite channel on a trace-one, sector-weighted reference state ρ_p. This problem is the operational face of a structural fact: the same pair of sectors 5 ⊕ 10 that makes USp(4) on C^4 state-homogeneous but not observable-uniform is exactly the modal content a minimal covariant memory is asked to carry. Our contribution is not a resolution of the underlying capacity question but a demonstration that this problem admits an exact reduction and a machine-checkable global bound: the reduction and the final lower- and upper-bound certificates are exact, while only the intermediate relaxation-solving step is numerical. We give an exact representation-theoretic reduction — Wedderburn splitting of the covariant commutant over Q(i), an induced-involution positivity bridge, and an exact trace-preservation reduction to fifteen free rational coordinates — turning F*(p) into a bilinear polynomial optimization over a product of two explicit semialgebraic bodies, each the affine preimage of the product cone (R+ × SOC4 × SOC4). Exploiting correlative sparsity we build an order-two sum-of-squares relaxation, solve it numerically for discovery, reconstruct the resulting SOS upper bounds in exact rational arithmetic, and separately certify exact rational feasible lower bounds from explicit witnesses. At p = 1/2 and p = 7/8: 0.0749 ≤ F*(1/2) ≤ 0.21, and 0.1546 ≤ F*(7/8) ≤ 0.643 (exact rationals in the paper). The upper bounds are Positivstellensatz certificates whose polynomial identity and positive semidefiniteness are verified with no optimizer in the loop by a standalone verifier we provide. Throughout we keep three visibly separate registers — exact theorems, numerical diagnostics, and open or conditional interpretations — and we are explicit that the exact optimum, the exactness of the relaxation, and the width of the certified interval remain open. Package: this record includes the manuscript, a single 30-page combined archival PDF (cover + manuscript + auditable reduction-supplement listing) inside the package, and a verification package with two independent machine-checkable obligations (the exact reduction chain and the certified two-sided enclosure). Manuscript licensed CC BY 4.0; code licensed MIT.