Unextendible product bases and 1-factorization of complete graphs
From MaRDI portal
Publication:2492195
DOI10.1016/j.dam.2005.10.011zbMath1094.05043OpenAlexW2084534072MaRDI QIDQ2492195
Publication date: 9 June 2006
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.10.011
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (15)
Nonexistence of \(n\)-qubit unextendible product bases of size \(2^n-5\) ⋮ Strong quantum nonlocality for unextendible product bases in heterogeneous systems ⋮ Unextendible product basis for fermionic systems ⋮ The construction of 7-qubit unextendible product bases of size ten ⋮ Constructing unextendible product bases from multiqubit ones ⋮ Multipartite unextendible product bases and quantum security ⋮ Extension of the unextendible product bases of 5-qubit under coarsening the system ⋮ Maximum dimension of subspaces with no product basis ⋮ Multiqubit UPB: the method of formally orthogonal matrices ⋮ The minimum size of unextendible product bases in the bipartite case (and some multipartite cases) ⋮ Constructing 2 × 2 × 4 and 4 × 4 unextendible product bases and positive-partial-transpose entangled states ⋮ Three-by-three bound entanglement with general unextendible product bases ⋮ The unextendible product bases of four qubits: Hasse diagrams ⋮ Local distinguishability based genuinely quantum nonlocality without entanglement ⋮ Unextendible product bases from tile structures in bipartite systems
Uses Software
Cites Work
This page was built for publication: Unextendible product bases and 1-factorization of complete graphs
