Quantum correlations provide dramatic advantage over the corresponding classical resources in several communication tasks. However a broad class of probabilistic theories exists that attributes greater success than quantum theory in many of these tasks by allowing supra-quantum correlations in `space-like' and/or `time-like' paradigms. In this letter we propose a communication task involving three spatially separated parties where one party (verifier) aims to verify whether the bit strings possessed by the other two parties (terminals) are equal or not. We call this task {\it authentication with limited communication}, the restrictions on communication being: (i) the terminals cannot communicate with each other, but (ii) each of them can communicate with the verifier through single use of channels with limited capacity. Manifestly, classical resources are not sufficient for perfect success of this task. Moreover, it is also not possible to perform this task with certainty in several non-classical theories although they might possess stronger `space-like' and/or `time-like' correlations. Surprisingly quantum resources can achieve the perfect winning strategy. The proposed task thus stands apart from all previously known communication tasks as it exhibits quantum advantage over other non-classical strategies.
In communication complexity, a number of distant parties have the task of calculating a distributed function of their inputs, while minimizing the amount of communication between them. It is known that with quantum resources, such as entanglement and quantum channels, one can obtain significant reductions in the communication complexity of some tasks. In this work, we study the role of the quantum superposition of the direction of communication as a resource for communication complexity. We present a tripartite communication task for which such a superposition allows for an exponential saving …
The study of ontology (hidden variables) provides for a vital ground on which significant non-classical features of quantum theory are revealed. One such non-classical ontic-feature is preparation contextuality (PC) and advantage in oblivious communication tasks is one of its operational signatures. This article primarily pursues the ontic-feature underlying quantum advantage in communication complexity (CC). We construct oblivious communication tasks tailored to given CC problems. We upper-bound the classical success probability of these oblivious communication tasks, obtaining preparation no…
Quantum channels are known to provide qualitatively better information transfer capacities over their classical counterparts. Examples include quantum cryptography, quantum dense coding, and quantum teleportation. This is a short review on paradigmatic quantum communication protocols in both bipartite as well as multipartite scenarios.
We obtain a general connection between a quantum advantage in communication complexity and non-locality. We show that given any protocol offering a (sufficiently large) quantum advantage in communication complexity, there exists a way of obtaining measurement statistics which violate some Bell inequality. Our main tool is port-based teleportation. If the gap between quantum and classical communication complexity can grow arbitrarily large, the ratio of the quantum value to the classical value of the Bell quantity becomes unbounded with the increase in the number of inputs and outputs.
Topology-independent quantum advantage in communication networks
Indian Institute of Technology Bhubaneswar（印度技术研究所布巴内斯瓦尔分校）；Indian Institute of Science Education and Research Thiruvananthapuram（印度科学教育研究特里凡得琅研究所）；Stockholm University（斯德哥尔摩大学）
Despite the conceptual importance of contextuality in quantum mechanics, there is a hitherto limited number of applications requiring contextuality but not entanglement. Here, we show that for any quantum state and observables of sufficiently small dimensions producing contextuality, there exists a communication task with quantum advantage. Conversely, any quantum advantage in this task admits a proof of contextuality whenever an additional condition holds. We further show that given any set of observables allowing for quantum state-independent contextuality, there exists a class of communicat…
We prove that for every Bell's inequality and for a broad class of protocols, there always exists a multi-party communication complexity problem, for which the protocol assisted by states which violate the inequality is more efficient than any classical protocol. Moreover, for that advantage Bell's inequality violation is a necessary and sufficient criterion. Thus, violation of Bell's inequalities has a significance beyond that of a non-optimal-witness of non-separability.
We investigate the use of noisy entanglement as a resource in classical communication via a quantum channel. In particular, we are interested in the question whether for any entangled state, including bound entangled states, there exists a quantum channel the classical capacity of which can be increased by providing the state as an additional resource. We partially answer this question by showing, for any entangled state, the existence of a quantum memory channel the feedback-assisted classical capacity with product encodings of which can be increased by using the state as a resource. Using a …
The goal of demonstrating a quantum advantage with currently available experimental systems is of utmost importance in quantum information science. While this remains elusive for quantum computation, the field of communication complexity offers the possibility to already explore and showcase this advantage for useful tasks. Here, we define such a task, the Sampling Matching problem, which is inspired by the Hidden Matching problem and features an exponential gap between quantum and classical protocols in the one-way communication model. Our problem allows by its conception a photonic implement…
It is known that the number of different classical messages which can be communicated with a single use of a classical channel with zero probability of decoding error can sometimes be increased by using entanglement shared between sender and receiver. It has been an open question to determine whether entanglement can ever increase the zero-error communication rates achievable in the limit of many channel uses. In this paper we show, by explicit examples, that entanglement can indeed increase asymptotic zero-error capacity, even to the extent that it is equal to the normal capacity of the chann…
Quantum correlations which violate a Bell inequality are presumed to power better-than-classical protocols for solving communication complexity problems (CCPs). How general is this statement? We show that violations of correlation-type Bell inequalities allow advantages in CCPs, when communication protocols are tailored to emulate the Bell no-signaling constraint (by not communicating measurement settings). Abandonment of this restriction on classical models allows us to disprove the main result of, inter alia, [Brukner et. al., Phys Rev. Lett. 89, 197901 (2002)]; we show that quantum correlat…
Gottesman-Knill Limit on One-way Communication Complexity: Tracing the Quantum Advantage down to Magic Resources
Indian Statistical Institute（印度统计研究所）；S. N. Bose National Centre for Basic Sciences（S.N. 玻色基础科学国家中心）；HUN-REN Institute for Nuclear Research（匈牙利研究与教育网络核物理研究所）；Harish-Chandra Research Institute, A CI of Homi Bhabha National Institute（哈瑞斯昌德拉研究所，霍米·巴巴国立学院成员机构）；Okinawa Institute of Science and Technology Graduate University（冲绳科学技术大学院大学）；Indian Institute of Technology Goa（果阿印度理工学院）
Random Exclusion Codes: Quantum Advantages of Single-Shot Communication
School of Electrical Engineering, Korea Advanced Institute of Science and Technology (KAIST)（韩国科学技术院电气工程学院）；Faculty of Information Technology, University of Jyväskylä（于韦斯屈莱大学信息技术学院）；Quanscient Oy（Quanscient公司）
Communication games are one of the widely used tools that are designed to demonstrate quantum supremacy over classical resources. In that, two or more parties collaborate to perform an information processing task to achieve the highest success probability of winning the game. We propose a specific two-party communication game in the prepare-measure scenario that relies on an encoding-decoding task of specific information. We first demonstrate that quantum theory outperforms the classical preparation non-contextual theory, and the optimal quantum success probability of such a communication game…
Communication games are crucial tools for investigating the limitations of physical theories. The communication complexity (CC) problem is a typical example, for which several distributed parties attempt to jointly calculate a given function with limited classical communications. In this work, we present a method to construct CC problems from Bell tests in a graph-theoretic way. Starting from an experimental compatibility graph and the corresponding Bell test function, a target function which encodes the information of each edge can be constructed, then using this target function we could cons…
We consider relations between communication complexity problems and detecting correlations (violating local realism) with no local hidden variable model. We show first universal equivalence between characteristics of protocols used in that type of problems and non-signaling correlations. We construct non linear bipartite Bell type inequalities and strong nonlocality test with binary observables by providing general method of Bell inequalities construction and showing that existence of gap between quantum and classical complexity leads to violation of these inequalities. We obtain, first to our…
This article summarises the current status of classical communication networks and identifies some critical open research challenges that can only be solved by leveraging quantum technologies. By now, the main goal of quantum communication networks has been security. However, quantum networks can do more than just exchange secure keys or serve the needs of quantum computers. In fact, the scientific community is still investigating on the possible use cases/benefits that quantum communication networks can bring. Thus, this article aims at pointing out and clearly describing how quantum communic…
We investigate whether certain non-classical communication channels can be simulated by a classical channel with a given number of states and a given `amount' of noise. It is proved that any noisy quantum channel can be simulated by a corresponding classical channel with `the same amount' of noise. Classical simulations of general probabilistic channels are also studied.
Understanding the role that quantum entanglement plays as a resource in various information processing tasks is one of the crucial goals of quantum information theory. Here we propose a new perspective for studying quantum entanglement: distributed computation of functions without communication between nodes. To formalize this approach, we propose identity games. Surprisingly, despite of no-signaling, we obtain that non-local quantum strategies beat classical ones in terms of winning probability for identity games originating from certain bipartite and multipartite functions. Moreover we show …
Quantum resources can improve communication complexity problems (CCPs) beyond their classical constraints. One quantum approach is to share entanglement and create correlations violating a Bell inequality, which can then assist classical communication. A second approach is to resort solely to the preparation, transmission and measurement of a single quantum system; in other words quantum communication. Here, we show the advantages of the latter over the former in high-dimensional Hilbert space. We focus on a family of CCPs, based on facet Bell inequalities, study the advantage of high-dimensio…
Entanglement is known to boost the efficiency of classical communication. In distributed computation, for instance, exploiting entanglement can reduce the number of communicated bits or increase the probability to obtain a correct answer. Entanglement-assisted classical communication protocols usually consist of two successive rounds: first a Bell test round, in which the parties measure their local shares of the entangled state, and then a communication round, where they exchange classical messages. Here, we go beyond this standard approach and investigate adaptive uses of entanglement: we al…
We prove a lower bound on the information leakage of any classical protocol computing the equality function in the simultaneous message passing (SMP) model. Our bound is valid in the finite length regime and is strong enough to demonstrate a quantum advantage in terms of information leakage for practical quantum protocols. We prove our bound by obtaining an improved finite size version of the communication bound due to Babai and Kimmel, relating randomized communication to deterministic communication in the SMP model. We then relate information leakage to randomized communication through a ser…
Phenomena induced by the existence of entanglement, such as nonlocal correlations, exhibit characteristic properties of quantum mechanics distinguishing from classical theories. When entanglement is accompanied by classical communication, it enhances the power of quantum operations jointly performed by two spatially separated parties. Such a power has been analyzed by the gap between the performances of joint quantum operations implementable by local operations at each party connected by classical communication with and without the assistance of entanglement. In this work, we present a new for…
In quantum teleportation, the role of entanglement has been much discussed. It is known that entanglement is necessary for achieving non-classical teleportation fidelity. Here we focus on the amount of classical communication that is necessary to obtain non-classical fidelity in teleportation. We quantify the amount of classical communication that is sufficient for achieving non-classical fidelity for two independent 1-bit and single 2-bits noisy classical channels. It is shown that on average 0.208 bits of classical communication is sufficient to get non-classical fidelity. We also find the n…
Limits of Classical correlations and Quantum advantages under (Anti-)Distinguishability constraints in Multipartite Communication
Indian Institute of Science Education and Research Thiruvananthapuram（印度科学教育研究所特里凡得琅分校）；Indian Institute of Technology Bhubaneswar（布巴内斯瓦尔印度理工学院）；International Institute of Information Technology Hyderabad（海得拉巴国际信息技术学院）；Gdańsk University of Technology（格但斯克理工大学）；University of Gdańsk（格但斯克大学）
A process of preparation, transmission and subsequent projective measurement of a qubit can be simulated by a classical model with only two bits of communication and some amount of shared randomness. However no model for n qubits with a finite amount of classical communication is known at present. A lower bound for the communication cost can provide useful hints for a generalization. It is known for example that the amount of communication must be greater than c 2^n, where c~0.01. The proof uses a quite elaborate theorem of communication complexity. Using a mathematical conjecture known as the…
We present a communication protocol for the erasure channel assisted by backward classical communication, which achieves a significantly better rate than the best prior result. In addition, we prove an upper bound for the capacity of the channel. The upper bound is smaller than the capacity of the erasure channel when it is assisted by two-way classical communication. Thus, we prove the separation between quantum capacities assisted by backward classical communication and two-way classical communication.
The advantage of using a single-photon two-mode entangled state in two-way communication via maximal violation of an inequality associated with the `Guess Your Neighbour's Input' (GYNI) game has been theoretically [Phys. Rev. Lett. 120, 060503 (2018)] as well as experimentally [CLEO FID.4 (OSA, 2018)] established quite recently. We show that such an advantage can also be obtained using any single-mode pure non-classical state embedded in a two-mode pure entangled state, wherein the other mode is the vacuum (henceforth referred to as a generalized NOON state), regardless of the average photon n…
We present an improved protocol for entanglement purification of bipartite mixed states. The protocol requires two-way classical communication and hence implies an improved lower bound on the quantum capacity with two-way classical communication of the quantum depolarizing channel.
The communication power of indefinite causal order
QICI Quantum Information and Computation Initiative, School of Computing and Data Science, The University of Hong Kong（香港大学计算与数据科学学院量子信息与计算倡议）；Université Grenoble Alpes, CNRS, Grenoble INP, Institut Néel（格勒诺布尔阿尔卑斯大学）；Quantum Group, Department of Computer Science, University of Oxford（牛津大学计算机科学系量子研究组）；Perimeter Institute for Theoretical Physics（理论物理前沿研究所）
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 communication can be achieved by activated, no-signalling assisted codes, suitably generalizing a result for classical channels. Second, we derive a new efficiently computable meta-converse on the amount of classical information unassisted codes can transmit over a single use of a quantum channel. As applications, we provide a finite resource analysis of classical com…
We provide a quantum key distribution protocol based on the correlations of the Greenburger-Horne-Zeilinger(GHZ) state. No classical communication is needed in the process of the establishment of the key. Our protocol is useful when an unjammable classical communication channel is unavailable. We prove that the protocol is secure.
Presently, classical optical communication systems employing strong laser pulses and quantum key distribution (QKD) systems working at single-photon levels are very different communication modalities. Dedicated devices are commonly required to implement QKD. In this paper, we propose a scheme which allows classical communication and QKD to be implemented simultaneously using the same communication infrastructure. More specially, we propose a coherent communication scheme where both the bits for classical communication and the Gaussian distributed random numbers for QKD are encoded on the same …
We analyze classically defined games for which a quantum team has an advantage over any classical team. The quantum team has a clear advantage in games in which the players of each team are separated in space and the quantum team can use unusually strong correlations of the Einstein-Podolsky-Rosen (EPR) type. We present an example of a classically defined game played at one location for which quantum players have a real advantage.
Bipartite operations underpin both classical communication and entanglement generation. Using a superposition of classical messages, we show that the capacity of a two-qubit operation for error-free entanglement-assisted bidirectional classical communication can not exceed twice the entanglement capability. In addition we show that any bipartite two-qubit operation can increase the communication that may be performed using an ensemble by twice the entanglement capability.
A relational bipartite communication problem is presented that has an efficient quantum simultaneous-messages protocol, but no efficient classical two-way protocol.
