Metraipolis › archive › dc_7c299833ecbc

The Sample Complexity of Quantum Entanglement Allocation — arXiv:2609.10141

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.10141
License (as archived)
CC0-1.0
Archived
2026-10-16T11:21:52.197Z
SHA-256 of the archived text
d11f6fff6fcbddbd630e9a6eef78e49f8e859a2969111138f6df3a6054f41697
Stable URL of this page
https://metraipolis.com/documento/dc_7c299833ecbc

How to cite

The Sample Complexity of Quantum Entanglement Allocation — arXiv:2609.10141 — arXiv (en), https://arxiv.org/abs/2609.10141 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7c299833ecbc (Metraipolis archive dc_7c299833ecbc, sha256 d11f6fff6fcbddbd630e9a6eef78e49f8e859a2969111138f6df3a6054f41697)
BibTeX
@misc{dc7c299833ecbc,
  title = {The Sample Complexity of Quantum Entanglement Allocation — arXiv:2609.10141},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.10141},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7c299833ecbc; sha256 d11f6fff6fcbddbd630e9a6eef78e49f8e859a2969111138f6df3a6054f41697},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.10141. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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$ qubits have minimax excess error after $m$ requests proportional to $k^{-1}\min\{1,\sqrt{d\log(k+1)/m}\}$, uniformly for $2\leq k<d$. Connected biclique regions can grow without increasing sample demand when depth, region count and connections per region stay bounded. Preparation noise introduces a separate calibration requirement. We derive an exact tradeoff with extra fresh detector calls and transfer the learning law to structured transaction co-location. Population-risk experiments test the statistical predictions. We also compare encodings on a native 15-qubit device and learned partitions on public purchase baskets. The full chain wins on the device; frequency grouping outperforms basket search in the largest-capacity retail setting.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-10 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph) ; Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2609.10141 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T11:00:36.238Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-10?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).