Metraipolis › archive › dc_cc80b6c63e41

A mixing time method for estimating the sample complexity of quantum state discrimination — arXiv:2609.40182

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.40182
License (as archived)
CC0-1.0
Archived
2026-10-07T14:15:21.245Z
SHA-256 of the archived text
cc03298ad6ce2914cb897d28fe819ca109b8c809c43b447de6682b538c7032aa
Stable URL of this page
https://metraipolis.com/documento/dc_cc80b6c63e41

How to cite

A mixing time method for estimating the sample complexity of quantum state discrimination — arXiv:2609.40182 — arXiv (en), https://arxiv.org/abs/2609.40182 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cc80b6c63e41 (Metraipolis archive dc_cc80b6c63e41, sha256 cc03298ad6ce2914cb897d28fe819ca109b8c809c43b447de6682b538c7032aa)
BibTeX
@misc{dccc80b6c63e41,
  title = {A mixing time method for estimating the sample complexity of quantum state discrimination — arXiv:2609.40182},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.40182},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cc80b6c63e41; sha256 cc03298ad6ce2914cb897d28fe819ca109b8c809c43b447de6682b538c7032aa},
  year = {2026}
}

Archived text

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

We develop a mixing time method for estimating the sample complexity of quantum state discrimination. We start with considering the minimum-error discrimination of geometrically uniform pure state ensembles, and prove that its sample complexity has a tight estimate given by a quantum homogeneous mixing time [George et al., 2026] and a quantum version of the generalized Dobrushin coefficient [Wolfer, 2020]. This quantum mixing time further reduces to a classical one when the generating group $G$ forms a Gelfand pair with the stabilizer subgroup $H$ of the generator state. In this case the generalized Dobrushin coefficient can be fully expressed by representation-theoretic quantities of the commutative Hecke algebra $\operatorname{End}_G(\mathbb C[G/H])$. In particular, this method reduces the sample complexity estimation of learning quantum coupon collector states [Arunachalam et al., 2020] and learning phase states to classical mixing time problems. We apply this framework to answer the open problems of learning degree-$d$ phase states over $\mathbb F_q$ in [Alrabiah et al., 2026] and generalized Boolean phase states over $\mathbb Z_q$ [Arunachalam et al., 2023]. The framework also applies to hypergraph state ensembles, giving estimates expressed fully in terms of hypergraph data and recovering estimates for graph state ensembles in [Montanaro and Shao, 2022]. Finally, we extend the discussion to arbitrary mixed state ensembles with uniform priors, prove a sandwiched bound for minimum-error discrimination sample complexity by a quantum weakly mixing time, and provide a tight estimate for the minimax discrimination sample complexity from [D'Ariano et al., 2005] by a Dobrushin-type coefficient. We also discuss the method of strengthened data processing inequality [Gao and Rouz{é}, 2022] and give an upper bound in terms of a strengthened data processing inequality constant.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-01 in math.PR).
Categorie arXiv: Quantum Physics (quant-ph) ; Computational Complexity (cs.CC); Information Theory (cs.IT); Probability (math.PR); Representation Theory (math.RT).
Pagina del lavoro: https://arxiv.org/abs/2609.40182 — 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:04:17.260Z dalla pagina https://arxiv.org/catchup/math.PR/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).