On the distinguishability of random quantum states

DOI10.1007/S00220-007-0221-7zbMATH Open1146.81019arXivquant-ph/0607011OpenAlexW3105112293MaRDI QIDQ946506

Author name not available (Why is that?)

Publication date: 23 September 2008

Published in: (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/quant-ph/0607011

Mathematics Subject Classification ID

No records found.

This page was built for publication: On the distinguishability of random quantum states

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q946506)