Distributed quantum computing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2747, Issue , 2003, Pages 1-20

  Buhrman, Harry ^a   Röhrig, Hein ^a  

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

QUANTUM THEORY;

DISTRIBUTED QUANTUM COMPUTING; ITS APPLICATIONS; QUANTUM COMPUTING;

QUANTUM COMPUTERS;

EID: 35248899468     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45138-9_1     Document Type: Article

References (57)

1. S. Aaronson and A. Ambainis. Quantum search of spatial regions. quant-ph/0303041, 2003.
2. H. Abelson. Lower bounds on information transfer in distributed computations. J. Assoc. Comput. Mach., 27(2):384-392, 1980.
3. Earlier version in FOCS'78.
4. D. Aharonov, A. Ta-Shma, U. Vazirani, and A. Yao. Quantum bit escrow. In Proceedings of STOC'00, pages 705-714, 2000.
5. A. Ambainis. A new protocol and lower bounds for quantum coin flipping. In Proceedings of 33rd ACM STOC, pages 134-142, 2001.
6. A. Ambainis. Lower bound for a class of weak quantum coin flipping protocols. quant-ph/0204063, 2002.
7. A. Ambainis, H. Buhrman, Y. Dodis, and H. Röhrig. Multiparty quantum coin flipping. Submitted, 2003.
8. A. Ambainis, L. Schulman, A. Ta-Shma, U. Vazirani, and A. Wigderson. The quantum communication complexity of sampling. In 39th IEEE Symposium on Foundations of Computer Science, pages 342-351, 1998.
9. A. Ambainis and Y. Shi. Distributed construction of quantum fingerprints, quant-ph/0305022, 2003.
10. A. Aspect, J. Dalibard, and G. Roger. Experimental test of Bell's inequalities using time-varying analyzers. Phys. Rev. Lett., 49(25):1804, 1982.
11. J. S. Bell. On the Einstein-Podolsky-Rosen paradox. Physics, 1, 1964.
12. C. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, and W. Wootters. Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. Physiscal Review Letters, 70:1895-1899, 1993.
13. C. Bennett and S. Wiesner. Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states. Physiscal Review Letters, 69:2881-2884, 1992.
14. C. H. Bennett and G. Brassard. Quantum cryptography: Public key distribution and coin tossing. In Proceedings of the IEEE International Conference on Computers, Systems and Signal Processing, pages 175-179, 1984.
15. G. Brassard, R. Cleve, and A. Tapp. The cost of exactly simulating quantum entanglement with classical communication. Physical Review Letters, 83(9):1874-1877, 1999.
16. H. Buhrman, R. Cleve, and W. van Dam. Quantum entanglement and communication complexity. SIAM Journal on Computing, 30(8):1829-1841, 2001. quant-ph/9705033.
17. H. Buhrman, R. Cleve, J. Watrous, and R. de Wolf. Quantum fingerprinting. Physical Review Letters, 87(16), September 26, 2001.
18. H. Buhrman, R. Cleve, and A. Wigderson. Quantum vs. classical communication and computation. In 30th Annual ACM Symposium on Theory of Computing, 1998. quant-ph/9702040.
19. H. Buhrman and R. de Wolf. Communication complexity lower bounds by polynomials. In 16th IEEE Annual Conference on Computational Complexity (CCC'01), pages 120-130, 2001. cs.CC/9910010.
20. H. Buhrman, P. Høyer, S. Massar, and H. Röhrig. Combinatorics and quantum nonlocality. Accepted for publication in Physical Review Letters, 2002.
21. H. Buhrman, P. Høyer, S. Massar, and H. Röhrig. Resistance of quantum nonlocality to imperfections. Manuscript, 2003.
22. Harry Buhrman, Wim van Dam, Peter Høyer, and Alain Tapp. Multiparty quantum communication complexity. Physical Review A, 60(4):2737-2741, October 1999.
23. R. Cleve and H. Buhrman. Substituting quantum entanglement for communication complexity. Physical Review A, 56(2):1201-1204, august 1997.
24. R. Cleve, W. van Dam, M. Nielsen, and A. Tapp. Quantum entanglement and the communication complexity of the inner product function. In Springer-Verlag, editor, Proceedings of the 1st NASA International Conference on Quantum Computing and Quantum Communications, 1998.
25. D. Dieks. Communication by EPR devices. Phys. Lett. A, 92(6):271-272, 1982.
26. A. Einstein, B. Podolsky, and N. Rosen. Can quantum-mechanical description of physical reality be considered complete? Phys. Rev., 47:777, 1935.
27. U. Feige. Noncryptographic selection protocols. In Proceedings of 40th IEEE FOCS, pages 142-152, 1999.
28. P. Frankl and V. Rödl. Forbidden intersections. Trans. Amer. Math. Soc., 300(1):259-286, 1987.
29. L. Goldenberg, L. Vaidman, and S. Wiesner. Quantum gambling. Physical Review Letters, 88:3356-3359, 1999.
30. L. Grover. A fast quantum mechenical algorithm for database search. In 28th ACM Symposium on Theory of Computing, pages 212-218, 1996.
31. A. S. Holevo. Bounds for the quantity of information transmitted by a quantum communication channel. Problemy Peredachi Informatsii, 9(3):3-11, 1973.
32. English translation in Problems of Information Transmission, 9:177-183, 1973.
33. P. Høyer and R. de Wolf. Improved quantum communication complexity bounds for disjointness and equality. In Proceedings of 19th Annual Symposium on Theoretical Aspects of Computer Science (STACS'2002), volume 2285 of Lecture Notes in Computer Science, pages 299-310. Springer, 2002. quant-ph/0109068.
34. J. Hromkovič. Communication Complexity and Parallel Computing. EATCS series: Texts in Theoretical Computer Science. Springer, 1997.
35. D. Deutsch R. Josza. Rapid solutions of problems by quantum computation. Proc. Roy. Soc. London Se. A, 439:553-558, 1992.
36. B. Kalyanasundaram and G. Schnitger. The probabilistic communication complexity of set intersection. SIAM J. Discrete Mathematics, 5(4):545-557, 1992.
37. A. Yu. Kitaev. Quantum coin-flipping. Talk at QIP 2003 (slides and video at MSRI), December 2002.
38. I. Kremer. Quantum communication. Master's thesis, Computer Science Department, The Hebrew University, 1995.
39. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
40. H. K. Lo and H. F. Chau. Why quantum bit commitment and ideal quantum coin tossing are impossible. Physica D, 120:177-187, 1998.
41. H-K. Lo and H. F. Chau. Unconditional security of quantum key distribution over arbitrarily long distances, quant-ph/9803006, 3 Mar 1998.
42. S. Massar. Nonlocality, closing the detection loophole, and communication complexity. Physical Review A, 65:032121, 2002.
43. D. Mayers. Unconditional security in quantum cryptography, quant-ph/9802025, 10 Feb 1998.
44. D. Mayers. Unconditionally secure quantum bit commitment is impossible. Physical Review Letters, 78:3414-3417, 1997.
45. D. Mayers, L. Salvail, and Y. Chiba-Kohno. Unconditionally secure quantum coin tossing, quant-ph/9904078, 22 Apr 1999.
46. K. Mehlhorn and E. M. Schmidt. Las Vegas is better than determinism in VLSI and distributed computing (extended abstract). In Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, pages 330-337, San Francisco, California, 5-7 May 1982.
47. I. Newman. Private vs. common random bits in communication complexity. Information Processing Letters, 39(2):67-71, July 1991.
48. M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000.
49. N. Nisan and A. Wigderson. On rank vs. communication complexity. Combinatorial, 15:557-566, 1995.
50. Earlier version in FOCS'94.
51. R. Raz. Exponential separation of quantum and classical communication complexity. In Proceedings of 31th STOC, pages 358-367, 1999.
52. A. A. Razborov. Quantum communication complexity of symmetric predicates. Izv. Math., 67(1):145-159, 2003.
53. M. Saks. A robust noncryptographic protocol for collective coin flipping. SIAM J. Discrete Math., 2(2):240-244, 1989.
54. R. Spekkens and T. Rudolph. A quantum protocol for cheat-sensitive weak coin flipping, quant-ph/0202118, 2002.
55. W. K. Wootters and W. H. Zurek. A single quantum cannot be cloned. Nature, 299(5886):802-803, 1982.
56. A. C-C. Yao. Some complexity questions related to distributive computing. In Proceedings of 11th STOC, pages 209-213, 1979.
57. A. C-C. Yao. Quantum circuit complexity. In Proceedings of 34th FOCS, pages 352-360, 1993.