English
Related papers

Related papers: Interaction in Quantum Communication Complexity

200 papers

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

The communication complexity of a quantum channel is the minimal amount of classical communication required for classically simulating a process of state preparation, transmission through the channel and subsequent measurement. It…

Quantum Physics · Physics 2012-09-14 Alberto Montina

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 consider a variation of the multi-party communication complexity scenario where the parties are supplied with an extra resource: particles in an entangled quantum state. We show that, although a prior quantum entanglement cannot be used…

Quantum Physics · Physics 2007-05-23 Harry Buhrman , Richard Cleve , Wim van Dam

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

Quantum communication holds the promise of creating disruptive technologies that will play an essential role in future communication networks. For example, the study of quantum communication complexity has shown that quantum communication…

Quantum entanglement cannot be used to achieve direct communication between remote parties, but it can reduce the communication needed for some problems. Let each of k parties hold some partial input data to some fixed k-variable function…

Quantum Physics · Physics 2007-05-23 Harry Buhrman , Wim van Dam , Peter Hoyer , Alain Tapp

Quantum teleportation allows one to transmit an arbitrary qubit from point A to point B using a pair of (pre-shared) entangled qubits and classical bits of information. The conventional protocol for teleportation uses two bits of classical…

Quantum Physics · Physics 2022-02-17 Abhishek Parakh

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…

Quantum Physics · Physics 2024-02-06 Ruoyu Meng , Aditya Ramamoorthy

We show that any classical two-way communication protocol with shared randomness that can approximately simulate the result of applying an arbitrary measurement (held by one party) to a quantum state of $n$ qubits (held by another), up to…

Quantum Physics · Physics 2019-07-03 Ashley Montanaro

Non-classical features of quantum systems have the potential to strengthen the way we currently exchange information. In this paper, we explore this enhancement on the most basic level of single particles. To be more precise, we compare how…

Quantum Physics · Physics 2024-09-25 Xinan Chen , Yujie Zhang , Andreas Winter , Virginia O. Lorenz , Eric Chitambar

We prove that the fidelity of two exemplary communication complexity protocols, allowing for an N-1 bit communication, can be exponentially improved by N-1 (unentangled) qubit communication. Taking into account, for a fair comparison, all…

We propose a probabilistic two-party communication complexity scenario with a prior nonmaximally entangled state, which results in less communication than that is required with only classical random correlations. A simple all-optical…

Quantum Physics · Physics 2019-08-17 Peng Xue , Yun-Feng Huang , Yong-Sheng Zhang , Chuan-Feng Li , Guang-Can Guo

Can quantum communication be more efficient than its classical counterpart? Holevo's theorem rules out the possibility of communicating more than n bits of classical information by the transmission of n quantum bits --- unless the two…

Quantum Physics · Physics 2007-05-23 Gilles Brassard

This work addresses two problems in the context of two-party communication complexity of functions. First, it concludes the line of research, which can be viewed as demonstrating qualitative advantage of quantum communication in the three…

Computational Complexity · Computer Science 2022-04-05 Dmytro Gavinsky

The ability to realize high-fidelity quantum communication is one of the many facets required to build generic quantum computing devices. In addition to quantum processing, sensing, and storage, transferring the resulting quantum states…

We define "coherent communication" in terms of a simple primitive, show it is equivalent to the ability to send a classical message with a unitary or isometric operation, and use it to relate other resources in quantum information theory.…

Quantum Physics · Physics 2009-11-10 Aram W. Harrow

We describe a general quantum receiver protocol that maps laser-light-modulated classical communications signals into quantum processors for decoding with quantum logic. The quantum logic enables joint quantum measurements over a codeword…

Quantum Physics · Physics 2026-03-16 Kelly Werker Smith , Don Boroson , Saikat Guha , Johannes Borregaard

A relational bipartite communication problem is presented that has an efficient quantum simultaneous-messages protocol, but no efficient classical two-way protocol.

Computational Complexity · Computer Science 2022-04-05 Dmytro Gavinsky

Quantum communication represents a revolutionary advancement over classical information theory, which leverages unique quantum mechanics properties like entanglement to achieve unprecedented capabilities in secure and efficient information…

Emerging Technologies · Computer Science 2024-06-14 Amit Kumar Bhuyan , Hrishikesh Dutta
‹ Prev 1 2 3 10 Next ›