What can be observed locally? Round-based models for quantum distributed computing

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

Volumn 5805 LNCS, Issue , 2009, Pages 243-257

  Gavoille, Cyril ^a   Kosowski, Adrian ^a,b   Markiewicz, Marcin ^c  

^a UNIVERSITÉ DE BORDEAUX   (France)

^b GDANSK UNIVERSITY OF TECHNOLOGY   (Poland)

^c UNIVERSITY OF GDA SK   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ANALYSIS TECHNIQUES; BIT SIZE; CLASSICAL MODEL; COMBINATORIAL OPTIMIZATION PROBLEMS; COMPUTATIONAL POWER; DISTRIBUTED ALGORITHM; DISTRIBUTED COMPUTING; DISTRIBUTED PROBLEMS; DISTRIBUTED SYSTEMS; LOWER BOUNDS; LOWER TIME BOUNDS; MAXIMAL INDEPENDENT SET; NON-TRIVIAL; OF QUANTUM-INFORMATION; PROOF OF CONCEPT; QUANTUM COMMUNICATION CHANNELS; QUANTUM EFFECTS; QUANTUM ENTANGLED STATE; VIEW-BASED;

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; QUANTUM ELECTRONICS; QUANTUM OPTICS;

QUANTUM ENTANGLEMENT;

EID: 76649087950     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04355-0_26     Document Type: Conference Paper

References (41)

1. th Annual ACM Symposium on Theory of Computing (STOC), pp. 481-485. ACM Press, New York (2005)
2. Benjamin, S.C., Hayden, P.M.: Multiplayer quantum games. Physical Review A 64(3), 030301 (2001)
3. Bennett, C.H., Shor, P.W.: Quantum information theory. IEEE Transactions on Information Theory 44, 2724-2742 (1998)
4. Broadbent, A., Tapp, A.: Can quantum mechanics help distributed computing? ACM SIGACT News - Distributed Computing Column 39(3), 67-76 (2008)
5. th Annual ACM Symposium on the Theory of Computing (STOC), pp. 63-68 (1998)
6. Cleve, R., Buhrman, H.: Substituting quantum entanglement for communication. Physical Review A 56(2), 1201-1204 (1997)
7. de Wolf, R.: Quantum communication and complexity. Theoretical Computer Science 287(1), 337-353 (2002)
8. den Nest, M.V., Dür, W., Vidal, G., Briegel, H.: Classical simulation versus universality in measurement-based quantum computation. Physical Review A 75(1), 012337 (2007)
9. Denchev, V.S., Pandurangan, G.: Distributed quantum computing: A new frontier in distributed systems or science fiction? ACM SIGACT News - Distributed Computing Column 39(3), 77-95 (2008)
10. th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 273-282. ACM Press, New York (2008)
11. Deutsch, D.: Quantum theory, the Church-Turing principle and the universal quantum computer. Proceedings of the Royal Society of London A400, 97-117 (1985)
12. D'Hondt, E., Panangaden, P.: The computational power of the W and GHZ states. Quantum Information and Computation 6(2), 173-183 (2006)
13. Eisert, J., Wilkens, M., Lewenstein, M.: Quantum games and quantum strategies. Physical Review Letters 83(11), 3077-3080 (1999)
14. th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 195-204. ACM Press, New York (2007)
15. Fraigniaud, P., Gavoille, C., Ilcinkas, D., Pelc, A.: Distributed computing with advice: Information sensitivity of graph coloring. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 231-242. Springer, Heidelberg (2007)
16. th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 179-187. ACM Press, New York (2006)
17. Gavoille, C., Klasing, R., Kosowski, A., Kuszner, Ł., Navarra, A.: On the complexity of distributed graph coloring with local minimality constraints. Networks (to appear, 2009)
18. Gavoille, C., Klasing, R., Kosowski, A., Navarra, A.: Brief announcement: On the complexity of distributed greedy coloring. In: Pelc, A. (ed.) DISC 2007. LNCS, vol. 4731, pp. 482-484. Springer, Heidelberg (2007)
19. Gavoille, C., Kosowski, A., Markiewicz, M.: What can be observed locally? Round-based models for quantum distributed computing. Technical report, arXiv: quantph/0903.1133 (2009)
20. Greenberger, D.M., Horne, M.A., Zeilinger, A.: Going beyond Bell's Theorem. In: Bell's Theorem, Quantum Theory, and Conceptions of the Universe, pp. 69-72. Kluwer, Dordrecht (1989)
21. Helm, L.: Brief announcement: Quantum distributed consensus. In: 27th Annual ACM Symposium on Principles of Distributed Computing (PODC), p. 445. ACM Press, New York (2008)
22. Jaeger, G.: Quantum Information. An Overview. Springer, Heidelberg (2007)
23. th Asian Conference on Quantum Information Science (AQIS), August 2008, pp. 157-158 (2008)
24. rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 300-309. ACM Press, New York (2004)
25. th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 331-335. IEEE Computer Society Press, Los Alamitos (1987)
26. Linial, N.: Locality in distributed graphs algorithms. SIAM Journal on Computing 21(1), 193-201 (1992)
27. Lynch, N.: Distributed Algorithms. Morgan Kaufmann Publishers, San Francisco (1997)
28. Naor, M.: A lower bound on probabilistic algorithms for distributive ring coloring. SIAM Journal on Discrete Mathematics 4(3), 409-412 (1991)
29. Naor, M., Stockmeyer, L.: What can be computed locally. SIAM Journal on Computing 24(6), 1259-1277 (1995)
30. Nielsen, M.: Conditions for a class of entanglement transformations. Physical Review Letters 83(2), 436-439 (1999)
31. Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)
32. Owari, M., Matsumoto, K., Murao, M.: Entanglement convertibility for infinite-dimensional pure bipartite states. Physical Review A 70(5), 1-4 (2004)
33. Pal, S.P., Singh, S.K., Kumar, S.: Multi-partite quantum entanglement versus randomization: Fair and unbiased leader election in networks. Technical report, arXiv: quant-ph/0306195v1 (June 2003)
34. Pan, J.-W., Chen, Z.-B., Żukowski, M., Weinfurter, H., Zeilinger, A.: Multi-photon entanglement and interferometry. Technical report, arXiv: quant-ph/0805.2853v1 (May 2008)
35. Peleg, D.: Proximity-preserving labeling schemes and their applications. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds.) WG 1999. LNCS, vol. 1665, pp. 30-41. Springer, Heidelberg (1999)
36. st Annual ACM Symposium on the Theory of Computing (STOC), pp. 358-367 (1999)
37. Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing 26(5), 1484-1509 (1997)
38. Singh, S.K., Kumar, S., Pal, S.P.: Characterizing the combinatorics of distributed EPR pairs for multi-partite entanglement. Technical report, arXiv: quantph/0306049v2 (January 2004)
39. Ta-Shma, A.: Classical versus quantum communication complexity. SIGACT News 30(3), 25-34 (1999)
40. Tani, S., Kobayashi, H., Matsumoto, K.: Exact quantum algorithms for the leader election problem. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 581-592. Springer, Heidelberg (2005)
41. Żukowski, M.: On Bell's Theorem, quantum communication, and entanglement detection. In: Foundations of Probability and Physics 5 (August 2008)