Complementary Quantum Correlations Are Universal for Qubits

Jinbo Wang; Kun Chen; Qihang Wang

Complementary Quantum Correlations Are Universal for Qubits

T0 review · 0 major / 4 minor · reviewed 2026-08-15 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Two complementary tables bound every qubit pair's total correlation.

desk verdict A parameter-free analytic proof of the two-qubit CQC conjecture; the concavity certificate survives re-derivation and the corollaries are honest lower bounds. read the letter →

arxiv 2608.04916 v1 pith:RYCSZAHI submitted 2026-08-05 quant-ph math-phmath.MP

Jinbo Wang , Qihang Wang , Kun Chen This is my paper · ORCID

classification quant-phmath-phmath.MP

keywords complementaryquantumcorrelationsmutualinformationqubitsexclusionmutuallyunbiasedbasesentanglementcertificationchannelcapacityBlochball

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper claims that for every two-qubit state, the sum of the classical mutual informations obtained from two complementary local measurements never exceeds the quantum mutual information of the unmeasured state, so two two-by-two correlation tables give a tomography-free lower bound on total correlation. This matters because most experiments access only a few measurement settings, and the result says the qubit case is the one dimension where simply adding complementary readouts is safe. The proof traces the protection to a single-qubit half-information exclusion lemma: information lost by reading one Pauli axis pays for at least half of the information visible along the complementary axis. That factor one half comes from concavity of a binary-entropy function on the Bloch ball, and data processing joins the two parties' tradeoffs into the full correlation budget. If correct, the same score $S_{XZ}>1$ certifies entanglement, a one-way entanglement-distillation rate at least $S_{XZ}-1$, and a lower bound on the quantum capacity of a qubit channel.

What carries the argument

The load-bearing object is the Bloch-ball function $g(x,y,z)=h(\sqrt{x^2+y^2+z^2})-h(x)-\frac{1}{2}h(z)$, where $h(t)$ is the binary entropy of a qubit with Bloch coordinate $t$. For any ensemble of Bloch vectors, the half-information exclusion inequality is exactly Jensen's inequality for $g$, because the difference $\chi(C:Q)-I(C:X)-\frac{1}{2}I(C:Z)$ equals $g(\bar{v})-\sum_c p_c g(v_c)$. The proof that $g$ is concave on the closed unit ball is a Hessian certificate: writing $-\nabla^2 g = R-D$, a Schur complement reduces positivity to a two-by-two matrix whose nonnegative diagonal and determinant follow from the scalar bound $\delta \ge 1/3$. This concavity is what forces the factor one half, and it is the reason qubits are special: in dimension three and higher, the entropy is not controlled by a single radial coordinate, and complementary readouts can double-count a shared classical label.

What would settle it

Compute, to high precision, the classical mutual informations $I(X_A:X_B)$ and $I(Z_A:Z_B)$ and the quantum mutual information $I(A:B)$ for any two-qubit state with Pauli measurements; a single state where $S_{XZ}$ exceeds $I(A:B)$ would falsify the central claim. Equivalently, search the Bloch ball for an ensemble of vectors $\{v_c\}$ and probabilities for which $g(\bar{v})-\sum_c p_c g(v_c)$ is negative, since that would violate the concavity lemma underpinning the proof.

Watch

Extended reading notes

Core claim

The central discovery is the universal validity for qubits of the complementary-quantum-correlation inequality $I(X_A:X_B)+I(Z_A:Z_B) \le I(A:B)$, for any pair of mutually unbiased local bases, equivalently Pauli $X$ and $Z$ measurements. The paper proves it in full generality, with no rank, purity, symmetry, separability, or marginal assumptions, by establishing a qubit half-information-exclusion lemma: $\chi(C:Q)-I(C:X) \ge \tfrac{1}{2}I(C:Z)$ for every ensemble of qubit states, then applying it in opposite orientations on the two parties. The two resulting deficits share the same crossed table $I(X_A:Z_B)$, so they pay for that table exactly once, while relative-entropy data processing under local dephasing accounts for the remaining quantum information. The theorem is tight in distinct regimes: a perfectly correlated classical bit attains $(I_X,I_Z,I)=(1,0,1)$, and a maximally entangled pair attains $(1,1,2)$.

