A mixing time method for estimating the sample complexity of quantum state discrimination
quant-ph, cs.CC, cs.IT, math.IT, math.PR, math.RT
Submitted: 2026-09-30
Updated: 2026-09-30
Terminology
Sources
- No low-degree tests for quantum states
- Quantum Coupon Collector
- Optimal algorithms for learning quantum phase states
- Rounds vs Communication Tradeoffs for Maximal Independent Sets
- Optimal measurements for the dihedral hidden subgroup problem
- Quantum state discrimination
- Reversing quantum dynamics with near-optimal quantum and classical fidelity
- Operational distance and fidelity for quantum channels
- Approximate simulation of quantum channels
- General conditions for approximate quantum error correction and near-optimal recovery channels
- An invitation to the sample complexity of quantum hypothesis testing
- Quantum algorithm for a generalized hidden shift problem
- On the Duality of Teleportation and Dense Coding
- Minimax quantum state discrimination
- Optimal Detection of Symmetric Mixed Quantum States
- Complete entropic inequalities for quantum Markov chains
- Quantum Doeblin Coefficients: Interpretations and Applications
- Sample-optimal tomography of quantum states
- How many copies are needed for state discrimination?
- Contraction coefficients for noisy quantum channels
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
- Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity