Metraipolis › archive › dc_656e53846315

Breaking the Multiplicative Overhead in Quantum Entropy Estimation — arXiv:2609.40179

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.40179
License (as archived)
CC0-1.0
Archived
2026-10-07T15:22:16.394Z
SHA-256 of the archived text
2e3e9c717da89ecd5f49cabcf8da469c8ed5ce93ae2693eab04d58bcd3cab344
Stable URL of this page
https://metraipolis.com/documento/dc_656e53846315

How to cite

Breaking the Multiplicative Overhead in Quantum Entropy Estimation — arXiv:2609.40179 — arXiv (en), https://arxiv.org/abs/2609.40179 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_656e53846315 (Metraipolis archive dc_656e53846315, sha256 2e3e9c717da89ecd5f49cabcf8da469c8ed5ce93ae2693eab04d58bcd3cab344)
BibTeX
@misc{dc656e53846315,
  title = {Breaking the Multiplicative Overhead in Quantum Entropy Estimation — arXiv:2609.40179},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.40179},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_656e53846315; sha256 2e3e9c717da89ecd5f49cabcf8da469c8ed5ce93ae2693eab04d58bcd3cab344},
  year = {2026}
}

Archived text

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

The von Neumann, Tsallis, and Rényi entropies are fundamental measures of quantum information. A common estimation strategy multiplies the worst-case costs of spectral transformation and statistical readout, leaving gaps to query lower bounds. We reduce this overhead with multi-level algorithms that use local normalization and precision allocation, while variable-time estimation accounts for the probability of reaching expensive spectral tests. With controlled purified access and its inverse, we obtain bounds for additive error $\varepsilon$, rank upper bound $R$, and fixed order $\alpha$. Tsallis entropy estimation has near-optimal rank-independent query complexity $\widetilde O(\varepsilon^{-1/(\alpha-1)})$ for $1<\alpha<2$, when the allowed dimension and rank accommodate the lower-bound instances, and $\widetilde O(1/\varepsilon)$ for $\alpha\ge2$, where $\widetilde O$ suppresses logarithmic factors. The first saves a factor $1/\varepsilon$; the second extends known integer-order scaling to noninteger orders. We also improve the von Neumann entropy bound from $\widetilde O(R/\varepsilon^2)$ to $\widetilde O(R/\varepsilon)$ and obtain $\widetilde O(R/\varepsilon)$ for noninteger Rényi orders $1<\alpha<3$, with further bounds at other orders. Our functional-estimation theorem replaces the global product by a sum of local costs weighted by function magnitudes and spectral masses. We further estimate fixed logarithmic moments and entropy variance using $\widetilde O(R/\varepsilon)$ queries, providing efficient access to fluctuation parameters that enter finite-blocklength quantum compression and pure-state entanglement conversion. More broadly, our framework extends beyond entropy to a broad class of density-matrix functionals, offering a systematic approach toward optimal query complexity in quantum spectral estimation.

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