Random exclusion codes (RECs) are one-shot communication tasks in which Alice receives a uniformly random word and sends a limited physical system to Bob, who is asked to output a symbol different from the one appearing at a randomly selected coordinate. We resolve the conjectured quantum advantage in the comparison between one communicated classical bit and one communicated qubit for arbitrary word length and alphabet size.
Random exclusion codes (RECs) are one-shot communication tasks in which Alice receives a uniformly random word and sends a limited physical system to Bob, who is asked to output a symbol different from the one appearing at a randomly selected coordinate. We resolve the conjectured quantum advantage in the comparison between one communicated classical bit and one communicated qubit for arbitrary word length and alphabet size.
Useful applications of quantum information technologies can be found by identifying tasks in which quantum resources outperform their classical counterparts. In this work, we introduce a two-party communication primitive, random exclusion code (REC), which is a single-shot prepare-and-measure protocol where a sender encodes a random message into a shorter sequence and a receiver attempts to a randomly chosen letter in the original message. We present quantum advantages in RECs in two ways: and . We show that RECs with quantum resources achieve higher success probabilities than classical strategies. We verify that, with the additional constraint that successful outcomes occur uniformly and without error, the quantum resources required to describe detection events of RECs have a smaller dimension than classical ones. We also show that a guessing counterpart, random access codes, may not have a dimension advantage over classical resources. Our results elucidate various possibilities of achieving quantum advantages in two-party communication.
A well-known cryptographic primitive is the so-called random access code. Namely, Alice is to send to Bob one of two bits, so that Bob has the choice of which bit he wants to learn about. However, at any time, Alice should not learn Bob's choice, and Bob should learn only the bit of his choice. The task is impossible to accomplish by means of either classical or quantum communication. On the other hand, a concept of correlations stronger than quantum ones, exhibited by the so-called Popescu-Rohrlich box, was introduced and widely studied. In particular, it is known that the Popescu-Rohrlich box enables simulation of the random access code with the support of one bit of communication. Here, we propose a quantum analog of this phenomenon. Namely, we define an analog of a random access code, where instead of classical bits, one encodes qubits. We provide a quantum nonsignaling box that if supported with two classical bits, allows one to simulate a quantum version of a random access code. We point out that two bits are necessary. We also show that a quantum random access code cannot be fully quantum: when Bob inputs the superposition of two choices, the output will be in a mixed state rather than in a superposition of required states.
This chapter begins our exploration of “dynamic” information-processing tasks in quantum Shannon theory, where the term “dynamic” indicates that a quantum channel connects a sender to a receiver and their goal is to exploit this resource for communication. We specifically consider the scenario where a sender Alice would like to communicate classical information to a receiver Bob, and the capacity theorem that we prove here is one particular generalization of Shannon's noisy channel coding theorem from classical information theory (overviewed in Section 2.2). In later chapters, we will see other generalizations of Shannon's theorem, depending on what resources are available to assist their communication or depending on whether they are trying to communicate classical or quantum information. For this reason and others, quantum Shannon theory is quite a bit richer than classical information theory. The naive approach to communicate classical information over a quantum channel is for Alice and Bob simply to mimic the approach used in Shannon's noisy channel coding theorem. That is, they select a random classical code according to some distribution pX(x) , and Bob performs individual measurements of the outputs of a noisy quantum channel according to some POVM. The POVM at the output induces some conditional probability distribution pY∣X(y∣x) , which we can in turn think of as an induced noisy classical channel. The classical mutual information I(X; Y) of this channel is an achievable rate for communication, and the best strategy for Alice and Bob is to optimize the mutual information over all of Alice's inputs to the channel and over all measurements that Bob could perform at the output.
Abstract A random access code (RAC), corresponding to a communication primitive with various applications in quantum information theory, is an instance of a preparation-and-measurement scenario. In this work, we consider (n, d)-RACs constituting an n-length string, constructed from a d size set of letters, and send an encoding of the string in a single d-level physical system and present their quantum advantages. We first characterize optimal classical RACs and prove that a known classical strategy, called majority-encoding-identity-decoding, is optimal. We then construct a quantum protocol by exploiting only two incompatible measurements (the minimal requirement) and show the advantages beyond the classical one. We also discuss the generality of our results and whether quantum advantages are valid for all types of ( n , d ) ↦ 1 RACs.
Entanglement can reduce the communication required for coding tasks, but establishing the minimum achievable cost is essential to understanding its limits. We address this question in a zero-error source-coding task where Alice receives a word and Bob knows an unordered pair of candidates containing it. Alice does not know the pair and must enable Bob to identify her word without error using shared entanglement and one classical message. The candidates satisfy a balanced-difference promise: for words in Zqn with n=qℓ, each residue modulo q occurs exactly ℓ times in their coordinatewise difference. For all integers q≥2 and ℓ≥1, we prove that the task requires exactly n messages when (q−1)ℓ is even and two messages when it is odd. These minima allow arbitrary finite-dimensional shared states independent of the inputs and arbitrary local measurements. In even parity, this establishes optimality of an existing entanglement-assisted protocol. In odd parity, an explicit deterministic protocol achieves the optimum of one bit without entanglement. Our proof combines Fourier analysis with a combinatorial counting argument to determine the smallest eigenvalue of the associated graphs. In even parity, this resolves the spectral assertion of Cao et al.'s Conjecture 6.3 for balanced cyclic generalized Hadamard graphs. Together with an explicit odd-parity bipartition, this determines the quantum chromatic number as n in even parity and 2 in odd parity, where the classical chromatic number is also 2. All lemmas, theorems, and corollaries are formalized and verified in Lean.
Measurement incompatibility stipulates the existence of quantum measurements that cannot be carried out simultaneously on single systems. We show that the set of input-output probabilities obtained from d-dimensional classical systems assisted with shared randomness is the same as the set obtained from d-dimensional quantum strategies restricted to compatible measurements with shared randomness in any communication scenario. Thus, measurement incompatibility is necessary for quantum advantage in communication, and any quantum advantage (with or without shared randomness) in communication acts as a witness to the incompatibility of the measurements at the receiver's end in a semi-device-independent way. We introduce a class of communication tasks---a general version of random access codes---to witness incompatibility of an arbitrary number of quantum measurements with arbitrary outcomes acting on d-dimensional systems and provide generic upper bounds on the success metric of these tasks for compatible measurements. We identify all sets of three incompatible rank-one projective qubit measurements that random access codes can witness. Finally, we present the generic relationship between different sets of probability distributions---classical, quantum with or without shared randomness, and quantum restricted to compatible measurements with or without shared randomness---produced in communication scenarios.