Genuinely Unextendible Product Bases from Maximum Distance Separable Codes

• URL: http://arxiv.org/abs/2608.09504v1
• Date: Mon, 10 Aug 2026 12:07:04 GMT
• Title: Genuinely Unextendible Product Bases from Maximum Distance Separable Codes
• Abstract summary: We study the existence of genuinely unextendible product bases (GUPBs)<n>We construct GUPBs for any number $Ngeq3$ of parties using classical maximum distance separable codes.<n>Results establish a direct connection between error-correcting codes and multipartite entanglement.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The existence of genuinely unextendible product bases (GUPBs), incomplete orthogonal sets of fully product states whose orthogonal complements contain no product vector across any bipartition, has remained an open problem. Here we construct GUPBs for any number $N\geq3$ of parties using classical maximum distance separable (MDS) codes. The MDS property imposes a rigidity on the induced product tiling across every bipartition; combined with Fourier mode deletion and a stopper state, this rigidity enforces genuine unextendibility. Consequently, the orthogonal complement of each GUPB is a genuinely entangled subspace whose normalized projector is invariant under partial transposition across every bipartition, yielding an explicit family of multipartite bound entangled states. We further construct GME witnesses that detect these states even though no fully decomposable witness can do so. Moreover, the resulting indistinguishability persists under arbitrary finite tensor powers and measurements separable across any bipartition. These results establish a direct connection between error-correcting codes and multipartite entanglement and provide an algebraic route to certifying genuinely multipartite bound entanglement.

Related papers

• Full Inseparability and Genuine Multipartite Entanglement Coincide for Finite-Mode Gaussian States [39.7867986252164]
  We prove that a biseparable decomposition may switch the separable cut from term to term in general mixed states.<n>For any finite family of partitions, a Gaussian density operator in the trace-norm-closed convex class generated by states separable across those partitions is already separable across one fixed partition in the family.
  arXiv  Detail & Related papers  (2026-09-10T02:02:56Z)
• Maximal-Rank Squeezing from Rank-One Quenches: An Exact Spectral-Reachability Theorem for Gaussian Bosonic Systems [0.0]
  We prove an exact spectral-reachability theorem for multimode squeezing generated by finite-rank quadratic quenches in Gaussian bosonic systems.<n>A single rank-one element with nonzero overlap with every mode produces a full-rank anomalous Bogoliubov response at every nonzero stable coupling.
  arXiv  Detail & Related papers  (2026-08-17T17:12:19Z)
• GAUGE: Granularity-Adaptive Counterfactual Gating of Evidence for Incomplete Multimodal Classification [17.595478415811687]
  Multimodal classification typically assumes all modalities are available, yet real-world inputs are often incomplete.<n>We propose GAUGE, a lightweight counterfactual gating framework for incomplete multimodal classification.<n>GAUGE scores the counterfactual effect of replacing every unit with a reference representation through prediction-aware Taylor evidence scores.
  arXiv  Detail & Related papers  (2026-08-06T05:07:14Z)
• Frame-Dependent Traces and the Third-Particle Paradox [45.88028371034407]
  We show that the Paradox of the Third Particle arises when comparing subsystem descriptions across Quantum Reference Tracing perspectives.<n>We argue that our condition captures the Paradox content: rather than imposing consistency on the whole state space, we reproduce exactly the states on which it holds.
  arXiv  Detail & Related papers  (2026-07-23T18:00:01Z)
• CoCurve: Cross-Module Co-Pruning Curvature for Training-Free Structured LLM Pruning [47.406985340436925]
  CoCurve is a calibration-only, fine-tuning-free method that prunes attention and FFN units jointly.<n>It reduces to one budgeted quadratic program, solved in a single shot under a shared attention--FFN budget, with no labels, fine-tuning, or recovery.
  arXiv  Detail & Related papers  (2026-07-20T05:27:57Z)
• Complete entanglement detection using polynomial invariants [1.9573380763700712]
  Existing methods for deciding whether a bipartite quantum state is separable or entangled typically fall into one of two categories.<n>We overcome both limitations in a unified framework by deriving separability criteria in the form of universal bounds on tensor powers of separable states.<n>We explicitly construct a corresponding family of nonlinear entanglement witnesses, which can detect all forms of entanglement without requiring an explicit density matrix.
  arXiv  Detail & Related papers  (2026-06-15T13:40:59Z)
• Sufficient criteria for absolute separability in arbitrary dimensions via linear map inverses [0.0]
  Quantum states that remain separable (i.e., not entangled) under any global unitary transformation are known as absolutely separable and form a convex set.<n>We employ linear maps and their inverses to derive new sufficient analytical conditions for absolute separability in arbitrary dimensions.<n>We refine the characterization of the set when multiple non-comparable criteria for absolute separability are available.
  arXiv  Detail & Related papers  (2024-10-29T18:00:04Z)
• Unextendibility, uncompletability, and many-copy indistinguishable ensembles [49.1574468325115]
  We show that the complement of any bipartite pure entangled state is spanned by product states which form a nonorthogonal unextendible product basis (nUPB) of maximum cardinality.<n>We also report a class of multipartite many-copy indistinguishable ensembles for which local indistinguishability property increases with decreasing number of mixed states.
  arXiv  Detail & Related papers  (2023-03-30T16:16:41Z)
• Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
  We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete. We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes. Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
  arXiv  Detail & Related papers  (2021-08-10T15:00:20Z)
• Probabilistic Serial Mechanism for Multi-Type Resource Allocation [32.93710648011737]
  We show that the existing multi-type probabilistic serial (MPS) mechanism satisfies the stronger efficiency notion of lexi-efficiency. We also prove that MPS can be characterized both by leximin-ptimality and by item-wise ordinal fairness.
  arXiv  Detail & Related papers  (2020-04-25T05:38:06Z)
• Distributed, partially collapsed MCMC for Bayesian Nonparametrics [68.5279360794418]
  We exploit the fact that completely random measures, which commonly used models like the Dirichlet process and the beta-Bernoulli process can be expressed as, are decomposable into independent sub-measures. We use this decomposition to partition the latent measure into a finite measure containing only instantiated components, and an infinite measure containing all other components. The resulting hybrid algorithm can be applied to allow scalable inference without sacrificing convergence guarantees.
  arXiv  Detail & Related papers  (2020-01-15T23:10:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.