Load-bearing premise

The whole result rests on the claim that the single-qubit function $g(x,y,z)=h(\sqrt{x^2+y^2+z^2})-h(x)-\tfrac{1}{2}h(z)$ is concave over the entire Bloch ball; if that concavity failed anywhere, the half-information tradeoff would not follow from Jensen's inequality, and the two-qubit inequality would lose its foundation.

Editorial extensions

If this is right

For any two-qubit source, the experimentally accessible score $S_{XZ}=I(X_A:X_B)+I(Z_A:Z_B)$ lower-bounds $I(A:B)$, so two two-by-two correlation tables replace full tomography whenever a lower bound on total correlation suffices.
A score $S_{XZ}>1$ certifies that the state is entangled, and the coherent information in either direction is at least $S_{XZ}-1$, so a one-way entanglement-distillation rate at least $\max\{0,S_{XZ}-1\}$ is achievable per copy.
For a qubit-input, qubit-output channel, applying the inequality to its normalized Choi state gives $Q(\mathcal{N}) \ge \max\{0,S_{XZ}(\omega)-1\}$, certifying a nonzero asymptotic quantum communication rate from paired measurements on transmitted Bell pairs.
Combining the inequality with the state-dependent qubit uncertainty relation yields the conditional bound $H(X_A|X_B)+H(Z_A|Z_B) \ge 1+S(A|B)$ and the joint bound $H(X_AX_B)+H(Z_AZ_B) \ge 2+S(AB)$.
The inequality is tight for a perfectly correlated classical bit and for a maximally entangled pair, pinning down the two physically distinct regimes in which the correlation budget closes exactly.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

The paper leaves open whether finite-sample and calibration corrections to $S_{XZ}$ can be stated as simple additive penalties; a natural extension is to develop such confidence intervals for the two-table score, since experiments will never have exact unbiasedness or infinite statistics.
The 'orient two deficits so they share the same crossed table' strategy suggests a general recipe: in any state space, find a curvature constant that lets one local readout charge the complementary correlation, then join opposite orientations by data processing. Whether qutrit subsets or restricted measurement families admit an analogous constant is a concrete open question.
Because leakage into local dimension three or higher restores overcounting, the score should in practice be paired with a dimension witness before being trusted; the paper does not develop that protocol, but its dimensional boundary makes such a pairing the natural experimental safeguard.
The same data that certify entanglement also give a one-way secret-key rate after entanglement distillation, so the two-table score could serve as a simple high-level certification tool for quantum key distribution with untrusted sources, assuming the trusted-qubit calibration holds.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

Best read here is the theorem, not the corollaries. The paper closes the two-qubit case of the CQC conjecture, which has been numerically probed for a decade, and it does so with a parameter-free analytic proof. The key move is concavity of the function g on the Bloch ball, established by a Hessian calculation that reduces to a Schur complement with a clean determinant decomposition. I re-derived the main lines (Eqs. 33–43); they check out. The oriented pairing in Eqs. 46–48 and the data-processing inequality in Eq. 54 close the sum correctly. The half-information exclusion lemma in Eq. 2 is the load-bearing piece and it looks sound.

What is genuinely new: the universal statement over all two-qubit states, not just pure states or structured families. The proof also explains why d=2 is special: binary spectrum gives a curvature bound δ≥1/3, exactly enough for the factor 1/2. That explanation is satisfying and matches the known d≥3 counterexamples.

The operational corollaries are decent but secondary. The SXZ lower bound on QMI and SXZ−1 distillable-entanglement rate are straightforward consequences; the capacity lower bound is just coherent information of the Choi state. The paper is honest about scope: trusted qubit spaces, calibrated MUBs, not device-independent. Good.

Soft spots, in proportion. First, no machine-checked proof. The Hessian algebra is long enough that a transcription error is conceivable; the stress-test note offers the same caveat. That is a low-probability risk, not a demonstrated gap. Second, the sharp-boundary claim depends on the companion d≥3 counterexample paper; this is fine, but it is a dependency beyond the present proof. Third, the corollaries are deterministic; finite-sample corrections are left to future work. Minor.

