Identifying the value of a random variable unambiguously: Quantum versus classical approaches
- URL: http://arxiv.org/abs/2211.09194v2
- Date: Wed, 15 May 2024 10:29:53 GMT
- Title: Identifying the value of a random variable unambiguously: Quantum versus classical approaches
- Authors: Saronath Halder, Alexander Streltsov, Manik Banik,
- Abstract summary: Quantum resources may provide advantage over their classical counterparts.
We construct such a task based on a game, mediated by Referee and played between Alice and Bob.
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.
- Score: 44.99833362998488
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- 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.
Related papers
- Optimal Strategies for Winning Certain Coset-Guessing Quantum Games [8.03451158784716]
In a recently introduced coset guessing game, Alice plays against Bob and Charlie, aiming to meet a joint winning condition.
We show that the probability of Bob's and Charlie's guesses being simultaneously correct goes to zero exponentially as m increases.
We devised an encoding circuit using only CNOT and Hadamard gates, which could be relevant for building efficient CSS-coded systems.
arXiv Detail & Related papers (2024-10-10T17:42:30Z) - Dueling Over Dessert, Mastering the Art of Repeated Cake Cutting [10.50673995077851]
We consider the setting of repeated fair division between two players, denoted Alice and Bob, with private valuations over a cake.
We consider two versions: sequential, where Bob observes Alice's cut point before choosing left/right, and simultaneous, where he only observes her cut point after making his choice.
arXiv Detail & Related papers (2024-02-13T15:53:09Z) - Photonic implementation of the quantum Morra game [69.65384453064829]
We study a faithful translation of a two-player quantum Morra game, which builds on previous work by including the classical game as a special case.
We propose a natural deformation of the game in the quantum regime in which Alice has a winning advantage, breaking the balance of the classical game.
We discuss potential applications of the quantum Morra game to the study of quantum information and communication.
arXiv Detail & Related papers (2023-11-14T19:41:50Z) - Quantum advantage in a unified scenario and secure detection of
resources [55.2480439325792]
We consider a single task to study different approaches of having quantum advantage.
We show that the optimal success probability in the overall process for a qubit communication might be higher than that for a cbit communication.
arXiv Detail & Related papers (2023-09-22T23:06:20Z) - Offline Reinforcement Learning for Human-Guided Human-Machine
Interaction with Private Information [110.42866062614912]
We study human-guided human-machine interaction involving private information.
We focus on offline reinforcement learning (RL) in this game.
We develop a novel identification result and use it to propose a new off-policy evaluation method.
arXiv Detail & Related papers (2022-12-23T06:26:44Z) - The resource theory of nonclassicality of channel assemblages [0.0]
Einstein, Podolsky and Rosen (EPR) introduced the simple scenario of Alice and Bob sharing correlated quantum systems.
In this paper, we provide a unified framework for studying the nonclassicality of various such generalizations of the EPR scenario.
arXiv Detail & Related papers (2022-09-21T08:13:52Z) - Two quantum algorithms for communication between spacelike separated
locations [0.7614628596146599]
We argue that superluminal communication is possible through state discrimination in a higher-dimensional Hilbert space using ancilla qubits.
We propose two quantum algorithms through state discrimantion for communication between two observers Alice and Bob.
arXiv Detail & Related papers (2022-09-16T06:54:22Z) - Quantum cryptography with classical communication: parallel remote state
preparation for copy-protection, verification, and more [125.99533416395765]
Many cryptographic primitives are two-party protocols, where one party, Bob, has full quantum computational capabilities, and the other party, Alice, is only required to send random BB84 states to Bob.
We show how such protocols can generically be converted to ones where Alice is fully classical, assuming that Bob cannot efficiently solve the LWE problem.
This means that all communication between (classical) Alice and (quantum) Bob is classical, yet they can still make use of cryptographic primitives that would be impossible if both parties were classical.
arXiv Detail & Related papers (2022-01-31T18:56:31Z) - Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel.
We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries.
We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
arXiv Detail & Related papers (2020-10-15T17:55:31Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.