Quantum communication complexity: a survey
暂无分享,去创建一个
[1] Michael Steiner,et al. Towards quantifying non-local information transfer: finite-bit non-locality , 1999, quant-ph/9902014.
[2] Charles H. Bennett,et al. Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states. , 1992, Physical review letters.
[3] G. Brassard,et al. Oracle Quantum Computing , 1992, Workshop on Physics and Computation.
[4] Peter Hoyer,et al. Multiparty quantum communication complexity. , 1997 .
[5] Harry Buhrman,et al. Quantum Entanglement and Communication Complexity , 2000, SIAM J. Comput..
[6] Gilles Brassard,et al. Quantum Cryptography , 2005, Encyclopedia of Cryptography and Security.
[7] N. Gisin,et al. Quantum cryptography , 1998 .
[8] Cerf,et al. Classical teleportation of a quantum Bit , 2000, Physical review letters.
[9] R. Cleve,et al. SUBSTITUTING QUANTUM ENTANGLEMENT FOR COMMUNICATION , 1997, quant-ph/9704026.
[10] Peter W. Shor,et al. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..
[11] Lov K. Grover. Quantum Mechanics Helps in Searching for a Needle in a Haystack , 1997, quant-ph/9706033.
[12] A. Holevo. Bounds for the quantity of information transmitted by a quantum communication channel , 1973 .
[13] Charles H. Bennett,et al. Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. , 1993, Physical review letters.
[14] Gilles Brassard,et al. Cost of Exactly Simulating Quantum Entanglement with Classical Communication , 1999 .
[15] Ran Raz,et al. Exponential separation of quantum and classical communication complexity , 1999, STOC '99.
[16] Andrew Chi-Chih Yao,et al. Quantum Circuit Complexity , 1993, FOCS.
[17] Avi Wigderson,et al. Quantum vs. classical communication and computation , 1998, STOC '98.
[18] D. Deutsch,et al. Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.
[19] G. Brassard,et al. Quantum Communication Complexity , 2003 .
[20] Bala Kalyanasundaram,et al. The Probabilistic Communication Complexity of Set Intersection , 1992, SIAM J. Discret. Math..
[21] Dave Bacon,et al. Classical simulation of quantum entanglement without local hidden variables , 2001 .
[22] Ronald de Wolf,et al. Communication complexity lower bounds by polynomials , 1999, Proceedings 16th Annual IEEE Conference on Computational Complexity.