The citation pattern looks fair. The proof-dependency audit is a useful addition, and the executable checks are explicitly marked as non-premises. No data or fitted constants appear anywhere.

Who is this for: quantum information theorists working on entropic inequalities and dimension-dependent complementarity; experimental groups wanting a two-measurement lower bound on correlation in qubit systems. It deserves a serious referee; the central inequality is important and the proof is detailed enough to verify. I would send it to peer review. My verdict: accept if the algebra is independently checked; I do not expect major conceptual revision.

Referee Report

0 major / 4 minor

Summary. This paper proves the complementary-quantum-correlation (CQC) inequality for all two-qubit states: for any pair of mutually unbiased local bases, I(X_A:X_B) + I(Z_A:Z_B) <= I(A:B). The proof introduces a half-information-exclusion lemma for arbitrary ensembles of qubit states, chi(C:Q) - I(C:X) >= (1/2) I(C:Z), and establishes it by proving concavity of g(x,y,z) = h(sqrt(x^2+y^2+z^2)) - h(x) - h(z)/2 on the Bloch ball. The concavity certificate is an exact Hessian computation reduced by a Schur complement to a 2x2 matrix whose positivity follows from the scalar bound delta >= 1/3. Two copies of the lemma, oriented oppositely on the two parties, are combined with a relative-entropy data-processing inequality for local dephasings, yielding the main inequality. The paper then derives operational corollaries: S_XZ is a state-independent lower bound on I(A:B), S_XZ > 1 certifies distillable entanglement and a one-way entanglement-distillation rate at least S_XZ - 1, the Choi-state version lower-bounds the quantum capacity of a qubit channel, and two entropic uncertainty relations follow. Appendices contain full derivations and a proof-dependency audit.

Significance. The result closes the qubit case of the CQC conjecture and identifies the dimension boundary at d = 2, complementing the cited higher-dimensional counterexamples. This is an original, self-contained analytic proof rather than a numerical or conjectural contribution. Strengths include the explicit Hessian/Schur-complement certificate, the continuous extension to the closed Bloch ball, the exact decomposition of the determinant, and the proof-dependency audit stating that executable checks are not premises. The operational corollaries are concrete: two 2x2 correlation tables provide a tomography-free lower bound on total correlation, entanglement certification, and a channel-capacity witness in a trusted-qubit model. The proof technique, combining a curvature-based exclusion bound on one system with data processing, is likely to be reusable. I found no load-bearing errors.

minor comments (4)

[Eq. (7) and Eq. (38)] The formula for delta should be typeset as (1 - r/arctanh r)/r^2 so that it is not misread as 1 - (r/arctanh r)/r^2; the Schur-complement and series arguments depend on this definition.
[Physical implications] The statement that the coefficient 1/2 is 'precisely sufficient' could be sharpened by explaining that two oppositely oriented applications of the half-information lemma account for the full crossed correlation I(X_A:Z_B), while the data-processing bracket closes the remaining budget.
[References] The companion paper [10] is cited for the d >= 3 counterexamples, but its overcounting mechanism is not described; a sentence summarizing that mechanism would help readers appreciate why the qubit proof is not generic.
[Appendix A, Eq. (24)] The notation h(t) = h_2((1+t)/2) makes h(0) = 1; since this value is used in the Jensen-gap identity and the Hessian at the origin, a brief reminder where h is introduced would improve readability.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the central inequality is proved from an independently established concavity certificate and relative-entropy data processing, not assumed or fitted.

full rationale

The derivation is self-contained. The target inequality Eq. (1) is never assumed; it is obtained by adding Eq. (48), which is the sum of two oriented applications of the half-information-exclusion lemma, and Eq. (54), which follows from relative-entropy data processing under commuting local dephasings. The load-bearing lemma Eq. (2) is proved inside the paper: Eq. (4) (and its detailed form Eq. (29)) is an exact algebraic identity expressing the difference as the Jensen gap of g, and the Hessian and Schur-complement certificate in Eqs. (33)-(43) establishes concavity of g on the closed Bloch ball with no reference to Eq. (1). The self-citations are not load-bearing: reference [10], the companion paper by the same authors, is used only to state that higher-dimensional counterexamples exist and to frame the dimensional boundary, not as a premise in the qubit proof, and reference [7] is cited as the original proposal of the CQC relation rather than as a proof ingredient. The operational corollaries are immediate consequences of the proved inequality together with standard hashing and quantum-coding theorems: SXZ is an experimentally accessible quantity bounded above by I(A:B), and no parameter is fitted to the data being predicted. The appended proof-dependency audit explicitly states that executable checks are not premises of the proof, and walking the derivation chain confirms that it terminates in binary-entropy concavity and data processing, not in the claimed result. No circular step was found.

