{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T17:02:56Z","timestamp":1771952576055,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100008398","name":"Villum Fonden","doi-asserted-by":"publisher","award":["37532"],"award-info":[{"award-number":["37532"]}],"id":[{"id":"10.13039\/100008398","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s11128-022-03470-4","type":"journal-article","created":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T07:07:00Z","timestamp":1649056020000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["The geometry of Bloch space in the context of quantum random access codes"],"prefix":"10.1007","volume":"21","author":[{"given":"Laura","family":"Man\u010dinska","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1405-3931","authenticated-orcid":false,"given":"Sigurd A. L.","family":"Storgaard","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,4]]},"reference":[{"key":"3470_CR1","unstructured":"Ambainis, A., Leung, D., Mancinska, L., Ozols, M.: \u2018Quantum random access codes with shared randomness\u2019, (2008), arXiv:0810.2937"},{"key":"3470_CR2","doi-asserted-by":"publisher","unstructured":"Ambainis, A., Nayak, A., Ta-Shma, A., Vazirani, U.: \u2018Dense quantum coding and a lower bound for 1-way quantum automata\u2019. In Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, STOC \u201999, pp 376\u2013383, New York, NY, USA, 1999. Association for Computing Machinery. https:\/\/doi.org\/10.1145\/301250.301347","DOI":"10.1145\/301250.301347"},{"issue":"4","key":"3470_CR3","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1145\/581771.581773","volume":"49","author":"A Ambainis","year":"2002","unstructured":"Ambainis, A., Nayak, A., Ta-Shma, A., Vazirani, U.: Dense quantum coding and quantum finite automata. J. ACM 49(4), 496\u2013511 (2002). https:\/\/doi.org\/10.1145\/581771.581773","journal-title":"J. ACM"},{"key":"3470_CR4","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-0348-0448-6_15","volume-title":"Geometric Methods in Physics","author":"I Bengtsson","year":"2013","unstructured":"Bengtsson, I., Weis, S., \u017byczkowski, K.: Geometry of the set of mixed quantum States: An apophatic approach. In: Kielanowski, P., Ali, S.T., Odzijewicz, A., Schlichenmaier, M., Voronov, T. (eds.) Geometric Methods in Physics, pp. 175\u2013197. Springer Basel, Basel (2013)"},{"key":"3470_CR5","unstructured":"Brassard, G.: \u2018Brief history of quantum cryptography: A personal perspective\u2019, 2006, arXiv:quant-ph\/0604072"},{"key":"3470_CR6","doi-asserted-by":"publisher","unstructured":"Hayashi, M., Iwama, K., Nishimura, H., Raymond, R., Yamashita, S.: \u2018(4,1)-Quantum random access coding does not exist\u2019. In 2006 IEEE International Symposium on Information Theory, pp 446\u2013450, 2006. https:\/\/doi.org\/10.1109\/ISIT.2006.261708","DOI":"10.1109\/ISIT.2006.261708"},{"issue":"4","key":"3470_CR7","first-page":"177","volume":"9","author":"AS Holevo","year":"1973","unstructured":"Holevo, A.S.: Bounds for the quantity of information transmitted by a quantum communication channel. Probl. Peredachi Inf. 9(4), 177\u2013183 (1973)","journal-title":"Probl. Peredachi Inf."},{"key":"3470_CR8","unstructured":"Imamichi, T., Raymond, R.: \u2018Constructions of quantum random access codes\u2019. Asian Quantum Information Symposium (AQIS), 2018. http:\/\/www.ngc.is.ritsumei.ac.jp\/~ger\/static\/AQIS18\/OnlineBooklet\/122"},{"key":"3470_CR9","doi-asserted-by":"crossref","unstructured":"Iwama, K., Nishimura, H., Raymond, R., Yamashita, S.: \u2018Unbounded-error one-way classical and quantum communication complexity. In L.\u00a0Arge, C.\u00a0Cachin, T.\u00a0Jurdzi\u0144ski, and A.\u00a0Tarlecki, editors, Automata, Languages and Programming, pp 110\u2013121, Berlin, Heidelberg, 2007. Springer Berlin Heidelberg","DOI":"10.1007\/978-3-540-73420-8_12"},{"key":"3470_CR10","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s11080-005-0919-y","volume":"12","author":"G Kimura","year":"2005","unstructured":"Kimura, G., Kossakowski, A.: \u2018The Bloch-Vector Space for N-Level systems - the spherical-coordinate point of view. Open Syst Inf Dyn 12, 207\u2013229 (2005). arXiv:quant-ph\/0408014","journal-title":"Open Syst Inf Dyn"},{"issue":"5","key":"3470_CR11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.95.052315","volume":"95","author":"O Liab\u00f8tr\u00f8","year":"2017","unstructured":"Liab\u00f8tr\u00f8, O.: Improved classical and quantum random access codes. Phys. Rev. A 95(5), 052315 (2017). https:\/\/doi.org\/10.1103\/PhysRevA.95.052315","journal-title":"Phys. Rev. A"},{"key":"3470_CR12","doi-asserted-by":"crossref","unstructured":"Nayak, A.: Optimal lower bounds for quantum automata and random access codes. In 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039), pp 369\u2013376, 1999. 10.1109\/SFFCS.1999.814608","DOI":"10.1109\/SFFCS.1999.814608"},{"issue":"1","key":"3470_CR13","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/1008908.1008920","volume":"15","author":"S Wiesner","year":"1983","unstructured":"Wiesner, S.: Conjugate coding. SIGACT News 15(1), 78\u201388 (1983). https:\/\/doi.org\/10.1145\/1008908.1008920","journal-title":"Conjugate coding. SIGACT News"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-022-03470-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-022-03470-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-022-03470-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,21]],"date-time":"2024-09-21T14:44:29Z","timestamp":1726929869000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-022-03470-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["3470"],"URL":"https:\/\/doi.org\/10.1007\/s11128-022-03470-4","relation":{},"ISSN":["1573-1332"],"issn-type":[{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4]]},"assertion":[{"value":"5 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 February 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"143"}}