Private vs. common random bits in communication complexity
Information Processing Letters
.879-approximation algorithms for MAX CUT and MAX 2SAT
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On randomized one-round communication complexity
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
SIAM Journal on Computing
On the Power of Quantum Computation
SIAM Journal on Computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Communication complexity
Quantum circuits with mixed states
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Quantum vs. classical communication and computation
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Exponential separation of quantum and classical communication complexity
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Unconditional security in quantum cryptography
Journal of the ACM (JACM)
On communication over an entanglement-assisted quantum channel
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Quantum computation and quantum information
Quantum computation and quantum information
Quantum Entanglement and Communication Complexity
SIAM Journal on Computing
Improved Quantum Communication Complexity Bounds for Disjointness and Equality
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
On the power of quantum fingerprinting
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Classical and Quantum Computation
Classical and Quantum Computation
Lower Bounds for Quantum Communication Complexity
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
The Quantum Communication Complexity of Sampling
SIAM Journal on Computing
Quantum Search of Spatial Regions
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Exponential separation of quantum and classical one-way communication complexity
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Asymptotic entanglement capacity of the ising and anisotropic Heisenberg interactions
Quantum Information & Computation
On the role of shared entanglement
Quantum Information & Computation
Hi-index | 0.00 |
Nonlocality is at the heart of quantum information processing. In this paper we investigate the minimum amount of classical communication required to simulate a nonlocal quantum measurement. We derive general upper bounds, which in turn translate to systematic classical simulations of quantum communication protocols.As a concrete application, we prove that any quantum communication protocol with shared entanglement for computing a Boolean function can be simulated by a classical protocol whose cost does not depend on the amount of the shared entanglement. This implies that if the cost of communication is a constant, quantum and classical protocols, with shared entanglement and shared coins, respectively, compute the same class of functions.Furthermore, we describe a new class of efficient quantum communication protocols based on fast quantum algorithms. While some of them have efficient classical simulations by our method, others appear to be good candidates for separating quantum v.s. classical protocols, and quantum protocols with v.s. without shared entanglement.Yet another application is in the context of simulating quantum correlations using local hidden variable models augmented with classical communications. We give a constant cost, approximate simulation of quantum correlations when the number of correlated variables is a constant, while the dimension of the entanglement and the number of possible measurements can be arbitrary.Our upper bounds are expressed in terms of some tensor norms on the measurement operator. Those norms capture the nonlocality of bipartite operators in their own way and may be of independent interest and further applications.