{"id":"f0ecad41-57a3-4ceb-9e73-514292ca1828","arxiv_id":"2608.09504","paper_version":1,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":8.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"GUPBs exist for any number of parties N≥3; they are built from MDS codes and give a family of genuinely multipartite bound entangled states with PPT across every bipartition.","lead":"This paper constructs the first examples of genuinely unextendible product bases (GUPBs) for any number of parties, using classical maximum distance separable (MDS) codes. The construction also yields multipartite bound entangled states that are positive under partial transpose across every bipartition, along with entanglement witnesses that detect them.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified.","rationale":"The reader identified the prime-field condition as the weakest structural assumption. I agree that it is the most sensitive point, but it is explicitly stated in Theorem 1 and is genuinely needed for Lemma 4; it is not a hidden flaw. The central existence claim is unaffected because a prime p >= N^2 always exists. I independently walked through the proof of the core rigidity lemma (Lemma 1), the filling lemma (Lemma 5), and the connectivity lemma (Lemma 6). The MDS minor argument in Lemma 3 is algebraically sound: the block-determinant identity is correct, and the nonzero-minor conclusion follows from the MDS property. In Lemma 5, the step 'if A_u + delta = A_u for delta != 0 then A_u = F_p' is valid over prime fields, and the subsequent propagation through coordinates is valid because each intermediate point keeps the relevant fiber nonempty. Lemma 6's surjectivity arguments use only that any up-to-N distinct generator columns are independent, which holds by the MDS property. The remainder of Theorem 1—support factorization, local constancy, and the final contradiction with the stopper—is straightforward. I also checked the definitions of the complementary projector and the partial-transpose symmetry; they are correct. The paper delivers a substantive, rigorous construction, and the reader's ACCEPT verdict is appropriate.","tokens_in":84,"tokens_out":32312,"duration_ms":1728253,"concrete_test":"For N=3 and p=11, construct the GRS generator matrix with any 9 distinct field elements, build the family U_C exactly as in Eq. (13), compute the orthogonal complement G_C. Then solve the optimization problem min_{|alpha>,|beta>} ||P_{G_C}(|alpha>|beta>)||^2 over normalized product vectors for each of the three nontrivial bipartitions, using a standard alternating least-squares or polynomial-system solver; a nonzero minimum would disprove Theorem 1, while a zero minimum (i.e., no product vector in G_C) would confirm the central claim. Alternatively, brute-force verify Lemma 1 for this instance by enumerating all nonempty subsets Lambda of F_11^3 with |Lambda| >= 2 and checking that the union of tiles is never a Cartesian rectangle unless Lambda = F_11^3.","verdict_should_be":"UNCHANGED","load_bearing_attack":"I read the proof as correct. The prime-field assumption is the most fragile step, but it is explicit in Theorem 1 and is used exactly in Lemma 4; for non-prime fields the filling argument fails, which is why the theorem restricts to p prime. This restriction does not threaten the main existence claim, because for any N one can choose a prime p≥N^2 by Bertrand's postulate and use the explicit GRS code. I checked the key intermediate claims: the MDS minor identity in Lemma 3, the Cartesian slice argument in Lemma 5 (including the 'begin with any point' propagation, which is valid because each intermediate point guarantees the relevant fiber is nonempty), and the connectivity argument in Lemma 6. I found no circularity, hidden normalization error, or unjustified leap. The only minor caveat is that for primes p<N^2 no [N^2,N,N^2-N+1]_p MDS code may exist, so the universal quantification over all primes is vacuous for those parameters; this does not affect the constructive existence of GUPBs for all N≥3.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper constructs genuinely unextendible product bases (GUPBs) for any number N>=3 of parties in (C^{Np})^{⊗N}, using linear MDS codes over prime fields. Starting from an [N^2,N,N^2-N+1]_p MDS code, the author partitions the computational grid into product tiles, places a local Fourier product basis on each tile, deletes the uniform Fourier mode from each tile, and adds a global stopper state. Theorem 1 asserts that the resulting orthogonal family is a GUPB; the proof combines an MDS rectangle-rigidity lemma with a projected-tile connectivity lemma, both proved in the Supplemental Material. The paper then shows that the complementary subspace is a genuinely entangled subspace whose normalized projector is invariant under partial transposition across every bipartition, yielding full-rank PPT genuine multipartite bound entangled states. It also constructs a GME witness that is nondecomposable with respect to every bipartition, proves a one-copy discrimination tradeoff, and establishes finite-copy indistinguishability under measurements separable across any bipartition, with a sharp ratio constant.","tokens_in":17095,"tokens_out":21547,"duration_ms":247142,"significance":"If correct, this settles the previously open existence problem for finite-dimensional orthogonal GUPBs and gives an explicit infinite family via generalized Reed–Solomon codes for every N>=3 (using Bertrand's postulate to choose a prime p with N^2 <= p < 2N^2). The proof is transparent and self-contained: the main theorem reduces to two auxiliary lemmas that are proved in detail, the construction has no fitted or free parameters, and the resulting states and witnesses are given by explicit formulas. The connection between classical MDS codes and genuinely multipartite bound entanglement is a new and potentially influential idea. The paper also provides falsifiable quantitative statements, such as the sharp one-copy and finite-copy discrimination ratios, which are strong positive features.","major_comments":[],"minor_comments":[{"comment":"The phrase 'We have showed' should be 'We have shown', and the heading of the following section contains the typo 'finte copy local discrimination' instead of 'finite copy local discrimination'.","section":"Main text, Section 'Genuine bound entanglement and its witness'"},{"comment":"The displayed formula for κ_{ℓ,X|Y} is typeset in a confusing way: the minimization should be over normalized vectors A,B with p_G^{(ℓ)}(A,B)>0 of the ratio p_U^{(ℓ)}(A,B)/p_G^{(ℓ)}(A,B), multiplied by (R/K)^ℓ. The current rendering makes the fraction and the positivity condition ambiguous and should be corrected for readability.","section":"Main text, Eq. (50)"},{"comment":"Two cross-references appear as 'As shown in Supplemental Sec. ,' with an empty section number; these should be filled in or replaced by a reference to the specific proposition in the Supplemental Material.","section":"Main text, before Eq. (37) and in the measurement section"},{"comment":"The universal quantification over all primes p is vacuous for primes for which no [N^2,N,N^2-N+1]_p MDS code exists (in particular, the explicit Reed–Solomon construction requires p >= N^2). The theorem is mathematically correct as an implication, but the wording 'for every prime p for which such a code exists' would more accurately reflect the content.","section":"Theorem 1"},{"comment":"The family ρ_λ is defined for 0<λ≤1 and the GME interval is stated as 0<λ<κ_G; it may be worth noting explicitly that the endpoint λ=0, namely ρ_G itself, is already GME by Theorem 1, even though the family as defined starts at λ>0.","section":"Theorem 2"}],"recommendation":"minor_revision","confidential_remarks":"This is a strong and convincing paper. I found the central proof complete, with the prime-field assumption explicitly used exactly where needed and the existence claim for all N rescued by Bertrand's postulate. The only issues are local presentation problems and a few imprecise cross-references. One point the editor may wish to verify is the historical claim that no finite-dimensional orthogonal GUPB was previously known, since the reference list already includes a 2026 paper excluding the smallest three-qutrit candidate; I did not find evidence against the claim, but it is a strong assertion and the handling editor may want a quick literature check."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"This paper settles the open existence problem for genuinely unextendible product bases, and the central idea is genuinely new. The construction takes a linear MDS code, partitions the computational grid into product tiles indexed by codewords, puts Fourier bases on each tile, deletes the uniform mode, and adds a global stopper. The MDS minor rigidity lemma—any union of tiles that is a rectangle across some bipartition must be either a single tile or the whole grid—is the key step, and it is proved with explicit determinant computations that I checked in detail. The logic is sound: the main theorem reduces to two lemmas, both in the supplement, and I found no circularity or hidden normalization error. The consequences for PPT genuine multipartite bound entanglement and nondecomposable witnesses follow cleanly from the projector being a sum of real product projectors.\n\nThe proof does rely on the field being prime: Lemma 4 needs the additive group of F_p to be cyclic of prime order, and for F_4, translation-invariant proper subsets exist. That is a real restriction, but it is stated explicitly in Theorem 1 and does not threaten the main existence claim, because for any N you can choose a prime p with N^2 ≤ p < 2N^2 by Bertrand's postulate and use the Reed–Solomon construction. For primes p < N^2, the universal quantification over all MDS codes is vacuous, but that is harmless.\n\nThere is one minor gap in the supplement. In Lemma 6, when connecting two cells with the same address but different symbols, the proof says to choose an auxiliary address k ≠ j. If the second cell has address j' ≠ j, you need k to be distinct from both j and j'; the text does not say that, but since N ≥ 3 such a k exists. It is a trivial fix.\n\nThe paper is well written and the citations look appropriate. The tensor-power closure and the discrimination bounds are standard but competently handled. I would send this to peer review and expect it to be accepted after minor revisions. It is the kind of paper you want at a journal: a clean algebraic resolution of an open problem, with explicit formulas and no overclaiming.","headline":"Resolves the GUPB existence problem with a clean MDS-code construction; the prime-field restriction is real but explicit and doesn't stop the construction from working for all N.","tokens_in":17594,"tokens_out":3849,"would_cite":true,"duration_ms":43993,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["81P40","81P45","94B05"],"pacs":["03.67.Mn","03.67.-a"],"model":"deepseek-v4-flash","headline":"Every number of parties $N\\ge 3$ has a genuinely unextendible product basis, built from any linear MDS code over a prime field.","keywords":["genuinely unextendible product bases","MDS codes","maximum distance separable codes","genuinely entangled subspace","bound entanglement","partial transposition","GME witnesses","local discrimination"],"falsifier":"Run an exhaustive search for small parameters, say $N=3$ and $p=3$: enumerate all subsets $\\Lambda\\subseteq\\mathbb{F}_3^3$ with $|\\Lambda|\\ge 2$ and test whether the union of the tiles $T_t$ for $t\\in\\Lambda$ is a Cartesian rectangle across any nontrivial bipartition; finding one would disprove Lemma 1. Alternatively, search the subspace $\\{\\sum_t a_t|\\psi_t\\rangle : \\sum_t a_t=0\\}$ for a nonzero vector that factors across some bipartition; finding one would refute Theorem 1.","tokens_in":16733,"feed_emoji":"🔐","tokens_out":8161,"duration_ms":85637,"temperature":0.7,"pith_summary":"A genuinely unextendible product basis (GUPB) is an incomplete orthogonal family of fully product states whose orthogonal complement contains no product vector across any bipartition. This paper claims to settle the open existence problem by constructing a GUPB for every $N\\ge 3$ and every prime $p$ from any linear $[N^2,N,N^2-N+1]_p$ maximum distance separable (MDS) code. The construction tiles the computational basis using the code's generator matrix, places Fourier modes on each tile, deletes one mode per tile, and adds a global stopper state. If the proof is correct, the orthogonal complement of each such family is a genuinely entangled subspace whose normalized projector is invariant under partial transposition across every bipartition, giving explicit multipartite bound entangled states that no fully decomposable witness can detect.","feed_headline":"MDS codes build genuinely unextendible product bases","feed_subtitle":"The same construction yields multipartite bound entangled states that fully decomposable witnesses cannot detect.","key_machinery":"The central object is the generator matrix $G$ of an MDS code, whose defining property is that every $N$ of its $N^2$ columns are linearly independent. That minor condition is used twice: transversal minors assign each computational cell to exactly one product tile, and replacement minors control the linear transformations between neighboring fixed-address slices. Together they yield the rectangle rigidity lemma, which forces any Cartesian union of more than one tile to fill the whole grid across every bipartition. Fourier-mode deletion and the stopper state then rule out the only rectangular configurations the rigidity lemma permits.","core_discovery":"The paper's central claim is Theorem 1: for every $N\\ge 3$, every prime $p$, and every linear $[N^2,N,N^2-N+1]_p$ MDS code $C$, the orthogonal family $U_C$ constructed by deleting one Fourier mode per tile and adjoining a global stopper is a genuinely unextendible product basis in $(\\mathbb{C}^{Np})^{\\otimes N}$. In plain terms, the complement of $U_C$ contains no nonzero vector that factors across any nontrivial bipartition of the $N$ parties. The heart of the proof is Lemma 1, MDS rectangle rigidity: if a union of at least two tiles is a Cartesian rectangle across some bipartition, then the union must be the entire computational grid. Since every vector in the complement is a superposition of one deleted mode per tile with coefficients summing to zero, a product vector in the complement would force such a rectangle; rigidity forces every tile to appear, and then the coefficient equations make the vector proportional to the stopper state, which is impossible because the stopper belongs to the original family.","pith_inferences":["Editorial inference: the rigidity lemma is proved only for prime fields, but the underlying MDS minor structure may survive over prime powers with a different filling argument; testing whether two tiles in $\\mathbb{F}_4$ can form a Cartesian rectangle would show whether the prime-field restriction is an artifact of the proof.","Editorial inference: because the construction assigns one tile per MDS codeword, the size and detection constant of the GUPB are tied to code parameters such as distance and dual distance, suggesting code-dependent entanglement measures independent of this paper.","Editorial inference: the asymptotic discrimination exponent $\\xi_{X|Y}$ defined from $\\kappa_{\\ell,X|Y}$ is a new finite-copy quantity attached to the MDS code; its value for Reed\\textendash Solomon codes is left open and could be computed explicitly."],"forward_implications":["For every prime $p\\ge N^2$, generalized Reed\\textendash Solomon codes give an explicit GUPB of size $p^N(N^N-1)+1$ in $(\\mathbb{C}^{Np})^{\\otimes N}$.","The normalized projector onto the complement of each GUPB is PPT with respect to every bipartition while supported on a genuinely entangled subspace, yielding an explicit family of multipartite bound entangled states.","A canonical witness $W_G=P_U-\\varepsilon_G I$ detects these states and is nondecomposable with respect to every bipartition, while no fully decomposable GME witness detects any member of the family.","Every finite tensor power $U_C^{\\otimes \\ell}$ remains a GUPB, and a PPT-invariant measurement distinguishes $\\rho_U^{\\otimes \\ell}$ from $\\rho_G^{\\otimes \\ell}$ perfectly even though every bipartite-separable measurement suffers a constant-factor gap."],"supporting_citations":[{"why":"Defines unextendible product bases and their connection to bound entanglement, supplying the concept the paper generalizes to the genuine multipartite setting.","marker":"[1]"},{"why":"Provides the tensor-product closure of unextendible product bases used to prove that every finite tensor power remains a GUPB.","marker":"[2]"},{"why":"Establishes that PPT entangled states are bound entangled, which lets the paper conclude the complementary states are nondistillable.","marker":"[4]"},{"why":"Introduces fully decomposable GME witnesses, the class the paper shows cannot detect its constructed states.","marker":"[44]"},{"why":"States the Singleton bound and the equivalent minor property of MDS codes on which the rectangle rigidity lemma rests.","marker":"[47]"},{"why":"Supplies generalized Reed–Solomon codes as the explicit infinite family realizing the required MDS parameters.","marker":"[48]"}],"fun_headline_variants":["MDS codes forge genuinely unextendible product bases","GUPBs from MDS codes for any number of parties","Error-correcting codes yield bound entanglement","MDS codes give genuine unextendibility and bound entanglement"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that the code's symbol field is a prime field $\\mathbb{F}_p$: the rigidity lemma fills missing positions by repeatedly adding a fixed nonzero difference, and this fills every slot only when the additive group is cyclic of prime order, as it is for $\\mathbb{F}_p$ but not for fields such as $\\mathbb{F}_4$.","fun_headline_variants_meta":{"raw":{"variants":["MDS codes forge genuinely unextendible product bases","GUPBs from MDS codes for any number of parties","Error-correcting codes yield bound entanglement","MDS codes give genuine unextendibility and bound entanglement"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000722,"raw_usage":{"total_tokens":3248,"prompt_tokens":961,"completion_tokens":2287,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":577,"completion_tokens_details":{"reasoning_tokens":2230}},"tokens_in":577,"tokens_out":2287,"duration_ms":17282,"temperature":1.0,"reasoning_tokens":2230,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-11T16:01:40.372471+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run an exhaustive search for small parameters, say $N=3$ and $p=3$: enumerate all subsets $\\Lambda\\subseteq\\mathbb{F}_3^3$ with $|\\Lambda|\\ge 2$ and test whether the union of the tiles $T_t$ for $t\\in\\Lambda$ is a Cartesian rectangle across any nontrivial bipartition; finding one would disprove Lemma 1. Alternatively, search the subspace $\\{\\sum_t a_t|\\psi_t\\rangle : \\sum_t a_t=0\\}$ for a nonzero vector that factors across some bipartition; finding one would refute Theorem 1.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Defines unextendible product bases and their connection to bound entanglement, supplying the concept the paper generalizes to the genuine multipartite setting."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the tensor-product closure of unextendible product bases used to prove that every finite tensor power remains a GUPB."},{"cited_title":"Horodecki, P","cited_arxiv_id":null,"evidence_quote":"Establishes that PPT entangled states are bound entangled, which lets the paper conclude the complementary states are nondistillable."},{"cited_title":"Jungnitsch, T","cited_arxiv_id":null,"evidence_quote":"Introduces fully decomposable GME witnesses, the class the paper shows cannot detect its constructed states."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"States the Singleton bound and the equivalent minor property of MDS codes on which the rectangle rigidity lemma rests."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies generalized Reed–Solomon codes as the explicit infinite family realizing the required MDS parameters."}],"review_version":1}