{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:29:29Z","timestamp":1759336169139,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662444641"},{"type":"electronic","value":"9783662444658"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44465-8_38","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T10:33:02Z","timestamp":1407839582000},"page":"445-456","source":"Crossref","is-referenced-by-count":6,"title":["Two Results about Quantum Messages"],"prefix":"10.1007","author":[{"given":"Hartmut","family":"Klauck","sequence":"first","affiliation":[]},{"given":"Supartha","family":"Podder","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Aaronson, S.: Limitations of quantum advice and one-way communication. Theory of Computing\u00a01, 1-28 (2005)","key":"#cr-split#-38_CR1.1"},{"unstructured":"Earlier version in Complexity 2004 (2004), quant-ph\/0402095","key":"#cr-split#-38_CR1.2"},{"doi-asserted-by":"crossref","unstructured":"Aaronson, S.: The learnability of quantum states. Proceedings of the Royal Society of London A463(2088) (2007), quant-ph\/0608142","key":"38_CR2","DOI":"10.1098\/rspa.2007.0113"},{"issue":"1","key":"38_CR3","doi-asserted-by":"crossref","first-page":"129","DOI":"10.4086\/toc.2007.v003a007","volume":"3","author":"S. Aaronson","year":"2007","unstructured":"Aaronson, S., Kuperberg, G.: Quantum versus classical proofs and advice. Theory of Computing\u00a03(1), 129\u2013157 (2007)","journal-title":"Theory of Computing"},{"unstructured":"Aharonov, D., Naveh, T.: Quantum NP - a survey (2002), quant-ph\/0210077","key":"38_CR4"},{"doi-asserted-by":"crossref","unstructured":"Ambainis, A., Nayak, A., Ta-Shma, A., Vazirani, U.: Dense quantum coding and a lower bound for 1-way quantum automata. In: Proceedings of 31st ACM STOC, pp. 697\u2013704 (1999)","key":"38_CR5","DOI":"10.1145\/301250.301347"},{"key":"38_CR6","doi-asserted-by":"crossref","first-page":"2816","DOI":"10.1109\/TIT.2009.2018325","volume":"55","author":"N. Datta","year":"2009","unstructured":"Datta, N.: Min- and max- relative entropies and a new entanglement monotone. IEEE Transactions on Information Theory\u00a055, 2816\u20132826 (2009)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"38_CR7","doi-asserted-by":"crossref","first-page":"1695","DOI":"10.1137\/070706550","volume":"38","author":"D. Gavinsky","year":"2008","unstructured":"Gavinsky, D., Kempe, J., Kerenidis, I., Raz, R., de Wolf, R.: Exponential separation for one-way quantum communication complexity, with applications to cryptography. SIAM J. Comput.\u00a038(5), 1695\u20131708 (2008)","journal-title":"SIAM J. Comput."},{"unstructured":"Gavinsky, D., Klauck, H.: Equality, Revisited. Manuscript (2014)","key":"38_CR8"},{"unstructured":"Gavinsky, D., Regev, O., de Wolf, R.: Simultaneous Communication Protocols with Quantum and Classical Messages. Chicago Journal of Theoretical Computer Science\u00a07 (2008)","key":"38_CR9"},{"key":"38_CR10","doi-asserted-by":"crossref","first-page":"99","DOI":"10.2140\/pjm.1981.96.99","volume":"96","author":"F. Hiai","year":"1981","unstructured":"Hiai, F., Ohya, M., Tsukada, M.: Sufficiency, KMS condition and relative entropy in von Neumann algebras. Pacific J. Math.\u00a096, 99\u2013109 (1981)","journal-title":"Pacific J. Math."},{"doi-asserted-by":"crossref","unstructured":"Jain, R., Ji, Z., Upadhyay, S., Watrous, J.: QIP = PSPACE. J. ACM\u00a058(6) (2011)","key":"38_CR11","DOI":"10.1145\/2049697.2049704"},{"issue":"26","key":"38_CR12","doi-asserted-by":"crossref","first-page":"2463","DOI":"10.1016\/j.tcs.2008.10.014","volume":"410","author":"R. Jain","year":"2009","unstructured":"Jain, R., Zhang, S.: New bounds on classical and quantum one-way communication complexity. Theoretical Computer Science\u00a0410(26), 2463\u20132477 (2009)","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Klauck, H.: On quantum and probabilistic communication: Las Vegas and one-way protocols. In: Proceedings of 32nd ACM STOC, pp. 644\u2013651 (2000)","key":"38_CR13","DOI":"10.1145\/335305.335396"},{"doi-asserted-by":"crossref","unstructured":"Klauck, H.: On Arthur Merlin Games in Communication Complexity. In: IEEE Conference on Computational Complexity, pp. 189\u2013199 (2011)","key":"38_CR14","DOI":"10.1109\/CCC.2011.33"},{"issue":"6","key":"38_CR15","doi-asserted-by":"crossref","first-page":"1970","DOI":"10.1109\/TIT.2007.896888","volume":"53","author":"H. Klauck","year":"2007","unstructured":"Klauck, H., Nayak, A., Ta-Shma, A., Zuckerman, D.: Interaction in Quantum Communication. IEEE Transactions on Information Theory\u00a053(6), 1970\u20131982 (2007)","journal-title":"IEEE Transactions on Information Theory"},{"doi-asserted-by":"crossref","unstructured":"Klauck, H., Podder, S.: Two Results about Quantum Messages (Full Version). arXiv:1402.4312 (2014)","key":"38_CR16","DOI":"10.1007\/978-3-662-44465-8_38"},{"doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press (1997)","key":"38_CR17","DOI":"10.1017\/CBO9780511574948"},{"doi-asserted-by":"crossref","unstructured":"Nayak, A.: Optimal lower bounds for quantum automata and random access codes. In: Proceedings of 40th IEEE FOCS, pp. 369\u2013376 (1999), quant-ph\/9904093","key":"38_CR18","DOI":"10.1109\/SFFCS.1999.814608"},{"unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press (2000)","key":"38_CR19"},{"unstructured":"Raz, R., Shpilka, A.: On the power of quantum proofs. In: Proceedings of Computational Complexity, pp. 260\u2013274 (2004)","key":"38_CR20"},{"key":"38_CR21","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0097-3165(72)90019-2","volume":"13","author":"N. Sauer","year":"1972","unstructured":"Sauer, N.: On the density of families of sets. J. Combin. Theory Ser. A\u00a013, 145\u2013147 (1972)","journal-title":"J. Combin. Theory Ser. A"},{"doi-asserted-by":"crossref","unstructured":"Watrous, J.: Succinct quantum proofs for properties of finite groups. In: Proceedings of 41st IEEE FOCS, pp. 537\u2013546 (2000), quant-ph\/0011023","key":"38_CR22","DOI":"10.1109\/SFCS.2000.892141"},{"unstructured":"Winter, A.: Quantum and classical message identification via quantum channels. In: Festschrift A.S. Holevo 60, pp. 171\u2013188 (2004)","key":"38_CR23"},{"issue":"1","key":"38_CR24","doi-asserted-by":"crossref","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"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44465-8_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:30:23Z","timestamp":1746333023000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44465-8_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662444641","9783662444658"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44465-8_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}