Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help


slug: nandi-2025-mub-correlation-locc-refutation bibkey: nandi2025genuine doi: 10.48550/arXiv.2509.24045 url: https://arxiv.org/abs/2509.24045v1 triage: theorem motivation_gids:

  • D5/S3/Quantum/Entanglement/NandiMutualPredictabilityLOCCRefutation.result

A local measure-and-reset refutes the LOCC monotonicity of the MUB correlation

Problem

S. Nandi, Genuine multipartite entanglement detection with mutually unbiased bases (MUBs), arXiv:2509.24045v1 (EPL 154 (2026)), §II, measures a bipartite state on in a basis for Alice and for Bob, and in a second pair , mutually unbiased to the first, and sets . Its Conjecture states that “the quantity is monotonically non-increasing under LOCC operations”, tested in Eq. (10) on binary local instruments with : . The verbatim statements are in the literature note.

Issue #13804 fixes two readings of “the quantity ”, both for : for every fixed pair of local MUB settings, and for the supremum over settings (the paper evaluates of pure states in their Schmidt basis). The conjecture is read as the disjunction of the two. Because is linear in , with , which also covers .

Motivation

The paper uses and its multipartite analogues as entanglement witnesses and compares them with entanglement measures; the Conjecture is announced as “one of the central results”, and the conclusion states that the correlation “is convex, and non-increasing under LOCC”. D5/S3/Quantum/Entanglement/NandiMutualPredictabilityLOCCRefutation.result shows that it is not non-increasing in either reading, already for two qubits and a one-sided measurement.

Gap

The bounded literature check in issue #13804 found no counterexample or correction in the arXiv versions, the public EPL abstract, web searches, or Zenodo phrase searches (“mutual predictability”, “mutually unbiased” LOCC, the identifier). The paper’s numerical check of Eq. (10) (its Fig. 1) uses the Bell state only. not-found-in-searched-scope.

The other D5 MUB results concern tomography and basis compatibility, rather than this correlation’s LOCC monotonicity. The proof reuses the frozen unitary-norm theorem and Hadamard matrix, and Mathlib’s unitary entry bound, positive-semidefinite outer products and conditionally complete supremum lemmas. No other D5 or pinned Mathlib declaration was found that settles this claim.

Route

Take , , , (measure Alice in the computational basis and reset outcome 1 to ). Then .

  1. Every setting gives . $\langle a_ib_i|\rho|a_ib_i\rangle =\tfrac12|a_i|^2|\langle b_i|0\rangle|^2=\tfrac12|\langle b_i|0\rangle|^2$, and because Bob’s basis is orthonormal. Each of the two sums is . Hence the supremum over settings is also .
  2. The branches. In the computational/Hadamard setting (, ), , so the branches sum to .
  3. The supremum. for every setting, so the supremum over settings of each branch is finite and at least ; the branches again sum to at least .

Falsifier

The formal refutation concerns fixed-setting values and their supremum. It does not settle Eq. (10) with branch-wise minima over settings. Restricting the operation class to exclude measure-and-reset instruments would change the claim. The instrument used here satisfies , the completeness condition in Eq. (10).

Evidence

The canonical source is D5/S3/Quantum/Entanglement/NandiMutualPredictabilityLOCCRefutation.lean. Its public declarations are Setting, prodVec, I2, I2max, branch, claimFixed, claimOptimized, claim and result. Its two imports are:

  • D5.S3.Weil.ZetaLinear.VonNeumann, for RHLinalg.normSqMatrix_mem_doublyStochastic_of_unitary in col_norm_sq and row_norm_sq;
  • D5.S3.Quantum.Information.BinaryStabilizerLocalInequivalence, for hadamard and s2 in hadamard_eq.

It also uses Mathlib’s Matrix.unitaryGroup, Matrix.kronecker, Matrix.PosSemidef, entry_norm_bound_of_unitary, ciSup_le, le_ciSup and le_ciSup_of_le. The axiom closure of result is exactly propext, Classical.choice and Quot.sound; there is no sorry, native_decide, or new axiom in the module. The module statement is sha256:f2a1a70d6a8555fd81594dbf727d9d42999af8ed61675b42069927e8b36a5cde, the result statement sha256:132905ada69324d38200d6c44277cc6336a4bd987db4228f75453d8f31a5382b and the claim statement sha256:230f98303e86e0c110c320b98386c1d4440577dd7cb4f4ff15cf66fd254f3e41. The Freeze event is sha256:b526a3e5a760af56c57ca370cf6128603623274e82cfcfbcfb07814f17c40b41; its project-level prerequisites are the frozen VonNeumann and BinaryStabilizerLocalInequivalence.

Triage

Tier 1 conjecture of a 2025 paper (published 2026), with the reading specified in issue #13804. Both claimFixed and claimOptimized quantify over dimensions ; claim is their disjunction, and result refutes it. theorem; resolution refuted.

declarationproof_shapeescape_witnessadmission_basis
resultbind-onlynoneopen-problem-resolution

The private theorems (col_norm_sq, row_norm_sq, rho0_mulVec, rho0_expect, i2_rho0, hadamard_eq, half_sqrt_two_sq, hadamard_unitary, hadamard_mub, branch_first, branch_second, rhoP_mulVec, rhoP_expect, i2_standard_branch, i2_standard_rhoP, rho0_vec, rho0_state, instrument_complete, not_claimFixed, normSq_entry_le_one, i2_rhoP_le_two, i2max_rho0, i2max_rhoP_ge, not_claimOptimized) are bind-only and are used on the proof path of result (CLAUDE.md §3.2 「有消费的辅助声明」). Utility is certified-instance with basis refutes of claim. There is no digestion atom.

What the settlement shows

Proved by result: the conjecture fails in the fixed-setting reading and in the optimized reading, for and a binary instrument acting on Alice only.

Established inside the proof. For every pair of qubit MUB settings, (i2_rho0); every value of the branch state is at most (i2_rhoP_le_two), which bounds the supremum.

Argued, not formalized.

  • Mechanism. is not invariant under local unitaries, and a local reset can move the state into a position aligned with the measured bases. A function that does not increase under all LOCC maps, including discarding a state and preparing a separable one, must be constant on separable states: each separable state can be prepared from any other. is not: it equals at the maximally mixed state for every setting, and at . So for every , every fixed setting and the supremum over settings, preparing from raises from to at least .
  • The minimum over settings fails too, under full LOCC. At , , while the setting , , gives . Replacing by , a local operation, raises the minimum from at most to . This channel is not a single binary instrument on one side, and Eq. (10) with branch-wise minima is not addressed by this example.
  • What survives. on separable states is the separability criterion the paper takes from its reference [1huber], and the paper’s tripartite and quadripartite bounds are stated as upper bounds over biseparable states; their proofs as given do not cite the Conjecture. therefore remains an entanglement witness; it is not an entanglement monotone.

Open. Whether some LOCC-monotone quantity is obtained from , for example , is not settled here.

Effect on the paper. The Conjecture and the sentence of the conclusion that the correlation is non-increasing under LOCC are false under the two specified readings. The separability and multipartite witness bounds do not rely on this conjecture in the paper’s arguments; this Lean result neither proves nor refutes those bounds.

ASSUMED-UNVERIFIED

The bounded literature check does not establish exhaustive worldwide novelty, priority, or the absence of an independent counterexample.