English
Related papers

Related papers: A feasible quantum communication complexity protoc…

200 papers

We study a new type of separation between quantum and classical communication complexity which is obtained using quantum protocols where all parties are efficient, in the sense that they can be implemented by small quantum circuits with…

Quantum Physics · Physics 2019-11-07 Uma Girish , Ran Raz , Avishay Tal

One of the most intriguing facts about communication using quantum states is that these states cannot be used to transmit more classical bits than the number of qubits used, yet there are ways of conveying information with exponentially…

Quantum Physics · Physics 2007-05-23 Ashwin Nayak , Amnon Ta-Shma , David Zuckerman

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…

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

Quantum entanglement, perhaps the most non-classical manifestation of quantum information theory, cannot be used to transmit information between remote parties. Yet, it can be used to reduce the amount of communication required to process a…

Quantum Physics · Physics 2015-06-29 Gilles Brassard , Anne Broadbent , Alain Tapp

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

I present a simple two-party quantum communication complexity protocol with higher success rate than the best possible classical protocol for the same task. The quantum protocol is shown to be equivalent to a quantum non-locality test,…

Quantum Physics · Physics 2007-05-23 Ernesto F. Galvao

We define a quantum model for multiparty communication complexity and prove a simulation theorem between the classical and quantum models. As a result of our simulation, we show that if the quantum k-party communication complexity of a…

Quantum Physics · Physics 2007-05-23 Iordanis Kerenidis

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

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 information science breaks limitations of conventional information transfer, cryptography and computation by using quantum superpositions or entanglement as resources for information processing. Here, we report on the experimental…

Quantum Physics · Physics 2016-08-02 Massimiliano Smania , Ashraf M. Elhassan , Armin Tavakoli , Mohamed Bourennane

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

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

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

We formulate a two-party communication complexity problem and present its quantum solution that exploits the entanglement between two qutrits. We prove that for a broad class of protocols the entangled state can enhance the efficiency of…

Quantum Physics · Physics 2009-11-07 Caslav Brukner , Marek Zukowski , Anton Zeilinger

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

We provide the first example of a communication model and a distributed task, for which there exists a realistic quantum protocol which is asymptotically more efficient than any classical protocol, both in the communication and the…

Quantum Physics · Physics 2017-04-05 Niraj Kumar , Eleni Diamanti , Iordanis Kerenidis

Quantum communication has been leading the way of many remarkable theoretical results and experimental tests in physics. In this context, quantum communication complexity (QCC) has recently drawn earnest research attention as a tool to…

Quantum Physics · Physics 2020-11-11 Hipólito Gómez-Sousa

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
‹ Prev 1 2 3 10 Next ›