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 inefficiencies of state-of-the-art set-up, the experimental implementation outperforms the best classical protocol, making it the candidate for multi-party quantum communication applications
Quantum computing resources have been known to provide speed-ups in computational complexity in many...
We consider the problem of implementing two-party interactive quantum communication over noisy chann...
We study quantum communication protocols, in which the players\u27 storage starts out in a state whe...
I show that a simple multi-party communication task can be performed more efficiently with quantum c...
Classical Communication complexity has been intensively studied since its conception two decades ag...
In STOC 1999, Raz presented a (partial) function for which there is a quantum protocol communicating...
AbstractIn the setting of communication complexity, two distributed parties want to compute a functi...
In the setting of communication complexity, two distributed parties want to compute a function depen...
By how much must the communication complexity of a function increase if we demand that the parties n...
By how much must the communication complexity of a function increase if we demand that the parties n...
In some scenarios there are ways of conveying information with many fewer, even exponentially fewer,...
AbstractIn the setting of communication complexity, two distributed parties want to compute a functi...
The interdisciplinary field of quantum communication and quantum information processing merges quant...
We define a new notion of information cost for quantum protocols, and a corre-sponding notion of qua...
© 2018 Copyright held by the owner/author(s). We consider the problem of implementing two-party inte...
Quantum computing resources have been known to provide speed-ups in computational complexity in many...
We consider the problem of implementing two-party interactive quantum communication over noisy chann...
We study quantum communication protocols, in which the players\u27 storage starts out in a state whe...
I show that a simple multi-party communication task can be performed more efficiently with quantum c...
Classical Communication complexity has been intensively studied since its conception two decades ag...
In STOC 1999, Raz presented a (partial) function for which there is a quantum protocol communicating...
AbstractIn the setting of communication complexity, two distributed parties want to compute a functi...
In the setting of communication complexity, two distributed parties want to compute a function depen...
By how much must the communication complexity of a function increase if we demand that the parties n...
By how much must the communication complexity of a function increase if we demand that the parties n...
In some scenarios there are ways of conveying information with many fewer, even exponentially fewer,...
AbstractIn the setting of communication complexity, two distributed parties want to compute a functi...
The interdisciplinary field of quantum communication and quantum information processing merges quant...
We define a new notion of information cost for quantum protocols, and a corre-sponding notion of qua...
© 2018 Copyright held by the owner/author(s). We consider the problem of implementing two-party inte...
Quantum computing resources have been known to provide speed-ups in computational complexity in many...
We consider the problem of implementing two-party interactive quantum communication over noisy chann...
We study quantum communication protocols, in which the players\u27 storage starts out in a state whe...