Can quantum communication speed up distributed computation?

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2014, Pages 166-175

  Elkin, Michael ^a   Klauck, Hartmut ^b   Nanongkai, Danupon ^c   Pandurangan, Gopal ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^c UNIVERSITY OF VIENNA   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ASPECT RATIO; COMPLEX NETWORKS; COMPUTER SIMULATION; GRAPH THEORY; HAMILTONIANS; HARDNESS; QUANTUM CHEMISTRY; QUANTUM COMMUNICATION; QUANTUM COMPUTERS;

COMMUNICATION COMPLEXITY; COMMUNICATION COMPLEXITY MODELS; COMMUNICATION SPEED; DISTRIBUTED COMPUTATIONS; DISTRIBUTED NETWORKS; MINIMUM SPANNING TREES; QUANTUM SIMULATIONS; VERIFICATION PROBLEMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84905457507     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2611462.2611488     Document Type: Conference Paper

References (64)

1. S. Aaronson and A. Ambainis. Quantum search of spatial regions. Theory of Computing, 1(1):479, 2005. Also in FGCS'03.
2. L. Babai, P. Frankl, and J. Simon. Complexity classes in communication complexity theory. In FOCS, pages 33747, 1986.
3. Z. Bar-Yossef, T. S. Jayram, R. Kumar, and D. Sivakumar. An information statistics approach to data stream and communication complexity. J. Comput. Syst. Sci., 68(4):702 732, 2004. Also in FOCS'02.
4. J. S. Bell. On the Einstein-Podolsky-Rosen paradox. Physics, 1:195-200, 1964.
5. M. Ben-Or and A. Hassidim. Fast quantum byzantine agreement. In STOC, pages 48185, 2005.
6. A. Broadbent and A. Tapp. Can quantum mechanics help distributed computing? SIGACT News, 39(3):676, 2008.
7. H. Buhrman, R. Cleve, and A. Wigderson. Quantum vs. classical communication and computation. In STOC, pages 63-68, 1998.
8. H. Buhrman and H. Röhrig. Distributed quantum computing. In MFCS, pages 1-20, 2003.
9. H. Buhrman, W. van Dam, P. Hoyer, and A. Tapp. Quantum multiparty communication complexity. Physical Review A, 60:2737-2741, 1999.
10. K. Censor-Hillel, M. Ghaffari, and F. Kuhn. Distributed connectivity decomposition. In PODC, 2014.
11. B. S. Chlebus, D. R. Kowalski, and M. Strojnowski. Scalable quantum consensus for crash failures. In DISC, pages 236-250, 2010.
12. R. Cleve and H. Buhrman. Substituting quantum entanglement for communication. Physical Review A, 56(2):1201 1204, 1997.
13. A. Das Sarma, S. Holzer, L. Kor, A. Korman, D. Nanongkai, G. Pandurangan, D. Peleg, and R. Wattenhofer. Distributed verification and hardness of distributed approximation. SIAM J. Comput., 41(5):1235265, 2012.
14. A. Das Sarma, A. R. Molla, and G. Pandurangan. Distributed computation of sparse cuts. CoRR, abs/1310.5407,
15. A. Das Sarma, D. Nanongkai, G. Pandurangan, and P. Tetali. Distributed random walks. J. ACM, 60(1):2, 2013.
16. R. de Wolf. Quantum communication and complexity. Theoretical Computer Science, 287(1):33752, 2002.
17. V. S. Denchev and G. Pandurangan. Distributed quantum computing: a new frontier in distributed systems or science fiction? SIGACT News, 39(3):77-95, 2008.
18. D. P. Dubhashi, F. Grandioni, and A. Panconesi. Distributed Algorithms via LP Duality and Randomization. In Handbook of Approximation Algorithms and Metaheuristics. Chapman and Hall/CRC, 2007.
19. A. Einstein, B. Podolsky, and N. Rosen. Can quantummechanical description of physical reality be considered complete? Phys. Rev., 47(10):777-780, May 1935.
20. M. Elkin. Distributed approximation: a survey. SIGACT News, 35(4):407, 2004.
21. M. Elkin. An Unconditional Lower Bound on the Time-Approximation Trade-off for the Distributed Minimum Spanning Tree Problem. SIAM J. Comput., 36(2):433-456, 2006. Also in STOC'04.
22. S. Frischknecht, S. Holzer, and R. Wattenhofer. Networks cannot compute their diameter in sublinear time. In SODA, pages 1150-1162, 2012.
23. S. Gaertner, M. Bourennane, C. Kurtsiefer, A. Cabello, and H. Weinfurter. Experimental demonstration of a quantum protocol for byzantine agreement and liar detection. PHYS.REV.LETT., 100:070504, 2008.
24. J. Garay, S. Kutten, and D. Peleg. A sublinear time distributed algorithm for minimum-weight spanning trees. SIAM J. on Computing, 27:30216, 1998. Also in FOCS'93.
25. C. Gavoille, A. Kosowski, and M. Markiewicz. What can be observed locally? In DISC, pages 24357, 2009.
26. .M. Ghaffari . Near-optimal distributed approximation of minimum-weight connected dominating set. In ICALP (2),2014..
27. M. Ghaffari and F. Kuhn. Distributed minimum cut approximation. In DISC, pages 15, 2013.
28. A.S. Holevo . Bounds for the quantity of information transmitted by a quantum communication channel. Problemy Peredachi Informatsii, 9(3):3-11, 1973.
29. A. S. Holevo. Bounds for the quantity of information transmitted by a quantum communication channel. Problemy Peredachi Informatsii, 9(3):311, 1973. English translation in Problems of Information Transmission, 9:17783, 1973.
30. S. Holzer and R. Wattenhofer. Optimal distributed all pairs shortest paths and applications. In PODC, pages 35564, 2012.
31. G. Ivanyos, H. Klauck, T. Lee, M. Santha, and R. de Wolf. New bounds on the classical and quantum communication complexity of some graph properties. In FSTTCS, pages 148-159, 2012.
32. B. Kalyanasundaram and G. Schnitger. The Probabilistic Communication Complexity of Set Intersection. SIAM J. Discrete Math., 5(4):545-557, 1992.
33. M. Khan, F. Kuhn, D. Malkhi, G. Pandurangan, and K. Talwar. Efficient distributed approximation algorithms via probabilistic tree embeddings. In PODC, pages 2632, 2008.
34. H. Klauck and R. de Wolf. Fooling one-sided quantum protocols. Manuscript, 2012.
35. Kobayashi H. Matsumoto K. Tani S.Ba: Exactly electing a unique leader is not harder than computing symmetric functions on anonymous quantum networks. PODC, pages 334-335, 2009.
36. H. Kobayashi, K. Matsumoto, and S. Tani. Computing on anonymous quantum network. CoRR, abs/1001.5307, 2010.
37. L. Kor, A. Korman, and D. Peleg. Tight bounds for distributed mst verification. In STAGS, pages 69-80, 2011.
38. E. Kushilevitz and N. Nisan. Communication complexity. Cambridge University Press, New York, NY, USA, 1997.
39. S. Kutten and D. Peleg. Fast Distributed Construction of Small k-Dominating Sets and Applications. J. Algorithms, 28(1):40-66, 1998. Also in PODC'95.
40. T. Lee and A. Shraibman. Lower bounds in communication complexity. Foundations and Trends in Theoretical Computer Science, 3(4):26398, 2009.
41. T. Lee and S. Zhang. Composition theorems in communication complexity. In ICALP (1), pages 475-489, 2010.
42. C. Lenzen and B. Patt-Shamir. Fast routing table construction using small messages: extended abstract. In STOC, pages 38190, 2013.
43. N. Linial and A. Shraibman. Lower bounds in communication complexity based on factorization norms. Random Struct. Algorithms, 34(3):36894, 2009. Also in STOC'07.
44. Z. Lotker, B. Patt-Shamir, and D. Peleg. Distributed MST for constant diameter graphs. Distributed Computing, 18(6):453-460, 2006. Also in PODC'01.
45. M. Luby. A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput., 15(4):1036053, 1986.
46. M. Luby. A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput., 15(4):1036053, 1986. Also in STOC'85.
47. D. Nanongkai. Brief announcement: Almost-tight approximation distributed algorithm for minimum cut. In PODC, 2014.
48. D. Nanongkai. Distributed Approximation Algorithms for Weighted Shortest Paths. In STOC, 2014.
49. D. Nanongkai, A. Das Sarma, and G. Pandurangan. A tight unconditional lower bound on distributed randomwalk computation. In PODC, pages 25766, 2011.
50. D. Nanongkai and H. Su. Almost-tight distributed minimum cut algorithms. Manuscript, 2014.
51. A. Nayak. Optimal lower bounds for quantum automata and random access codes. In FOCS, pages 36977, 1999.
52. M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information (Cambridge Series on Information and the Natural Sciences). Cambridge University Press, 1 edition, Jan. 2004.
53. S. P. Pal, S. K. Singh, and S. Kumar. Multi-partite quantum entanglement versus randomization: Fair and unbiased leader election in networks, 2003.
54. D. Peleg. Distributed computing: a locality-sensitive approach. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2000.
55. D. Peleg and V. Rubinovich. A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction. SIAM J. Comput., 30(5):1427-1442, 2000. Also in FOCS'99.
56. R. Raz. Exponential separation of quantum and classical communication complexity. In STOC, pages 35869, 1999.
57. R. Raz and B. Spieker. On the "log rank"-conjecture in communication complexity. Combinatorica, 15(4):567-588, 1995. Also in FOCS'93.
58. A. A. Razborov. On the Distributional Complexity of Disjointness. Theor. Comput. Sci., 106(2):38590, 1992. Also in ICALP'90.
59. A. A. Razborov. Quantum communication complexity of symmetric predicates. Izvestiya: Mathematics, 67(1):145, 2003.
60. A. A. Sherstov. The pattern matrix method. SIAM J. Comput., 40(6): 1969000, 2011. Also in STOC'08.
61. H. Su. Brief announcement: A distributed minimum cut approximation scheme. In SPAA, 2014.
62. J. Suomela. Survey of local algorithms. ACM Computing Surveys, to appear.
63. A. Ta-Shma. Classical versus quantum communication complexity. SIGACT News, 30(3):25-34, 1999.
64. S. Tani, H. Kobayashi, and K. Matsumoto. Exact quantum algorithms for the leader election problem. In STACS, pages 581-592, 2005.