Nonlocality and communication complexity

H Buhrman, R Cleve, S Massar, R De Wolf - Reviews of modern physics, 2010 - APS
Quantum information processing is the emerging field that defines and realizes computing
devices that make use of quantum mechanical principles such as the superposition …

Quantum pseudo-telepathy

G Brassard, A Broadbent, A Tapp - Foundations of Physics, 2005 - Springer
Quantum information processing is at the crossroads of physics, mathematics and computer
science. It is concerned with what we can and cannot do with quantum information that goes …

Exponential separations for one-way quantum communication complexity, with applications to cryptography

D Gavinsky, J Kempe, I Kerenidis, R Raz… - Proceedings of the thirty …, 2007 - dl.acm.org
We give an exponential separation between one-way quantum and classical communication
protocols for twopartial Boolean functions, both of which are variants of the Boolean Hidden …

Shortcuts to quantum network routing

E Schoute, L Mancinska, T Islam, I Kerenidis… - arxiv preprint arxiv …, 2016 - arxiv.org
A quantum network promises to enable long distance quantum communication, and
assemble small quantum devices into a large quantum computing cluster. Each network …

Limitations of quantum advice and one-way communication

S Aaronson - Proceedings. 19th IEEE Annual Conference on …, 2004 - ieeexplore.ieee.org
Although a quantum state requires exponentially many classical bits to describe, the laws of
quantum mechanics impose severe restrictions on how that state can be accessed. This …

Streaming algorithms for estimating the matching size in planar graphs and beyond

H Esfandiari, M Hajiaghayi, V Liaghat… - ACM Transactions on …, 2018 - dl.acm.org
We consider the problem of estimating the size of a maximum matching when the edges are
revealed in a streaming fashion. When the input graph is planar, we present a simple and …

Experimental quantum fingerprinting with weak coherent pulses

F Xu, JM Arrazola, K Wei, W Wang… - Nature …, 2015 - nature.com
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 …

Multi-pass graph streaming lower bounds for cycle counting, max-cut, matching size, and other problems

S Assadi, G Kol, RR Saxena… - 2020 IEEE 61st Annual …, 2020 - ieeexplore.ieee.org
Consider the following gap cycle counting problem in the streaming model: The edges of a 2-
regular n-vertex graph G are arriving one-by-one in a stream and we are promised that G is …

Optimal bounds for parity-oblivious random access codes

A Chailloux, I Kerenidis, S Kundu… - New Journal of …, 2016 - iopscience.iop.org
Optimal bounds for parity-oblivious random access codes - IOPscience Skip to content IOP
Science home Accessibility Help Search all IOPscience content Search Article Lookup Select …

Streaming euclidean mst to a constant factor

X Chen, V Cohen-Addad, R Jayaram, A Levi… - Proceedings of the 55th …, 2023 - dl.acm.org
We study streaming algorithms for the fundamental geometric problem of computing the cost
of the Euclidean Minimum Spanning Tree (MST) on an n-point set X⊂ ℝ d. In the streaming …