{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T07:58:11Z","timestamp":1768550291917,"version":"3.49.0"},"reference-count":68,"publisher":"Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften","license":[{"start":{"date-parts":[[2021,4,8]],"date-time":"2021-04-08T00:00:00Z","timestamp":1617840000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000181","name":"U.S. Air Force Office of Scientific Research","doi-asserted-by":"crossref","award":["FA9550-17-1-0083"],"award-info":[{"award-number":["FA9550-17-1-0083"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Science Foundation","award":["CCF-1526189"],"award-info":[{"award-number":["CCF-1526189"]}]},{"name":"National Science Foundation","award":["CCF-1617710"],"award-info":[{"award-number":["CCF-1617710"]}]},{"name":"National Science Foundation","award":["CNS-1801470"],"award-info":[{"award-number":["CNS-1801470"]}]}],"content-domain":{"domain":["quantum-journal.org"],"crossmark-restriction":false},"short-container-title":["Quantum"],"abstract":"<jats:p>A central tenet of theoretical cryptography is the study of the minimal assumptions required to implement a given cryptographic primitive. One such primitive is the one-time memory (OTM), introduced by Goldwasser, Kalai, and Rothblum [CRYPTO 2008], which is a classical functionality modeled after a non-interactive 1-out-of-2 oblivious transfer, and which is complete for one-time classical and quantum programs. It is known that secure OTMs do not exist in the standard model in both the classical and quantum settings. Here, we propose a scheme for using quantum information, together with the assumption of stateless (<mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>i<\/mml:mi><mml:mo>.<\/mml:mo><mml:mi>e<\/mml:mi><mml:mo>.<\/mml:mo><\/mml:math>, reusable) hardware tokens, to build statistically secure OTMs. Via the semidefinite programming-based quantum games framework of Gutoski and Watrous [STOC 2007], we prove security for a malicious receiver making at most 0.114<mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>n<\/mml:mi><\/mml:math> adaptive queries to the token (for <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>n<\/mml:mi><\/mml:math> the key size), in the quantum universal composability framework, but leave open the question of security against a polynomial amount of queries. Compared to alternative schemes derived from the literature on quantum money, our scheme is technologically simple since it is of the \"prepare-and-measure\" type. We also give two impossibility results showing certain assumptions in our scheme cannot be relaxed.<\/jats:p>","DOI":"10.22331\/q-2021-04-08-429","type":"journal-article","created":{"date-parts":[[2021,4,8]],"date-time":"2021-04-08T16:13:10Z","timestamp":1617898390000},"page":"429","update-policy":"https:\/\/doi.org\/10.22331\/q-crossmark-policy-page","source":"Crossref","is-referenced-by-count":6,"title":["Towards Quantum One-Time Memories from Stateless Hardware"],"prefix":"10.22331","volume":"5","author":[{"given":"Anne","family":"Broadbent","sequence":"first","affiliation":[{"name":"Department of Mathematics and Statistics, University of Ottawa, Ontario, Canada"}]},{"given":"Sevag","family":"Gharibian","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Paderborn University, Germany"},{"name":"Department of Computer Science, Virginia Commonwealth University, Virginia, USA"}]},{"given":"Hong-Sheng","family":"Zhou","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Virginia Commonwealth University, Virginia, USA"}]}],"member":"9598","published-online":{"date-parts":[[2021,4,8]]},"reference":[{"key":"0","doi-asserted-by":"publisher","unstructured":"Scott Aaronson and Paul Christiano ``Quantum Money from Hidden Subspaces'' Proc. 44th Symposium on Theory of Computing (STOC) 2012 41-60 (2012).","DOI":"10.1145\/2213977.2213983"},{"key":"1","doi-asserted-by":"publisher","unstructured":"Charles H. Bennett and Gilles Brassard ``Quantum cryptography: Public key distribution and coin tossing'' International Conference on Computers, Systems and Signal Processing 175\u2013179 (1984).","DOI":"10.1016\/j.tcs.2014.05.025"},{"key":"2","unstructured":"Shalev Ben-David and Or Sattath ``Quantum Tokens for Digital Signatures'' (2018) arXiv:1609.09047."},{"key":"3","doi-asserted-by":"publisher","unstructured":"Donald Beaver ``Secure Multiparty Protocols and Zero-Knowledge Proof Systems Tolerating a Faulty Minority'' Journal of Cryptology 4, 75\u2013122 (1991).","DOI":"10.1007\/BF00196771"},{"key":"4","doi-asserted-by":"crossref","unstructured":"Charles H. Bennett, Gilles Brassard, Claude Cr\u00e9peau, and Marie-H\u00e9l\u00e8ne Skubiszewska, ``Practical Quantum Oblivious Transfer'' CRYPTO'91 576, 351\u2013366 (1992).","DOI":"10.1007\/3-540-46766-1_29"},{"key":"5","doi-asserted-by":"publisher","unstructured":"Manuel Blum, Paul Feldman, and Silvio Micali, ``Non-Interactive Zero-Knowledge and Its Applications'' 20th ACM STOC 103\u2013112 (1988).","DOI":"10.1145\/62212.62222"},{"key":"6","doi-asserted-by":"publisher","unstructured":"Anne Broadbent, Gus Gutoski, and Douglas Stebila, ``Quantum One-Time Programs'' CRYPTO 2013, Part II 8043, 344\u2013360 (2013).","DOI":"10.1007\/978-3-642-40084-1_20"},{"key":"7","unstructured":"Anne Broadbent, Sevag Gharibian, and Hong-Sheng Zhou, ``Quantum One-Time Memories from Stateless Hardware'' (2015) arXiv:1511.01363."},{"key":"8","doi-asserted-by":"publisher","unstructured":"Manuel Blum and Silvio Micali ``How to Generate Cryptographically Strong Sequences of Pseudo Random Bits'' 23rd FOCS 112\u2013117 (1982).","DOI":"10.1137\/0213053"},{"key":"9","doi-asserted-by":"publisher","unstructured":"Anne Broadbent and Christian Schaffner ``Quantum Cryptography Beyond Quantum Key Distribution'' Designs, Codes and Cryptography 78, 351\u2013382 (2016).","DOI":"10.1007\/s10623-015-0157-4"},{"key":"10","doi-asserted-by":"crossref","unstructured":"Stephen Boyd and Lieven Vandenberghe ``Convex Optimization'' Cambridge University Press (2004).","DOI":"10.1017\/CBO9780511804441"},{"key":"11","doi-asserted-by":"publisher","unstructured":"Ran Canetti ``Security and Composition of Multiparty Cryptographic Protocols'' Journal of Cryptology 13, 143\u2013202 (2000).","DOI":"10.1007\/s001459910006"},{"key":"12","doi-asserted-by":"publisher","unstructured":"Ran Canetti ``Universally Composable Security: A New Paradigm for Cryptographic Protocols'' 42nd FOCS 136\u2013145 (2001).","DOI":"10.1109\/SFCS.2001.959888"},{"key":"13","doi-asserted-by":"publisher","unstructured":"Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, and Amit Sahai, ``Universally composable two-party and multi-party secure computation'' 34th ACM STOC 494\u2013503 (2002).","DOI":"10.1145\/509907.509980"},{"key":"14","doi-asserted-by":"publisher","unstructured":"Ran Canetti, Yevgeniy Dodis, Rafael Pass, and Shabsi Walfish, ``Universally Composable Security with Global Setup'' TCC 2007 4392, 61\u201385 (2007).","DOI":"10.1007\/978-3-540-70936-7_4"},{"key":"15","doi-asserted-by":"publisher","unstructured":"Nishanth Chandran, Vipul Goyal, and Amit Sahai, ``New Constructions for UC Secure Computation Using Tamper-Proof Hardware'' EUROCRYPT 2008 4965, 545\u2013562 (2008).","DOI":"10.5555\/1788414.1788445"},{"key":"16","doi-asserted-by":"publisher","unstructured":"Seung Geol Choi, Jonathan Katz, Dominique Schr\u00f6der, Arkady Yerukhimovich, and Hong-Sheng Zhou, ``(Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens'' TCC 2014 8349, 638\u2013662 (2014).","DOI":"10.1007\/978-3-642-54242-8_27"},{"key":"17","doi-asserted-by":"publisher","unstructured":"Man-Duen Choi ``Completely positive linear maps on complex matrices'' Linear Alg. Appl. 10, 285 (1975).","DOI":"10.1016\/0024-3795(75)90075-0"},{"key":"18","doi-asserted-by":"publisher","unstructured":"Kai-Min Chung, Marios Georgiou, Ching-Yi Lai, and Vassilis Zikas, ``Cryptography with Disposable Backdoors'' Cryptography 3, 22 (2019).","DOI":"10.3390\/cryptography3030022"},{"key":"19","doi-asserted-by":"publisher","unstructured":"Christian Cachin and Ueli Maurer ``Unconditional security against memory-bounded adversaries'' Advances in Cryptology - CRYPTO 1997 292\u2013306 (1997).","DOI":"10.1007\/BFb0052243"},{"key":"20","doi-asserted-by":"publisher","unstructured":"Ivan Damg\u00e5rd, Serge Fehr, Louis Salvail, and Christian Schaffner, ``Cryptography In the Bounded Quantum-Storage Model'' Symposium on Foundations of Computer Science - FOCS 2005 449\u2013458 (2005).","DOI":"10.1109\/SFCS.2005.30"},{"key":"21","doi-asserted-by":"publisher","unstructured":"Ivan Damg\u00e5rd, Serge Fehr, Carolin Lunemann, Louis Salvail, and Christian Schaffner, ``Improving the Security of Quantum Protocols via Commit-and-Open'' CRYPTO 2009 5677, 408\u2013427 (2009).","DOI":"10.1007\/978-3-642-03356-8_24"},{"key":"22","doi-asserted-by":"publisher","unstructured":"Fr\u00e9d\u00e9ric Dupuis, Jesper Buus Nielsen, and Louis Salvail, ``Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries'' Advances in Cryptology \u2013 Proc. CRYPTO 2010 685\u2013706 (2010).","DOI":"10.1007\/978-3-642-14623-7_37"},{"key":"23","doi-asserted-by":"publisher","unstructured":"Fr\u00e9d\u00e9ric Dupuis, Jesper Buus Nielsen, and Louis Salvail, ``Actively Secure Two-Party Evaluation of Any Quantum Operation'' Advances in Cryptology \u2013 Proc. CRYPTO 2012 7417, 794\u2013811 (2012).","DOI":"10.1007\/978-3-642-32009-5_46"},{"key":"24","doi-asserted-by":"publisher","unstructured":"Ivan Damg\u00e5rd and Alessandra Scafuro ``Unconditionally Secure and Universally Composable Commitments from Physical Assumptions'' ASIACRYPT 2013, Part II 8270, 100\u2013119 (2013).","DOI":"10.1007\/978-3-642-42045-0_6"},{"key":"25","doi-asserted-by":"publisher","unstructured":"Serge Fehr, Jonathan Katz, Fang Song, Hong-Sheng Zhou, and Vassilis Zikas, ``Feasibility and Completeness of Cryptographic Tasks in the Quantum World'' TCC 2013 7785, 281\u2013296 (2013).","DOI":"10.1007\/978-3-642-36594-2_16"},{"key":"26","doi-asserted-by":"publisher","unstructured":"Bill Fefferman and Shelby Kimmel ``Quantum vs. Classical Proofs and Subset Verification'' 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018) 117, 22:1\u201322:23 (2018).","DOI":"10.4230\/LIPIcs.MFCS.2018.22"},{"key":"27","doi-asserted-by":"publisher","unstructured":"Dmitry Gavinsky ``Quantum Money with Classical Verification'' Computational Complexity (CCC), 2012 IEEE 27th Annual Conference on 42\u201352 (2012).","DOI":"10.1109\/CCC.2012.10"},{"key":"28","doi-asserted-by":"publisher","unstructured":"Shafi Goldwasser, Yael Tauman Kalai, and Guy N. Rothblum, ``One-Time Programs'' CRYPTO 2008 5157, 39\u201356 (2008).","DOI":"10.1007\/978-3-540-85174-5_3"},{"key":"29","doi-asserted-by":"publisher","unstructured":"Shafi Goldwasser and Leonid A. Levin ``Fair Computation of General Functions in Presence of Immoral Majority'' CRYPTO'90 537, 77\u201393 (1991).","DOI":"10.1007\/3-540-38424-3_6"},{"key":"30","doi-asserted-by":"publisher","unstructured":"Oded Goldreich, Silvio Micali, and Avi Wigderson, ``How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority'' 19th ACM STOC 218\u2013229 (1987).","DOI":"10.1145\/3335741.3335755"},{"key":"31","doi-asserted-by":"publisher","unstructured":"Vipul Goyal, Yuval Ishai, Amit Sahai, Ramarathnam Venkatesan, and Akshay Wadia, ``Founding Cryptography on Tamper-Proof Hardware Tokens'' TCC 2010 5978, 308\u2013326 (2010).","DOI":"10.1007\/978-3-642-11799-2_19"},{"key":"32","doi-asserted-by":"publisher","unstructured":"Gus Gutoski and John Watrous ``Toward a general theory of quantum games'' Proceedings of the 39th ACM Symposium on Theory of Computing (STOC 2007) 565\u2013574 (2007).","DOI":"10.1145\/1250790.1250873"},{"key":"33","doi-asserted-by":"publisher","unstructured":"Werner Heisenberg ``Schwankungserscheinungen und Quantenmechanik'' Zeitschrift fuer Physik 40, 501\u2013506 (1927).","DOI":"10.1007\/BF01440827"},{"key":"34","doi-asserted-by":"publisher","unstructured":"Sean Hallgren, Adam Smith, and Fang Song, ``Classical Cryptographic Protocols in a Quantum World'' CRYPTO 2011 6841, 411\u2013428 (2011).","DOI":"10.1007\/978-3-642-22792-9_23"},{"key":"35","doi-asserted-by":"publisher","unstructured":"Yuval Ishai, Manoj Prabhakaran, and Amit Sahai, ``Founding Cryptography on Oblivious Transfer - Efficiently'' CRYPTO 2008 5157, 572\u2013591 (2008).","DOI":"10.1007\/978-3-540-85174-5_32"},{"key":"36","doi-asserted-by":"publisher","unstructured":"Andrzej Jamio\u0142kowski ``Linear Transformations which preserve trace and positive semi-definiteness of operators'' Rep. Math. Phys. 3, 275 (1972).","DOI":"10.1016\/0034-4877(72)90011-0"},{"key":"37","doi-asserted-by":"publisher","unstructured":"Jonathan Katz ``Universally Composable Multi-party Computation Using Tamper-Proof Hardware'' EUROCRYPT 2007 4515, 115\u2013128 (2007).","DOI":"10.1007\/978-3-540-72540-4_7"},{"key":"38","doi-asserted-by":"publisher","unstructured":"Joe Kilian ``Founding Cryptography on Oblivious Transfer'' 20th ACM STOC 20\u201331 (1988).","DOI":"10.1145\/62212.62215"},{"key":"39","doi-asserted-by":"publisher","unstructured":"Daniel Kraschewski and J\u00f6rn M\u00fcller-Quade ``Completeness Theorems with Constructive Proofs for Finite Deterministic 2-Party Functions'' TCC 2011 6597, 364\u2013381 (2011).","DOI":"10.1007\/978-3-642-19571-6_22"},{"key":"40","doi-asserted-by":"publisher","unstructured":"Daniel Kraschewski, Hemanta K. Maji, Manoj Prabhakaran, and Amit Sahai, ``A Full Characterization of Completeness for Two-Party Randomized Function Evaluation'' EUROCRYPT 2014 8441, 659\u2013676 (2014).","DOI":"10.1007\/978-3-642-55220-5_36"},{"key":"41","doi-asserted-by":"publisher","unstructured":"Yi-Kai Liu ``Building one-time memories from isolated qubits'' ITCS 2014 269\u2013286 (2014).","DOI":"10.1145\/2554797.2554823"},{"key":"42","doi-asserted-by":"publisher","unstructured":"Yi-Kai Liu ``Single-Shot Security for One-Time Memories in the Isolated Qubits Model'' CRYPTO 2014, Part II 8617, 19\u201336 (2014).","DOI":"10.1007\/978-3-662-44381-1_2"},{"key":"43","doi-asserted-by":"publisher","unstructured":"Yi-Kai Liu ``Privacy Amplification in the Isolated Qubits Model'' EUROCRYPT 2015, Part II 9057, 785\u2013814 (2015).","DOI":"10.1007\/978-3-662-46803-6_26"},{"key":"44","doi-asserted-by":"publisher","unstructured":"Huijia Lin, Rafael Pass, and Muthuramakrishnan Venkitasubramaniam, ``A unified framework for concurrent security: universal composability from stand-alone non-malleability'' 41st ACM STOC 179\u2013188 (2009).","DOI":"10.1145\/1536414.1536441"},{"key":"45","doi-asserted-by":"publisher","unstructured":"Ueli M. Maurer ``Protocols for Secret Key Agreement by Public Discussion Based on Common Information'' Advances in Cryptology - CRYPTO 1992 740, 461\u2013470 (1992).","DOI":"10.1007\/3-540-48071-4_32"},{"key":"46","doi-asserted-by":"publisher","unstructured":"Hemanta K. Maji, Manoj Prabhakaran, and Mike Rosulek, ``Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation'' TCC 2009 5444, 256\u2013273 (2009).","DOI":"10.1007\/978-3-642-00457-5_16"},{"key":"47","doi-asserted-by":"publisher","unstructured":"Hemanta K. Maji, Manoj Prabhakaran, and Mike Rosulek, ``A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security'' CRYPTO 2010 6223, 595\u2013612 (2010).","DOI":"10.1007\/978-3-642-14623-7_32"},{"key":"48","unstructured":"Ueli Maurer and Renato Renner ``Abstract Cryptography'' ICS 2011 1\u201321 (2011)."},{"key":"49","doi-asserted-by":"publisher","unstructured":"Silvio Micali and Phillip Rogaway ``Secure Computation (Abstract)'' CRYPTO'91 576, 392\u2013404 (1992).","DOI":"10.1007\/3-540-46766-1_32"},{"key":"50","doi-asserted-by":"publisher","unstructured":"Abel Molina, Thomas Vidick, and John Watrous, ``Optimal Counterfeiting Attacks and Generalizations for Wiesner\u2019s Quantum Money'' Theory of Quantum Computation, Communication, and Cryptography 7582, 45\u201364 (2013).","DOI":"10.1007\/978-3-642-35656-8_4"},{"key":"51","unstructured":"M. A. Nielsen and I. L. Chuang ``Quantum Computation and Quantum Information'' Cambridge University Press (2000)."},{"key":"52","doi-asserted-by":"publisher","unstructured":"Fernando Pastawski, Norman Y Yao, Liang Jiang, Mikhail D Lukin, and J Ignacio Cirac, ``Unforgeable noise-tolerant quantum tokens'' Proceedings of the National Academy of Sciences 109, 16079 \u201316082 (2012).","DOI":"10.1073\/pnas.1203552109"},{"key":"53","doi-asserted-by":"publisher","unstructured":"Manoj Prabhakaran and Mike Rosulek ``Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations'' CRYPTO 2008 5157, 262\u2013279 (2008).","DOI":"10.1007\/978-3-540-85174-5_15"},{"key":"54","doi-asserted-by":"publisher","unstructured":"Manoj Prabhakaran and Amit Sahai ``New notions of security: Achieving universal composability without trusted setup'' 36th ACM STOC 242\u2013251 (2004).","DOI":"10.1145\/1007352.1007394"},{"key":"55","doi-asserted-by":"publisher","unstructured":"Birgit Pfitzmann and Michael Waidner ``A model for asynchronous reactive systems and its application to secure message transmission'' Proc. 22nd IEEE Symposium on Security & Privacy (S&P) 2001 184\u2013200 (2001).","DOI":"10.1109\/SECPRI.2001.924298"},{"key":"56","doi-asserted-by":"publisher","unstructured":"Marco T\u00falio Quintino, Qingxiuxiong Dong, Atsushi Shimbo, Akihito Soeda, and Mio Murao, ``Reversing Unknown Quantum Transformations: Universal Quantum Circuit for Inverting General Unitary Operations'' Phys. Rev. Lett. 123, 210502 (2019).","DOI":"10.1103\/PhysRevLett.123.210502"},{"key":"57","doi-asserted-by":"publisher","unstructured":"Renato Renner ``Security of Quantum Key Distribution'' thesis (2008).","DOI":"10.1142\/S0219749908003256"},{"key":"58","doi-asserted-by":"publisher","unstructured":"Dominique Unruh ``Universally Composable Quantum Multi-party Computation'' EUROCRYPT 2010 6110, 486\u2013505 (2010).","DOI":"10.1007\/978-3-642-13190-5_25"},{"key":"59","doi-asserted-by":"publisher","unstructured":"Dominique Unruh ``Everlasting Multi-party Computation'' CRYPTO 2013, Part II 8043, 380\u2013397 (2013).","DOI":"10.1007\/978-3-642-40084-1_22"},{"key":"60","doi-asserted-by":"publisher","unstructured":"Dominique Unruh ``Revocable Quantum Timed-Release Encryption'' EUROCRYPT 2014 8441, 129\u2013146 (2014).","DOI":"10.1007\/978-3-642-55220-5_8"},{"key":"61","unstructured":"John Watrous ``Lecture 7: Semidefinite programming'' (2011) Latest version available at: https:\/\/cs.uwaterloo.ca\/ watrous\/TQI-notes\/."},{"key":"62","doi-asserted-by":"publisher","unstructured":"Stephen Wiesner ``Conjugate coding'' ACM SIGACT News 15, 78\u201388 (1983) Original article written circa 1970.","DOI":"10.1145\/1008908.1008920"},{"key":"63","doi-asserted-by":"publisher","unstructured":"Andreas Winter ``Coding theorem and strong converse for quantum channels'' IEEE Transactions on Information Theory 45, 2481\u20132485 (1999).","DOI":"10.1109\/18.796385"},{"key":"64","doi-asserted-by":"publisher","unstructured":"Stephanie Wehner, Christian Schaffner, and Barbara M. Terhal, ``Cryptography from Noisy Storage'' Physical Review Letters 100, 220502 (2008).","DOI":"10.1103\/PhysRevLett.100.220502"},{"key":"65","doi-asserted-by":"publisher","unstructured":"Stephanie Wehner and Andreas Winter ``Entropic uncertainty relations\u2014a survey'' New J. Phys. 12, 025009 (2010).","DOI":"10.1088\/1367-2630\/12\/2\/025009"},{"key":"66","doi-asserted-by":"publisher","unstructured":"William K. Wootters and Wojciech H. Zurek ``A single quantum cannot be cloned'' Nature 299, 802\u2013803 (1982).","DOI":"10.1038\/299802a0"},{"key":"67","doi-asserted-by":"publisher","unstructured":"Andrew Chi-Chih Yao ``Theory and Applications of Trapdoor Functions'' 23rd FOCS 80\u201391 (1982).","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Quantum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/quantum-journal.org\/papers\/q-2021-04-08-429\/pdf\/","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,4,8]],"date-time":"2021-04-08T16:13:25Z","timestamp":1617898405000},"score":1,"resource":{"primary":{"URL":"https:\/\/quantum-journal.org\/papers\/q-2021-04-08-429\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,8]]},"references-count":68,"URL":"https:\/\/doi.org\/10.22331\/q-2021-04-08-429","archive":["CLOCKSS"],"relation":{},"ISSN":["2521-327X"],"issn-type":[{"value":"2521-327X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,8]]},"article-number":"429"}}