Constructions of unextendible entangled bases
Pith reviewed 2026-05-25 16:54 UTC · model grok-4.3
The pith
Several constructions produce unextendible entangled bases with fixed Schmidt number k in C^d ⊗ C^{d'} for 2 ≤ k ≤ d ≤ d'.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
We provide several constructions of special unextendible entangled bases with fixed Schmidt number k (SUEB k) in C^d ⊗ C^{d'} for 2≤k≤d≤d'. We generalize the space decomposition method by proposing a systematic way of constructing new SUEB k s for 2≤k < d ≤ d' or 2≤k=d< d'. In addition, we give a construction of a (pqdd'-p(dd'-N))-number SUEB pk in C^{pd} ⊗ C^{qd'} from an N-number SUEB k in C^d ⊗ C^{d'} for p≤q by using permutation matrices. We also connect a (d(d'-1)+m)-number UMEB in C^d ⊗ C^{d'} with an unextendible partial Hadamard matrix H_{m×d} with m<d.
What carries the argument
Generalized space decomposition method together with permutation matrices, which together generate the required SUEB k sets and scale them across dimensions.
If this is right
- Systematic constructions of SUEB k exist whenever 2 ≤ k < d ≤ d'.
- A (pqdd' - p(dd' - N))-sized SUEB pk can be obtained from any N-sized SUEB k via permutation matrices when p ≤ q.
- The number of certain UMEBs in C^d ⊗ C^{d'} equals d(d' - 1) + m when an unextendible partial Hadamard matrix of size m × d exists with m < d.
- The earlier space decomposition technique extends directly to the case k = d < d'.
Where Pith is reading between the lines
- The scaling construction via permutations suggests that families of SUEB k can be generated recursively for arbitrarily large dimensions.
- The explicit link to partial Hadamard matrices opens a route for importing combinatorial designs to produce new entangled bases.
- Similar decomposition steps may apply when the two subsystems have more than two parties, provided the Schmidt-number constraint is suitably generalized.
Load-bearing premise
The space decomposition method from the 2016 reference can be systematically extended to produce valid SUEB k when 2≤k<d≤d' or 2≤k=d<d', without additional hidden constraints on the dimensions or the choice of subspaces.
What would settle it
An explicit attempt to follow the generalized space decomposition in dimensions d=3, d'=4, k=2 that produces a set which is either extendible or fails to maintain Schmidt number exactly k would disprove the constructions.
read the original abstract
We provide several constructions of special unextendible entangled bases with fixed Schmidt number $k$ (SUEB$k$) in $\mathbb{C}^{d}\otimes \mathbb{C}^{d'}$ for $2\leq k\leq d\leq d'$. We generalize the space decomposition method in Guo [Phys. Rev. A 94, 052302 (2016)], by proposing a systematic way of constructing new SUEB$k$s in $\mathbb{C}^{d}\otimes \mathbb{C}^{d'}$ for $2\leq k < d \leq d'$ or $2\leq k=d< d'$. In addition, we give a construction of a $(pqdd'-p(dd'-N))$-number SUEB$pk$ in $\mathbb{C}^{pd}\otimes \mathbb{C}^{qd'}$ from an $N$-number SUEB$k$ in $\mathbb{C}^{d}\otimes \mathbb{C}^{d'}$ for $p\leq q$ by using permutation matrices. We also connect a $(d(d'-1)+m)$-number UMEB in $\mathbb{C}^{d}\otimes \mathbb{C}^{d'}$ with an unextendible partial Hadamard matrix $H_{m\times d}$ with $m<d$, which extends the result in [Quantum Inf. Process. 16(3), 84 (2017)].
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper claims to provide several explicit constructions of special unextendible entangled bases with fixed Schmidt number k (SUEB k) in C^d ⊗ C^{d'} for 2≤k≤d≤d'. It generalizes Guo's 2016 space decomposition method to the cases 2≤k<d≤d' and 2≤k=d<d', gives a permutation-matrix lifting that produces a (pq d d' - p(dd'-N))-element SUEB_{p k} in C^{p d} ⊗ C^{q d'} from an N-element SUEB k in the smaller space (p≤q), and connects a (d(d'-1)+m)-element UMEB in C^d ⊗ C^{d'} to an unextendible partial Hadamard matrix H_{m×d} with m<d, extending a 2017 result.
Significance. If the constructions are valid and the stated dimension ranges are achieved without hidden constraints, the work supplies systematic families of SUEB k and a new combinatorial link to partial Hadamard matrices. These objects are relevant to the study of maximal entanglement, unextendibility, and quantum state discrimination; the lifting and decomposition methods could be reusable for generating further examples.
minor comments (4)
- [§2] §2 (or wherever the generalized space decomposition is defined): the precise choice of subspaces or the inductive step that guarantees the fixed Schmidt number k and unextendibility should be stated as a numbered proposition or algorithm rather than left implicit in the text.
- [lifting section] The lifting construction in the permutation-matrix section: verify that the resulting set remains orthonormal and that the Schmidt number scales exactly as claimed (pk); an explicit small example (e.g., p=2, q=2, small d,d',N) would strengthen the claim.
- [Introduction] Notation: the abbreviation “SUEB k” is used before it is formally defined; add a sentence in the introduction that recalls the definition from the 2016 reference.
- [Hadamard section] The Hadamard-matrix connection: the precise relation between the UMEB cardinality d(d'-1)+m and the partial Hadamard matrix size m×d should be stated as a theorem with a short proof sketch.
Simulated Author's Rebuttal
We thank the referee for the careful reading of our manuscript, the positive summary of our contributions, and the recommendation for minor revision. No specific major comments were provided in the report.
Circularity Check
No significant circularity; explicit constructions are self-contained
full rationale
The paper's core contribution consists of explicit constructions that generalize the 2016 space-decomposition technique to SUEB k for the stated dimension ranges, together with a permutation-matrix lifting and a connection to unextendible partial Hadamard matrices. These are presented as direct, systematic recipes rather than derivations that reduce by definition or by fitted parameters to their own inputs. The cited 2016 reference supplies the starting method being extended; the present work supplies the new subspace choices and lifting rules, so the argument does not collapse to a self-citation chain or a renaming of a known result. No uniqueness theorem, ansatz smuggling, or prediction-from-fit pattern appears in the claimed steps.
Axiom & Free-Parameter Ledger
axioms (1)
- standard math Standard properties of finite-dimensional complex vector spaces and their tensor products hold.
Reference graph
Works this paper leans on
-
[1]
Bennett, C.H., Divincenzo, D.P., Mor, T., Shor, P.W., Smolin, J.A., Terh al, B.M.: Unextendible product bases and bound entanglement. Phys. R ev. Lett. 82, 5385 (1999). Constructions of unextendible entangled bases 13
work page 1999
-
[2]
Pittenger, A.O.: Unextendible product bases and the construct ion of insep- arable states. Lin. Alg. Appl. 359, 235 (2003)
work page 2003
-
[3]
Sollid, P.Ø., Leinaas, J.M., Myrheim, J.: Unextendible product bases a nd extremal density matrices with positive partial transpose. Phys. Rev. A 84, 042325 (2011)
work page 2011
-
[4]
Skowronek, /suppress L.: Three-by-three bound entanglement with general unex- tendible product bases. J. Math. Phys. 52, 122202 (2011)
work page 2011
-
[5]
Bravyi, S.B.: Unextendible product bases and locally unconvertible bound entangled states. Quantum Inf. Process. 3, 309 (2004)
work page 2004
-
[6]
Divincenzo, D.P., Mor, T., Shor, P.W., Smolin, J.A., Terhal, B.M.: Unex- tendible product bases, uncompletable product bases and bound e ntangle- ment. Math. Phys. 238, 379-410 (2003)
work page 2003
-
[7]
Bravyi, S., Smolin, J.A.: Unextendible maximally entangled bases. Phy s. Rev. A 84, 042306 (2011)
work page 2011
-
[8]
Chen, B., Fei, S.M.: Unextendible maximally entangled bases and mutu ally unbiased bases. Phys. Rev. A 88, 034301 (2013)
work page 2013
-
[9]
Guo, Y., Wu, S.J.: Unextendible entangled bases with fixed Schmidt n um- ber. Phys. Rev. A 90, 054303 (2014)
work page 2014
-
[10]
Guo, Y., Jia, Y.P., Li, X.L.: Multipartite unextendible entangled basis . Quantum Inf. Process. 14, 3553 (2015)
work page 2015
-
[11]
Wang, Y.L., Li, M.S., Fei, S.M.: Connecting unextendible maximally en- tangled base with partial Hadamard matrices. Quantum Inf. Proce ss. 16(3), 84 (2017)
work page 2017
-
[12]
Li, M.S., Wang, Y.L., Zheng, Z.J.: Unextendible maximally entangled bases in Cd ⊗ Cd′ . Phys. Rev. A 89, 062313 (2014)
work page 2014
-
[13]
Guo, Y.: Constructing the unextendible maximally entangled basis from the maximally entangled basis. Phys. Rev. A 94, 052302 (2016)
work page 2016
-
[14]
Wang, Y.L., Li, M.S., Fei, S.M.: Unextendible maximally entangled bases in Cd ⊗ Cd. Phys. Rev. A 90, 034301 (2014)
work page 2014
-
[15]
Zhang, J.G., Tao, Y.H., Han, Y.F., Yong, X.L., Fei, S.M.: Unextendible maximally entangled bases in Cpd ⊗ Cqd. Quantum Inf. Process. 17, 318 (2018)
work page 2018
-
[16]
Nan, H., Tao, Y.H., Li, L.S., Zhang, J.: Unextendible maximally entang led bases and mutually unbiased bases in Cd ⊗ Cd′ . Int. J. Theor. Phys. 54, 927 (2015)
work page 2015
-
[17]
Cambridge University press, Cambridge (2004)
Nielsen, M.A., Chuang, I.L.: Quantum computation and quantum inf or- mation. Cambridge University press, Cambridge (2004)
work page 2004
-
[18]
Guo, Y., Du, S.P., Li, X.L.: Entangled bases with fixed Schmidt numbe r. J. Phys. A Math. Theor. 48 245301 (2015)
work page 2015
-
[19]
Master’s thesis, Univ ersity of Wa- terloo (2004)
Schacke, K.: On the kronecker product. Master’s thesis, Univ ersity of Wa- terloo (2004)
work page 2004
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.