{"id":"43b7ba68-8e1d-4736-8868-623676e3ffc7","arxiv_id":"2608.06235","paper_version":1,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":8.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"For any matrix describing a bipartite system, the trace norm is bounded by sqrt(2) times the smaller dimension times the product-observable norm, and sqrt(2) is optimal.","lead":"This paper proves the exact worst-case gap between global and product measurements on bipartite quantum systems, showing the trace norm can exceed the product-observable norm by at most sqrt(2) times the smaller local dimension, and that this constant is unavoidable. It also sharpens the universal bound for quantum data hiding and gives a machine-checked proof of the upper bound.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Upper-bound proof in Sec. 3.2 has inconsistent Fourier coefficient definitions (missing conjugate in eq. 3.6/3.40), so the printed derivation does not yield the claimed sqrt(2) n bound; needs correction or Lean check.","rationale":"The central claim rests on two pillars: the upper bound (Theorem 1.1 with constant sqrt(2)) and the asymptotic lower bound via the CAR construction. The reader's weakest-assumption analysis focused on the appendix CAR computation, which is indeed intricate. Our independent reading found that the CAR moment computation (Wick signs, Catalan limit) is plausible and survives scrutiny. However, the upper-bound proof in Section 3.2 has a more immediate correctness issue: the Fourier coefficient definitions and the duality step in Eq. (3.40) are inconsistent as printed, and the displayed constant in Theorem 3.2 does not match the constant implied by its own proof. If taken literally, the printed derivation gives the wrong power of n in the final bound. Because the upper bound is the part of the theorem that establishes the universal inequality, this is the most load-bearing concern. The issue is likely repairable by inserting missing conjugate bars and correcting the normalization, and the claimed Lean formalization would provide strong evidence if verified; but the manuscript as written is not self-contained. Hence we recommend acceptance conditional on this correction or on confirmation from the Lean code. We partly agree with the reader's emphasis on the appendix, but we believe the upper-bound normalization is the more pressing gate for the central claim.","tokens_in":14497,"tokens_out":61660,"duration_ms":523410,"concrete_test":"Re-derive Theorem 3.2 with the corrected coefficient definition y_ij = E[bar w_ij F(w)] and S_k(w) = sqrt(n) sum bar w_ij y_ij^(k), and check that the duality step yields E||sum w_ij x_ij||_1 >= (1/sqrt(2n)) ||x||_{L1[R+C]}. Alternatively, inspect the Lean repository [LS26] declaration UpperBound.upper_bound and the formalized statement corresponding to Theorem 3.2; if the Lean statement uses 1/sqrt(2n) and the coefficient condition with bar w_ij, the concern is settled.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The proof of Theorem 3.2 (the Khintchine inequality carrying the constant sqrt(2) into Theorem 1.1) is internally inconsistent as written. Eq. (3.6) defines y_ij = E_w[w_ij F(w)], but Eq. (3.8) with S(w) = sqrt(n) sum w_ij y_ij gives y_ij = E[bar w_ij / sqrt(n) S(w)] = y_ij/n, a contradiction. In the dual proof, Eq. (3.40) claims |sum tr(y*_ij x_ij)| = |E tr(F(w)^* sum w_ij x_ij)|, whereas with y_ij = E[w_ij F] the left side equals E[tr(F^* sum bar w_ij x_ij)], not the printed expression. The correct coefficient condition should be y_ij = E[bar w_ij F] (with S built from bar w_ij). Moreover, Theorem 3.2 is displayed with constant 1/(sqrt(2) n), while the proof's bound ||F||_infty <= sqrt(2n) yields 1/sqrt(2n); only the latter combines with Prop. 3.1 to give sqrt(2) n in Eq. (3.45). As printed, the upper bound is not self-contained: the sharp constant depends on unstated conjugation and normalization corrections. The claimed Lean formalization may resolve this, but the repository is not inspected within the manuscript. This is load-bearing because if the intended Khintchine constant were 1/(sqrt(2) n), the final bound would be sqrt(2) n^{3/2}, not sqrt(2) n.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper determines the sharp universal comparison between the trace norm and the injective tensor norm associated with the trace norms on the two factors of a bipartite matrix algebra. For every z in M_n ⊗ M_m it proves ||z||_1 ≤ √2 min(n,m) ||z||_ε, and shows that the constant √2 is asymptotically optimal as n → ∞ (with m allowed to grow very fast). The upper bound is obtained from a new L1 noncommutative Khintchine inequality for random coefficients that are entries of a Haar unitary matrix, proved via a dual bounded Fourier-synthesis theorem. The lower bound uses a CAR-based construction, polar decomposition to flatten singular values, and a quarter-circle law for the singular-value distribution of the CAR matrix. Applications are given to bipartite correlation measures and to quantum data hiding, improving the known upper bound from 2√2 min(n,m) to √2 min(n,m). The paper also states that the upper-bound argument has been machine-checked in Lean 4.","tokens_in":14813,"tokens_out":16327,"duration_ms":143091,"significance":"If the proof is correct, this is a clean and nontrivial resolution of a natural norm-comparison problem. The constant √2 (rather than 1 or 2) is a genuine surprise, and the upper-bound technique—a sharp Haar-unitary noncommutative Khintchine inequality—is likely to be useful elsewhere. The lower-bound construction, which combines CAR algebras with a functional-calculus flattening step and a moment-method proof of a quarter-circle law, is conceptually interesting. The applications to correlation measures and data hiding are immediate and relevant. The claimed Lean formalization is a genuine strength, though the manuscript does not provide enough detail to verify it independently. The main caveat is that the printed upper-bound proof contains a conjugation error in the Fourier-coefficient extraction that is load-bearing; this is local and repairable, but it must be fixed before the paper can be accepted.","major_comments":[{"comment":"The Fourier-coefficient convention is inconsistent. Equation (3.6) defines y_ij = E_w[w_ij F(w)], but then Eq. (3.8) cannot be correct: with S(w) = √n ∑ w_ij y_ij, Schur orthogonality gives E_w[w_ij S(w)] = 0 and E_w[\\bar w_ij S(w)] = y_ij/√n, not y_ij. Consequently, the claim in the proof of Theorem 3.3 that \"Schur orthogonality gives y^{(0)}_ij = y_ij\" is false as stated. The correct extraction requires a conjugate: y_ij = E_w[\\bar w_ij F(w)] (with S built from \\bar w_ij, or with an equivalent normalization). This is load-bearing because it is the mechanism by which the first-order Fourier data of F are matched to the given family (y_ij).","section":"§3.2, Eqs. (3.6)–(3.8)"},{"comment":"The duality step in the proof of Theorem 3.2 is only valid under the conjugate coefficient convention. With the printed definition y_ij = E_w[w_ij F(w)], the expression on the left of Eq. (3.40) is ∑ tr(y*_ij x_ij) = E_w tr(F(w)^* ∑ \\bar w_ij x_ij), not E_w tr(F(w)^* ∑ w_ij x_ij). The printed equality would hold if y_ij = E_w[\\bar w_ij F(w)] were used. Thus the proof as written does not connect the supremum over y_ij to the norm ∥(x_ij)∥_{L1[R+C]} via Eq. (2.7).","section":"§3.2, Eq. (3.40)"},{"comment":"The constant in Theorem 3.2 is displayed as \"1√ 2n\", which is ambiguous between 1/(√2 n) and 1/√(2n). The proof via Theorem 3.3, whose bound is ∥F∥∞ ≤ √(2n), yields E∥∑ w_ij x_ij∥_1 ≥ (1/√(2n)) ∥(x_ij)∥_{L1[R+C]}. Only this version combines with Proposition 3.1 to produce the chain ∥z∥_1 ≤ √2 n ∥z∥_ε in Eq. (3.45); if the constant were instead 1/(√2 n), the chain would give √2 n^{3/2}. The statement should state explicitly \\frac{1}{\\sqrt{2n}} and the chain in Eq. (3.45) should be aligned with it.","section":"§3.2, Theorem 3.2 and Eq. (3.45)"}],"minor_comments":[{"comment":"The claimed Lean formalization would be more useful with a commit hash or a precise pointer to the declaration `UpperBound.upper_bound`, especially because the printed proof has the conjugation issue; quoting the exact formalized statement of Theorem 3.2 would help resolve the ambiguity in the constant.","section":"§3.3"},{"comment":"The statement that noncrossing pairings have Wick sign +1 and all other permutations are of lower order is standard but is asserted rather than justified; a short explanation or reference for the sign convention would improve readability.","section":"Appendix A, Eqs. (A.17)–(A.19)"},{"comment":"The norm ∥·∥_M is defined for Hermitian h, but Proposition 5.3 applies it to arbitrary z; the extension to non-Hermitian operators by taking absolute values should be stated explicitly.","section":"§5.2, Eq. (5.19)"},{"comment":"The typesetting of constants such as \"1√ 2n\" and \"√ 2n\" is ambiguous; the authors should use explicit parentheses or \\frac throughout, particularly in the abstract, Theorem 3.2, and Eq. (3.45).","section":"Throughout"}],"recommendation":"major_revision","confidential_remarks":"The main result is significant and the overall strategy is convincing, but the upper-bound proof as printed cannot be accepted without correcting the Fourier-coefficient convention. The conjugation error in Eqs. (3.6)–(3.8) and (3.40) is load-bearing, and the constant in Theorem 3.2 must be disambiguated. I expect this to be a straightforward repair, and the result is likely correct, but the authors should also verify that the Lean formalization matches the corrected statement."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The paper settles the sharp constant in the comparison between the trace norm and the injective tensor norm over product observables: sqrt(2) min{n,m}, improving the previous best factor 2 and disproving the SWAP-extremal conjecture. The main new ingredients are real: an L1 noncommutative Khintchine inequality with Haar unitary coefficients, and a CAR-based flattening construction for the lower bound. The applications to bipartite correlation and quantum data hiding follow naturally. This is significant work, and I believe the main result is likely correct.\n\nThe soft spots are real but fixable. The stress-test note is on target: Eq. (3.6) defines y_ij = E[w_ij F(w)] but Schur orthogonality requires the conjugate coefficient. As written, Eq. (3.40) then has the wrong pairing. The easy fix is to set y_ij = E[bar w_ij F] and build S from bar w_ij; the iteration in Theorem 3.3 survives. Also, Theorem 3.2 displays the constant as 1/(sqrt(2)n) while the proof and the final chain (3.45) both require 1/sqrt(2n); the displayed constant is a typo. Neither issue is fatal, but they need correcting before the proof is self-contained. The Lean formalization could settle the upper bound, but the repo is referenced without a commit hash; a referee should verify the formalized statement matches the corrected theorem.\n\nThe lower bound is the part I checked least carefully. The appendix's CAR analysis is long, and the proof of the quarter-circle law via Wick signs and noncrossing pairings is plausible but intricate. I did not find an obvious error, but a referee should go through it line by line, especially the closure argument in Prop. 4.1 and the sign factor in Eq. (A.17). The dimensional blow-up (D_n = 2^{n^2}) is fine for asymptotic sharpness, and the outlook correctly notes the open question of reducing m.\n\nOverall: this deserves a serious referee. Send it out. The upper-bound proof needs the conjugation fix and the constant typo resolved; the lower bound needs careful checking. If those pass, this is a clean and significant contribution to operator space theory and quantum information.","headline":"A likely-correct sharp constant sqrt(2) for trace vs product-observable norms, with a fixable conjugation error in the Khintchine proof and a typo in the stated constant.","tokens_in":15377,"tokens_out":3270,"would_cite":true,"duration_ms":30351,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["46B28","46L52","81P45","60B20"],"pacs":["03.67.Mn"],"model":"deepseek-v4-flash","headline":"In bipartite quantum systems, restricting probes to product operators costs at most $\\sqrt{2}\\,\\min\\{n,m\\}$ in trace norm, and this constant is asymptotically optimal.","keywords":["trace norm","injective tensor norm","product observables","noncommutative Khintchine inequality","Haar unitary","canonical anticommutation relations","quantum data hiding","bipartite correlation"],"falsifier":"Compute the first few moments of the empirical singular-value distribution of $\\sqrt{2/n}\\,C$ for small $n$ (say $n=3$ or 4) by exact symbolic Wick expansion: the paper predicts Catalan moments $2,5,14,\\ldots$ up to $O(n^{-1})$. If the moments deviate, the quarter-circle step and the $\\sqrt{2}$ lower bound fail; separately, a numerical optimization of $\\|z\\|_1/\\|z\\|_\\varepsilon$ over Hermitian $z$ for fixed $n=m$ could search for violations of the upper bound.","tokens_in":14266,"feed_emoji":"⚛️","tokens_out":12366,"duration_ms":104329,"temperature":0.7,"pith_summary":"The paper asks how much detecting power is lost when a bipartite quantum system is probed only by product operators—one local measurement on each side—instead of an arbitrary joint measurement. Its answer is a sharp universal bound: for every operator $z$ on $\\mathbb{C}^n\\otimes\\mathbb{C}^m$, the global trace norm $\\|z\\|_1$ is at most $\\sqrt{2}\\,\\min\\{n,m\\}$ times the product-probe norm $\\|z\\|_\\varepsilon$, and no smaller constant factor can work in general, since the ratio approaches $\\sqrt{2}$ as the smaller dimension grows. This closes the gap between the previously known linear bound $2\\min\\{n,m\\}$ and the trivial lower bound $\\min\\{n,m\\}$, showing that the natural conjecture that the lower bound is sharp is false. The upper bound rests on a new $L_1$ noncommutative Khintchine inequality whose random coefficients are the entries of a Haar-distributed unitary; the lower bound uses a fermionic CAR construction whose singular-value spectrum follows the quarter-circle law. The same sharp constant is shown to govern bipartite correlation measured by joint versus product observables, and it improves the universal quantum data-hiding ratio to $\\sqrt{2}\\,\\min\\{n,m\\}$.","feed_headline":"The exact probe gap is sqrt(2) times the smaller dimension","feed_subtitle":"Global measurements out-detect product probes by at most sqrt(2) times the smaller dimension; the factor is tight.","key_machinery":"The upper-bound argument combines two estimates. Proposition 3.1 bounds the trace norm of a block matrix $z=\\sum E_{ij}\\otimes x_{ij}$ by $\\sqrt{n}\\,\\|(x_{ij})\\|_{L_1[R+C]}$, where the row-plus-column norm is the infimum, over decompositions $x_{ij}=a_{ij}+b_{ij}$, of the trace norm of $(\\sum a_{ij}a_{ij}^*)^{1/2}$ plus the trace norm of $(\\sum b_{ij}^*b_{ij})^{1/2}$. Theorem 3.2 is the Haar-unitary $L_1$ noncommutative Khintchine inequality: $\\mathbb{E}_{w\\in U(n)}\\|\\sum w_{ij}x_{ij}\\|_1 \\ge (1/\\sqrt{2}\\,n)\\|(x_{ij})\\|_{L_1[R+C]}$, proved through its dual Fourier-synthesis statement that every coefficient family of row-plus-column norm at most 1 appears as the first-order Fourier coefficients of a function $F:U(n)\\to M_m$ with pointwise norm at most $\\sqrt{2n}$, built by singular-value truncation and iteration. For the lower bound, the paper forms the CAR matrix $C=\\sum E_{ij}\\otimes c_{ij}$ from $n^2$ fermionic modes and polar-decomposes it into a partial isometry $V$ that flattens all singular values to 1; the structural fact $T_V(a)^2=0$ for every $a$, together with the quarter-circle limiting distribution of the singular values of $\\sqrt{2/n}\\,C$, makes the rank of $V$ fill almost all of the ambient $n\\cdot 2^{n^2}$ dimensions, forcing the ratio $\\|V\\|_1/(n\\|V\\|_\\varepsilon)$ to tend to $\\sqrt{2}$.","core_discovery":"The central result is Theorem 1.1: for every $n,m\\ge 1$ and every $z\\in M_n\\otimes M_m$, $\\|z\\|_1\\le \\sqrt{2}\\,\\min\\{n,m\\}\\,\\|z\\|_\\varepsilon$, where $\\|\\cdot\\|_1$ is the trace norm, the supremum of $|\\operatorname{tr}(yz)|$ over all contractive joint observables $y$, and $\\|\\cdot\\|_\\varepsilon$ is the injective tensor norm, the same supremum restricted to product observables $a\\otimes b$. The constant is optimal in the asymptotic sense $\\lim_{n\\to\\infty}\\sup_{m\\ge 1} C_{n,m}/\\min\\{n,m\\}=\\sqrt{2}$, where $C_{n,m}$ is the worst-case norm ratio. In particular, the SWAP-operator lower bound $\\min\\{n,m\\}$ is not attainable as a universal constant; the exact worst-case loss from restricting to product measurements is $\\sqrt{2}$ times the smaller local dimension.","pith_inferences":["Editorial inference: the singular-value-flattening step that turns the CAR matrix into a partial isometry is a transferable trick; the same flatten-then-prove-square-zero strategy could yield sharp constants in other norm-comparison problems where spectra are otherwise uneven.","Editorial inference: the second local dimension in the lower-bound witness is $2^{n^2}$, far larger than the first dimension; if a polynomial-dimensional witness exists, the $\\sqrt{2}$ asymptotics would apply in more realistic finite-size settings, and the paper's open question on dimension reduction is the natural next test.","Editorial inference: because the lower-bound argument never uses randomness, one could try replacing the CAR construction with random Gaussian or Haar-random matrices; the quarter-circle law is the only spectral ingredient, so such an ensemble might reproduce the same $\\sqrt{2}$ constant with a simpler proof."],"forward_implications":["The previously bracketed gap between global and product probing is now pinned down: the worst-case ratio is asymptotically $\\sqrt{2}\\,\\min\\{n,m\\}$, not the conjectured $\\min\\{n,m\\}$.","For every bipartite state, the trace norm of the correlation operator $\\rho_{AB}-\\rho_A\\otimes\\rho_B$ is at most $\\sqrt{2}\\,\\min\\{n,m\\}$ times the largest product-operator correlation function, and the constant remains asymptotically sharp among Hermitian correlation operators with vanishing partial traces.","The data-hiding ratio against local operations and the larger classes of LOCC and separable measurements is at most $\\sqrt{2}\\,\\min\\{n,m\\}$, improving the previous $2\\sqrt{2}\\,\\min\\{n,m\\}$ bound in the chain $\\min\\{n,m\\}\\le R_{SEP}\\le R_{LOCC}\\le R_{LOCC\\to}\\le R_{LO}\\le \\sqrt{2}\\min\\{n,m\\}$.","The entire upper-bound argument has been machine-checked in a formal proof assistant, so the inequality itself, the block-matrix estimate, and the Khintchine inequality carry a verified certificate."],"supporting_citations":[{"why":"supplies the projective/injective tensor-norm framework that identifies $C_{n,m}$ and the prior data-hiding bounds.","marker":"[LPW18]"},{"why":"proves the previous best upper bound $C_{n,m}\\le 2\\min\\{n,m\\}$, the bound improved here.","marker":"[CLP22]"},{"why":"supplies the truncation-and-iteration technique and sharp-constant approach used for the Haar-unitary Khintchine inequality.","marker":"[HM07]"},{"why":"introduces the CAR extremal construction that the lower-bound witness adapts and flattens.","marker":"[HI95]"},{"why":"fixes the exact noncommutative Grothendieck constant 2 used by the prior linear bound.","marker":"[Haa85]"},{"why":"gives the unitary-group moment formula used in the fourth-moment estimate.","marker":"[Col03]"},{"why":"supplies the Haar-integration identities used to expand the fourth moment.","marker":"[C´S06]"},{"why":"provides the quarter-circle law and moment-matching method used to identify the limiting singular-value distribution.","marker":"[MP67]"},{"why":"defines the distinguishability-norm framework in which the data-hiding ratio is formulated.","marker":"[MWW09]"}],"fun_headline_variants":["Global vs product probes: exact √2 factor on min dimension","Sharp bound: trace norm ≤ √2·min(n,m) times injective norm","Exact measurement gap: √2 times smaller local dimension","Probe gap tight: √2 × min(n,m) bound proven","Bipartite probe gap: exact √2 factor, Lean-verified"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The lower bound depends on the appendix's fermionic calculation that the flattened CAR partial isometry still squares to zero and that its singular-value spectrum converges to the quarter-circle law; if the signs or normalization in that combinatorial pairing count are wrong, the extremal constant could shift.","fun_headline_variants_meta":{"raw":{"variants":["Global vs product probes: exact √2 factor on min dimension","Sharp bound: trace norm ≤ √2·min(n,m) times injective norm","Exact measurement gap: √2 times smaller local dimension","Probe gap tight: √2 × min(n,m) bound proven","Bipartite probe gap: exact √2 factor, Lean-verified"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000592,"raw_usage":{"total_tokens":2779,"prompt_tokens":956,"completion_tokens":1823,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":572,"completion_tokens_details":{"reasoning_tokens":1729}},"tokens_in":572,"tokens_out":1823,"duration_ms":12427,"temperature":1.0,"reasoning_tokens":1729,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-07T11:51:25.686025+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute the first few moments of the empirical singular-value distribution of $\\sqrt{2/n}\\,C$ for small $n$ (say $n=3$ or 4) by exact symbolic Wick expansion: the paper predicts Catalan moments $2,5,14,\\ldots$ up to $O(n^{-1})$. If the moments deviate, the quarter-circle step and the $\\sqrt{2}$ lower bound fail; separately, a numerical optimization of $\\|z\\|_1/\\|z\\|_\\varepsilon$ over Hermitian $z$ for fixed $n=m$ could search for violations of the upper bound.","supporting_citations":[],"review_version":1}