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.
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.
Quantum information is a highly interesting and fast emerging field that involves processing information encoded into quantum systems and their subsequent use in various information tasks. The use of quantum resources such as superposition and entanglement have shown to enhance information processing capabilities beyond classical means in a number of communication, information and computation tasks. In this thesis, we have used single photons to study the advantage of d-level quantum systems (qudits) for a communication task commonly known as random access codes (RACs). A successful experimental demonstration of quantum random access codes (QRACs) with four dimensions is realized to demonstrate that the higher dimensional QRACs not only outperform the classical RACs but also provide an advantage over their quantum bit (qubit) counterparts. QRACs are also studied in regards to two specific applications: certification of true randomness and for testing the non-classicality of quantum systems. A method for increased certification of generated randomness is realized for the former and a successful experimental demonstration of a test of non-classicality with arbitrarily low detection efficiency is provided for the latter. This is followed by an implementation of a QRAC in a one-path communication network consisting of preparation, transformation and measurement devices. We have shown that the distributed QRAC provides optimal success probabilities for a number of tasks. Moreover, a novel quantum protocol for the solution to the problem of dining cryptographers and anonymous veto voting is also presented. This single photon transmission based protocol provides an efficient solution, which is experimentally demonstrated for a 3-party description. Lastly, Nitrogen-Vacancy (NV) center in diamond is studied as a potential resource for single photon emission and two methods to enhance the photon collection efficiency are successfully explored. Due to this enhancement, single photons from an NV center may also be used in similar single quantum system based communication experiments.
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.
Quantum mechanics enables information-processing advantages even at the level of a single qubit. A paradigmatic example is the 2$\to$1 random access code (RAC), where a qubit outperforms a classical bit in retrieving encoded information. In the standard form, however, this quantum advantage is restricted to a single receiver, since decoding measurements inevitably destroy the encoded information. Contrary to this, we address how long the information encoded in a single qubit remains accessible even after multiple decoding, each with a quantum advantage. Introducing preparation distinguishability as an operational resource associated with the sender, we show that its interplay with measurement incompatibility on the receiver's side can mitigate measurement-induced disturbance, thereby enabling an arbitrarily long sequence of receivers to each retain a quantum advantage. Our results show that, even under repeated measurements, the information encoded in a qubit need not be entirely exhausted, revealing a stronger communication feature than previously recognised.
A random access code (RAC) is an important communication protocol to obtain information about a randomly specified substring of an n-bit string, while only having limited information about the n-bit string. Quantum RACs usually utilize either communication of quantum bits or a shared-in-advance quantum state used in conjunction with classical communication. Here we consider the latter version of the quantum protocols under the constraint of single-bit communication and with a shared arbitrary state of two qubits. Taking the worst-case success probability as the figure of merit, we demonstrate that any state with an invertible correlation matrix can be used to outperform the best classical RAC for n=3. We derive an additional condition sufficient to beat the best classical performance in the case of n=2. In particular, separable states turn out to be a useful resource behind the quantum advantage for n=2,3. For $n\ensuremath{\ge}4$, RACs assisted with a single copy of a quantum state do not outperform the classical RACs.
Quantum resources may provide an advantage over their classical counterparts in communication tasks. We refer to this as quantum advantage. Here, we consider a single communication task to study different approaches of observing quantum advantage. We call this setting a unified scenario. Our task is described as the following. There are three parties---the Manager, Alice, and Bob. The Manager sends a value of a random variable to Alice, and at the same time Bob receives some partial information regarding that value. Initially, neither Alice nor Bob knows the input of the other, which is received from the Manager. The goal of the task is achieved if and only if the value of the random variable, sent to Alice by the Manager, is identified by Bob with a success probability greater than half all the time. Here, nonzero error probability is allowed. However, to help Bob, Alice sends a limited amount of classical or quantum information to him (cbit or qubit). We show that the goal of the task can be achieved when Alice sends a qubit. On the other hand, a cbit communication is not sufficient for achieving the goal. Thus, it establishes quantum advantage. We further show that the optimal success probability in the overall process for a qubit communication can be higher than the optimal success probability for a cbit communication. In fact, this success probability is higher for qubit communication even if along with cbit communication Alice and Bob share randomness which allows mixing of classical strategies. Clearly, it not only establishes quantum advantage, it also demonstrates a more prominent nonclassical feature. Actually, we obtain higher success probability compared to other tasks. This also suggests the experiment-friendly nature of our task. For applications, we connect our task with semi-device-independence and show how our task can be useful to detect quantumness of a communication in a secure way. Moreover, within the same setting, we provide a way to detect universal coherence present in an ensemble. For a high-dimensional random variable, to achieve the goal, it may require a high-dimensional classical communication, while it can be achieved with only a qubit communication. This establishes a large separation between the quantum and the classical communication.