REVIEW 2 cited by
On the distinguishability of random quantum states
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original 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.
Forward citations
Cited by 2 Pith papers
-
Getting almost all the bits from a quantum random access code
Every quantum random access code can be decoded with one measurement to a string that differs from the original in at most 2p(1-p)n positions, even for worst-case inputs.
-
Pretty simple bounds on quantum state discrimination
An explicit pretty-good-measurement protocol solves worst-case quantum state discrimination with O(log n) copies for low-fidelity mixed states and with a Gram-matrix-dependent copy count for pure states.
Discussion (0). Continue with ORCID to comment.