G. Brassard, R. Cleve, and A. Tapp. Cost of exactly simulating quantum entanglement with classical communication. Physical Review Letters, 83(9):1874--1877, 1999. Home/Search Document Details and Download
Summary APS Related Articles Check |
This paper is cited in the following contexts:
Some More Quantum Communication Complexity - Quantum Computing Course (Correct)
....c log(2 n = p n1:99 n ) 0:007 n. 2 Spooky protocols without any communication Here we give an example of something which you can do with entanglement and no communication, using a quantum computer and EPR pairs, and which is impossible to do classically without a lot of communication [BCT99]. It gives what can be viewed as a quantitative version of Bell s theorem, which showed that 1 quantum mechanics cannot be simulated by classical local hidden variable theories. Note that an EPR pair can be used to simulate a joint random coin flip: if Alice and Bob each measure their part of ....
G. Brassard, R. Cleve, and A. Tapp. The cost of exactly simulating quantum entanglement with classical communication. Physical Review Letters, 83(9):1874--1877, 1999. quant-ph/9901035.
Quantum Communication and Complexity - de Wolf (2000) (1 citation) (Correct)
....as possible. Ambainis et.al. 2] give a tight algebraic characterization of quantum sampling complexity, and exhibit an exponential gap between the quantum and classical communication required for a sampling problem related to disjointness. ffl Spooky communication. Brassard, Cleve, and Tapp [14] exhibit tasks which can be achieved in the quantum world with entanglement and no communication, but which would require communication in the classical world. They also give upper and lower bounds on the amount of classical communication needed to simulate EPR pairs. Their results may be viewed ....
G. Brassard, R. Cleve, and A. Tapp. The cost of exactly simulating quantum entanglement with classical communication. Physical Review Letters, 83(9):1874--1877, 1999. quant-ph/9901035.
Consequences and Limits of Nonlocal Strategies - Richard Cleve Peter Self-citation (Cleve) (Correct)
No context found.
G. Brassard, R. Cleve, and A. Tapp. Cost of exactly simulating quantum entanglement with classical communication. Physical Review Letters, 83(9):1874--1877, 1999.
Quantum Fingerprinting - Buhrman, Cleve, Watrous, de Wolf (2001) (1 citation) Self-citation (Cleve) (Correct)
....of indentical states and k 2 copies of pairs of states whose inner product is bounded in absolute value by any ffi 1. Finally, in Section 5 we consider a variation of fingerprinting with a shared quantum key, consisting of O(log n) shared Bell states (EPR pairs) We observe that results in [BCT99] imply that errorless (i.e. exact) fingerprinting is possible with O(log n) bit classical fingerprints in a particular context where achieving the same performance with only a classical shared key requires fingerprints of length Omega Gamma n) We assume the reader is familiar with the basic ....
....fingerprinting where Alice and Bob have a shared quantum key, consisting of O(log n) Bell states, but are required to output classical strings as fingerprints. Is there any sense in which a quantum key can result in improved performance over the case of a classical key We observe that results in [BCT99] imply an improvement in the particular setting where the fingerprinting scheme must be exact (i.e. the error probability is 0) and where there is a restriction on the inputs that either x = y or the Hamming distance between x and y is n=2 (and n is divisible by 4) Under this restriction, any ....
[Article contains additional citation context not shown here]
G. Brassard, R. Cleve, and A. Tapp. The cost of exactly simulating quantum entanglement with classical communication. Physical Review Letters, 83(9):1874--1877, 1999. quant-ph/9901035.
Quantum Fingerprinting - Buhrman, Cleve, Watrous, de Wolf (2001) (1 citation) Self-citation (Cleve) (Correct)
....of pairs of indentical states and k 2 copies of pairs of states whose inner product is bounded in absolute value by any 1. Finally, in Section 5 we consider a variation of ngerprinting with a shared quantum key, consisting of O(log n) shared Bell states (EPR pairs) We observe that results in [BCT99] imply that errorless (i.e. exact) ngerprinting is possible with O(log n) bit classical ngerprints in a particular context where achieving the same performance with only a classical shared key requires ngerprints of length n) We assume the reader is familiar with the basic notions of ....
....of ngerprinting where Alice and Bob have a shared quantum key, consisting of O(log n) Bell states, but are required to output classical strings as ngerprints. Is there any sense in which a quantum key can result in improved performance over the case of a classical key We observe that results in [BCT99] imply an improvement in the particular setting where the ngerprinting scheme must be exact (i.e. the error probability is 0) and where there is a restriction on the inputs that either x = y or the Hamming distance between x and y is n=2 (and n is divisible by 4) Under this restriction, any ....
[Article contains additional citation context not shown here]
G. Brassard, R. Cleve, and A. Tapp. The cost of exactly simulating quantum entanglement with classical communication. Physical Review Letters, 83(9):1874-1877, 1999. quant-ph/9901035.
Quantum Pseudo-Telepathy and the Kochen-Specker Theorem - Renner, Wolf (Correct)
No context found.
G. Brassard, R. Cleve, and A. Tapp, The cost of exactly simulating quantum entanglement with classical communication, Phys. Rev. Lett., Vol. 83, No. 9, pp. 1874--1878, 1999.
Towards Characterizing the Non-Locality of Entangled Quantum.. - Renner, Wolf (2003) (Correct)
No context found.
G. Brassard, R. Cleve, and A. Tapp. Cost of exactly simulating quantum entanglement with classical communication. Physical Review Letters, 83(9):1874-1877, 1999.
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