Metraipolis › archive › dc_49d51131d087
Near-Optimal Mixedness Testing with Pauli Measurements — arXiv:2608.18839
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.18839
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T13:59:13.558Z
- SHA-256 of the archived text
de71bba8b27afd528e36dc789c73d789906b7d18184b9a401c3a30b7994a0dd6- Stable URL of this page
https://metraipolis.com/documento/dc_49d51131d087
How to cite
Near-Optimal Mixedness Testing with Pauli Measurements — arXiv:2608.18839 — arXiv (en), https://arxiv.org/abs/2608.18839 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_49d51131d087 (Metraipolis archive dc_49d51131d087, sha256 de71bba8b27afd528e36dc789c73d789906b7d18184b9a401c3a30b7994a0dd6)
BibTeX
@misc{dc49d51131d087,
title = {Near-Optimal Mixedness Testing with Pauli Measurements — arXiv:2608.18839},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.18839},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_49d51131d087; sha256 de71bba8b27afd528e36dc789c73d789906b7d18184b9a401c3a30b7994a0dd6},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.18839. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We consider a fundamental problem of \emph{mixedness testing}: Given $n$ copies of an $N$-qubit state $\rho$, determine whether $\rho = \mathbb{I}_d/d$ or $\|\rho-\mathbb{I}_d/d\|_1 \geq \varepsilon$ with high probability, where $d = 2^N$. In particular, we focus on performing this task in the practical setting of single-qubit measurements, where measurements are prepared independently on each qubit. We provide a nearly complete picture of single-qubit mixedness tesing by showing $n = \tilde{\Theta}\left(\sqrt{10}^N/\varepsilon^2\right)$. To establish our lower bound, we introduce a measurement-dependent lower bound framework for adaptive single-copy state certification. For the upper bound, we present a randomized Pauli basis measurement protocol, which relies on a new primitive for computationally efficient uniformity testing of correlation-concentrated distributions on the Boolean hypercube. In conjunction, we provide lower and upper bounds for mixedness testing with fixed Pauli measurement protocols.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-20 in math.IT).
Categorie arXiv: Quantum Physics (quant-ph) ; Computational Complexity (cs.CC); Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2608.18839 — 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-18T13:58:18.015Z dalla pagina https://arxiv.org/catchup/math.IT/2026-08-20?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).