Towards characterizing the nonlocality of entangled quantum states
暂无分享,去创建一个
[1] A. Zeilinger,et al. Going Beyond Bell’s Theorem , 2007, 0712.0921.
[2] S. Wolf,et al. The impossibility of pseudotelepathy without quantum entanglement , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..
[3] D. Bacon,et al. Communication cost of simulating Bell correlations. , 2003, Physical review letters.
[4] Stefan Wolf,et al. Pseudo-telepathy, entanglement, and graph colorings , 2002, Proceedings IEEE International Symposium on Information Theory,.
[5] Gilles Brassard,et al. Cost of Exactly Simulating Quantum Entanglement with Classical Communication , 1999 .
[6] Harry Buhrman,et al. Quantum Computing and Communication Complexity , 2001, Bull. EATCS.
[7] G. Brassard,et al. Quantum Pseudo-Telepathy , 2004, quant-ph/0407221.
[8] Harry Buhrman,et al. Quantum Entanglement and Communication Complexity , 2000, SIAM J. Comput..
[9] Andris Ambainis,et al. The quantum communication complexity of sampling , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[10] Avi Wigderson,et al. Quantum vs. classical communication and computation , 1998, STOC '98.
[11] A. Shimony,et al. Bell’s theorem without inequalities , 1990 .
[12] N J Cerf,et al. Simulating maximal quantum entanglement without communication. , 2005, Physical review letters.
[13] Peter Hoyer,et al. Multiparty quantum communication complexity. , 1997 .
[14] J. Bell. On the Einstein-Podolsky-Rosen paradox , 1964 .
[15] Ran Raz,et al. Exponential separation of quantum and classical communication complexity , 1999, STOC '99.
[16] R. Cleve,et al. SUBSTITUTING QUANTUM ENTANGLEMENT FOR COMMUNICATION , 1997, quant-ph/9704026.