On the distinguishability of random quantum states

Abstract

We develop two analytic lower bounds on the probability of success p of identifying a state picked from a known ensemble of pure states: a bound based on the pairwise inner products of the states, and a bound based on the eigenvalues of their Gram matrix. We use the latter to lower bound the asymptotic distinguishability of ensembles of n random quantum states in d dimensions, where n/d approaches a constant. In particular, for almost all ensembles of n states in n dimensions, p>0.72. An application to distinguishing Boolean functions (the "oracle identification problem") in quantum computation is given.

20 pages, 2 figures; v2 fixes typos and an error in an appendix

References in corpus (7)

• Quantum fingerprinting
• Aspects of generic entanglement
• Reversing quantum dynamics with near-optimal quantum and classical fidelity
• Designing Optimal Quantum Detectors Via Semidefinite Programming
• Remote preparation of quantum states
• Average fidelity between random quantum states
• Distinguishability of States and von Neumann Entropy

Cited by in corpus (29)

• Unbounded violation of tripartite Bell inequalities
• Operational relevance of resource theories of quantum measurements
• Generic local distinguishability and completely entangled subspaces
• Distinguishability of generic quantum states
• Sequential projective measurements for channel decoding
• Achieving the Holevo bound via sequential measurements
• Two-sided bounds on minimum-error quantum measurement, on the reversibility of quantum dynamics, and on the maximum overlap problem using directional iterates
• Simulating all quantum measurements using only projective measurements and postselection
• Two-sided estimates of minimum-error distinguishability of mixed quantum states via generalized Holevo-Curlander bounds
• Random tensor theory: extending random matrix theory to random product states
• Quantum key distribution protocol with pseudorandom bases
• Error rates of Belavkin weighted quantum measurements and a converse to Holevo's asymptotic optimality theorem
• An asymptotic error bound for testing multiple quantum hypotheses
• Wishart and random density matrices: Analytical results for the mean-square Hilbert-Schmidt distance
• Improving application performance with biased distributions of quantum states
• Idler-free channel position finding
• Building one-time memories from isolated qubits
• Classification and reconstruction of optical quantum states with deep neural networks
• Random density matrices: Analytical results for mean root fidelity and mean square Bures distance
• Spectral statistics for the difference of two Wishart matrices
• Information capacity of quantum communication under natural physical assumptions
• Random density matrices: Analytical results for mean fidelity and variance of squared Bures distance
• Quantumness of pure-state ensembles via coherence of Gram matrix based on generalized $\alpha$-$z$-relative Rényi entropy
• Rigidity of superdense coding
• Upper and Lower Bounds on Optimal Success Probability of Quantum State Discrimination with and without Inconclusive Results
• Minimal-error quantum state discrimination versus robustness of entanglement:More indistinguishability with less entanglement
• Entropic lower bound for distinguishability of quantum states
• Chaos-Mediated Quantum State Discrimination Near Unit Fidelity
• On the distinguishability of geometrically uniform quantum states