REVIEW 2 cited by
Antidistinguishability of Pure 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
abstract
The Pusey-Barrett-Rudolph theorem has recently provoked a lot of discussion regarding the reality of the quantum state. In this article we focus on a property called antidistinguishability, which is a main component in constructing the proof for the PBR theorem. In particular we study algebraic conditions for a set of pure quantum states to be antidistinguishable, and a novel sufficient condition is presented. We also discuss a more general criterion which can be used to show that the sufficient condition is not necessary. Lastly, we consider how many quantum states needs to be added into a set of pure quantum states in order to make the set antidistinguishable. It is shown that in the case of qubit states the answer is one, while in the general but finite dimensional case the answer is at most $n$, where $n$ is the size of the original set.
Forward citations
Cited by 2 Pith papers
-
Near-optimal performance of square-root measurement for general score functions and quantum ensembles
For any quantum ensemble and any positive score function, the optimal expected gain is no larger than the square root of the gain of the generalized pretty good measurement, implying a two-fold mean-square-error bound...
-
A lower bound on the classical simulation cost of star-network correlations
A star-network exclusion game is won perfectly with quantum d-level messages, but classically needs a message of at least n^{d-1} symbols, so no fixed-size classical qubit description can simulate joint measurements o...
Discussion (0). Continue with ORCID to comment.