English
Related papers

Related papers: Exponential Separation of Quantum Communication an…

200 papers

We consider a distributed quantum hypothesis testing problem with communication constraints, in which the two hypotheses correspond to two different states of a bipartite quantum system, multiple identical copies of which are shared between…

Quantum Physics · Physics 2019-05-03 Hao-Chung Cheng , Nilanjana Datta , Cambyse Rouzé

We study the question of how much classical communication is needed when Alice is given a classical description of a quantum state $|\psi\rangle$ for Bob to recover any expectation value $\langle \psi | M |\psi\rangle$ given an observable…

Quantum Physics · Physics 2025-06-27 Kaushik Sankar

Equality and disjointness are two of the most studied problems in communication complexity. They have been studied for both classical and also quantum communication and for various models and modes of communication. Buhrman et al. [Buh98]…

Computational Complexity · Computer Science 2013-10-01 Jozef Gruska , Daowen Qiu , Shenggen Zheng

In this work we introduce an intermediate setting between quantum nonlocality and communication complexity problems. More precisely, we study the value of XOR games $G$ when Alice and Bob are allowed to use a limited amount of one-way…

Quantum Physics · Physics 2018-10-10 Marius Junge , Carlos Palazuelos , Ignacio Villanueva

We define a new model of quantum learning that we call Predictive Quantum (PQ). This is a quantum analogue of PAC, where during the testing phase the student is only required to answer a polynomial number of testing queries. We demonstrate…

Quantum Physics · Physics 2022-03-29 Dmytro Gavinsky

The `no communication' theorem prohibits superluminal communication by showing that any measurement by Alice on an entangled system cannot change the reduced density matrix of Bob's state, and hence the expectation value of any measurement…

Quantum Physics · Physics 2022-09-19 Amitava Datta

The capability of a given channel to communicate information is, a priori, distinct from its capability to distribute shared randomness. In this article we define randomness distribution capacities of quantum channels assisted by forward,…

Quantum Physics · Physics 2018-05-22 Raul Garcia-Patron , William Matthews , Andreas Winter

We investigates a model of hybrid classical-quantum communication complexity, in which two parties first exchange classical messages and subsequently communicate using quantum messages. We study the trade-off between the classical and…

Computational Complexity · Computer Science 2026-04-23 Xudong Wu , Guangxu Yang , Penghui Yao

Communication complexity is a fundamental aspect of information science, concerned with the amount of communication required to solve a problem distributed among multiple parties. The standard quantification of one-way communication…

Quantum Physics · Physics 2024-12-25 Satyaki Manna , Anubhav Chaturvedi , Debashis Saha

Quantum entanglement can be used in a communication scheme to establish a correlation between successive channel inputs that is impossible by classical means. It is known that the classical capacity of quantum channels can be enhanced by…

Quantum Physics · Physics 2018-04-17 Dawei Ding , Mark M. Wilde

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…

Quantum Physics · Physics 2019-08-07 Xin Wang , Kun Fang , Marco Tomamichel

We characterize the communication complexity of the following distributed estimation problem. Alice and Bob observe infinitely many iid copies of $\rho$-correlated unit-variance (Gaussian or $\pm1$ binary) random variables, with unknown…

Information Theory · Computer Science 2019-04-19 Uri Hadar , Jingbo Liu , Yury Polyanskiy , Ofer Shayevitz

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…

Computational Complexity · Computer Science 2013-08-20 Xiaoming Sun , Marcos Villagra

We uncover an apparent instance of classical information transfer via only the Einstein-Podolsky-Rosen channel in a quantum optical protocol between Alice and Bob, involving two-photon maximal path entanglement and based on a recent…

Quantum Physics · Physics 2007-05-23 R. Srikanth

We study the fundamental, classical mechanism design problem of single-buyer multi-item Bayesian revenue-maximizing auctions under the lens of communication complexity between the buyer and the seller. Specifically, we ask whether using…

Computer Science and Game Theory · Computer Science 2025-01-07 Aviad Rubinstein , Zixin Zhou

We prove a new version of the Holevo bound employing the Hilbert-Schmidt norm instead of the Kullback-Leibler divergence. Suppose Alice is sending classical information to Bob using a quantum channel, while Bob is performing some projective…

Quantum Physics · Physics 2017-11-27 Boaz Tamir , Eliahu Cohen

We study the advantages of quantum communication models over classical communication models that are equipped with a limited number of qubits of entanglement. In this direction, we give explicit partial functions on $n$ bits for which…

Quantum Physics · Physics 2025-12-02 Srinivasan Arunachalam , Uma Girish

We consider several models of 1-round classical and quantum communication, some of these models have not been defined before. We "almost separate" the models of simultaneous quantum message passing with shared entanglement and the model of…

Quantum Physics · Physics 2022-03-29 Dmytro Gavinsky

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…

Quantum Physics · Physics 2020-11-09 Sutapa Saha , Some Sankar Bhattacharya , Tamal Guha , Saronath Halder , Manik Banik

We study two basic graph parameters, the chromatic number and the orthogonal rank, in the context of classical and quantum exact communication complexity. In particular, we consider two types of communication problems that we call promise…

Quantum Physics · Physics 2018-12-24 Jop Briët , Harry Buhrman , Debbie Leung , Teresa Piovesan , Florian Speelman