H. Buhrman, R. Cleve, and A. Wigderson, "Quantum vs. classical communication and computation", Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC 98), 1998, pp. 63-68.  Home/Search   Document Details and Download   Summary   ACM   TOC   Related Articles   Check

.... card numbers [12] Classical and quantum information can be used together to accomplish tasks that neither could achieve alone, such as quantum cryptography [2] quantum computing [5,9] quantum teleportation [3] and the computation of distributed tasks with vastly reduced communication cost [7]. Some of these concepts are still theoretical, but others have been implemented in the laboratory. The key to understanding the foundations of QIP is the dichotomy that exists between the everyday notion of classical information and its less intuitive quantum counterpart. Classical information ....

Buhrman, H., Cleve, R. and Wigderson, A., "Quantum vs. classical communication and computation", in Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pages 63--68, 1998.

.... evolved a solution that is essentially equivalent to the version of Grover s algorithm described in [19] The AND OR tree problem is the evaluation of a Booleanvalued property of a Boolean black box (oracle) function; the quantum complexity of such problems has been studied, for example, in [20] [21]. For Boolean functions of binary strings of length n, the AND OR property is a binary tree, having AND at the root and n (including the root) alternating layers of Boolean OR and AND as nodes, with an n 1st layer of 2 n leaves consisting of the values of the black box function ordered by their ....

Harry Buhrman, Richard Cleve, and Avi Widgerson, "Quantum vs. classical communication and computation," Proceedings of the 30th Annual ACM Symposium on the Theory of Computing (STOC), pp. 63--68, 1998.

....function has the same (maximum) complexity of N in the quantum scenario as it has in the classical case[5] 2.3 The Appointment Problem It can be shown that the earlier described appointment problem has, even in the probabilistic setting, a classical complexity of O(N) bits. Buhrman et al.[3] showed that for parties with initial entanglement this complexity reduces to O( p N Delta log N ) This also shows that any distributed task with a small certificate (with size of the order of log N ) can be performed with O( p N Delta log N) bits of communication. Other tasks for which ....

....log N ) This also shows that any distributed task with a small certificate (with size of the order of log N ) can be performed with O( p N Delta log N) bits of communication. Other tasks for which nonlocal correlations allow a saving in the communication are: Distributed Deutsch Problem [3], Quantum Whispers [7] and Sampling [1] 3 Conclusion Although entanglement does not allow the signalling or even compression of information, it can sometimes reduce the communication complexity of distributed tasks. These examples of communication reduction can also be viewed as a new ....

Harry Buhrman, Richard Cleve and Avi Wigderson, "Quantum vs. classical communication and computation", Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC 98), pages 63-68. Also as quant-ph report no. 9802040.

No context found.

H. Buhrman, R. Cleve, and A. Wigderson, "Quantum vs. classical communication and computation", Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC 98), 1998, pp. 63-68.

....AB = 1 p 2 n P i2f0;1g n jiijii, any local hidden variable scheme must be augmented with a constant times 2 n bits of communication in order to exactly simulate it. Proof. The proof is based on connections between a measurement scenario and a communication complexity problem examined in [2]. We begin by defining a set of 2 2 n measurements, which we call Deutsch Jozsa measurements, due to their connection with the algorithm in [4] The measurements are parametrized by the set f0; 1g 2 n . For a parameter value z 2 f0; 1g 2 n , we index the bits of z by the set f0; 1g n . ....

....then x i y i is even for 2 n Gamma1 values of i and odd for 2 n Gamma1 values of i. Therefore, the amplitude of any ket of the form jjijji in state (9) is 1 p 2 3n X i2f0;1g n ( Gamma1) x i y i = 0; 10) so Pr[a = b] 0. Now we reduce a communication complexity problem in [2] to the problem of designing an augmented local hidden scheme that satisfies properties 1 and 2. The communication complexity problem (called EQ 0 in [2] is a restricted version of the equality problem, and is defined as follows. Alice and Bob get inputs x; y 2 f0; 1g 2 n (respectively) ....

[Article contains additional citation context not shown here]

H. Buhrman, R. Cleve, and A. Wigderson, "Quantum vs. classical communication and computation", Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC 98), 1998, pp. 63-68.

No context found.

H. Buhrman, R. Cleve, and A. Wigderson, "Quantum vs. classical communication and computation," in Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998, pp. 63--68.

No context found.

H. Buhrman, R. Cleve, and A. Wigderson, "Quantum vs. classical communication and computation," in Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998, pp. 63--68.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC