Metraipolis › archive › dc_2621ff01fe39

Controlled-Memory Identification with Shared Generators: Dimension--Horizon Tradeoffs and Quantum--Classical Separation — arXiv:2610.21797

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.21797
License (as archived)
CC0-1.0
Archived
2026-10-16T10:34:53.484Z
SHA-256 of the archived text
b0075d6360a223b9b22098e072d4ae28518e7351a3b3c118cf79fa1ca981f059
Stable URL of this page
https://metraipolis.com/documento/dc_2621ff01fe39

How to cite

Controlled-Memory Identification with Shared Generators: Dimension--Horizon Tradeoffs and Quantum--Classical Separation — arXiv:2610.21797 — arXiv (en), https://arxiv.org/abs/2610.21797 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2621ff01fe39 (Metraipolis archive dc_2621ff01fe39, sha256 b0075d6360a223b9b22098e072d4ae28518e7351a3b3c118cf79fa1ca981f059)
BibTeX
@misc{dc2621ff01fe39,
  title = {Controlled-Memory Identification with Shared Generators: Dimension--Horizon Tradeoffs and Quantum--Classical Separation — arXiv:2610.21797},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.21797},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2621ff01fe39; sha256 b0075d6360a223b9b22098e072d4ae28518e7351a3b3c118cf79fa1ca981f059},
  year = {2026}
}

Archived text

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

We determine the finite-horizon identification limits of a \(d\)-dimensional memory when the control interface is restricted to four shared, time-homogeneous generators. A writer encodes a message by applying a prefix word to a common root state. The verifier then applies a candidate-dependent query word followed by a shared terminal binary test, with each word of length at most \(T\). For fixed error tolerances \(\lambda_2>0\) and \(\lambda_1+\lambda_2<1\), the optimal identification sizes satisfy \(\ln N_{\mathsf Q,4}=\Theta_{\lambda_1,\lambda_2}(\min\{d^2,T\})\) for arbitrary CPTP generators and \(\ln N_{\mathsf S,4}=\Theta_{\lambda_1,\lambda_2}(\min\{d,T\})\) for stochastic maps. Four unitary letters and four permutation letters attain these respective bounds, showing that a four-letter reversible alphabet reaches the static code-size orders in optimal quadratic and linear word length. In the fully dimension-limited regime, this yields \(\ln N_{\mathsf Q,4}=\Theta(d^2)\) versus \(\ln N_{\mathsf S,4}=\Theta(d)\), establishing a quadratic quantum--classical separation in logarithmic code size. Low-overlap Grassmann and agreement-code packings supply the orbit endpoints, while exact inverse query words match each encoded state to its designated test. At the sharp boundary \(\lambda_2=0\), \(0\leq\lambda_1<1\), all four model classes satisfy \(\ln N=\Theta(\min\{\ln d,T\})\). Thus any fixed positive false-acceptance tolerance activates the metric-packing regime, whereas zero false acceptance imposes an exclusive-witness constraint and yields the logarithmic-dimension boundary.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno).
Categorie arXiv: Quantum Physics (quant-ph) ; Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2610.21797 — 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-16T08:51:02.599Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).