{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T16:43:19Z","timestamp":1764002599214,"version":"3.40.5"},"reference-count":26,"publisher":"Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften","license":[{"start":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T00:00:00Z","timestamp":1673568000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["quantum-journal.org"],"crossmark-restriction":false},"short-container-title":["Quantum"],"abstract":"<jats:p>We propose a protocol to encode classical bits in the measurement statistics of many-body Pauli observables, leveraging quantum correlations for a random access code. Measurement contexts built with these observables yield outcomes with intrinsic redundancy, something we exploit by encoding the data into a set of convenient context eigenstates. This allows to randomly access the encoded data with few resources. The eigenstates used are highly entangled and can be generated by a discretely-parametrized quantum circuit of low depth. Applications of this protocol include algorithms requiring large-data storage with only partial retrieval, as is the case of decision trees. Using <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>n<\/mml:mi><\/mml:math>-qubit states, this Quantum Random Access Code has greater success probability than its classical counterpart for <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>n<\/mml:mi><mml:mo>&amp;#x2265;<\/mml:mo><mml:mn>14<\/mml:mn><\/mml:math> and than previous Quantum Random Access Codes for <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>n<\/mml:mi><mml:mo>&amp;#x2265;<\/mml:mo><mml:mn>16<\/mml:mn><\/mml:math>. Furthermore, for <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>n<\/mml:mi><mml:mo>&amp;#x2265;<\/mml:mo><mml:mn>18<\/mml:mn><\/mml:math>, it can be amplified into a nearly-lossless compression protocol with success probability <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mn>0.999<\/mml:mn><\/mml:math> and compression ratio <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>O<\/mml:mi><mml:mo stretchy=\"false\">(<\/mml:mo><mml:msup><mml:mi>n<\/mml:mi><mml:mn>2<\/mml:mn><\/mml:msup><mml:mrow class=\"MJX-TeXAtom-ORD\"><mml:mo>\/<\/mml:mo><\/mml:mrow><mml:msup><mml:mn>2<\/mml:mn><mml:mi>n<\/mml:mi><\/mml:msup><mml:mo stretchy=\"false\">)<\/mml:mo><\/mml:math>. The data it can store is equal to Google-Drive server capacity for <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>n<\/mml:mi><mml:mo>=<\/mml:mo><mml:mn>44<\/mml:mn><\/mml:math>, and to a brute-force solution for chess (what to do on any board configuration) for <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>n<\/mml:mi><mml:mo>=<\/mml:mo><mml:mn>100<\/mml:mn><\/mml:math>.<\/jats:p>","DOI":"10.22331\/q-2023-01-13-895","type":"journal-article","created":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T11:31:57Z","timestamp":1673609517000},"page":"895","update-policy":"https:\/\/doi.org\/10.22331\/q-crossmark-policy-page","source":"Crossref","is-referenced-by-count":1,"title":["Random access codes via quantum contextual redundancy"],"prefix":"10.22331","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5867-3537","authenticated-orcid":false,"given":"Giancarlo","family":"Gatti","sequence":"first","affiliation":[{"name":"Department of Physical Chemistry, University of the Basque Country UPV\/EHU, Apartado 644, 48080 Bilbao, Spain"},{"name":"EHU Quantum Center, University of the Basque Country UPV\/EHU"},{"name":"Quantum MADS, Uribitarte Kalea 6, 48001 Bilbao, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3210-2370","authenticated-orcid":false,"given":"Daniel","family":"Huerga","sequence":"additional","affiliation":[{"name":"Department of Physical Chemistry, University of the Basque Country UPV\/EHU, Apartado 644, 48080 Bilbao, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8602-1181","authenticated-orcid":false,"given":"Enrique","family":"Solano","sequence":"additional","affiliation":[{"name":"Department of Physical Chemistry, University of the Basque Country UPV\/EHU, Apartado 644, 48080 Bilbao, Spain"},{"name":"International Center of Quantum Artificial Intelligence for Science and Technology (QuArtist) and Department of Physics, Shanghai University, 200444 Shanghai, China"},{"name":"IKERBASQUE, Basque Foundation for Science, Plaza Euskadi 5, 48009 Bilbao, Spain"},{"name":"Kipu Quantum, Greifswalderstrasse 226, 10405 Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1615-9035","authenticated-orcid":false,"given":"Mikel","family":"Sanz","sequence":"additional","affiliation":[{"name":"Department of Physical Chemistry, University of the Basque Country UPV\/EHU, Apartado 644, 48080 Bilbao, Spain"},{"name":"EHU Quantum Center, University of the Basque Country UPV\/EHU"},{"name":"IKERBASQUE, Basque Foundation for Science, Plaza Euskadi 5, 48009 Bilbao, Spain"},{"name":"Basque Center for Applied Mathematics (BCAM), Alameda de Mazarredo 14, 48009 Bilbao, Basque Country, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"9598","published-online":{"date-parts":[[2023,1,13]]},"reference":[{"key":"0","doi-asserted-by":"publisher","unstructured":"C. E. Shannon, A mathematical theory of communication, The Bell system technical journal 27, 379\u2013423 (1948).","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"1","unstructured":"W. C. Huffman and V. Pless, Fundamentals of error-correcting codes (Cambridge University Press, 2012)."},{"key":"2","doi-asserted-by":"publisher","unstructured":"H. Al-Bahadili, A novel lossless data compression scheme based on the error correcting Hamming codes, Computers & Mathematics with Applications 56, 143\u2013150 (2008).","DOI":"10.1016\/j.camwa.2007.11.043"},{"key":"3","doi-asserted-by":"publisher","unstructured":"A. R. Calderbank and P. W. Shor, Good quantum error-correcting codes exist, Phys. Rev. A 54, 1098\u20131105 (1996).","DOI":"10.1103\/PhysRevA.54.1098"},{"key":"4","doi-asserted-by":"publisher","unstructured":"A. M. Steane, Error correcting codes in quantum theory, Phys. Rev. Lett. 77, 793\u2013797 (1996).","DOI":"10.1103\/PhysRevLett.77.793"},{"key":"5","doi-asserted-by":"publisher","unstructured":"L. A. Rozema, D. H. Mahler, A. Hayat, P. S. Turner, and A. M. Steinberg, Quantum data compression of a qubit ensemble, Phys. Rev. Lett. 113, 160504 (2014).","DOI":"10.1103\/PhysRevLett.113.160504"},{"key":"6","doi-asserted-by":"publisher","unstructured":"D. Gottesman, Class of quantum error-correcting codes saturating the quantum Hamming bound, Phys. Rev. A 54, 1862\u20131868 (1996).","DOI":"10.1103\/PhysRevA.54.1862"},{"key":"7","doi-asserted-by":"publisher","unstructured":"A. Y. Kitaev, Fault-tolerant quantum computation by anyons, Annals of Physics 303, 2\u201330 (2003).","DOI":"10.1016\/S0003-4916(02)00018-0"},{"key":"8","unstructured":"A. Peres, Quantum theory: Concepts and Methods (Springer Science & Business Media, 2006)."},{"key":"9","doi-asserted-by":"publisher","unstructured":"C. H. Bennett, G. Brassard, C. Cr\u00e9peau, R. Jozsa, A. Peres, and W. K. Wootters, Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels, Phys. Rev. Lett. 70, 1895 (1993).","DOI":"10.1103\/PhysRevLett.70.1895"},{"key":"10","doi-asserted-by":"publisher","unstructured":"C. H. Bennett and S. J. Wiesner, Communication via one-and two-particle operators on Einstein-Podolsky-Rosen states, Phys. Rev. Lett. 69, 2881 (1992).","DOI":"10.1103\/PhysRevLett.69.2881"},{"key":"11","doi-asserted-by":"publisher","unstructured":"C. H. Bennett, P. W. Shor, J. A. Smolin, and A. V. Thapliyal, Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem, IEEE transactions on Information Theory 48.10, 2637\u20132655 (2002).","DOI":"10.1109\/TIT.2002.802612"},{"key":"12","doi-asserted-by":"publisher","unstructured":"S. Wiesner, Conjugate coding, ACM Sigact News 15(1), 78\u201388 (1983).","DOI":"10.1145\/1008908.1008920"},{"key":"13","doi-asserted-by":"publisher","unstructured":"A. Ambainis, A. Nayak, A. Ta-Shma, and U. Vazirani, Dense quantum coding and a lower bound for 1-way quantum automata, in Proceedings of the thirty-first annual ACM symposium on Theory of Computing (1999) pp. 376\u2013383.","DOI":"10.1145\/301250.301347"},{"key":"14","doi-asserted-by":"publisher","unstructured":"A. Ambainis, A. Nayak, A. Ta-Shma, and U. Vazirani, Dense quantum coding and quantum finite automata, Journal of the ACM (JACM) 49(4), 496\u2013511 (2002).","DOI":"10.1145\/581771.581773"},{"key":"15","doi-asserted-by":"publisher","unstructured":"M. Paw\u0142owski and M. \u017bukowski, Entanglement-assisted random access codes, Phys. Rev. A 81, 042326 (2010).","DOI":"10.1103\/PhysRevA.81.042326"},{"key":"16","doi-asserted-by":"publisher","unstructured":"A. Casaccino, E. F. Galv\u00e3o, and S. Severini, Extrema of discrete Wigner functions and applications, Phys. Rev. A 78, 022310 (2008).","DOI":"10.1103\/PhysRevA.78.022310"},{"key":"17","doi-asserted-by":"publisher","unstructured":"A. Tavakoli, A. Hameedi, B. Marques, and M. Bourennane, Quantum random access codes using single d-level systems, Phys. Rev. Lett. 114, 170502 (2015).","DOI":"10.1103\/PhysRevLett.114.170502"},{"key":"18","doi-asserted-by":"publisher","unstructured":"J. Pauwels, S. Pironio, E. Woodhead, and A. Tavakoli, Almost qudits in the prepare-and-measure scenario, Phys. Rev. Lett. 129, 250504 (2022).","DOI":"10.1103\/PhysRevLett.129.250504"},{"key":"19","doi-asserted-by":"publisher","unstructured":"W. K. Wootters, and B. D. Fields, Optimal state-determination by mutually unbiased measurements, Annals of Physics 191(2), 363\u2013381 (1989).","DOI":"10.1016\/0003-4916(89)90322-9"},{"key":"20","doi-asserted-by":"publisher","unstructured":"A. Ambainis, D. Leung, L. Mancinska, and M. Ozols, Quantum random access codes with shared randomness, arXiv 0810.2937 (2009).","DOI":"10.48550\/arXiv.0810.2937"},{"key":"21","unstructured":"M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, 2010)."},{"key":"22","doi-asserted-by":"publisher","unstructured":"S. Cheng, J. Chen, and L. Wang, Information perspective to probabilistic modeling: Boltzmann machines versus Born machines, Entropy 20, 583 (2018).","DOI":"10.3390\/e20080583"},{"key":"23","unstructured":"F. Lardinois, Google drive will hit a billion users this week, TechCrunch (2018)."},{"key":"24","unstructured":"J. Tromp, John&apos;s chess playground, (2010)."},{"key":"25","unstructured":"A. Levinovitz, The mystery of Go, the ancient game that computers still can&apos;t win, Wired Business (2014)."}],"container-title":["Quantum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/quantum-journal.org\/papers\/q-2023-01-13-895\/pdf\/","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T11:32:02Z","timestamp":1673609522000},"score":1,"resource":{"primary":{"URL":"https:\/\/quantum-journal.org\/papers\/q-2023-01-13-895\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,13]]},"references-count":26,"URL":"https:\/\/doi.org\/10.22331\/q-2023-01-13-895","archive":["CLOCKSS"],"relation":{},"ISSN":["2521-327X"],"issn-type":[{"type":"electronic","value":"2521-327X"}],"subject":[],"published":{"date-parts":[[2023,1,13]]},"article-number":"895"}}