Assumptions & free parameters 0 free parameters · 7 assumptions · 0 invented entities

No free parameters are fitted; the proof is fully analytic. The non-trivial inputs are standard entropy inequalities and the trusted-qubit modeling assumption, both stated explicitly by the authors.

assumptions (7)

standard math Jensen's inequality applies to the ensemble average of the concave function g
Used in Eq. (4) and Eq. (29) to turn the exact Jensen-gap identity into the half-information exclusion inequality.
standard math Schur complement criterion for positive semidefinite block matrices
Reduces R - U D2 U^T >= 0 to Q = D2^{-1} - U^T R^{-1} U >= 0 in Eq. (36).
standard math Relative entropy data processing under completely positive maps and the pinching identity
Used to derive the cross-pinching inequality in Eq. (12) and Eq. (54).
domain assumption Hashing inequality lower-bounds one-way entanglement distillation rate by coherent information
Invoked for Eq. (16) and Eq. (63), accepting the standard one-way LOCC setting for distillation.
domain assumption Quantum coding theorem lower-bounds quantum capacity by coherent information of a chosen input
Invoked for Eq. (17) and Eq. (68) to obtain the capacity witness from the Choi state.
standard math Every qubit MUB pair is unitarily equivalent to the Pauli X,Z pair
Reduces the general inequality to Pauli measurements in Appendix A, using rotation invariance of mutual information.
domain assumption Trusted two-dimensional local Hilbert spaces with calibrated mutually unbiased projective measurements
Operational scope explicitly stated in the manuscript; leakage into higher levels restores the d>=3 overcounting.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Complementary Quantum Correlations Are Universal for Qubits." pith.science (2026). https://pith.science/paper/RYCSZAHI

@misc{pith2026260804916,
  author       = {Pith},
  title        = {Pith review of: Complementary Quantum Correlations Are Universal for Qubits},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/RYCSZAHI}},
  note         = {Machine review of arXiv:2608.04916}
}

read the original abstract

Extracting total correlations from a quantum system usually requires reconstructing its state, whereas many experiments access only a few measurement settings. A possible shortcut is to add the mutual informations obtained from complementary measurements; in dimensions above two, however, this procedure can count the same classical correlation twice. We establish that qubits are protected from such overcounting. For every two-qubit state, the correlations observed in two complementary local bases are bounded by the premeasurement quantum mutual information. The proof traces this protection to binary-entropy curvature on the Bloch ball and combines a qubit information-exclusion tradeoff with data processing under local dephasing. Consequently, two correlation tables give a tomography-free lower bound on total correlation. A score above one bit also certifies a quantitative one-way entanglement-distillation rate; when applied to the Choi state of a qubit channel, the same data lower bound its quantum capacity. The theorem therefore identifies both an operational use of complementarity and the trusted two-dimensional setting in which its correlation accounting is valid.

Review history (2 revisions) →

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

19 extracted references · 11 canonical work pages

[1]

exact entropy identities for a Bloch vector

work page
[2]

(33)–(43)

the analytic Hessian and Schur certificate Eqs. (33)–(43)

work page
[3]

Maassen and J

H. Maassen and J. B. M. Uffink, Generalized entropic uncertainty relations, Physical Review Letters60, 1103 (1988)

work page 1988
[4]

relative-entropy data processing for two commuting local pinchings; and

work page
[5]

Random-state searches, floating-point checks, and regression tests are not premises; removing every executable file leaves the proof unchanged

standard entropy identities for the operational corollaries. Random-state searches, floating-point checks, and regression tests are not premises; removing every executable file leaves the proof unchanged. ∗ chenkun@itp.ac.cn

work page
[6]

