arXiv (OAI Expanded)
open access
Systematic construction of multiqubit unextendible product bases
The construction of multiqubit unextendible product bases (UPBs) has been a long-standing problem. We give a systematic construction of multiqubit UPBs by studying their unextendible orthogonal matrices (UOMs) with graph-theoretic methods. Row decompositions of small UOMs produce the main intervals.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On Non-Existence of Absolutely Maximally Entangled Canonical Graph States in Even Local Dimensions#1129204
- Construction of orthogonal arrays#356746
- Gaussian Relational Graph Transformer#196472
- A lower bound for $\langle 3,2,m \rangle$ matrix multiplication#1036464
- Numerical Stability of Linear Algebra Operations over Relational Databases#1083300
Record · ID 1084710
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive