Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity
暂无分享,去创建一个
[1] Ilan Newman,et al. Private vs. Common Random Bits in Communication Complexity , 1991, Inf. Process. Lett..
[2] Iordanis Kerenidis. Quantum multiparty communication complexity and circuit lower bounds , 2009, Math. Struct. Comput. Sci..
[3] Dmitry Gavinsky,et al. Classical interaction cannot replace a quantum message , 2007, STOC.
[4] F. Lazebnik,et al. A new series of dense graphs of high girth , 1995, math/9501231.
[5] Avi Wigderson,et al. Quantum vs. classical communication and computation , 1998, STOC '98.
[6] M. Simonovits,et al. Cycles of even length in graphs , 1974 .
[7] Richard J. Lipton,et al. Multi-party protocols , 1983, STOC.
[8] Andrew Chi-Chih Yao,et al. Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.
[9] Ziv Bar-Yossef,et al. Exponential separation of quantum and classical one-way communication complexity , 2004, STOC '04.
[10] Ran Raz,et al. Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography , 2008, SIAM J. Comput..
[11] M. Murty. Ramanujan Graphs , 1965 .
[12] R. Cleve,et al. Quantum fingerprinting. , 2001, Physical review letters.
[13] Ran Raz,et al. Exponential separation of quantum and classical communication complexity , 1999, STOC '99.
[14] Ronald de Wolf,et al. Bounded-error quantum state identification and exponential separations in communication complexity , 2005, STOC '06.