Related papers: Limitations of Quantum Advice and One-Way Communic…
It is shown that with the use of entanglement a specific two party communication task can be done with a systematically smaller expected error than any possible classical protocol could do. The example utilises the very tight correlation…
We study randomized and quantum efficiency lower bounds in communication complexity. These arise from the study of zero-communication protocols in which players are allowed to abort. Our scenario is inspired by the physics setup of Bell…
We give a tight lower bound of Omega(\sqrt{n}) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way communication complexity protocol of O(\log n) qubits for…
We explore several new converse bounds for classical communication over quantum channels in both the one-shot and asymptotic regimes. First, we show that the Matthews-Wehner meta-converse bound for entanglement-assisted classical…
We consider a quantum and classical version multi-party function computation problem with $n$ players, where players $2, \dots, n$ need to communicate appropriate information to player 1, so that a "generalized" inner product function with…
In communication complexity-like problems, previous studies have shown either an exponential quantum advantage or an unbounded quantum advantage with an exponentially large input set $\Theta(2^{n})$ bits with respect to classical…
We show that a separation between the class of all problems that can efficiently be solved on a quantum computer and those solvable using probabilistic classical algorithms in polynomial time implies the generalized contextuality of quantum…
Secret-key distillation from quantum states and channels is a central task of interest in quantum information theory, as it facilitates private communication over a quantum network. Here, we study the task of secret-key distillation from…
We present an alternative quantization procedure for the one-dimensional non-relativistic quantum mechanics. We show that, for the case of a free particle and a particle in a box, the complete classical and quantum correspondence can be…
We show an unconditional classical oracle separation between the class of languages that can be verified using a quantum proof ($\mathsf{QMA}$) and the class of languages that can be verified with a classical proof ($\mathsf{QCMA}$).…
There are three different types of nondeterminism in quantum communication: i) $\nqp$-communication, ii) $\qma$-communication, and iii) $\qcma$-communication. In this \redout{paper} we show that multiparty $\nqp$-communication can be…
Quantum telepathy is the concept of using quantum entanglement to solve real-world problems involving decision coordination between parties with restricted communication. One possible reason for this restriction is a latency constraint:…
Current advancements in communication equipment demand the investigation of classical information transfer over quantum channels, by encompassing realistic scenarios in finite dimensions. To address this issue, we develop a framework for…
We present a method to detect lower bounds to the classical capacity of quantum communication channels by means of few local measurements (i.e. without complete process tomography), reconstruction of sets of conditional probabilities, and…
Quantum Teleportation is the key communication functionality of the Quantum Internet, allowing the "transmission' of qubits without either the physical transfer of the particle storing the qubit or the violation of the quantum mechanical…
We present a simple and general simulation technique that transforms any black-box quantum algorithm (a la Grover's database search algorithm) to a quantum communication protocol for a related problem, in a way that fully exploits the…
This work studies the quantum query complexity of Boolean functions in a scenario where it is only required that the query algorithm succeeds with a probability strictly greater than 1/2. We show that, just as in the communication…
In this paper, we provide a simple framework for deriving one-shot achievable bounds for some problems in quantum information theory. Our framework is based on the joint convexity of the exponential of the collision relative entropy, and is…
We implement an experiment on a photonic quantum processor establishing efficacy of the elementary quantum system in classical information storage. The advantage is established by considering a class of simple bipartite games played with…
The more than thirty years old issue of the information capacity of quantum communication channels was dramatically clarified during the last period, when a number of direct quantum coding theorems was discovered. To considerable extent…