{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:19:01Z","timestamp":1726409941984},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540792277"},{"type":"electronic","value":"9783540792284"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79228-4_46","type":"book-chapter","created":{"date-parts":[[2008,4,29]],"date-time":"2008-04-29T05:07:56Z","timestamp":1209445676000},"page":"526-541","source":"Crossref","is-referenced-by-count":0,"title":["A Separation between Divergence and Holevo Information for Ensembles"],"prefix":"10.1007","author":[{"given":"Rahul","family":"Jain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashwin","family":"Nayak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"46_CR1","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1109\/SFCS.2002.1181967","volume-title":"Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science","author":"R. Jain","year":"2002","unstructured":"Jain, R., Radhakrishnan, J., Sen, P.: Privacy and interaction in quantum communication complexity and a theorem about the relative entropy of quantum states. In: Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002, pp. 429\u2013438. IEEE Computer Society Press, Los Alamitos (2002) (A more complete version appears as In: [2])"},{"key":"46_CR2","unstructured":"Jain, R., Radhakrishnan, J., Sen, P.: A theorem about relative entropy of quantum states with an application to privacy in quantum communication. Technical Report arXiv:0705.2437v1, ArXiv.org Preprint Archive (2007), http:\/\/www.arxiv.org\/"},{"key":"46_CR3","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":"46_CR4","series-title":"Wiley Series in Telecommunications","doi-asserted-by":"crossref","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T.M. Cover","year":"1991","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley Series in Telecommunications. John Wiley & Sons, New York, NY, USA (1991)"},{"key":"46_CR5","first-page":"285","volume-title":"Proceedings of the 20th Annual IEEE Conference on Computational Complexity","author":"R. Jain","year":"2005","unstructured":"Jain, R., Radhakrishnan, J., Sen, P.: Prior entanglement, message compression and privacy in quantum communication. In: Proceedings of the 20th Annual IEEE Conference on Computational Complexity, 2005, pp. 285\u2013296. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"46_CR6","unstructured":"Jain, R.: Stronger impossibility results for quantum string commitment. Technical Report arXiv:quant-ph\/0506001v4, ArXiv.org Preprint Archive (2005), http:\/\/www.arxiv.org\/"},{"key":"46_CR7","doi-asserted-by":"crossref","first-page":"461","DOI":"10.26421\/QIC6.4-5-11","volume":"6","author":"R. Jain","year":"2006","unstructured":"Jain, R.: Communication complexity of remote state preparation with entanglement. Quantum Information and Computation\u00a06, 461\u2013464 (2006)","journal-title":"Quantum Information and Computation"},{"key":"46_CR8","doi-asserted-by":"crossref","unstructured":"Buhrman, H., Christandl, M., Hayden, P., Lo, H.-K., Wehner, S.: Security of quantum bit string commitment depends on the information measure. Physical Review Letters\u00a097 (2006) (Article no.\u00a0250501)","DOI":"10.1103\/PhysRevLett.97.250501"},{"issue":"17","key":"46_CR9","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(17), 3414\u20133417 (1997)","journal-title":"Physical Review Letters"},{"key":"46_CR10","doi-asserted-by":"publisher","first-page":"3410","DOI":"10.1103\/PhysRevLett.78.3410","volume":"78","author":"H.-K. Lo","year":"1997","unstructured":"Lo, H.-K., Chau, H.F.: Is quantum bit commitment really possible? Physical Review Letters\u00a078, 3410\u20133413 (1997)","journal-title":"Physical Review Letters"},{"key":"46_CR11","doi-asserted-by":"crossref","unstructured":"Kent, A.: Quantum bit string commitment (Article no.\u00a0237901). Physical Review Letters\u00a090 (2003) (Article no.\u00a0237901)","DOI":"10.1103\/PhysRevLett.90.237901"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79228-4_46.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,9]],"date-time":"2021-09-09T03:03:33Z","timestamp":1631156613000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79228-4_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540792277","9783540792284"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79228-4_46","relation":{},"subject":[]}}