Pages that link to "Item:Q2492195"

The following pages link to Unextendible product bases and 1-factorization of complete graphs (Q2492195):

Displaying 18 items.

• Nonexistence of \(n\)-qubit unextendible product bases of size \(2^n-5\) (Q1617179) (← links)
• Maximum dimension of subspaces with no product basis (Q2020690) (← links)
• The unextendible product bases of four qubits: Hasse diagrams (Q2100765) (← links)
• The minimum size of unextendible product bases in the bipartite case (and some multipartite cases) (Q2514200) (← links)
• The construction of 7-qubit unextendible product bases of size ten (Q2677259) (← links)
• Extension of the unextendible product bases of 5-qubit under coarsening the system (Q2693853) (← links)
• Three-by-three bound entanglement with general unextendible product bases (Q2853582) (← links)
• Unextendible product basis for fermionic systems (Q3189935) (← links)
• Multiqubit UPB: the method of formally orthogonal matrices (Q4686775) (← links)
• Constructing 2 × 2 × 4 and 4 × 4 unextendible product bases and positive-partial-transpose entangled states (Q4965578) (← links)
• Strong quantum nonlocality for unextendible product bases in heterogeneous systems (Q5049481) (← links)
• Local distinguishability based genuinely quantum nonlocality without entanglement (Q5877994) (← links)
• Unextendible product bases from tile structures in bipartite systems (Q5879089) (← links)
• Unextendible product bases (Q5940308) (← links)
• Constructing unextendible product bases from multiqubit ones (Q6099041) (← links)
• Multipartite unextendible product bases and quantum security (Q6107763) (← links)
• The construction and weakly local indistinguishability of multiqubit unextendible product bases (Q6550811) (← links)
• Unextendible and strongly uncompletable product bases (Q6646356) (← links)