Identifying the value of a random variable unambiguously: Quantum versus classical approaches

Abstract

Quantum resources may provide advantage over their classical counterparts. Theoretically, in certain tasks, this advantage can be very high. In this work, we construct such a task based on a game, mediated by Referee and played between Alice and Bob. Referee sends Alice a value of a random variable. At the same time, Referee also sends Bob some partial information regarding that value. Here partial information can be defined in the following way. Bob gets the information of a random set which must contain the value of the variable, that is sent to Alice by the Referee, along with other value(s). Alice is not allowed to know what information is sent to Bob by the Referee. Again, Bob does not know which value of the random variable is sent to Alice. Now, the game can be won if and only if Bob can unambiguously identify the value of the variable, that is sent to Alice, with some nonzero probability, no matter what information Bob receives or which value is sent to Alice. However, to help Bob, Alice sends some limited amount of information to him, based on any strategy which is fixed by Alice and Bob before the game begins. We show that if Alice sends limited amount of classical information then the game cannot be won while the quantum analogue of the `limited amount of classical information' is sufficient for winning the game. Thus, it establishes quantum advantage. We further analyze several variants of the game and provide certain bounds on the success probabilities. Moreover, we establish connections between trine ensemble, mutually unbiased bases, and the encoding-decoding strategies of those variants. We also discuss the role of quantum coherence in the present context.

title changed, close to published version

References in corpus (19)

• Quantum Coherence as a Resource
• Quantum fingerprinting
• Information Causality as a Physical Principle
• A new proof for the existence of mutually unbiased bases
• Unambiguous Discrimination Between Linearly-Independent Quantum States
• Preparation contextuality powers parity-oblivious multiplexing
• Quantum Random Access Codes using Single $d$-level Systems
• Semi-device independent random number expansion protocol with n to 1 quantum random access codes
• Condition for unambiguous state discrimination with local operations and classical communication
• Classical simulation of quantum entanglement without local hidden variables
• Limitations of Quantum Advice and One-Way Communication
• Classical information storage in an $n$-level quantum system
• Substituting a qubit for an arbitrarily large number of classical bits
• Communication tasks with infinite quantum-classical separation
• Limited preparation contextuality in quantum theory and its relation to the Cirel'son bound
• Mutually Unbiased Balanced Functions & Generalized Random Access Codes
• The Learnability of Quantum States
• Unextendible entangled bases and more nonlocality with less entanglement
• Experimental demonstration of optimal unambiguous two-out-of-four quantum state elimination

Cited by in corpus (1)

• Quantum advantage in a unified scenario and secure detection of resources