{"id":"f5f59277-4bd5-4269-889d-9ea396bf6ca4","arxiv_id":"1908.03434","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"New explicit families of LOCC-indistinguishable orthogonal product states in bipartite systems with dimensions n and m become perfectly distinguishable by LOCC when the parties share a C^2⊗C^2 maximally entangled state.","lead":"This paper builds new families of quantum two-party states that cannot be told apart by local measurements alone. It then gives explicit protocols showing that sharing one maximally entangled pair of qubits makes them distinguishable, and calls this the least entanglement resource.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The C^n⊗C^5 family is not actually defined: Eq. (9) with k=2 uses basis labels |0+1> and |5+6> outside a 5-dimensional space, so Theorem 3 and its one-ebit protocol lack a state list for a headline case.","rationale":"The reader's conditional verdict is well founded, and my pass reinforces it. The most concrete failure I found is not merely unverified orthogonality but an undefined construction for one of the headline dimensions: Eq. (9) cannot be instantiated at m=5 because it refers to basis vectors outside the stated Hilbert space. Since the abstract and Theorem 3 explicitly claim the C^n⊗C^5 family, this is a load-bearing gap. I also note that Theorem 3's proof is a sketch and its 'obvious symmetry' assertion is not justified, but I did not find a definitive counterexample to the generic k≥3 case. The state lists in Theorems 1 and 2 appear plausible, and the one-ebit protocols, while worded as sketches, give enough structure for generic cases. Thus the correct decision remains CONDITIONAL, not REJECT: the missing m=5 list and the uncompleted proofs are fixable in revision. My concern differs from the reader's weakest assumption (pairwise orthogonality/cardinality), but it is closely related to the reliability of the displayed state lists, hence partial agreement.","tokens_in":14606,"tokens_out":22481,"duration_ms":227624,"concrete_test":"Specialize Eq. (9) to k=2 with n=5 and n=6, and enumerate every basis label in Alice's and Bob's spaces. If any index appears outside {1,...,n} or {1,...,m}, or if |0+1> appears, the construction is undefined. Then check whether another passage in the paper supplies a valid 2n−1-state list for C^n⊗C^5; if no such list exists, Theorem 3 does not cover its stated m=5 case.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper's abstract and Theorem 3 promise 2n−1 locally indistinguishable orthogonal product states in C^n⊗C^5 (n≥5). The only displayed construction for odd Bob dimension is Eq. (9), where m=2k+1. For k=2 (m=5), the very first states are ill-defined: |φ1>=|(k−2)+(k−1)>_A|k>_B = |0+1>_A|2>_B, |φ4>=|4>_A|0+1>_B, and |φ2>, |φ3>, together with |ϕ_i> for i=1, contain |5+6>_B although Bob's space is only 5-dimensional. Thus the promised family is never exhibited, and the C^2⊗C^2 MES protocol in Theorem 6 cannot even be applied to it. This is not a cosmetic typo: the proof of local indistinguishability and the distinguishing protocol both operate on the explicit list. The proof of Theorem 3 is also only a sketch: it says Bob-first follows by 'obvious symmetry when m=n' without showing the displayed set is invariant under A↔B, and the author-added note after Theorem 1 ('should be |ϕ7>=...') shows the printed lists are not yet reliable. The central claim is therefore conditional on producing a valid explicit set for m=5 and completing the missing LOCC-indistinguishability verification.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper constructs explicit families of orthogonal product states in bipartite systems C^n⊗C^4, C^n⊗C^5, C^n⊗C^{2l}, and C^n⊗C^{2k+1}, proves their LOCC indistinguishability without shared entanglement, and then presents LOCC protocols that perfectly distinguish each family when Alice and Bob share a C^2⊗C^2 maximally entangled state. The indistinguishability proofs follow the Walgate-Hardy criterion: any POVM element that preserves orthogonality of the set must be proportional to the identity. The distinguishing protocols use an auxiliary maximally entangled pair and sequential projective measurements. Theorems 1 and 4 treat the C^n⊗C^4 case in detail; Theorems 2, 3, 5, and 6 generalize to even and odd Bob dimensions.","tokens_in":14904,"tokens_out":11476,"duration_ms":107944,"significance":"If the constructions and protocols are correct, the paper would supply new explicit examples of 'nonlocality without entanglement' that can be resolved with a single ebit of entanglement, adding to the literature on entanglement as a resource for LOCC discrimination. The paper's main strengths are its constructive approach and its explicit one-ebit protocols. The C^n⊗C^4 case is worked out in sufficient detail to be checked line by line, and the use of the Walgate-Hardy criterion is standard and sound. However, the advertised C^n⊗C^5 family and the odd-dimension generalization currently suffer from undefined states and omitted proof cases, so the full claimed result is not yet established.","major_comments":[{"comment":"For k=2, i.e. Bob dimension m=5, the states in Eq. (9) are not defined on the stated Hilbert space: |φ1> = |(k−2)+(k−1)>_A|k>_B = |0+1>_A|2>_B and |φ4> = |(k+2)>_A|(k−2)+(k−1)>_B = |4>_A|0+1>_B use a basis vector |0>, which does not exist in the {|i>}_{i=1}^d convention used throughout the paper; moreover |φ3> = |k>_A|(k+3)+(k+4)>_B = |2>_A|5+6>_B uses |6> in a five-dimensional Bob space, and |φ2> = |5+6>_A|4>_B uses |6> on Alice when n=5. Since Theorem 3 explicitly promises d=2(n−m)+9 locally indistinguishable states in C^n⊗C^5 for n≥5, this is not a cosmetic typo: the promised family is never exhibited, and the entanglement-assisted protocol in Theorem 6 cannot be applied to it. The construction for k=2 must be repaired before the main claim can be assessed.","section":"II, Eq. (9)"},{"comment":"The author-added note that |ϕ_{n+1}> = |3−5>_A|2>_B in (1) 'should be' |ϕ_7> = |3+4>_A|2>_B is not integrated into the theorem. If the replacement is made literally, the Alice-first proof's deduction a33=a55 from ⟨φ|M_A^† M_A ⊗ I|ϕ_{n+1}>=0 no longer follows with the same vector, and the Bob-first proof's use of |ϕ_{n+1}> to obtain b12=b21=0 is likewise affected. As printed, the theorem contains an unresolved self-identified indexing inconsistency, and the proof does not correspond to a single unambiguous state list.","section":"II, note after Theorem 1"},{"comment":"The proofs of the even- and odd-dimension generalizations are only sketches. In Theorem 3, the Bob-first case is dismissed by 'the obvious symmetry when m=n' without showing that the set in (9) is invariant under exchanging Alice and Bob; for n>m the symmetry argument is not available at all. In Theorem 2, the Bob-first case is summarized as 'seen similarly' with only a sample computation. Since the Walgate-Hardy criterion requires ruling out a nontrivial first measurement by either party, the local-indistinguishability claim is incomplete without a full argument for the first-measuring party in each case.","section":"II, Theorems 2 and 3"},{"comment":"The paper asserts pairwise orthogonality and the stated cardinalities of the sets in (1), (4), and (9) but does not verify them. The indistinguishability proofs assume the Gram matrix of the original set is diagonal; if any two listed states overlapped, the displayed equations setting inner products to zero would not be valid. A concise orthogonality check, for example by listing disjoint-support arguments or a verification table, should be included for each family.","section":"II, state lists (1), (4), (9)"}],"minor_comments":[{"comment":"The title and abstract claim 'least entanglement resource,' but the paper proves only sufficiency of a C^2⊗C^2 maximally entangled state, not optimality. I suggest rephrasing to 'one-ebit resource' or 'minimal resource among the protocols considered' unless a lower bound is proved.","section":"Title and Abstract"},{"comment":"Several inner products in Eq. (2) suppress nonzero Bob-part overlaps, for example ⟨2+3|1+2⟩=1/2 and ⟨2+3|3⟩=1/√2. The conclusions aij=0 are still valid because these factors are nonzero, but the presentation should note this normalization explicitly.","section":"II, Eq. (2)"},{"comment":"The expression ⟨ψ_{l−l}| appears twice in the block after Eq. (6) and should be ⟨ψ_{l−1}|. Also, the indexing of the |ψ_{i+l}> states is inconsistent with the later use in Eq. (11), where the range begins at i=0; the notation should be harmonized so that every referenced state label is defined.","section":"II, Eq. (4) and Theorem 2 proof"},{"comment":"The notation |φ'_{1,4}> and |φ'_{2,3}> is undefined; it should be spelled out as separate states |φ'_1>, |φ'_4> and |φ'_2>, |φ'_3>, respectively, to match the definitions in (9).","section":"III, Theorem 6 proof, Eq. (14)"},{"comment":"There is a typographical error in the sentence introducing the projectors A3i: 'A3i = 2⟩a⟨2|⊗| 2 +i⟩A⟨2 +i|' is missing the initial vertical bar and should read 'A3i = |2⟩a⟨2|⊗| 2 +i⟩A⟨2 +i|'.","section":"III, Theorem 4 proof"}],"recommendation":"major_revision","confidential_remarks":"The paper is within the scope of the journal and addresses a relevant question in entanglement-assisted LOCC discrimination. The main obstacle is that the advertised C^n⊗C^5 family is not actually defined for m=5, and the proofs for the generalized families are incomplete. These issues are substantial but appear fixable within the manuscript's scope, so I recommend major revision rather than rejection."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The paper does real work: it writes down explicit orthogonal product states in C^n⊗C^4, C^n⊗C^{2l}, and C^n⊗C^{2k+1} and gives concrete LOCC protocols showing one shared ebit suffices to distinguish them. The techniques are standard — Walgate–Hardy, Cohen's tiling, Zhang et al.'s one-ebit trick — but the particular state lists and the counts (2n−1, 2(n+2l)−8, etc.) are new and not in the cited papers. Theorem 1's proof is worked out in detail, and the even-dimensional Theorem 2 looks plausible, with the protocol in Theorem 4 spelled out. That is genuine progress in a narrow but active subfield.\n\nThe soft spots are more than cosmetic. The big one is Eq. (9), the promised C^n⊗C^5 family. For k=2 (m=5), the states use |0+1> and |5+6>, which do not exist in a 5-dimensional space. So the family that Theorem 3 and Theorem 6 claim to handle is simply not defined as printed. That is a load-bearing flaw, not a typo: local indistinguishability and the distinguishing protocol both operate on an explicit list, and the list fails. The proof of Theorem 3 is also a sketch — it says Bob-first follows by 'obvious symmetry when m=n' without showing the set is actually symmetric, and it compresses the Alice-first case into a few bullets. The note after Theorem 1 admitting that |ϕ_{n+1}> should be |ϕ_7> reinforces the impression that the indexing is not yet reliable. Pairwise orthogonality and cardinality of the large lists are asserted, not verified. Finally, the 'least entanglement resource' in the title and abstract is an overclaim: the paper proves sufficiency of one ebit, not optimality.\n\nNone of this kills the core idea for the even-dimensional families. But as it stands, the odd-dimensional family is broken for the headline case, and the proofs are uneven. This is exactly the kind of manuscript that needs a serious referee's time: a referee can require the authors to fix Eq. (9), write out the missing cases, and verify orthogonality. I would not cite it in its current form, but I would send it out.","headline":"A genuinely new set of LOCC-indistinguishable product-state families with one-ebit LOCC protocols, but the C^n⊗C^5 construction is ill-defined as printed and needs a major fix.","tokens_in":15462,"tokens_out":2488,"would_cite":false,"duration_ms":24770,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":["03.67.Mn","03.65.Ud"],"model":"deepseek-v4-flash","headline":"The paper constructs four families of orthogonal product states that are indistinguishable by LOCC without entanglement, and proves that sharing one C^2⊗C^2 maximally entangled state (one ebit) makes every family perfectly distinguishable…","keywords":["LOCC distinguishability","orthogonal product states","local indistinguishability","nonlocality without entanglement","maximally entangled state","one ebit resource","quantum state discrimination"],"falsifier":"Compute all inner products among the states in Eq. (1) for n=6 in $C^{6}$⊗$C^{4}$: if any two states are not orthogonal or the number of distinct states is not 11, the central claim collapses. Also run the explicit protocol of Theorem 4 on this instance and check that at every branch the surviving states remain pairwise orthogonal; a branch with overlapping states would refute one-ebit sufficiency.","tokens_in":14383,"feed_emoji":"🔗","tokens_out":7218,"duration_ms":64416,"temperature":0.7,"pith_summary":"The paper constructs four families of pairwise orthogonal product states that cannot be distinguished by local operations and classical communication (LOCC) when the two parties share no entanglement: 2n−1 states in C^n⊗$C^{4}$ and in C^n⊗$C^{5}$, 2(n+2l)−8 states in C^n⊗$C^{{2l}}$, and 2(n+2k+1)−7 states in C^n⊗$C^{{2k+1}}$. It then proves a converse: in every family, the states become perfectly distinguishable by LOCC once Alice and Bob share a single $C^{2}$⊗$C^{2}$ maximally entangled state, i.e., one ebit. If correct, this shows that these particular instances of \"nonlocality without entanglement\" do not require higher-dimensional entanglement or extra communication; one shared Bell pair is sufficient. The significance is that a minimal two-qubit entangled resource unlocks local distinguishability for all the constructed product-state sets.","feed_headline":"One shared Bell pair makes these product states distinguishable","feed_subtitle":"Four families of LOCC-indistinguishable orthogonal product states become perfectly distinguishable using one ebit.","key_machinery":"The constructions are tiling-like lists of product states built around a \"stopper\" state |φ⟩ = (|1⟩−|2⟩+⋯+(−1)^{n−1}|n⟩)_A ⊗ (|1⟩−|2⟩+⋯+(−1)^{m−1}|m⟩)_B, together with tile states of the form |i+(i+1)⟩_A ⊗ |j⟩_B and |i⟩_A ⊗ |j+(j+1)⟩_B. The load-bearing mechanism is the non-disturbing measurement lemma: to prove LOCC indistinguishability, the paper shows that any measurement operator preserving the orthogonality of the whole set must be a scalar matrix, forcing the measurement to be trivial. The distinguishing protocol uses Cohen's ancilla method: Alice and Bob share the two-qubit maximally entangled state (|00⟩+|11⟩)/√2, Alice performs a controlled two-outcome measurement that correlates the ancilla with the first-party state, and then a sequence of local projections separates the remaining states in each branch.","core_discovery":"The central claim is that the orthogonal product states listed in Eq. (1) (for C^n⊗$C^{4}$, n>4), Eq. (4) (for C^n⊗$C^{{2l}}$, n≥2l>4), and Eq. (9) (for C^n⊗$C^{{2k+1}}$, n≥2k+1≥5) are LOCC-indistinguishable without assistance, yet can be perfectly distinguished by LOCC when Alice and Bob share a suitable $C^{2}$⊗$C^{2}$ maximally entangled state. The indistinguishability proofs follow the Walgate–Hardy criterion: any first-party measurement that preserves mutual orthogonality of the listed states must have its POVM operator proportional to the identity, so neither Alice nor Bob can extract information by going first. The distinguishability protocols append the entangled ancilla and let Alice or Bob perform a controlled two-outcome measurement that splits the set into branches, after which the states in each branch are separated by further local projective measurements. The paper therefore establishes that one ebit of entanglement is an upper bound on the resource needed to distinguish each of these families.","pith_inferences":["The paper proves sufficiency, not necessity: the title's \"least\" is relative to Cohen's method, and nothing here shows that a Bell pair is required for these sets; a matching lower bound remains open.","The alternating-sign stopper state appears to be the engine of indistinguishability, which suggests that other stopper-based tilings in higher dimensions should also be unlocked by one ebit.","The indexing slip in Eq. (1) means a numerical implementation should regenerate the list from the corrected |ϕ7⟩=|3+4⟩_A|2⟩_B before testing the protocol.","A natural testable extension is to ask whether the state counts 2n−1, 2(n+2l)−8, and 2(n+2k+1)−7 are minimal among product-state sets in these dimensions that require one ebit."],"forward_implications":["Each of the four constructed families is LOCC-indistinguishable without assistance, so each is a new example of nonlocality without entanglement in dimensions C^n⊗C^m with m≥4.","For each family, a single C^2⊗C^2 maximally entangled state is sufficient for perfect LOCC discrimination, so one ebit is an upper bound on the entanglement resource needed.","The same protocol style works across even and odd Bob-side dimensions, indicating a uniform route from local indistinguishability to one-ebit-assisted distinguishability.","Since the indistinguishable sets consist entirely of product states, the result shows that entanglement is required only as a discrimination resource, not as a property of the states themselves."],"supporting_citations":[{"why":"Introduced the phenomenon of nonlocality without entanglement with nine LOCC-indistinguishable product states in C^3⊗C^3, the archetype these constructions extend.","marker":"[20]"},{"why":"Supplies the necessary-and-sufficient criterion for local distinguishability in C^2⊗C^n that the paper uses to prove indistinguishability by non-disturbing measurements.","marker":"[21]"},{"why":"Earlier construction of d^2 LOCC-indistinguishable orthogonal product states in C^d⊗C^d for odd d, a comparison family for cardinality.","marker":"[22]"},{"why":"Constructed 3(m+n)−9 LOCC-indistinguishable orthogonal product states in C^m⊗C^n, giving a different count to compare against.","marker":"[24]"},{"why":"Constructed 2p−1 locally indistinguishable orthogonal product states in C^m⊗C^n, a direct predecessor for the 2n−1 count used here.","marker":"[26]"},{"why":"Provided the effective method to distinguish certain classes of unextendible product bases using entanglement, which the protocol section adapts.","marker":"[27]"},{"why":"Showed that indistinguishable orthogonal product states in C^m⊗C^n can be distinguished with a C^2⊗C^2 maximally entangled state, the immediate predecessor of the one-ebit result.","marker":"[28]"},{"why":"Supplies the definition of a maximally entangled state used in the paper's resource statements.","marker":"[29]"}],"fun_headline_variants":["One shared ebit unlocks perfect LOCC discrimination of product states","Single Bell pair makes LOCC-indistinguishable product states distinguishable","One ebit suffices to distinguish these orthogonal product states via LOCC","With one shared ebit, these product states become LOCC-distinguishable"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"Everything rests on the listed states in Eqs. (1), (4), and (9) being pairwise orthogonal with exactly the stated cardinalities; the paper itself flags an un-integrated indexing correction in Eq. (1), so a reader must verify the lists before relying on the theorems.","fun_headline_variants_meta":{"raw":{"variants":["One shared ebit unlocks perfect LOCC discrimination of product states","Single Bell pair makes LOCC-indistinguishable product states distinguishable","One ebit suffices to distinguish these orthogonal product states via LOCC","With one shared ebit, these product states become LOCC-distinguishable"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000143,"raw_usage":{"total_tokens":1164,"prompt_tokens":932,"completion_tokens":232,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":548,"completion_tokens_details":{"reasoning_tokens":169}},"tokens_in":548,"tokens_out":232,"duration_ms":2960,"temperature":1.0,"reasoning_tokens":169,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T14:14:57.065588+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute all inner products among the states in Eq. (1) for n=6 in $C^{6}$⊗$C^{4}$: if any two states are not orthogonal or the number of distinct states is not 11, the central claim collapses. Also run the explicit protocol of Theorem 4 on this instance and check that at every branch the surviving states remain pairwise orthogonal; a branch with overlapping states would refute one-ebit sufficiency.","supporting_citations":[{"cited_title":"Bennett, D.P","cited_arxiv_id":null,"evidence_quote":"Introduced the phenomenon of nonlocality without entanglement with nine LOCC-indistinguishable product states in C^3⊗C^3, the archetype these constructions extend."},{"cited_title":"Walgate, and L","cited_arxiv_id":null,"evidence_quote":"Supplies the necessary-and-sufficient criterion for local distinguishability in C^2⊗C^n that the paper uses to prove indistinguishability by non-disturbing measurements."},{"cited_title":"Zhang, F","cited_arxiv_id":null,"evidence_quote":"Earlier construction of d^2 LOCC-indistinguishable orthogonal product states in C^d⊗C^d for odd d, a comparison family for cardinality."},{"cited_title":"Wang, M.S","cited_arxiv_id":null,"evidence_quote":"Constructed 3(m+n)−9 LOCC-indistinguishable orthogonal product states in C^m⊗C^n, giving a different count to compare against."},{"cited_title":"Constructing locally indistinguishable orthogonal product bases in an $m \\otimes n$ system","cited_arxiv_id":"1512.06485","evidence_quote":"Constructed 2p−1 locally indistinguishable orthogonal product states in C^m⊗C^n, a direct predecessor for the 2n−1 count used here."},{"cited_title":"Cohen, Phys","cited_arxiv_id":null,"evidence_quote":"Provided the effective method to distinguish certain classes of unextendible product bases using entanglement, which the protocol section adapts."},{"cited_title":"Zhang, F","cited_arxiv_id":null,"evidence_quote":"Showed that indistinguishable orthogonal product states in C^m⊗C^n can be distinguished with a C^2⊗C^2 maximally entangled state, the immediate predecessor of the one-ebit result."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the definition of a maximally entangled state used in the paper's resource statements."}],"review_version":1}