Metraipolis › archive › dc_d05f554e1320

Exact Local Optimality Does Not Compose: The Complexity of Chronological Realization — arXiv:2609.19707

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.19707
License (as archived)
CC0-1.0
Archived
2026-10-10T05:50:37.551Z
SHA-256 of the archived text
b90a066c1b4ce56735efe19939cd1df15a3c9c662f955013e2825c40e84b7323
Stable URL of this page
https://metraipolis.com/documento/dc_d05f554e1320

How to cite

Exact Local Optimality Does Not Compose: The Complexity of Chronological Realization — arXiv:2609.19707 — arXiv (en), https://arxiv.org/abs/2609.19707 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d05f554e1320 (Metraipolis archive dc_d05f554e1320, sha256 b90a066c1b4ce56735efe19939cd1df15a3c9c662f955013e2825c40e84b7323)
BibTeX
@misc{dcd05f554e1320,
  title = {Exact Local Optimality Does Not Compose: The Complexity of Chronological Realization — arXiv:2609.19707},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.19707},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d05f554e1320; sha256 b90a066c1b4ce56735efe19939cd1df15a3c9c662f955013e2825c40e84b7323},
  year = {2026}
}

Archived text

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

We study a controlled, normalized multi-menu positive-realization problem. A normalized realization reproduces declared root--word responses using common row-stochastic transition matrices and a single terminal effect. We compare three realization complexities: independent local realizations, a static shared carrier with independent query effects, and chronological shared realizations. We construct response families for which the local and static optimum widths both equal $k$, isolating the additional cost imposed by chronological consistency. An explicit payload--delay family has exact width $k$ locally and statically but requires exact width $k(L+1)$ under shared chronological coupling, yielding an unbounded multiplicative separation. For explicitly listed rational menus, exact shared realizability is $\exists\mathbb{R}$-complete, while the promise problem of distinguishing zero defect from defect at least inverse-polynomial is $\mathsf{PromiseNP}$-complete. These finite-menu hardness results hold with five control letters and a single Boolean terminal effect. For regular response families generated by a geometric compiler, rank-tight realizability over the full infinite language is equivalent to realizability on a polynomial-size finite core. Consequently, exact rank-tight realizability for the compiled instances has an $\exists\mathbb{R}$ upper bound, complementing a strongly bounded-rational $\mathsf{PromiseNP}$-hardness result.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-18 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.19707 — 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-10T05:18:18.893Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).