Bipartite discrimination of independently prepared quantum states as a counterexample to a parallel repetition conjecture
arXiv:1802.00160 · doi:10.1103/PhysRevA.97.042309
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 show that the disappearance of the nonlocality can be regarded as a remarkable counterexample of a fundamental open question in theoretical computer science, called a parallel repetition conjecture of interactive games with two classically communicating players. Measurements for the discrimination task include a projective measurement of one party represented by stabilizer states, which enable the other party to perfectly distinguish states that are sampled with high probability.
arXiv commentIn this version, we improve a proof of appendix B
References in corpus (33)
- Separability of Mixed States: Necessary and Sufficient Conditions
- Quantifying Entanglement
- Quantum Nonlocality without Entanglement
- An Area Law for One Dimensional Quantum Systems
- Unextendible Product Bases and Bound Entanglement
- Quantum information can be negative
- Theoretical framework for quantum networks
- Local Distinguishability of Multipartite Orthogonal Quantum States
- Everything You Always Wanted to Know About LOCC (But Were Afraid to Ask)
- Quantum Data Hiding
- Limits for entanglement measures
- Quantum state discrimination and its applications
- Distinguishability of the Bell states
- Local indistinguishability and LOCC monotones
- Local indistinguishability: more nonlocality with less entanglement
- Hiding classical data in multi-partite quantum states
- Bounds on Multipartite Entangled Orthogonal State Discrimination Using Local Operations and Classical Communication
- Distinguishing Bipartitite Orthogonal States using LOCC: Best and Worst Cases
- Optimal local discrimination of two multipartite pure states
- Four Locally Indistinguishable Ququad-Ququad Orthogonal Maximally Entangled States
- A framework for bounding nonlocality of state discrimination
- Local permutations of products of Bell states and entanglement distillation
- PPT-indistinguishable states via semidefinite programming
- A Return to the Optimal Detection of Quantum Information
- When do Local Operations and Classical Communication Suffice for Two-Qubit State Discrimination?
- Quantum Proofs
- Entanglement cost of implementing controlled-unitary operations
- Entanglement requirements for implementing bipartite unitary operations
- Optimal networks for Quantum Metrology: semidefinite programs and product rules
- Tight bounds on the distinguishability of quantum states under separable measurements
- Pure state estimation and the characterization of entanglement
- Two-party LOCC convertibility of quadpartite states and Kraus-Cirac number of two-qubit unitaries
- Getting Information on Independently Prepared Quantum States -- When Are Individual Measurements as Powerful as Joint Measurements?