{"id":"816eaa33-96ee-4989-a2d8-0795282a1148","arxiv_id":"2608.00930","paper_version":1,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":7.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"Two copies of the quantum cloning game have value strictly between (5+√17)/16 and (11+√65)/32, so the naive (3/4)² bound is beaten and strong parallel repetition fails.","lead":"This paper studies a two-player quantum game in which a referee tests which player shares a special entangled correlation, a setup used in quantum position verification. It proves that playing two rounds at once lets the players beat the naive single-round win rate, and it improves the best known limit on how well they can do.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Lower bound depends on unshown 64x64 eigenvector computation; exact verification of Kw and char poly would settle.","rationale":"I read the full argument carefully. The Stinespring reduction to challenge-dependent unitaries in Section 2 is standard and valid under the paper's explicit 'unrestricted' model, where the initial state may include private registers and the referee's marginal. The cap-matrix upper bounds (Lemma 3.1, Corollary 5.1, Proposition 5.2) are analytically sound: the directional overlap calculation, the tensor-product norm computation, the Perron-Frobenius argument, and the block-norm comparison all check out. Proposition 4.5's use of Halmos's two-subspaces theorem is correct, and the product structure of the averaged projector is straightforward. The only place where the central claim is not backed by a fully displayed proof is the 64x64 eigenvector/characteristic-polynomial computation for the explicit strategy. The paper says an ancillary script reproduces it, but the script is not available in the text, and the 'direct computation' is not expanded. Because the lower bound is the linchpin of the paper's main novelty (failure of strong parallel repetition), and because a typo in w or in the polynomial would invalidate that result, I think acceptance should be conditional on an independent exact verification of these two finite identities. This is a reproducibility and verification gap, not an internal inconsistency, so the verdict should be CONDITIONAL rather than REJECT or UNVERDICTED.","tokens_in":9872,"tokens_out":30797,"duration_ms":324834,"concrete_test":"Construct K in exact arithmetic from the definitions in Section 4 (64x64, entries in Z), and verify symbolically that K w = (5+sqrt(17))w for the printed w, and that det(lambda I - K) equals the printed factorization. If both identities hold, Theorem 4.1 is certified; if either fails, the counterexample collapses. This takes seconds in SymPy and requires no floating-point approximation.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The paper's central counterexample (Theorem 4.1) rests entirely on two finite computational claims: the stated characteristic polynomial det(lambda I - K) = ... and the assertion that the explicitly listed vector w satisfies Kw = (5+sqrt(17))w 'by direct computation' (Remark 4.2). Neither computation is displayed, and the referenced ancillary script is not included in the text. These claims are not derived analytically; they are computer-assisted. If either assertion contains a typo or arithmetic error, the claimed lower bound (5+sqrt(17))/16 > 9/16 would fail, and with it the failure of strong parallel repetition. The reader's suggestion that the explicit eigenvector 'certifies' the lower bound presumes that Kw has actually been checked; that check is precisely the omitted step. I found the rest of the argument (Stinespring reduction, cap-matrix upper bound, challenge-independent value) to be standard and internally consistent, so this computational verification gap is the single load-bearing concern.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies parallel repetition of the two-player quantum cloning game QCG_2. Using a block Gram matrix formulation, the value is expressed as 1/2^n times the operator norm of a matrix built from local response unitaries. The authors prove directional caps on the off-diagonal blocks (Lemma 3.1), assemble them into a cap matrix, and for n=2 obtain the upper bound (11+√65)/32 < cos^4(π/8). They then construct an explicit challenge-dependent strategy involving a 64×64 integer matrix K; using stated computer-assisted computations (a characteristic polynomial and an eigenvector w) they claim λmax(K)=5+√17 and hence value (5+√17)/16 > 9/16, disproving strong parallel repetition. They also prove that challenge-independent strategies have exact value (3/4)^n for every n, and that the cap-matrix bound improves the previous upper bound for every n.","tokens_in":10063,"tokens_out":10182,"duration_ms":120583,"significance":"If the main claims hold, the paper settles a natural open question for this monogamy game: strong parallel repetition fails already at two copies, and the previously known interval is strictly tightened. The conceptual contribution is the directional refinement of the overlap bound into a cap matrix, and the construction of an explicit challenge-dependent lower-bound strategy. The upper-bound and challenge-independent proofs are clean, parameter-free, and non-circular. The principal weakness is that the central counterexample rests on a nontrivial finite computation that is only asserted in Remark 4.2; the referenced ancillary script is not included. Once a machine-checkable certificate is supplied, the central result would be independently verifiable and the paper would be suitable for publication.","major_comments":[{"comment":"The proof of the lower bound relies on two computational assertions: det(λI−K) = λ^48(λ−2)^2(λ−3)^3(λ−4)^2(λ−5)^3(λ^2−7λ+4)(λ^2−10λ+8)(λ^2−11λ+22), and Kw = (5+√17)w 'by direct computation'. Neither computation is displayed, and the ancillary script mentioned in Remark 4.2 is not present in the submitted text. The eigenvector assertion is the load-bearing certificate for the claim (5+√17)/16 > 9/16; the characteristic polynomial is used to identify the largest eigenvalue and hence the exact strategy value. A typo in either assertion would invalidate the exact-value claim, and an error in the vector check would break the counterexample. Please provide the code or an exact-arithmetic transcript, or an independent analytic verification (e.g., modular factorization for the characteristic polynomial and a short script verifying Kw).","section":"Theorem 4.1 / Remark 4.2"},{"comment":"The reduction from arbitrary local response channels to challenge-dependent local unitaries is stated very tersely. The Stinespring argument is standard, but as written it does not explicitly justify why retaining the environment in the private registers preserves the success probability, since a general channel would require a partial trace over the environment. Please spell out the argument: for any POVM E on the output registers, Tr[(I_env ⊗ E) U(ρ⊗|0><0|)U†] = Tr[E Φ(ρ)]. This is not a correctness concern, but it supports the central operator-norm formula and should be made precise.","section":"Section 2, Eq. (4)"}],"minor_comments":[{"comment":"The expression '(1/2 + 1/2√2)^n' is ambiguous. It should read \\(\\frac12 + \\frac{1}{2\\sqrt2}\\), not \\(\\frac12 + \\frac{\\sqrt2}{2}\\).","section":"Eq. (1)"},{"comment":"The claim that replacing −iY by any anti-diagonal unitary W_{α,β} leaves the strategy value unchanged is not proved. Since this is a remark rather than a load-bearing step, it would help to add one sentence explaining the diagonal phase conjugation.","section":"Remark 4.3"},{"comment":"The statement about the largest root of the characteristic polynomial could be made explicit: the roots of λ^2−10λ+8 are 5±√17, and all other roots are smaller. This is immediate but would help the reader.","section":"Theorem 4.1 proof"},{"comment":"The claimed value ∥w∥² = 1972−476√17 is not derived. It is not needed for the main argument, but if kept it should be verified or removed.","section":"Remark 4.2"}],"recommendation":"major_revision","confidential_remarks":"The paper is mathematically interesting and the main argument appears sound, but I cannot certify the central counterexample from the submitted text because the 64×64 computation is not shown. Please ensure that the ancillary verification script is actually included in the published version, and ask the authors to expand the Stinespring reduction in Section 2. If the computational certificate checks out, I would expect the paper to be acceptable."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Short version: this paper proves strong parallel repetition fails for the two-copy unrestricted quantum cloning game, and it gives a strictly improved upper bound for every n. The results are genuinely new relative to Colisson, Palais, Escolà-Farràs, and Speelman, who left both endpoints open. The explicit lower-bound strategy (5+sqrt17)/16 is a real construction, and the cap-matrix technique—retaining directional t_A/t_B information instead of collapsing to Hamming distance—is a clean idea that provably beats the previous bound.\n\nWhat's good: the operator-norm formulation in Section 2 is standard but clean; the directional overlap Lemma 3.1 is a nice refinement of the prior projector argument; the cap matrix N2 has spectrum that I independently checked (trace 4, Frobenius squared 53/8, eigenvalues as stated); the Halmos argument for Proposition 4.5 is elegant; and the Perron–Frobenius step in 5.2 is rigorous. The paper is honest about scope: the counterexample is for the unrestricted game and does not touch the routing QPV protocol. For a subfield result, the significance is real: it resolves an explicit open tightness question and shows strong parallel repetition fails in a natural monogamy game.\n\nSoft spots: the lower bound in Theorem 4.1 depends entirely on two finite computations: the characteristic polynomial of the 64x64 integer matrix K, and the assertion that the written-out vector w satisfies Kw = (5+sqrt17)w 'by direct computation.' Neither is shown, and the cited verify_counterexample.py is not embedded in the text. This is not a hidden black box—the vector w is fully specified, so a referee can multiply K times w and check the eigenvalue equation by hand or with any CAS. But the paper should, for acceptance, provide the script or include the resulting product as an appendix; as written, a reader has to trust the assertion or redo the work. That's a presentation or verifiability issue, not a correctness flaw unless the computation is actually wrong. I did not find an error.\n\nThe other assumptions—the Stinespring reduction to local unitaries, the norm-matrix bound, the challenge-independent exact value—are all standard and appear sound. No circularity.\n\nThis paper is for quantum information readers working on monogamy-of-entanglement games, parallel repetition, and QPV. It deserves a serious referee; the claims are checkable and the main result is an open-question resolution. My recommendation: send it to peer review, and in the review ask the authors to make the computer verification openly available or to include the explicit eigenvector equation in full.","headline":"Settles the n=2 tightness question with an explicit challenge-dependent counterexample to strong parallel repetition and a strictly improved upper bound; the math is careful and checkable, with the main caveat that the 64x64 eigenvector computation is asserted rather than displayed.","tokens_in":10614,"tokens_out":2441,"would_cite":true,"duration_ms":26648,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["81P45","81P68"],"pacs":["03.67.-a"],"model":"deepseek-v4-flash","headline":"The two-copy quantum cloning game beats strong parallel repetition: the value lies strictly between $(3/4)^2$ and $\\cos^4(\\pi/8)$, with explicit bounds $\\frac{5+\\sqrt{17}}{16}$ and $\\frac{11+\\sqrt{65}}{32}$.","keywords":["quantum cloning game","parallel repetition","monogamy of entanglement","quantum position verification","block Gram matrix","cap matrix","challenge-dependent strategy","strong parallel repetition"],"falsifier":"Numerically optimize general strategies for the two-copy game, not restricted to unitaries; if any success probability exceeds $(11+\\sqrt{65})/32$, the cap-matrix upper bound is false. Conversely, recompute the largest eigenvalue of the explicit $64\\times64$ integer matrix $K=4H$: it should be exactly $5+\\sqrt{17}$, and any deviation falsifies the lower-bound construction.","tokens_in":9691,"feed_emoji":"⚛️","tokens_out":9172,"duration_ms":91520,"temperature":0.7,"pith_summary":"The paper asks whether playing the two-player quantum cloning game twice in parallel multiplies the win probability, as strong parallel repetition would predict. Earlier work put the $n$-copy value between $(3/4)^n$ and $\\cos^{2n}(\\pi/8)$, leaving both endpoints open. Here the authors prove that for $n=2$ neither endpoint is tight: an explicit challenge-dependent strategy wins with probability at least $(5+\\sqrt{17})/16>9/16$, while a block-Gram argument bounds the value by $(11+\\sqrt{65})/32<\\cos^4(\\pi/8)$. They also show that challenge-independent strategies are stuck at exactly $(3/4)^n$ for every $n$, so the gain is inherently coordinated across rounds. The immediate stake is whether copying games behave like single games under repetition, with consequences for quantum position-verification protocols.","feed_headline":"Quantum cloning game defies strong parallel repetition","feed_subtitle":"An explicit two-copy strategy exceeds the squared single-copy value, tightening both known bounds.","key_machinery":"The paper's central object is the block Gram matrix $[M_{x,y}]_{x,y}$ whose entries are $M_{x,y}=C_x S_x S_y^\\dagger C_y^\\dagger$, with $C_x$ the Bell-test contraction for challenge $x$ and $S_x$ the challenge-dependent response unitary. By cyclicity of trace and the identity of nonzero spectra, the game value equals $2^{-n}$ times the supremum over response unitaries of the operator norm of this block matrix. The key bound is the directional overlap lemma: for $x\\ne y$, $\\|M_{x,y}\\|\\le 2^{-\\max(t_A,t_B)}$, where $t_A$ counts coordinates where $x$ tests Alice under $y$, and $t_B$ counts the reverse; this improves on the Hamming-distance-only bound $2^{-|x\\oplus y|/2}$. These caps form the ca","core_discovery":"The central discovery is that strong parallel repetition fails for the unrestricted two-player quantum cloning game. Writing $\\omega^*(QCG_2^{\\times2})$ for the best two-copy success probability, the paper establishes $$(3/4)^2 < \\frac{5+\\sqrt{17}}{16} \\le \\omega^*($QCG_2^{{\\times2}}$) \\le \\frac{11+\\sqrt{65}}{32} < \\$cos^{4}$(\\pi/8).$$ The lower bound is constructive: choosing the response unitaries $U^{01}_A=V^{10}_B=G$ (a controlled $-iY$ gate), $U^{10}_A=V^{01}_B=\\mathrm{SW}\\,G\\,\\mathrm{SW}$, and the identity elsewhere, the averaged acceptance operator $H$ satisfies $K=4H$, a $64\\times64$ integer matrix whose largest eigenvalue $5+\\sqrt{17}$ is certified by an explicit eigenvector $w$. The upper","pith_inferences":["Inference: the same directional-cap matrix idea may give nontrivial parallel-repetition bounds for other monogamy-of-entanglement games, wherever the overlap of acceptance projectors depends on the orientation of changed coordinates.","Inference: the exact two-copy value is pinned between two algebraic numbers of the same quadratic-field form; if the true value is one of the endpoints, it would suggest a general frozen-eigenvalue mechanism for two-copy repetition values.","Inference: because challenge-independent strategies are exactly multiplicative, the super-multiplicative gain isolates a coordination resource: the players must know not just which positions are tested but in which direction, which is testable in smaller instances.","Inference: an immediate extension is to compute the three-copy cap matrix $N_3$ and compare $\\|N_3\\|/8$ against $\\cos^6(\\pi/8)$ to see how quickly the directional improvement grows with $n$."],"forward_implications":["Strong parallel repetition fails for the unrestricted cloning game: two copies are worth strictly more than $(3/4)^2$.","The exact two-copy value lies in the interval $[(5+\\sqrt{17})/16,\\,(11+\\sqrt{65})/32]$, with neither endpoint proved tight.","The cap-matrix upper bound $2^{-n}\\|N_n\\|$ strictly improves the previous $\\cos^{2n}(\\pi/8)$ bound for every $n$.","Challenge-independent strategies achieve exactly $(3/4)^n$ for every $n$, so any super-multiplicative advantage requires challenge-dependent responses.","The lower-bound strategy does not by itself break the routed quantum position-verification protocol of the original model, because that model restricts the initial state and the referee's marginal."],"supporting_citations":[{"why":"defines the quantum cloning game, proves the single-copy value 3/4, and supplies the two-sided n-copy bound that this paper refines.","marker":"[1]"},{"why":"introduces the projection-overlap method whose directional refinement produces the cap matrix upper bound.","marker":"[4]"},{"why":"provides the Stinespring dilation background used to replace arbitrary response channels by challenge-dependent unitaries.","marker":"[5]"},{"why":"the two-subspaces theorem used to compute the optimal challenge-independent value as (3/4)^n.","marker":"[6]"}],"fun_headline_variants":["Quantum cloning game defeats strong parallel repetition","Two-copy quantum strategy beats squared single-copy value","Tighter bounds for quantum cloning game's two-copy value","Challenge-independent strategies hit (3/4)^n in cloning game","Quantum cloning game: strong repetition fails"],"cache_read_input_tokens":2816,"weakest_assumption_plain":"The operator-norm formula depends on representing every possible local response by a challenge-dependent unitary on a fixed output register, via Stinespring dilation; if a non-unitary channel—one that measures or discards qubits—could outperform all unitary strategies, both new bounds would collapse.","fun_headline_variants_meta":{"raw":{"variants":["Quantum cloning game defeats strong parallel repetition","Two-copy quantum strategy beats squared single-copy value","Tighter bounds for quantum cloning game's two-copy value","Challenge-independent strategies hit (3/4)^n in cloning game","Quantum cloning game: strong repetition fails"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000569,"raw_usage":{"total_tokens":2525,"prompt_tokens":732,"completion_tokens":1793,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":476,"completion_tokens_details":{"reasoning_tokens":1731}},"tokens_in":476,"tokens_out":1793,"duration_ms":15066,"temperature":1.0,"reasoning_tokens":1731,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-06T00:38:42.930025+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Numerically optimize general strategies for the two-copy game, not restricted to unitaries; if any success probability exceeds $(11+\\sqrt{65})/32$, the cap-matrix upper bound is false. Conversely, recompute the largest eigenvalue of the explicit $64\\times64$ integer matrix $K=4H$: it should be exactly $5+\\sqrt{17}$, and any deviation falsifies the lower-bound construction.","supporting_citations":[{"cited_title":"Colisson Palais, L","cited_arxiv_id":null,"evidence_quote":"defines the quantum cloning game, proves the single-copy value 3/4, and supplies the two-sided n-copy bound that this paper refines."}],"review_version":1}