English
Related papers

Related papers: Unbounded quantum advantage in communication compl…

200 papers

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…

Communication scenarios between two parties can be implemented by first encoding messages into some states of a physical system which acts as the physical medium of the communication and then decoding the messages by measuring the state of…

Quantum Physics · Physics 2024-04-23 Teiko Heinosaari , Oskari Kerppo , Leevi Leppäjärvi , Martin Plávala

We investigate the quantum advantage that can arise in typical two-party communication scenarios, where the sender and the receiver are allowed to share prior correlations. Focusing on communication tasks constrained by the…

Quantum Physics · Physics 2026-03-20 Satyaki Manna , Ankush Pandit , Debashis Saha

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…

Quantum Physics · Physics 2023-06-13 Debashis Saha , Debarshi Das , Arun Kumar Das , Bihalan Bhattacharya , A. S. Majumdar

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…

We consider communication scenarios with multiple senders and a single receiver. Focusing on communication tasks where the distinguishability or anti-distinguishability of the sender's input is bounded, we show that quantum strategies…

Quantum Physics · Physics 2025-06-10 Ankush Pandit , Soumyabrata Hazra , Satyaki Manna , Anubhav Chaturvedi , Debashis Saha

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…

Quantum Physics · Physics 2019-09-16 Niraj Kumar , Iordanis Kerenidis , Eleni Diamanti

Quantum resources, such as entanglement or quantum communication, offer significant communication advantages in information processing. We develop an operational framework for realizing these communication advantages in resource-constrained…

Quantum Physics · Physics 2026-04-16 Brian Doolittle , Felix Leditzky , Eric Chitambar

Two-party one-way quantum communication has been extensively studied in the recent literature. We target the size of minimal information that is necessary for a feasible party to finish a given combinatorial task, such as distinction of…

Quantum Physics · Physics 2007-05-23 Harumichi Nishimura , Tomoyuki Yamakami

Quantum resources may provide advantage over their classical counterparts. We say this as quantum advantage. Here we consider a single communication task to study different approaches of observing quantum advantage. We say this setting as a…

Quantum Physics · Physics 2025-03-03 Saronath Halder , Alexander Streltsov

Quantum systems are known to offer advantages over their classical counterpart in communication complexity protocols, where the aim is to minimize the amount of information exchange between distant parties to compute global functions of…

We investigate two senders and one receiver multiparty communication scenario. Following Phys.Rev.A83, 062112 and arXiv : 2506.07699, we study multiparty communication bounded by dimension and distinguishability. We provide an explicit…

Quantum Physics · Physics 2025-12-08 Ankush Pandit

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

Finding exponential separation between quantum and classical information tasks is like striking gold in quantum information research. Such an advantage is believed to hold for quantum computing but is proven for quantum communication…

Communication complexity, which quantifies the minimum communication required for distributed computation, offers a natural setting for investigating the capabilities and limitations of quantum mechanics in information processing. We…

Quantum Physics · Physics 2026-02-12 Nikolai Miklin , Prabhav Jain , Mariami Gachechiladze

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 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…

Quantum Physics · Physics 2016-09-12 Philippe Allard Guérin , Adrien Feix , Mateus Araújo , Časlav Brukner

I show that a simple multi-party communication task can be performed more efficiently with quantum communication than with classical communication, even with low detection efficiency $\eta$. The task is a communication complexity problem in…

Quantum Physics · Physics 2009-11-07 Ernesto F. Galvao

In some scenarios there are ways of conveying information with many fewer, even exponentially fewer, qubits than possible classically. Moreover, some of these methods have a very simple structure--they involve only few message exchanges…

Quantum Physics · Physics 2018-03-22 Hartmut Klauck , Ashwin Nayak , Amnon Ta-Shma , David Zuckerman

We study private classical communication over quantum multiple-access channels. For an arbitrary number of transmitters, we derive a regularized expression of the capacity region. In the case of degradable channels, we establish a…

Information Theory · Computer Science 2022-01-31 Remi A. Chou
‹ Prev 1 2 3 10 Next ›