Exponential separation of quantum and classical communication complexity
暂无分享,去创建一个
[1] A. Holevo. Bounds for the quantity of information transmitted by a quantum communication channel , 1973 .
[2] Andrew Chi-Chih Yao,et al. Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.
[3] V. Milman,et al. Asymptotic Theory Of Finite Dimensional Normed Spaces , 1986 .
[4] Bala Kalyanasundaram,et al. The Probabilistic Communication Complexity of Set Intersection , 1992, SIAM J. Discret. Math..
[5] Avi Wigderson,et al. Monotone circuits for connectivity require super-logarithmic depth , 1990, STOC '88.
[6] Avi Wigderson,et al. Monotone Circuits for Connectivity Require Super-Logarithmic Depth , 1990, SIAM J. Discret. Math..
[7] Ilan Newman,et al. Private vs. Common Random Bits in Communication Complexity , 1991, Inf. Process. Lett..
[8] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[9] Alexander A. Razborov,et al. On the Distributional Complexity of Disjointness , 1992, Theor. Comput. Sci..
[10] Umesh V. Vazirani,et al. Quantum complexity theory , 1993, STOC.
[11] Charles H. Bennett,et al. Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. , 1993, Physical review letters.
[12] Andrew Chi-Chih Yao,et al. Quantum Circuit Complexity , 1993, FOCS.
[13] R. Hughes,et al. Quantum Cryptography , 1995, quant-ph/9504002.
[14] Weinfurter,et al. Dense coding in experimental quantum communication. , 1996, Physical review letters.
[15] H. Weinfurter,et al. Experimental quantum teleportation , 1997, Nature.
[16] Lov K. Grover. Quantum Mechanics Helps in Searching for a Needle in a Haystack , 1997, quant-ph/9706033.
[17] Umesh V. Vazirani,et al. Quantum Complexity Theory , 1997, SIAM J. Comput..
[18] John Preskill,et al. Lecture notes on quantum information and quantum computation~ http://www , 1998 .
[19] Avi Wigderson,et al. Quantum vs. classical communication and computation , 1998, STOC '98.
[20] Andris Ambainis,et al. The quantum communication complexity of sampling , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[21] Lov K. Grover,et al. Quantum computation , 1999, Proceedings Twelfth International Conference on VLSI Design. (Cat. No.PR00013).
[22] Peter W. Shor,et al. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..