Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1809.01033 · Quantum Information Processing

The unextendible product bases of four qubits: Hasse diagrams

Lin Chen, Dragomir Ž. Ðoković

Published Mar 29, 2019• 8 citations
arXivHTMLPDF
DOI
10.1007/s11128-019-2259-9

Related papers

3 The Minimum Size of Qubit Unextendible Product Bases

Nathaniel Johnston

•Aug 14, 2016•0 citations

The construction of 7-qubit unextendible product bases of size ten

Kai Wang, Lin Chen

Quantum Information Processing•May 11, 2020•9 citations

Extension of the unextendible product bases of 5-qubit under coarsening the system

Jinmei Wang, Yu Jing Guo, Ruiping Wen

Quantum Information Processing•Feb 6, 2023•0 citations

Unextendible Product Bases, Uncompletable Product Bases and Bound Entanglement

David Peter Divincenzo, Tal Mor, Peter W. Shor +2 more

arXiv:quant-ph/9908070•Communications in Mathematical Physics•Jul 1, 2003•349 citations

Multipartite unextendible product bases and quantum security

Lin Chen, Yifan Yuan, Jiahao Yan +1 more

Quantum Information Processing•Jun 24, 2023•0 citations

Unextendible stabiliser bases

Markus Frembs

We study incomplete sets of orthogonal stabiliser states that cannot be extended by a further stabiliser state orthogonal to all of its members. Such sets are the stabiliser analogue of unextendible product bases (UPBs), and we thus call them unextendible stabiliser bases (USBs). Leveraging the symplectic geometry underlying the $n$-qudit Pauli group in prime local dimension, we explicitly construct USBs for systems of four qubits and three qudits of odd prime local dimension. Moreover, we show that these are the respective minimal qubit, respectively qudit numbers for which such bases exist, and that USBs exist for all $n\geq4$ qubit and for all $n\geq3$ odd-prime-dimensional qudit systems. Finally, we compare the resource-theoretic aspects of USBs with those of UPBs. We establish that, analogous to the case of UPBs, the orthogonal complement of every unextendible stabiliser set is a stabiliser-free subspace, and its normalised projector is necessarily magic; moreover, it is bound magic in odd prime dimension, yet need not be for qubits. We also show that USB unextendibility alone imposes no uniform quantitative obstruction to discrimination by stabiliser operations.

quant-pharXiv:2608.10202•Aug 12, 2026•0 citations
We study incomplete sets of orthogonal stabiliser states that cannot be extended by a further stabiliser state orthogonal to all of its members. Such sets are the stabiliser analogue of unextendible product bases (UPBs), and we thus call them unextendible stabiliser bases (USBs). Leveraging the symplectic geometry underlying the nnn-qudit Pauli group in prime local dimension, we explicitly construct USBs for systems of four qubits and three qudits of odd prime local dimension. Moreover, we show that these are the respective minimal qubit, respectively qudit numbers for which such bases exist, and that USBs exist for all n≥4n\geq4n≥4 qubit and for all n≥3n\geq3n≥3 odd-prime-dimensional qudit systems. Finally, we compare the resource-theoretic aspects of USBs with those of UPBs. We establish that, analogous to the case of UPBs, the orthogonal complement of every unextendible stabiliser set is a stabiliser-free subspace, and its normalised projector is necessarily magic; moreover, it is bound magic in odd prime dimension, yet need not be for qubits. We also show that USB unextendibility alone imposes no uniform quantitative obstruction to discrimination by stabiliser operations.