Abstract In a variant of communication tasks, players cooperate in choosing their local strategies to compute a given task later, working separately. Utilizing quantum bits for communication and sharing entanglement between parties is a recognized method to enhance performance in these situations. In this work, we introduce the game for which three parties, Alice, Bob and Charlie, would like to discover the hidden order in which they make the moves. We show the advantage of quantum strategies that use shared entanglement and local operations over classical setups for discriminating operations’ composition order. The role of quantum resources improving the probability of successful discrimination is also investigated. Our research provides a basis for examining computational model featuring a specific gate set while examining the diverse operations achievable through permutations of its elements.
We study sequential state discrimination measurements performed on the same qubit by subsequent observers. Specifically, we focus on the case when the observers perform a kind of a minimum-error type state discriminating measurement where the goal of the observers is to maximize their joint probability of successfully guessing the state that the qubit was initially prepared in. We call this the Joint Best Guess strategy. In this scheme, Alice prepares a qubit in one of two possible states. The qubit is first sent to Bob, who measures it, and then on to Charlie, and so on to altogether N consecutive receivers who all perform measurements on it. The goal for all observers is to determine which state Alice sent. In the Joint Best Guess strategy, every time a system is received the observer is required to make a guess, aided by the measurement, about its state. The price to pay for this requirement is that errors must be permitted, the guess can be correct or in error. There is a nonzero probability for all the receivers to successfully identify the initially prepared state, and we maximize this joint probability of success. This work is a step toward developing a theory of nondestructive sequential quantum measurements and could be useful in multiparty quantum communication schemes based on communicating with single qubits, particularly in schemes employing continuous variable states. It also represents a case where subsequent observers can probabilistically and optimally get around both the collapse postulate and the no-broadcasting theorem.
In this work, we consider "decision" variants of a monogamy-of-entanglement game by Tomamichel, Fehr, Kaniewski, and Wehner [New Journal of Physics '13]. In its original "search" variant, Alice prepares a (possibly entangled) state on registers
ABC; register
A, consisting of
n qubits, is sent to a Referee, while
B and
C are sent to Bob and Charlie; the Referee then measures each qubit in the standard or Hadamard basis (chosen uniformly at random). The basis choices are sent to Bob and Charlie, whose goal is to simultaneously guess the Referee's
n-bit outcome string
x. Tomamichel et al. show that the optimal winning probability is
cos2n(8π), following a perfect parallel repetition theorem. We consider the following "decision" variants of this game: - Variant 1, "XOR repetition": Bob and Charlie's goal is to guess the XOR of all the bits of
x. Ananth et al. [Asiacrypt '24] conjectured that the optimal advantage over random guessing decays exponentially in
n. Surprisingly, we show that this conjecture is false, and, in fact, there is no decay at all: there exists a strategy that wins with probability
cos2(8π)≈0.85 for any
n. - Variant 2, "Goldreich-Levin": The Referee additionally samples a uniformly random
n-bit string
r that is sent to Bob and Charlie along with the basis choices. Their goal is to guess the parity of
r⋅x. We show that the optimal advantage over random guessing decays exponentially in
n for the restricted class of adversaries that do not share entanglement. A similar result was already shown by Champion et al. and Çakan et al.; we give a more direct proof. Additionally, we put forward a reasonably concrete conjecture that is equivalent to exponential decay for general adversaries.
Quantum state discrimination is a fundamental problem in quantum information science. We investigate the optimal distinguishability of orthogonal two-qubit (bipartite) quantum states. The scenario consists of three parties: Alice, Bob, and Charlie. Charlie prepares one of two orthogonal states and sends one qubit to Alice and the other to Bob. Their goal is to correctly identify which state Charlie sent. In most state discrimination scenarios, it is assumed that Alice and Bob can freely communicate with one another so as to collectively agree on the best guess. In this research, we consider a more restricted setting where only one-way classical communication is possible from Alice to Bob. Under this setting, we study two figures of merit (i) Alice's optimal probability,
P, of identifying the state , and (ii) Alice's optimal probability,
P⊥, of identifying the state along with helping Bob identify the state perfectly. We show that in general
P=P⊥ and we prove a theorem for when
P=P⊥. We also found that the maximum of
P−P⊥ can arbitrarily approach
1/2.
We formulate the
(n,k) Coset Monogamy Game, in which two players must extract complementary information of unequal size (
k bits vs.
n−k bits) from a random coset state without communicating. The complementary information takes the form of random Pauli-X and Pauli-Z errors on subspace states. Our game generalizes those considered in previous works that deal with the case of equal information size
(k=n/2). We prove a convex upper bound of the information-theoretic winning rate of the
(n,k) Coset Monogamy Game in terms of the subspace rate
R=nk∈[0,1]. This bound improves upon previous results for the case of
R=1/2. We also prove the achievability of an optimal winning probability upper bound for the class of unentangled strategies of the
(n,k) Coset Monogamy Game.