Bipartite discrimination of independently prepared quantum states as a counterexample to a parallel repetition conjecture
Seiseki Akibue, Go Kato

TL;DR
This paper demonstrates that bipartite quantum state discrimination exhibits asymptotic nonlocality disappearance under certain conditions, providing a counterexample to a parallel repetition conjecture in theoretical computer science.
Contribution
It introduces a novel bipartite state discrimination scenario that challenges the parallel repetition conjecture by showing nonlocality vanishes asymptotically with concentrated distributions.
Findings
Success probability approaches 1 as N increases when entropy < 1.
Nonlocality asymptotically disappears for concentrated distributions.
Counterexample to the parallel repetition conjecture in interactive games.
Abstract
For distinguishing quantum states sampled from a fixed ensemble, the gap in bipartite and single-party distinguishability can be interpreted as a nonlocality of the ensemble. In this paper, we consider bipartite state discrimination in a composite system consisting of subsystems, where each subsystem is shared between two parties and the state of each subsystem is randomly sampled from a particular ensemble comprising the Bell states. We show that the success probability of perfectly identifying the state converges to as if the entropy of the probability distribution associated with the ensemble is less than , even if the success probability is less than for any finite . In other words, the nonlocality of the -fold ensemble asymptotically disappears if the probability distribution associated with each ensemble is concentrated. Furthermore, we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
