TY - JOUR
T1 - The unextendible product bases of four qubits
T2 - Hasse diagrams
AU - Chen, Lin
AU - Ɖoković, Dragomir
N1 - Publisher Copyright:
© 2019, Springer Science+Business Media, LLC, part of Springer Nature.
PY - 2019/5/1
Y1 - 2019/5/1
N2 - We consider the unextendible product bases (UPBs) of fixed cardinality m in quantum systems of n qubits. These UPBs are divided into finitely many equivalence classes with respect to an equivalence relation introduced by N. Johnston. There is a natural partial order “≤ ” on the set of these equivalence classes for fixed m, and we use this partial order to study the topological closure of an equivalence class of UPBs. In the case of four qubits, for m= 8 , 9 , 10 , we construct explicitly the Hasse diagram of this partial order.
AB - We consider the unextendible product bases (UPBs) of fixed cardinality m in quantum systems of n qubits. These UPBs are divided into finitely many equivalence classes with respect to an equivalence relation introduced by N. Johnston. There is a natural partial order “≤ ” on the set of these equivalence classes for fixed m, and we use this partial order to study the topological closure of an equivalence class of UPBs. In the case of four qubits, for m= 8 , 9 , 10 , we construct explicitly the Hasse diagram of this partial order.
KW - Four qubits
KW - Hasse diagrams
KW - UPB
KW - Unextendible product bases
UR - https://www.scopus.com/pages/publications/85063687026
U2 - 10.1007/s11128-019-2259-9
DO - 10.1007/s11128-019-2259-9
M3 - 文章
AN - SCOPUS:85063687026
SN - 1570-0755
VL - 18
JO - Quantum Information Processing
JF - Quantum Information Processing
IS - 5
M1 - 143
ER -