{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T23:15:01Z","timestamp":1770333301681,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":54,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540406716","type":"print"},{"value":"9783540451389","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45138-9_1","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T18:41:48Z","timestamp":1277232108000},"page":"1-20","source":"Crossref","is-referenced-by-count":61,"title":["Distributed Quantum Computing"],"prefix":"10.1007","author":[{"given":"Harry","family":"Buhrman","sequence":"first","affiliation":[]},{"given":"Hein","family":"R\u00f6hrig","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"Aaronson, S., Ambainis, A.: Quantum search of spatial regions (2003); quant-ph\/0303041"},{"issue":"2","key":"1_CR2","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1145\/322186.322200","volume":"27","author":"H. Abelson","year":"1980","unstructured":"Abelson, H.: Lower bounds on information transfer in distributed computations. J. Assoc. Comput. Mach.\u00a027(2), 384\u2013392 (1980); Earlier version in FOCS 1978","journal-title":"J. Assoc. Comput. Mach."},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Aharonov, D., Ta-Shma, A., Vazirani, U., Yao, A.: Quantum bit escrow. In: Proceedings of STOC 2000, pp. 705\u2013714 (2000)","DOI":"10.1145\/335305.335404"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Ambainis, A.: A new protocol and lower bounds for quantum coin flipping. In: Proceedings of 33rd ACM STOC, pp. 134\u2013142 (2001)","DOI":"10.1145\/380752.380788"},{"key":"1_CR5","unstructured":"Ambainis, A.: Lower bound for a class of weak quantum coin flipping protocols (2002); quant-ph\/0204063"},{"key":"1_CR6","unstructured":"Ambainis, A., Buhrman, H., Dodis, Y., R\u00f6hrig, H.: Multiparty quantum coin flipping (2003) (submitted)"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Schulman, L., Ta-Shma, A., Vazirani, U., Wigderson, A.: The quantum communication complexity of sampling. In: 39th IEEE Symposium on Foundations of Computer Science, pp. 342\u2013351 (1998)","DOI":"10.1109\/SFCS.1998.743480"},{"key":"1_CR8","unstructured":"Ambainis, A., Shi, Y.: Distributed construction of quantum fingerprints. quant-ph\/0305022 (2003)"},{"issue":"25","key":"1_CR9","doi-asserted-by":"publisher","first-page":"1804","DOI":"10.1103\/PhysRevLett.49.1804","volume":"49","author":"A. Aspect","year":"1982","unstructured":"Aspect, A., Dalibard, J., Roger, G.: Experimental test of Bell\u2019s inequalities using time-varying analyzers. Phys. Rev. Lett.\u00a049(25), 1804 (1982)","journal-title":"Phys. Rev. Lett."},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Bell, J.S.: On the Einstein-Podolsky-Rosen paradox. Physics\u00a01 (1964)","DOI":"10.1103\/PhysicsPhysiqueFizika.1.195"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"1895","DOI":"10.1103\/PhysRevLett.70.1895","volume":"70","author":"C. Bennett","year":"1993","unstructured":"Bennett, C., Brassard, G., Cr\u00e9peau, C., Jozsa, R., Peres, A., Wootters, W.: Tele-porting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. Physiscal Review Letters\u00a070, 1895\u20131899 (1993)","journal-title":"Physiscal Review Letters"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"2881","DOI":"10.1103\/PhysRevLett.69.2881","volume":"69","author":"C. Bennett","year":"1992","unstructured":"Bennett, C., Wiesner, S.: Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states. Physiscal Review Letters\u00a069, 2881\u20132884 (1992)","journal-title":"Physiscal Review Letters"},{"key":"1_CR13","unstructured":"Bennett, C.H., Brassard, G.: Quantum cryptography: Public key distribution and coin tossing. In: Proceedings of the IEEE International Conference on Computers, Systems and Signal Processing, pp. 175\u2013179 (1984)"},{"issue":"9","key":"1_CR14","doi-asserted-by":"publisher","first-page":"1874","DOI":"10.1103\/PhysRevLett.83.1874","volume":"83","author":"G. Brassard","year":"1999","unstructured":"Brassard, G., Cleve, R., Tapp, A.: The cost of exactly simulating quantum entanglement with classical communication. Physical Review Letters\u00a083(9), 1874\u20131877 (1999)","journal-title":"Physical Review Letters"},{"issue":"8","key":"1_CR15","doi-asserted-by":"publisher","first-page":"1829","DOI":"10.1137\/S0097539797324886","volume":"30","author":"H. Buhrman","year":"2001","unstructured":"Buhrman, H., Cleve, R., van Dam, W.: Quantum entanglement and communication complexity. SIAM Journal on Computing\u00a030(8), 1829\u20131841 (2001); quant-ph\/9705033","journal-title":"SIAM Journal on Computing"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Buhrman, H., Cleve, R., Watrous, J., de Wolf, R.: Quantum fingerprinting. Physical Review Letters\u00a087(16) (September 26 2001)","DOI":"10.1103\/PhysRevLett.87.167902"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Buhrman, H., Cleve, R., Wigderson, A.: Quantum vs. classical communication and computation. In: 30th Annual ACM Symposium on Theory of Computing (1998); quant-ph\/9702040","DOI":"10.1145\/276698.276713"},{"key":"1_CR18","unstructured":"Buhrman, H., de Wolf, R.: Communication complexity lower bounds by polynomials. In: 16th IEEE Annual Conference on Computational Complexity (CCC 2001), pp. 120\u2013130 (2001); cs.CC\/9910010"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Buhrman, H., H\u00f6yer, P., Massar, S., R\u00f6hrig, H.: Combinatorics and quantum nonlocality. Accepted for publication in Physical Review Letters (2002)","DOI":"10.1103\/PhysRevLett.91.047903"},{"key":"1_CR20","unstructured":"Buhrman, H., H\u00f6yer, P., Massar, S., R\u00f6hrig, H.: Resistance of quantum nonlo-cality to imperfections (2003) (manuscript)"},{"issue":"4","key":"1_CR21","doi-asserted-by":"publisher","first-page":"2737","DOI":"10.1103\/PhysRevA.60.2737","volume":"60","author":"H. Buhrman","year":"1999","unstructured":"Buhrman, H., van Dam, W., H\u00f6yer, P., Tapp, A.: Multiparty quantum communication complexity. Physical Review A\u00a060(4), 2737\u20132741 (1999)","journal-title":"Physical Review A"},{"issue":"2","key":"1_CR22","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1103\/PhysRevA.56.1201","volume":"56","author":"R. Cleve","year":"1997","unstructured":"Cleve, R., Buhrman, H.: Substituting quantum entanglement for communication complexity. Physical Review A\u00a056(2), 1201\u20131204 (1997)","journal-title":"Physical Review A"},{"key":"1_CR23","volume-title":"Proceedings of the 1st NASA International Conference on Quantum Computing and Quantum Communications","author":"R. Cleve","year":"1998","unstructured":"Cleve, R., van Dam, W., Nielsen, M., Tapp, A.: Quantum entanglement and the communication complexity of the inner product function. In: Proceedings of the 1st NASA International Conference on Quantum Computing and Quantum Communications. Springer, Heidelberg (1998)"},{"issue":"6","key":"1_CR24","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0375-9601(82)90084-6","volume":"92","author":"D. Dieks","year":"1982","unstructured":"Dieks, D.: Communication by EPR devices. Phys. Lett. A\u00a092(6), 271\u2013272 (1982)","journal-title":"Phys. Lett. A"},{"key":"1_CR25","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1103\/PhysRev.47.777","volume":"47","author":"A. Einstein","year":"1935","unstructured":"Einstein, A., Podolsky, B., Rosen, N.: Can quantum-mechanical description of physical reality be considered complete? Phys. Rev.\u00a047, 777 (1935)","journal-title":"Phys. Rev."},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Feige, U.: Noncryptographic selection protocols. In: Proceedings of 40th IEEE FOCS, pp. 142\u2013152 (1999)","DOI":"10.1109\/SFFCS.1999.814586"},{"issue":"1","key":"1_CR27","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1090\/S0002-9947-1987-0871675-6","volume":"300","author":"P. Frankl","year":"1987","unstructured":"Frankl, P., R\u00f6dl, V.: Forbidden intersections. Trans. Amer. Math. Soc.\u00a0300(1), 259\u2013286 (1987)","journal-title":"Trans. Amer. Math. Soc."},{"key":"1_CR28","doi-asserted-by":"publisher","first-page":"3356","DOI":"10.1103\/PhysRevLett.82.3356","volume":"88","author":"L. Goldenberg","year":"1999","unstructured":"Goldenberg, L., Vaidman, L., Wiesner, S.: Quantum gambling. Physical Review Letters\u00a088, 3356\u20133359 (1999)","journal-title":"Physical Review Letters"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Grover, L.: A fast quantum mechenical algorithm for database search. In: 28th ACM Symposium on Theory of Computing, pp. 212\u2013218 (1996)","DOI":"10.1145\/237814.237866"},{"issue":"3","key":"1_CR30","first-page":"3","volume":"9","author":"A.S. Holevo","year":"1973","unstructured":"Holevo, A.S.: Bounds for the quantity of information transmitted by a quantum communication channel. Problemy Peredachi Informatsii\u00a09(3), 3\u201311 (1973); English translation in Problems of Information Transmission, 9, 177\u2013183 (1973)","journal-title":"Problemy Peredachi Informatsii"},{"key":"1_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/3-540-45841-7_24","volume-title":"STACS 2002","author":"P. H\u00f8yer","year":"2002","unstructured":"H\u00f8yer, P., de Wolf, R.: Improved quantum communication complexity bounds for disjointness and equality. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, pp. 299\u2013310. Springer, Heidelberg (2002); quant-ph\/0109068"},{"key":"1_CR32","series-title":"EATCS series: Texts in Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03442-2","volume-title":"Communication Complexity and Parallel Computing","author":"J. Hromkovic","year":"1997","unstructured":"Hromkovi\u010d, J.: Communication Complexity and Parallel Computing. EATCS series: Texts in Theoretical Computer Science. Springer, Heidelberg (1997)"},{"key":"1_CR33","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1098\/rspa.1992.0167","volume":"439","author":"D. Deutsch","year":"1992","unstructured":"Deutsch, D., Josza, R.: Rapid solutions of problems by quantum computation. Proc. Roy. Soc. London Se. A\u00a0439, 553\u2013558 (1992)","journal-title":"Proc. Roy. Soc. London Se. A"},{"issue":"4","key":"1_CR34","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1137\/0405044","volume":"5","author":"B. Kalyanasundaram","year":"1992","unstructured":"Kalyanasundaram, B., Schnitger, G.: The probabilistic communication complexity of set intersection. SIAM J. Discrete Mathematics\u00a05(4), 545\u2013557 (1992)","journal-title":"SIAM J. Discrete Mathematics"},{"key":"1_CR35","unstructured":"Kitaev, A.Y.: Quantum coin-flipping. Talk at QIP 2003 (slides and video at MSRI) (December 2002)"},{"key":"1_CR36","unstructured":"Kremer, I.: Quantum communication. Master\u2019s thesis, Computer Science Department, The Hebrew University (1995)"},{"key":"1_CR37","volume-title":"Communication Complexity","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)"},{"key":"1_CR38","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0167-2789(98)00053-0","volume":"120","author":"H.K. Lo","year":"1998","unstructured":"Lo, H.K., Chau, H.F.: Why quantum bit commitment and ideal quantum coin tossing are impossible. Physica D\u00a0120, 177\u2013187 (1998)","journal-title":"Physica D"},{"key":"1_CR39","unstructured":"Lo, H.-K., Chau, H.F.: Unconditional security of quantum key distribution over arbitrarily long distances March 3 (1998); quant-ph\/9803006"},{"key":"1_CR40","doi-asserted-by":"publisher","first-page":"32121","DOI":"10.1103\/PhysRevA.65.032121","volume":"65","author":"S. Massar","year":"2002","unstructured":"Massar, S.: Nonlocality, closing the detection loophole, and communication complexity. Physical Review A\u00a065, 032121 (2002)","journal-title":"Physical Review A"},{"key":"1_CR41","unstructured":"Mayers, D.: Unconditional security in quantum cryptography February 10 (1998); quant-ph\/9802025"},{"key":"1_CR42","doi-asserted-by":"publisher","first-page":"3414","DOI":"10.1103\/PhysRevLett.78.3414","volume":"78","author":"D. Mayers","year":"1997","unstructured":"Mayers, D.: Unconditionally secure quantum bit commitment is impossible. Physical Review Letters\u00a078, 3414\u20133417 (1997)","journal-title":"Physical Review Letters"},{"key":"1_CR43","unstructured":"Mayers, D., Salvail, L., Chiba-Kohno, Y.: Unconditionally secure quantum coin tossing April 22 (1999); quant-ph\/9904078"},{"key":"1_CR44","doi-asserted-by":"crossref","unstructured":"Mehlhorn, K., Schmidt, E.M.: 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, San Francisco, California, pp. 330\u2013337, May 5-7 (1982)","DOI":"10.1145\/800070.802208"},{"issue":"2","key":"1_CR45","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0020-0190(91)90157-D","volume":"39","author":"I. Newman","year":"1991","unstructured":"Newman, I.: Private vs. common random bits in communication complexity. Information Processing Letters\u00a039(2), 67\u201371 (1991)","journal-title":"Information Processing Letters"},{"key":"1_CR46","volume-title":"Quantum Computation and Quantum Information","author":"M.A. Nielsen","year":"2000","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"key":"1_CR47","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/BF01192527","volume":"15","author":"N. Nisan","year":"1995","unstructured":"Nisan, N., Wigderson, A.: On rank vs. communication complexity. Combinatorica\u00a015, 557\u2013566 (1995); Earlier version in FOCS 1994","journal-title":"Combinatorica"},{"key":"1_CR48","doi-asserted-by":"crossref","unstructured":"Raz, R.: Exponential separation of quantum and classical communication complexity. In: Proceedings of 31th STOC, pp. 358-367 (1999)","DOI":"10.1145\/301250.301343"},{"issue":"1","key":"1_CR49","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1070\/IM2003v067n01ABEH000422","volume":"67","author":"A.A. Razborov","year":"2003","unstructured":"Razborov, A.A.: Quantum communication complexity of symmetric predicates. Izv. Math.\u00a067(1), 145\u2013159 (2003)","journal-title":"Izv. Math."},{"issue":"2","key":"1_CR50","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1137\/0402020","volume":"2","author":"M. Saks","year":"1989","unstructured":"Saks, M.: A robust noncryptographic protocol for collective coin flipping. SIAM J. Discrete Math.\u00a02(2), 240\u2013244 (1989)","journal-title":"SIAM J. Discrete Math."},{"key":"1_CR51","doi-asserted-by":"crossref","unstructured":"Spekkens, R., Rudolph, T.: A quantum protocol for cheat-sensitive weak coin flipping (2002); quant-ph\/0202118","DOI":"10.1103\/PhysRevLett.89.227901"},{"issue":"5886","key":"1_CR52","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1038\/299802a0","volume":"299","author":"W.K. Wootters","year":"1982","unstructured":"Wootters, W.K., Zurek, W.H.: A single quantum cannot be cloned. Nature\u00a0299(5886), 802\u2013803 (1982)","journal-title":"Nature"},{"key":"1_CR53","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Some complexity questions related to distributive computing. In: Proceedings of 11th STOC, pp. 209\u2013213 (1979)","DOI":"10.1145\/800135.804414"},{"key":"1_CR54","unstructured":"Yao, A.C.-C.: Quantum circuit complexity. In: Proceedings of 34th FOCS, pp. 352\u2013360 (1993)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45138-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T05:54:19Z","timestamp":1559195659000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45138-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540406716","9783540451389"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45138-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}