Author:
Chen Chi-Yuan,Chou Yao-Hsin,Chao Han-Chieh
Publisher
Springer Science and Business Media LLC
Subject
Geometry and Topology,Theoretical Computer Science,Software
Reference19 articles.
1. Ambainis A, Schulman LJ, Ta-Shma A, Vazirani U, Wigderson A (1998) The quantum communication complexity of sampling. In: Proceedings of the 39th annual symposium on foundations of computer science, pp 342–351
2. Bennett C, Brassard G, Crepeau C, Jozsa R, Peres A, Wootters W (1993) Teleporting an unknown quantum state via dual classical and EPR channels. Phys Rev Lett 70:1895–1899
3. Brassard G (2003) Quantum communication complexity. Found Phys 33:1593–1616
4. Buhrman H, Cleve R, Wigderson A (1998) Quantum vs. classical communication and computation. In: Proceedings of the 30th annual ACM symposium on theory of computing, pp 63–68
5. Buhrman H, van Dam W, Hoyer P, Tapp A (1999) Muliparty quantum communication complexity. Phys Rev A 60:2737–2741
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献