{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:31Z","timestamp":1759638271553},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157622"},{"type":"electronic","value":"9783642157639"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15763-9_24","type":"book-chapter","created":{"date-parts":[[2010,8,24]],"date-time":"2010-08-24T09:48:44Z","timestamp":1282643324000},"page":"236-250","source":"Crossref","is-referenced-by-count":4,"title":["Scalable Quantum Consensus for Crash Failures"],"prefix":"10.1007","author":[{"given":"Bogdan S.","family":"Chlebus","sequence":"first","affiliation":[]},{"given":"Dariusz R.","family":"Kowalski","sequence":"additional","affiliation":[]},{"given":"Micha\u0142","family":"Strojnowski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"24_CR1","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1137\/S0097539799359385","volume":"38","author":"D. Aharonov","year":"2008","unstructured":"Aharonov, D., Ben-Or, M.: Fault-tolerant quantum computation with constant error rate. SIAM Journal on Computing\u00a038(4), 1207\u20131282 (2008)","journal-title":"SIAM Journal on Computing"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Bar-Joseph, Z., Ben-Or, M.: A tight lower bound for randomized synchronous consensus. In: Proceedings of the 17th ACM Symposium on Principles of Distributed Computing (PODC), pp. 193\u2013199 (1998)","DOI":"10.1145\/277697.277733"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Hassidim, A.: Fast quantum Byzantine agreement. In: Proceedings of the 37th ACM Symposium on Theory of Computing (STOC), pp. 481\u2013485 (2005)","DOI":"10.1145\/1060590.1060662"},{"issue":"20","key":"24_CR4","doi-asserted-by":"publisher","first-page":"2881","DOI":"10.1103\/PhysRevLett.69.2881","volume":"69","author":"C.H. Bennett","year":"1992","unstructured":"Bennett, C.H., Wiesner, S.J.: Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states. Physical Review Letters\u00a069(20), 2881\u20132884 (1992)","journal-title":"Physical Review Letters"},{"issue":"3","key":"24_CR5","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/1412700.1412717","volume":"39","author":"A. Broadbent","year":"2008","unstructured":"Broadbent, A., Tapp, A.: Can quantum mechanics help distributed computing? SIGACT News\u00a039(3), 67\u201376 (2008)","journal-title":"SIGACT News"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-45138-9_1","volume-title":"Mathematical Foundations of Computer Science 2003","author":"H. Buhrman","year":"2003","unstructured":"Buhrman, H., R\u00f6hrig, H.: Distributed quantum computing. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 1\u201320. Springer, Heidelberg (2003)"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/11864219_22","volume-title":"Distributed Computing","author":"B.S. Chlebus","year":"2006","unstructured":"Chlebus, B.S., Kowalski, D.R.: Time and communication efficient consensus for crash failures. In: Dolev, S. (ed.) DISC 2006. LNCS, vol.\u00a04167, pp. 314\u2013328. Springer, Heidelberg (2006)"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Chlebus, B.S., Kowalski, D.R.: Locally scalable randomized consensus for synchronous crash failures. In: Proceedings of the 21st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 290\u2013299 (2009)","DOI":"10.1145\/1583991.1584063"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Chlebus, B.S., Kowalski, D.R., Strojnowski, M.: Fast scalable deterministic consensus for crash failures. In: Proceedings of the 28th ACM Symposium on Principles of Distributed Computing (PODC), pp. 111\u2013120 (2009)","DOI":"10.1145\/1582716.1582738"},{"issue":"3","key":"24_CR10","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1145\/65950.65956","volume":"36","author":"B. Chor","year":"1989","unstructured":"Chor, B., Merritt, M., Shmoys, D.B.: Simple constant-time consensus protocols in realistic failure models. Journal of the ACM\u00a036(3), 591\u2013614 (1989)","journal-title":"Journal of the ACM"},{"issue":"2","key":"24_CR11","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. Physical Review A\u00a056(2), 1201\u20131204 (1997)","journal-title":"Physical Review A"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-49208-9_4","volume-title":"Quantum Computing and Quantum Communications","author":"R. Cleve","year":"1999","unstructured":"Cleve, R., van Dam, W., Nielsen, M., Tapp, A.: Quantum entanglement and the communication complexity of the inner product function. In: Williams, C.P. (ed.) QCQC 1998. LNCS, vol.\u00a01509, pp. 61\u201374. Springer, Heidelberg (1999)"},{"issue":"1","key":"24_CR13","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/S0304-3975(02)00377-8","volume":"287","author":"R. Wolf de","year":"2002","unstructured":"de Wolf, R.: Quantum communication and complexity. Theoretical Computer Science\u00a0287(1), 337\u2013353 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"24_CR14","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/1412700.1412718","volume":"39","author":"V.S. Denchev","year":"2008","unstructured":"Denchev, V.S., Pandurangan, G.: Distributed quantum computing: a new frontier in distributed systems or science fiction? SIGACT News\u00a039(3), 77\u201395 (2008)","journal-title":"SIGACT News"},{"issue":"1","key":"24_CR15","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1145\/2455.214112","volume":"32","author":"D. Dolev","year":"1985","unstructured":"Dolev, D., Reischuk, R.: Bounds on information exchange for Byzantine agreement. Journal of the ACM\u00a032(1), 191\u2013204 (1985)","journal-title":"Journal of the ACM"},{"key":"24_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-642-04355-0_26","volume-title":"Distributed Computing","author":"C. Gavoille","year":"2009","unstructured":"Gavoille, C., Kosowski, A., Markiewicz, M.: What can be observed locally? Round-based models for quantum distributed computing. In: Keidar, I. (ed.) DISC 2009. LNCS, vol.\u00a05805, pp. 243\u2013257. Springer, Heidelberg (2009)"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Gilbert, S., Kowalski, D.R.: Distributed agreement with optimal communication complexity. In: Proceedings of the 21st ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 965\u2013977 (2010)","DOI":"10.1137\/1.9781611973075.78"},{"issue":"1","key":"24_CR18","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF01187074","volume":"26","author":"V. Hadzilacos","year":"1993","unstructured":"Hadzilacos, V., Halpern, J.Y.: Message-optimal protocols for Byzantine agreement. Mathematical Systems Theory\u00a026(1), 41\u2013102 (1993)","journal-title":"Mathematical Systems Theory"},{"issue":"3","key":"24_CR19","first-page":"177","volume":"9","author":"A.S. Holevo","year":"1973","unstructured":"Holevo, A.S.: Bounds for the quantity of information transmitted by a quantum communication channel. Problems of Information Transmission\u00a09(3), 177\u2013183 (1973)","journal-title":"Problems of Information Transmission"},{"issue":"4","key":"24_CR20","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s00446-008-0069-x","volume":"21","author":"D. Holtby","year":"2008","unstructured":"Holtby, D., Kapron, B.M., King, V.: Lower bound for scalable Byzantine agreement. Distributed Computing\u00a021(4), 239\u2013248 (2008)","journal-title":"Distributed Computing"},{"key":"24_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/978-3-642-04355-0_47","volume-title":"Distributed Computing","author":"V. King","year":"2009","unstructured":"King, V., Saia, J.: From almost everywhere to everywhere: Byzantine agreement with \n                    \n                      \n                    \n                    $\\tilde{O}(n^{3\/2})$\n                   bits. In: Keidar, I. (ed.) DISC 2009. LNCS, vol.\u00a05805, pp. 464\u2013478. Springer, Heidelberg (2009)"},{"key":"24_CR22","doi-asserted-by":"crossref","unstructured":"King, V., Saia, J., Sanwalani, V., Vee, E.: Towards secure and scalable computation in peer-to-peer networks. In: Proceedings of the 47th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 87\u201398 (2006)","DOI":"10.1109\/FOCS.2006.77"},{"key":"24_CR23","unstructured":"Kobayashi, H., Matsumoto, K., Tani, S.: Fast exact quantum leader election on anonymous rings. In: Proceedings of the 8th Asian Conference on Quantum Information Science (AQIS), pp. 157\u2013158 (2008)"},{"key":"24_CR24","doi-asserted-by":"crossref","unstructured":"Linial, N.: Distributive graph algorithms - global solutions from local data. In: Proceedings of the 28th Symposium on Foundations of Computer Science (FOCS), pp. 331\u2013335 (1987)","DOI":"10.1109\/SFCS.1987.20"},{"key":"24_CR25","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)"},{"issue":"3","key":"24_CR26","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/333623.333628","volume":"30","author":"A. Ta-Shma","year":"1999","unstructured":"Ta-Shma, A.: Classical versus quantum communication complexity. SIGACT News\u00a030(3), 25\u201334 (1999)","journal-title":"SIGACT News"},{"issue":"2","key":"24_CR27","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s00493-007-0053-2","volume":"27","author":"A. Ta-Shma","year":"2007","unstructured":"Ta-Shma, A., Umans, C., Zuckerman, D.: Lossless condensers, unbalanced expanders, and extractors. Combinatorica\u00a027(2), 213\u2013240 (2007)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15763-9_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T13:05:14Z","timestamp":1619787914000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15763-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157622","9783642157639"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15763-9_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}