Groisman, S

B. Groisman, S. Popescu, and A. Winter, Quantum, classical, and total amount of correlations in a quantum state, Physical Review A72, 032317 (2005)

2005
[7]

W. K. Wootters and B. D. Fields, Optimal state-determination by mutually unbiased measurements, Annals of Physics 191, 363 (1989)

1989
[8]

M. J. W. Hall, Information exclusion principle for complementary observables, Physical Review Letters74, 3307 (1995)

work page 1995

Show all 19 references

[9]

P. J. Coles and M. Piani, Improved entropic uncertainty relations and information exclusion relations, Physical Review A 89, 022112 (2014)

2014
[10]

P. J. Coles, M. Berta, M. Tomamichel, and S. Wehner, Entropic uncertainty relations and their applications, Reviews of Modern Physics89, 015002 (2017)

2017
[11]

Schneeloch, C

J. Schneeloch, C. J. Broadbent, and J. C. Howell, Uncertainty relation for mutual information, Physical Review A90, 062119 (2014). 10

2014
[12]

P. M. Alsing, C. C. Tison, J. Schneeloch, R. J. Birrittella, and M. L. Fanto, Distribution of density matrices at fixed purity for arbitrary dimensions, Physical Review Research4, 043114 (2022)

2022
[13]

Iqbal, On the CQC conjecture: A sufficient condition and an extension, Quantum Information Processing25, 250 (2026)

H. Iqbal, On the CQC conjecture: A sufficient condition and an extension, Quantum Information Processing25, 250 (2026)

2026
[14]

J. Wang, Q. Wang, and K. Chen, When complementary measurements count the same classical bit twice: Counterexamples to cqc, ecqc, and complementarity-based certification (2026), arXiv:2608.03828 [quant-ph]

2026 arXiv
[15]

A. S. Holevo, Bounds for the quantity of information transmitted by a quantum communication channel, Problems of Information Transmission9, 177 (1973)

1973
[16]

Lindblad, Completely positive maps and entropy inequalities, Communications in Mathematical Physics40, 147 (1975)

G. Lindblad, Completely positive maps and entropy inequalities, Communications in Mathematical Physics40, 147 (1975)

1975
[17]

Devetak and A

I. Devetak and A. Winter, Distillation of secret key and entanglement from quantum states, Proceedings of the Royal Society A461, 207 (2005)

2005
[18]

Devetak, The private classical capacity and quantum capacity of a quantum channel, IEEE Transactions on Information Theory51, 44 (2005)

I. Devetak, The private classical capacity and quantum capacity of a quantum channel, IEEE Transactions on Information Theory51, 44 (2005)

2005
[19]

Berta, M

M. Berta, M. Christandl, R. Colbeck, J. M. Renes, and R. Renner, The uncertainty principle in the presence of quantum memory, Nature Physics6, 659 (2010)

2010

Pith tools

Reviewed August 15, 2026 · model on record in the stance chip above.

[1] [1]

exact entropy identities for a Bloch vector

work page

[2] [2]

(33)–(43)

the analytic Hessian and Schur certificate Eqs. (33)–(43)

work page

[3] [3]

Maassen and J

H. Maassen and J. B. M. Uffink, Generalized entropic uncertainty relations, Physical Review Letters60, 1103 (1988)

work page 1988

[4] [4]

relative-entropy data processing for two commuting local pinchings; and

work page

[5] [5]

Random-state searches, floating-point checks, and regression tests are not premises; removing every executable file leaves the proof unchanged

standard entropy identities for the operational corollaries. Random-state searches, floating-point checks, and regression tests are not premises; removing every executable file leaves the proof unchanged. ∗ chenkun@itp.ac.cn

work page

[6] [6]

Groisman, S

B. Groisman, S. Popescu, and A. Winter, Quantum, classical, and total amount of correlations in a quantum state, Physical Review A72, 032317 (2005)

2005

[7] [7]

W. K. Wootters and B. D. Fields, Optimal state-determination by mutually unbiased measurements, Annals of Physics 191, 363 (1989)

1989

[8] [8]

M. J. W. Hall, Information exclusion principle for complementary observables, Physical Review Letters74, 3307 (1995)

work page 1995