{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T17:40:36Z","timestamp":1737394836470,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734192"},{"type":"electronic","value":"9783540734208"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73420-8_13","type":"book-chapter","created":{"date-parts":[[2007,8,25]],"date-time":"2007-08-25T14:58:43Z","timestamp":1188053923000},"page":"122-133","source":"Crossref","is-referenced-by-count":2,"title":["A Lower Bound on Entanglement-Assisted Quantum Communication Complexity"],"prefix":"10.1007","author":[{"given":"Ashley","family":"Montanaro","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Winter","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.4086\/toc.2005.v001a004","volume":"1","author":"S. Aaronson","year":"2005","unstructured":"Aaronson, S., Ambainis, A.: Quantum search of spatial regions. Theory of Computing\u00a01, 47\u201379 (2005) quant-ph\/0303041","journal-title":"Theory of Computing"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"1570","DOI":"10.1137\/S009753979935476","volume":"32","author":"A. Ambainis","year":"2003","unstructured":"Ambainis, A., Schulman, L.J., Ta-Shma, A., Vazirani, U., Wigderson, A.: The quantum communication complexity of sampling. SIAM J. Comput.\u00a032, 1570\u20131585 (2003)","journal-title":"SIAM J. Comput."},{"key":"13_CR3","series-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization","doi-asserted-by":"crossref","DOI":"10.1002\/0471722154","volume-title":"The probabilistic method","author":"N. Alon","year":"2000","unstructured":"Alon, N., Spencer, J.: The probabilistic method. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, New York (2000)"},{"key":"13_CR4","unstructured":"Buhrman, H., deWolf, R.: Communication complexity lower bounds by polynomials. In: Proc. CCC 2001, pp. 120\u2013130 (2001) cs.CC\/9910010"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Cleve, R., van Dam, W., Nielsen, M., Tapp, A.: Quantum entanglement and the communication complexity of the inner product function. In: Selected papers from the First NASA International Conference on Quantum Computing and Quantum Communications, pp.61\u201374, February 17-20 (1998) quant-ph\/9708019","DOI":"10.1007\/3-540-49208-9_4"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/BF01646490","volume":"31","author":"M. Fannes","year":"1973","unstructured":"Fannes, M.: A continuity property of the entropy density for spin lattice systems. Commun. Math. Phys.\u00a031, 291\u2013294 (1973)","journal-title":"Commun. Math. Phys."},{"key":"13_CR7","unstructured":"van Dam, W., Hayden, P.: Renyi-entropic bounds on quantum communication (2002) quant-ph\/0204093"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Gavinsky, D., Kempe, J., de Wolf, R.: Strengths and weaknesses of quantum fingerprinting. In: Proc. CCC 2006, pp. 288\u2013298 (2006) quant-ph\/0603173","DOI":"10.1109\/CCC.2006.39"},{"issue":"3","key":"13_CR9","doi-asserted-by":"publisher","first-page":"1869","DOI":"10.1103\/PhysRevA.54.1869","volume":"54","author":"P. Hausladen","year":"1996","unstructured":"Hausladen, P., Jozsa, R., Schumacher, B., Westmoreland, M., Wootters, W.: Classical information capacity of a quantum channel. Phys. Rev. A\u00a054(3), 1869\u20131876 (1996)","journal-title":"Phys. Rev. A"},{"key":"13_CR10","unstructured":"Holevo, A.S.: Bounds for the quantity of information transmittable by a quantum communications channel. Problemy Peredachi Informatsii 9(3), 3\u201311 (1973) English translation Problems of Information Transmission 9, 177\u2013183 (1973)"},{"key":"13_CR11","volume-title":"Matrix analysis","author":"R.A. Horn","year":"1996","unstructured":"Horn, R.A., Johnson, C.: Matrix analysis. Cambridge University Press, Cambridge (1996)"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Jozsa, R., Schlienz, J.: Distinguishability of states and von Neumann entropy. Phys. Rev. A 62 012301 (2000) quant-ph\/9911009","DOI":"10.1103\/PhysRevA.62.012301"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Klauck, H.: Lower bounds for quantum communication complexity. In: Proc. FOCS 2001, pp. 288\u2013297 (2001) quant-ph\/0106160","DOI":"10.1109\/SFCS.2001.959903"},{"key":"13_CR14","unstructured":"Kremer, I.: Quantum communication. Master\u2019s thesis, Hebrew University (1995)"},{"key":"13_CR15","volume-title":"Communication complexity","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication complexity. Cambridge University Press, Cambridge (1997)"},{"key":"13_CR16","unstructured":"Linial, N., Shraibman, A.: Learning complexity vs. communication complexity. Manuscript (2006), http:\/\/www.cs.huji.ac.il\/~nati\/PAPERS\/lcc.pdf"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Linial, N., Shraibman, A.: Lower bounds in communication complexity based on factorization norms. In: Proc. STOC 2007 (to appear, 2007), http:\/\/www.cs.huji.ac.il\/~nati\/PAPERS\/quantcc.pdf","DOI":"10.1145\/1250790.1250892"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Nayak, A., Salzman, J.: On communication over an entanglement-assisted quantum channel. In: Proc. STOC 2002, pp. 698\u2013704 (2002) quant-ph\/0206122","DOI":"10.1145\/509907.510007"},{"key":"13_CR19","unstructured":"Nielsen, M.A.: Quantum information theory. PhD thesis, University of New Mexico, Albuquerque (1998) quant-ph\/0011036"},{"key":"13_CR20","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":"13_CR21","doi-asserted-by":"crossref","unstructured":"Raz, R.: Exponential separation of quantum and classical communication complexity, In: Proc. STOC 1999, pp. 358\u2013367 (1999)","DOI":"10.1145\/301250.301343"},{"key":"13_CR22","first-page":"159","volume":"67","author":"A.A. Razborov","year":"2003","unstructured":"Razborov, A.A.: Quantum communication complexity of symmetric predicates. Izvestiya of the Russian Academy of Science\u00a067, 159\u2013176 (2003) quant-ph\/ 0204025","journal-title":"Izvestiya of the Russian Academy of Science"},{"key":"13_CR23","volume-title":"Probability theory","author":"A. R\u00e9nyi","year":"1970","unstructured":"R\u00e9nyi, A.: Probability theory. North-Holland, Amsterdam (1970)"},{"issue":"1","key":"13_CR24","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"},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Yao, A.: Some complexity questions related to distributive computing. In: Proc. STOC 1979, pp. 209\u2013213 (1979)","DOI":"10.1145\/800135.804414"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73420-8_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T17:15:02Z","timestamp":1737393302000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73420-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734192","9783540734208"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73420-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}