Metraipolis › archive › dc_2539daefbce1

Quantized Low-Rank Quantum State Tomography: Hyperbolic Quantization and Riemannian Least-Squares Recovery — arXiv:2608.27503

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.27503
License (as archived)
CC0-1.0
Archived
2026-10-17T11:27:19.038Z
SHA-256 of the archived text
45e8fba292d0b5bfe618ce6d66a1cac67ebcc1c0598ec980159a8872a888216d
Stable URL of this page
https://metraipolis.com/documento/dc_2539daefbce1

How to cite

Quantized Low-Rank Quantum State Tomography: Hyperbolic Quantization and Riemannian Least-Squares Recovery — arXiv:2608.27503 — arXiv (en), https://arxiv.org/abs/2608.27503 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2539daefbce1 (Metraipolis archive dc_2539daefbce1, sha256 45e8fba292d0b5bfe618ce6d66a1cac67ebcc1c0598ec980159a8872a888216d)
BibTeX
@misc{dc2539daefbce1,
  title = {Quantized Low-Rank Quantum State Tomography: Hyperbolic Quantization and Riemannian Least-Squares Recovery — arXiv:2608.27503},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.27503},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2539daefbce1; sha256 45e8fba292d0b5bfe618ce6d66a1cac67ebcc1c0598ec980159a8872a888216d},
  year = {2026}
}

Archived text

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

We study low-rank quantum state tomography from finite-bit Pauli batch responses. To avoid bias introduced by generic quantization, we propose HyperQuant, a mean-preserving hyperbolic quantizer adapted to the second-moment scale of Pauli responses. We establish minimax distortion guarantees and show that exact mean preservation enables direct rank-constrained least-squares recovery without altering the population target. We derive nonasymptotic recovery guarantees and an explicit bit--shot tradeoff under which finite-bit responses retain the error order of unquantized batch averages using fewer response bits. For efficient computation, we develop QuantRGD, a Riemannian gradient method with provable linear convergence to the corresponding statistical neighborhood under explicit resource conditions. Numerical experiments validate the predicted quantization, recovery, and convergence behavior.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-31 in math.IT).
Categorie arXiv: Quantum Physics (quant-ph) ; Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2608.27503 — 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-17T11:07:15.584Z dalla pagina https://arxiv.org/catchup/math.IT/2026-08-31?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).