Metraipolis › archive › dc_3bdd1931c8a0

Optimal spectrum estimation — arXiv:2609.30171

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.30171
License (as archived)
CC0-1.0
Archived
2026-10-08T07:26:48.118Z
SHA-256 of the archived text
f9d03c250f1cf23de1fb0a309f199fd442b43b257c49c490b342cf02fd54c75e
Stable URL of this page
https://metraipolis.com/documento/dc_3bdd1931c8a0

How to cite

Optimal spectrum estimation — arXiv:2609.30171 — arXiv (en), https://arxiv.org/abs/2609.30171 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3bdd1931c8a0 (Metraipolis archive dc_3bdd1931c8a0, sha256 f9d03c250f1cf23de1fb0a309f199fd442b43b257c49c490b342cf02fd54c75e)
BibTeX
@misc{dc3bdd1931c8a0,
  title = {Optimal spectrum estimation — arXiv:2609.30171},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.30171},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3bdd1931c8a0; sha256 f9d03c250f1cf23de1fb0a309f199fd442b43b257c49c490b342cf02fd54c75e},
  year = {2026}
}

Archived text

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

We prove that the spectrum of an unknown $d$-dimensional quantum state can be estimated to error $\varepsilon$ in total variation distance using \[ O\!\left(d^2\min\left\{ \frac{1}{(\varepsilon\log d)^4},\; \frac{1}{(\varepsilon\log d)^2} \right\}\right) \] copies. This matches the recent lower bound of Wang. When restricted to unentangled measurements, we give an algorithm with an additional factor of $d$ in copy complexity, which we conjecture to be optimal. We develop a framework for recovering the small eigenvalues of a quantum state by matching Chebyshev moments. We bound the variance of each Chebyshev moment estimate in terms of scalar derivatives of the corresponding polynomial, using classical and quantum Efron--Stein decompositions. Different rescalings of the Chebyshev polynomials balance approximation error and variance, yielding two regimes in our copy complexity bound.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-25 in cs.DS).
Categorie arXiv: Quantum Physics (quant-ph) ; Computational Complexity (cs.CC); Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2609.30171 — 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-08T06:44:29.101Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).