Local simultaneous state discrimination
arXiv:2111.01209 · doi:10.1103/PhysRevA.109.052217
Abstract
Quantum state discrimination is one of the most fundamental problems studied in quantum information theory. Applications range from channel coding to metrology and cryptography. In this work, we introduce a new variant of this task: Local Simultaneous State Discrimination (LSSD). While previous distributed variants of the discrimination problem always allowed some communication between the parties to come up with a joint answer, the parties in LSSD cannot communicate and have to simultaneously answer correctly. This simultaneity implies, e.g., that for classical states, the problem does not trivialize to a non-distributed distinguishing task. While interesting in its own right, this problem also arises in quantum cryptography. After introducing the problem, we give a number of characterization results. We give examples showing that i) the optimal strategy for local discrimination need not coincide with the optimal strategy for LSSD, even for classical states, ii) an additional entangled resource can increase the optimal success probability in LSSD, and iii) stronger-than-quantum non-signalling resources can allow for a higher success probability in some cases, compared to strategies using entanglement. Finally, we show that finding the optimal strategy in (classical) 3-party LSSD is NP-hard.
References in corpus (19)
- The Security of Practical Quantum Key Distribution
- Bell nonlocality
- Quantum Nonlocality without Entanglement
- Quantum cryptography protocols robust against photon number splitting attacks for weak laser pulses implementations
- The operational meaning of min- and max-entropy
- Non-local correlations as an information theoretic resource
- Everything You Always Wanted to Know About LOCC (But Were Afraid to Ask)
- Quantum state discrimination and its applications
- All Entangled Quantum States Are Nonlocal
- Quantum Copy-Protection and Quantum Money
- Distinguishability of quantum states under restricted families of measurements with an application to quantum data hiding
- A Monogamy-of-Entanglement Game With Applications to Device-Independent Quantum Cryptography
- A framework for bounding nonlocality of state discrimination
- Ultimate data hiding in quantum mechanics and beyond
- Distinguishing multi-partite states by local measurements
- Nondestructive discrimination of a new family of highly entangled states in IBM quantum computer
- Uncloneable Quantum Encryption via Oracles
- Maximal gap between local and global distinguishability of bipartite quantum states
- Extended Nonlocal Games