REVIEW 1 cited by
How many copies are needed for state discrimination?
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
Given a collection of states (rho_1, ..., rho_N) with pairwise fidelities F(rho_i, rho_j) <= F < 1, we show the existence of a POVM that, given rho_i^{otimes n}, will identify i with probability >= 1-epsilon, as long as n>=2(log N/eps)/log (1/F). This improves on previous results which were either dimension-dependent or required that i be drawn from a known distribution.
Forward citations
Cited by 1 Pith paper
-
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.