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

Quantum Information Processing

Multipartite unextendible product bases and quantum security

Lin Chen, Yifan Yuan, Jiahao Yan, Mengfan Liang

Published Jun 24, 2023• 0 citations
Publisher
DOI
10.1007/s11128-023-04014-0

Related papers

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•379 citations

Unextendible Maximally Entangled Bases and Mutually Unbiased Bases in Multipartite Systems

Yajing Zhang, Hui Zhao, Naihuan Jing +1 more

arXiv:1708.04171•International Journal of Theoretical Physics•Aug 11, 2017•8 citations

Unextendible product bases and the construction of inseparable states

A. O. Pittenger

arXiv:quant-ph/0208028•Linear Algebra and its Applications•Nov 11, 2002•37 citations

Automated Construction and Verification of Unextendible Product Bases

Zicheng Han, Wanchen Zhang, Fei Shi +1 more

Unextendible product bases (UPBs) are important structures in quantum information theory, with applications to completely entangled subspaces, bound entanglement, and local indistinguishability. Since many properties and applications of UPBs are closely related to their cardinalities, one of the central problems in the study of UPBs is to determine whether UPBs of prescribed sizes exist in a given multipartite system. In this paper, we introduce a SAT-assisted framework based on decompositions of the \(N\)-dimensional hypercube. We define \(O_N\)-tile decompositions and prove a tile-to-UPB theorem: every \(O_N\)-tile decomposition induces a UPB through a construction based on tile-wise Fourier product bases and a global stopper state. We then encode the search for such decompositions as a Boolean satisfiability (SAT) problem and use SAT solvers to generate explicit instances. In terms of verification, we also implement a UPB verification algorithm based on local orthogonality graphs and unsaturated subspaces. The algorithm can be used to determine whether an arbitrary finite set of product states forms a UPB. Using this framework, we obtain UPBs of several sizes in some tripartite and quadripartite systems, including sizes \(13,14,\ldots,23\) in \(\mathbb C^3\otimes\mathbb C^3\otimes\mathbb C^3\). Moreover, the small-dimensional instances obtained here can serve as seed UPBs for recursive constructions, leading to further examples in larger multipartite systems.

quant-pharXiv:2608.01438•Aug 4, 2026•1 citation

Unextendible Product Bases and Locally Unconvertible Bound Entangled States

Sergey B. Bravyi

arXiv:quant-ph/0310172•Quantum Information Processing•Dec 1, 2004•39 citations

Multipartite unextendible entangled basis

Yu Jing Guo, Yanping Jia, Xiulan Li

arXiv:1502.00490•Quantum Information Processing•Jul 1, 2015•24 citations
Unextendible product bases (UPBs) are important structures in quantum information theory, with applications to completely entangled subspaces, bound entanglement, and local indistinguishability. Since many properties and applications of UPBs are closely related to their cardinalities, one of the central problems in the study of UPBs is to determine whether UPBs of prescribed sizes exist in a given multipartite system. In this paper, we introduce a SAT-assisted framework based on decompositions of the NNN-dimensional hypercube. We define ONO_NON​-tile decompositions and prove a tile-to-UPB theorem: every ONO_NON​-tile decomposition induces a UPB through a construction based on tile-wise Fourier product bases and a global stopper state. We then encode the search for such decompositions as a Boolean satisfiability (SAT) problem and use SAT solvers to generate explicit instances. In terms of verification, we also implement a UPB verification algorithm based on local orthogonality graphs and unsaturated subspaces. The algorithm can be used to determine whether an arbitrary finite set of product states forms a UPB. Using this framework, we obtain UPBs of several sizes in some tripartite and quadripartite systems, including sizes 13,14,…,2313,14,\ldots,2313,14,…,23 in C3⊗C3⊗C3\mathbb C^3\otimes\mathbb C^3\otimes\mathbb C^3C3⊗C3⊗C3. Moreover, the small-dimensional instances obtained here can serve as seed UPBs for recursive constructions, leading to further examples in larger multipartite systems.