SOURCE-LINKED INTELLIGENCE

The Sample Complexity of Quantum Entanglement Allocation

arXiv · AI, language, vision and robotics · article · Sep 9, 2026 · UTC

How many past requests are needed to decide which qubits should share entanglement? We show that the answer depends on the allocation choices created by the queries: a larger memory can require no more data. The memory stores a classical bit and answers requests through a fixed detector that preserves coherence within each measured sector. For independent commuting $X$- and $Z$-type Pauli queries, we characterize the full attainable prediction-contrast region and construct encodings that preserve the bit at every nonzero vertex. With sharp reports, a $d$-qubit path and groups of at most $k$ qu

Read original source ↗ Open in workspace

recordType

paper

region

Global