{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T14:50:41Z","timestamp":1766587841211,"version":"3.40.5"},"reference-count":84,"publisher":"Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften","license":[{"start":{"date-parts":[[2025,5,12]],"date-time":"2025-05-12T00:00:00Z","timestamp":1747008000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000266","name":"UK Engineering and Physical Sciences Research Council","doi-asserted-by":"crossref","award":["EP\/X026167\/1"],"award-info":[{"award-number":["EP\/X026167\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["quantum-journal.org"],"crossmark-restriction":false},"short-container-title":["Quantum"],"abstract":"<jats:p>In this work, we initiate the study of learning quantum processes from quantum statistical queries. We focus on two fundamental learning tasks in this new access model: shadow tomography of quantum processes and process tomography with respect to diamond distance. For the former, we present an efficient average-case algorithm along with a nearly matching lower bound with respect to the number of observables to be predicted. For the latter, we present average-case query complexity lower bounds for learning classes of unitaries. We obtain an exponential lower bound for learning unitary 2-designs and a doubly exponential lower bound for Haar-random unitaries. Finally, we demonstrate the practical relevance of our access model by applying our learning algorithm to attack an authentication protocol using Classical-Readout Quantum Physically Unclonable Functions, partially addressing an important open question in quantum hardware security.<\/jats:p>","DOI":"10.22331\/q-2025-05-12-1739","type":"journal-article","created":{"date-parts":[[2025,5,12]],"date-time":"2025-05-12T13:58:59Z","timestamp":1747058339000},"page":"1739","update-policy":"https:\/\/doi.org\/10.22331\/q-crossmark-policy-page","source":"Crossref","is-referenced-by-count":3,"title":["Learning Quantum Processes with Quantum Statistical Queries"],"prefix":"10.22331","volume":"9","author":[{"given":"Chirag","family":"Wadhwa","sequence":"first","affiliation":[{"name":"School of Informatics, University of Edinburgh, Edinburgh, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mina","family":"Doosti","sequence":"additional","affiliation":[{"name":"School of Informatics, University of Edinburgh, Edinburgh, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"9598","published-online":{"date-parts":[[2025,5,12]]},"reference":[{"key":"0","doi-asserted-by":"publisher","unstructured":"Leslie G Valiant. ``A theory of the learnable&apos;&apos;. Communications of the ACM 27, 1134\u20131142 (1984).","DOI":"10.1145\/1968.1972"},{"key":"1","doi-asserted-by":"publisher","unstructured":"Michael Kearns. ``Efficient noise-tolerant learning from statistical queries&apos;&apos;. Journal of the ACM (JACM) 45, 983\u20131006 (1998).","DOI":"10.1145\/293347.293351"},{"key":"2","doi-asserted-by":"publisher","unstructured":"Nader H. Bshouty and Jeffrey C. Jackson. ``Learning dnf over the uniform distribution using a quantum example oracle&apos;&apos;. In Proceedings of the Eighth Annual Conference on Computational Learning Theory. Page 118\u2013127. COLT&apos;95. Association for Computing Machinery (1995).","DOI":"10.1145\/225298.225312"},{"key":"3","unstructured":"Srinivasan Arunachalam and Ronald De Wolf. ``Optimal quantum sample complexity of learning algorithms&apos;&apos;. The Journal of Machine Learning Research 19, 2879\u20132878 (2018)."},{"key":"4","unstructured":"Srinivasan Arunachalam, Alex B. Grilo, and Henry Yuen. ``Quantum statistical query learning&apos;&apos; (2020). arxiv:2002.08240."},{"key":"5","unstructured":"Srinivasan Arunachalam, Vojtech Havlicek, and Louis Schatzki. ``On the role of entanglement and statistics in learning&apos;&apos;. Advances in Neural Information Processing Systems 36, 55064\u201355076 (2024)."},{"key":"6","doi-asserted-by":"publisher","unstructured":"M Hinsche, M Ioannou, A Nietner, J Haferkamp, Y Quek, D Hangleiter, J-P Seifert, J Eisert, and R Sweke. ``One t gate makes distribution learning hard&apos;&apos;. Physical Review Letters 130, 240602 (2023).","DOI":"10.1103\/physrevlett.130.240602"},{"key":"7","unstructured":"Alexander Nietner, Marios Ioannou, Ryan Sweke, Richard Kueng, Jens Eisert, Marcel Hinsche, and Jonas Haferkamp. ``On the average-case complexity of learning output distributions of quantum circuits&apos;&apos; (2023). arxiv:2305.05765."},{"key":"8","unstructured":"Alexander Nietner. ``Unifying (quantum) statistical and parametrized (quantum) algorithms&apos;&apos; (2023). arxiv:2310.17716."},{"key":"9","doi-asserted-by":"publisher","unstructured":"Alp Atici and Rocco A Servedio. ``Improved bounds on quantum learning algorithms&apos;&apos;. Quantum Information Processing 4, 355\u2013386 (2005).","DOI":"10.1007\/s11128-005-0001-2"},{"key":"10","doi-asserted-by":"publisher","unstructured":"Alex B. Grilo, Iordanis Kerenidis, and Timo Zijlstra. ``Learning-with-errors problem is easy with quantum samples&apos;&apos;. Physical Review A 99, 032314 (2019).","DOI":"10.1103\/physreva.99.032314"},{"key":"11","doi-asserted-by":"publisher","unstructured":"Alessandro Bisio, Giulio Chiribella, Giacomo Mauro D&apos;Ariano, Stefano Facchini, and Paolo Perinotti. ``Optimal quantum tomography&apos;&apos;. IEEE Journal of Selected Topics in Quantum Electronics 15, 1646\u20131660 (2009).","DOI":"10.1109\/jstqe.2009.2029243"},{"key":"12","doi-asserted-by":"publisher","unstructured":"Ryan O&apos;Donnell and John Wright. ``Efficient quantum tomography&apos;&apos;. In Proceedings of the forty-eighth annual ACM symposium on Theory of Computing. Pages 899\u2013912. (2016).","DOI":"10.1145\/2897518.2897544"},{"key":"13","unstructured":"Qian Xu and Shuqi Xu. ``Neural network state estimation for full quantum state tomography&apos;&apos; (2018). arxiv:1811.06654."},{"key":"14","doi-asserted-by":"publisher","unstructured":"Hsin-Yuan Huang, Richard Kueng, and John Preskill. ``Predicting many properties of a quantum system from very few measurements&apos;&apos;. Nature Physics 16, 1050\u20131057 (2020).","DOI":"10.1038\/s41567-020-0932-7"},{"key":"15","doi-asserted-by":"publisher","unstructured":"Scott Aaronson. ``Shadow tomography of quantum states&apos;&apos;. In Proceedings of the 50th annual ACM SIGACT symposium on theory of computing. Pages 325\u2013338. (2018).","DOI":"10.1145\/3188745.3188802"},{"key":"16","unstructured":"Andrew M Childs, Tongyang Li, Jin-Peng Liu, Chunhao Wang, and Ruizhe Zhang. ``Quantum algorithms for sampling log-concave distributions and estimating normalizing constants&apos;&apos;. Advances in Neural Information Processing Systems 35, 23205\u201323217 (2022)."},{"key":"17","unstructured":"Ashley Montanaro. ``Learning stabilizer states by bell sampling&apos;&apos; (2017). arxiv:1707.04012."},{"key":"18","doi-asserted-by":"publisher","unstructured":"Masoud Mohseni, Ali T Rezakhani, and Daniel A Lidar. ``Quantum-process tomography: Resource analysis of different strategies&apos;&apos;. Physical Review A 77, 032322 (2008).","DOI":"10.1103\/physreva.77.032322"},{"key":"19","doi-asserted-by":"publisher","unstructured":"Kai-Min Chung and Han-Hsuan Lin. ``Sample efficient algorithms for learning quantum channels in pac model and the approximate state discrimination problem&apos;&apos;. In 16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021). Pages 3:1\u20133:22. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2021).","DOI":"10.4230\/LIPIcs.TQC.2021.3"},{"key":"20","doi-asserted-by":"publisher","unstructured":"Jeongwan Haah, Robin Kothari, Ryan O\u2019Donnell, and Ewin Tang. ``Query-optimal estimation of unitary channels in diamond distance&apos;&apos;. In 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS). Pages 363\u2013390. IEEE (2023).","DOI":"10.1109\/focs57990.2023.00028"},{"key":"21","doi-asserted-by":"publisher","unstructured":"Srinivasan Arunachalam and Ronald de Wolf. ``Guest column: A survey of quantum learning theory&apos;&apos;. ACM Sigact News 48, 41\u201367 (2017).","DOI":"10.1145\/3106700.3106710"},{"key":"22","doi-asserted-by":"publisher","unstructured":"Nathan Wiebe, Christopher Granade, Christopher Ferrie, and David G Cory. ``Hamiltonian learning and certification using quantum resources&apos;&apos;. Physical review letters 112, 190501 (2014).","DOI":"10.1103\/physrevlett.112.190501"},{"key":"23","doi-asserted-by":"publisher","unstructured":"Harper R Grimsley, Sophia E Economou, Edwin Barnes, and Nicholas J Mayhall. ``An adaptive variational algorithm for exact molecular simulations on a quantum computer&apos;&apos;. Nature communications 10, 3007 (2019).","DOI":"10.1038\/s41467-019-10988-2"},{"key":"24","doi-asserted-by":"publisher","unstructured":"Andrew James Scott. ``Optimizing quantum process tomography with unitary 2-designs&apos;&apos;. Journal of Physics A: Mathematical and Theoretical 41, 055308 (2008).","DOI":"10.1088\/1751-8113\/41\/5\/055308"},{"key":"25","doi-asserted-by":"publisher","unstructured":"Ryan Levy, Di Luo, and Bryan K Clark. ``Classical shadows for quantum process tomography on near-term quantum computers&apos;&apos;. Physical Review Research 6, 013029 (2024).","DOI":"10.1103\/physrevresearch.6.013029"},{"key":"26","unstructured":"Hsin-Yuan Huang, Steven T Flammia, and John Preskill. ``Foundations for learning from noisy quantum experiments&apos;&apos; (2022). arxiv:2204.13691."},{"key":"27","doi-asserted-by":"publisher","unstructured":"Robin Blume-Kohout, John King Gamble, Erik Nielsen, Kenneth Rudinger, Jonathan Mizrahi, Kevin Fortier, and Peter Maunz. ``Demonstration of qubit operations below a rigorous fault tolerance threshold with gate set tomography&apos;&apos;. Nature communications 8, 14485 (2017).","DOI":"10.1038\/ncomms14485"},{"key":"28","doi-asserted-by":"publisher","unstructured":"Robin Harper, Steven T Flammia, and Joel J Wallman. ``Efficient learning of quantum noise&apos;&apos;. Nature Physics 16, 1184\u20131188 (2020).","DOI":"10.1038\/s41567-020-0992-8"},{"key":"29","doi-asserted-by":"publisher","unstructured":"Armands Strikis, Dayue Qin, Yanzhu Chen, Simon C Benjamin, and Ying Li. ``Learning-based quantum error mitigation&apos;&apos;. PRX Quantum 2, 040330 (2021).","DOI":"10.1103\/prxquantum.2.040330"},{"key":"30","doi-asserted-by":"publisher","unstructured":"Yihui Quek, Daniel Stilck Fran\u00e7a, Sumeet Khatri, Johannes Jakob Meyer, and Jens Eisert. ``Exponentially tighter bounds on limitations of quantum error mitigation&apos;&apos;. Nature Physics 20, 1648\u20131658 (2024).","DOI":"10.1038\/s41567-024-02536-7"},{"key":"31","doi-asserted-by":"publisher","unstructured":"Maria Schuld, Ilya Sinayskiy, and Francesco Petruccione. ``An introduction to quantum machine learning&apos;&apos;. Contemporary Physics 56, 172\u2013185 (2015).","DOI":"10.1080\/00107514.2014.964942"},{"key":"32","doi-asserted-by":"publisher","unstructured":"Dan Boneh and Mark Zhandry. ``Quantum-secure message authentication codes&apos;&apos;. In Thomas Johansson and Phong Q. Nguyen, editors, Advances in Cryptology \u2013 EUROCRYPT 2013. Pages 592\u2013608. Berlin, Heidelberg (2013). Springer Berlin Heidelberg.","DOI":"10.1007\/978-3-642-38348-9_35"},{"key":"33","doi-asserted-by":"publisher","unstructured":"Marc Kaplan, Ga\u00ebtan Leurent, Anthony Leverrier, and Mar\u00eda Naya-Plasencia. ``Breaking symmetric cryptosystems using quantum period finding&apos;&apos;. In Matthew Robshaw and Jonathan Katz, editors, Advances in Cryptology \u2013 CRYPTO 2016. Pages 207\u2013237. Berlin, Heidelberg (2016). Springer Berlin Heidelberg.","DOI":"10.1007\/978-3-662-53008-5_8"},{"key":"34","doi-asserted-by":"publisher","unstructured":"Thomas Santoli and Christian Schaffner. ``Using simon&apos;s algorithm to attack symmetric-key cryptographic primitives&apos;&apos;. Quantum Information & Computation 17, 65\u201378 (2017).","DOI":"10.26421\/qic17.1-2-4"},{"key":"35","doi-asserted-by":"publisher","unstructured":"C\u00e9line Chevalier, Ehsan Ebrahimi, and Quoc-Huy Vu. ``On security notions for encryption in a quantum world&apos;&apos;. In International Conference on Cryptology in India. Pages 592\u2013613. Springer (2022).","DOI":"10.1007\/978-3-031-22912-1_26"},{"key":"36","doi-asserted-by":"publisher","unstructured":"Myrto Arapinis, Mahshid Delavar, Mina Doosti, and Elham Kashefi. ``Quantum physical unclonable functions: Possibilities and impossibilities&apos;&apos;. Quantum 5, 475 (2021).","DOI":"10.22331\/q-2021-06-15-475"},{"key":"37","doi-asserted-by":"publisher","unstructured":"Koustubh Phalak, Abdullah Ash-Saki, Mahabubul Alam, Rasit Onur Topaloglu, and Swaroop Ghosh. ``Quantum PUF for security and trust in quantum computing&apos;&apos;. IEEE Journal on Emerging and Selected Topics in Circuits and Systems 11, 333\u2013342 (2021).","DOI":"10.1109\/jetcas.2021.3077024"},{"key":"38","doi-asserted-by":"publisher","unstructured":"Niklas Pirnay, Anna Pappa, and Jean-Pierre Seifert. ``Learning classical readout quantum PUFs based on single-qubit gates&apos;&apos;. Quantum Machine Intelligence 4, 14 (2022).","DOI":"10.1007\/s42484-022-00073-1"},{"key":"39","doi-asserted-by":"publisher","unstructured":"Hsin-Yuan Huang, Sitan Chen, and John Preskill. ``Learning to predict arbitrary quantum processes&apos;&apos;. PRX Quantum 4, 040337 (2023).","DOI":"10.1103\/prxquantum.4.040337"},{"key":"40","unstructured":"Ashley Montanaro and Tobias J Osborne. ``Quantum boolean functions&apos;&apos; (2008). arxiv:0810.2435."},{"key":"41","doi-asserted-by":"publisher","unstructured":"Marco Fanizza, Yihui Quek, and Matteo Rosati. ``Learning quantum processes without input control&apos;&apos;. PRX Quantum 5, 020367 (2024).","DOI":"10.1103\/prxquantum.5.020367"},{"key":"42","doi-asserted-by":"publisher","unstructured":"Matthias C Caro, Marcel Hinsche, Marios Ioannou, Alexander Nietner, and Ryan Sweke. ``Classical verification of quantum learning&apos;&apos;. In 15th Innovations in Theoretical Computer Science Conference (ITCS 2024). Pages 24:1\u201324:23. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2024).","DOI":"10.4230\/LIPIcs.ITCS.2024.24"},{"key":"43","unstructured":"Vitaly Feldman. ``A general characterization of the statistical query complexity&apos;&apos;. In Conference on learning theory. Pages 785\u2013830. PMLR (2017)."},{"key":"44","unstructured":"Armando Angrisani. ``Learning unitaries with quantum statistical queries&apos;&apos; (2023). arxiv:2310.02254."},{"key":"45","doi-asserted-by":"publisher","unstructured":"Sitan Chen, Jordan Cotler, Hsin-Yuan Huang, and Jerry Li. ``Exponential separations between learning with and without quantum memory&apos;&apos;. In 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS). Pages 574\u2013585. IEEE (2022).","DOI":"10.1109\/focs52979.2021.00063"},{"key":"46","doi-asserted-by":"publisher","unstructured":"Jonathan Kunjummen, Minh C Tran, Daniel Carney, and Jacob M Taylor. ``Shadow process tomography of quantum channels&apos;&apos;. Physical Review A 107, 042403 (2023).","DOI":"10.1103\/physreva.107.042403"},{"key":"47","doi-asserted-by":"publisher","unstructured":"Matthias C Caro. ``Learning quantum processes and hamiltonians via the pauli transfer matrix&apos;&apos;. ACM Transactions on Quantum Computing 5, 1\u201353 (2024).","DOI":"10.1145\/3670418"},{"key":"48","doi-asserted-by":"publisher","unstructured":"Shivam Nadimpalli, Natalie Parham, Francisca Vasconcelos, and Henry Yuen. ``On the pauli spectrum of qac0&apos;&apos;. In Proceedings of the 56th Annual ACM Symposium on Theory of Computing. Pages 1498\u20131506. (2024).","DOI":"10.1145\/3618260.3649662"},{"key":"49","unstructured":"Michael A Nielsen and Isaac L Chuang. ``Quantum computation and quantum information&apos;&apos;. Cambridge university press. (2010)."},{"key":"50","doi-asserted-by":"publisher","unstructured":"Antonio Anna Mele. ``Introduction to haar measure tools in quantum information: A beginner&apos;s tutorial&apos;&apos;. Quantum 8, 1340 (2024).","DOI":"10.22331\/q-2024-05-08-1340"},{"key":"51","doi-asserted-by":"publisher","unstructured":"Andreas Elben, Steven T. Flammia, Hsin-Yuan Huang, Richard Kueng, John Preskill, Beno\u0131\u0302t Vermersch, and Peter Zoller. ``The randomized measurement toolbox&apos;&apos;. Nature Reviews Physics 5, 9\u201324 (2022).","DOI":"10.1038\/s42254-022-00535-2"},{"key":"52","doi-asserted-by":"publisher","unstructured":"Hsin-Yuan Huang, Richard Kueng, Giacomo Torlai, Victor V Albert, and John Preskill. ``Provably efficient machine learning for quantum many-body problems&apos;&apos;. Science 377, eabk3333 (2022).","DOI":"10.1126\/science.abk3333"},{"key":"53","doi-asserted-by":"publisher","unstructured":"V Kanade, A Rocchetto, and S Severini. ``Learning dnfs under product distributions via $\\mu$-biased quantum fourier sampling&apos;&apos;. Quantum Information and Computation 19, 1261\u20131278 (2019).","DOI":"10.26421\/QIC19.15-16-1"},{"key":"54","doi-asserted-by":"publisher","unstructured":"Matthias C. Caro. ``Quantum learning boolean linear functions w.r.t. product distributions&apos;&apos;. Quantum Information Processing 19, 172 (2020).","DOI":"10.1007\/s11128-020-02661-1"},{"key":"55","doi-asserted-by":"publisher","unstructured":"Yuxuan Du, Min-Hsiu Hsieh, Tongliang Liu, Dacheng Tao, and Nana Liu. ``Quantum noise protects quantum classifiers against adversaries&apos;&apos;. Physical Review Research 3, 023153 (2021).","DOI":"10.1103\/physrevresearch.3.023153"},{"key":"56","doi-asserted-by":"publisher","unstructured":"Aravind Gollakota and Daniel Liang. ``On the hardness of pac-learning stabilizer states with noise&apos;&apos;. Quantum 6, 640 (2022).","DOI":"10.22331\/q-2022-02-02-640"},{"key":"57","doi-asserted-by":"publisher","unstructured":"Changjun Kim, Kyungdeock Daniel Park, and June-Koo Rhee. ``Quantum error mitigation with artificial neural network&apos;&apos;. IEEE Access 8, 188853\u2013188860 (2020).","DOI":"10.1109\/access.2020.3031607"},{"key":"58","doi-asserted-by":"publisher","unstructured":"Hsin-Yuan Huang, Richard Kueng, and John Preskill. ``Information-theoretic bounds on quantum advantage in machine learning&apos;&apos;. Physical Review Letters 126, 190505 (2021).","DOI":"10.1103\/physrevlett.126.190505"},{"key":"59","doi-asserted-by":"publisher","unstructured":"Charles Hadfield, Sergey Bravyi, Rudy Raymond, and Antonio Mezzacapo. ``Measurements of quantum hamiltonians with locally-biased classical shadows&apos;&apos;. Communications in Mathematical Physics 391, 951\u2013967 (2022).","DOI":"10.1007\/s00220-022-04343-8"},{"key":"60","doi-asserted-by":"publisher","unstructured":"Hsin-Yuan Huang, Richard Kueng, and John Preskill. ``Efficient estimation of pauli observables by derandomization&apos;&apos;. Physical Review Letters 127, 030503 (2021).","DOI":"10.1103\/physrevlett.127.030503"},{"key":"61","doi-asserted-by":"publisher","unstructured":"Bujiao Wu, Jinzhao Sun, Qi Huang, and Xiao Yuan. ``Overlapped grouping measurement: A unified framework for measuring quantum states&apos;&apos;. Quantum 7, 896 (2023).","DOI":"10.22331\/q-2023-01-13-896"},{"key":"62","unstructured":"Zak Webb. ``The clifford group forms a unitary 3-design&apos;&apos; (2015). arxiv:1510.02769."},{"key":"63","doi-asserted-by":"publisher","unstructured":"Huangjun Zhu. ``Multiqubit clifford groups are unitary 3-designs&apos;&apos;. Physical Review A 96, 062336 (2017).","DOI":"10.1103\/physreva.96.062336"},{"key":"64","doi-asserted-by":"publisher","unstructured":"Richard A Low. ``Learning and testing algorithms for the clifford group&apos;&apos;. Physical Review A\u2014Atomic, Molecular, and Optical Physics 80, 052314 (2009).","DOI":"10.1103\/physreva.80.052314"},{"key":"65","doi-asserted-by":"publisher","unstructured":"Ching-Yi Lai and Hao-Chung Cheng. ``Learning quantum circuits of some t gates&apos;&apos;. IEEE Transactions on Information Theory 68, 3951\u20133964 (2022).","DOI":"10.1109\/tit.2022.3151760"},{"key":"66","doi-asserted-by":"publisher","unstructured":"Jonas Haferkamp and Nicholas Hunter-Jones. ``Improved spectral gaps for random quantum circuits: Large local dimensions and all-to-all interactions&apos;&apos;. Physical Review A 104, 022417 (2021).","DOI":"10.1103\/physreva.104.022417"},{"key":"67","doi-asserted-by":"publisher","unstructured":"Elizabeth Meckes and Mark Meckes. ``Spectral measures of powers of random matrices&apos;&apos;. Electronic Communications in Probability 18, 1 \u2013 13 (2013).","DOI":"10.1214\/ECP.v18-2551"},{"key":"68","unstructured":"Bernhard Baumgartner. ``An inequality for the trace of matrix products, using absolute values&apos;&apos; (2011). arxiv:1106.6189."},{"key":"69","doi-asserted-by":"publisher","unstructured":"Ulrich R\u00fchrmair and Daniel E Holcomb. ``Pufs at a glance&apos;&apos;. In the conference on Design, Automation & Test in Europe. Page 347. European Design and Automation Association (2014).","DOI":"10.7873\/date.2014.360"},{"key":"70","doi-asserted-by":"publisher","unstructured":"Chip-Hong Chang, Yue Zheng, and Le Zhang. ``A retrospective and a look forward: Fifteen years of physical unclonable function advancement&apos;&apos;. IEEE Circuits and Systems Magazine 17, 32\u201362 (2017).","DOI":"10.1109\/mcas.2017.2713305"},{"key":"71","doi-asserted-by":"publisher","unstructured":"Mina Doosti, Niraj Kumar, Mahshid Delavar, and Elham Kashefi. ``Client-server identification protocols with quantum PUF&apos;&apos;. ACM Transactions on Quantum Computing 2, 1\u201340 (2021).","DOI":"10.1145\/3484197"},{"key":"72","doi-asserted-by":"publisher","unstructured":"Mahshid Delavar, Sattar Mirzakuchaki, Mohammad Hassan Ameri, and Javad Mohajeri. ``Puf-based solutions for secure communications in advanced metering infrastructure (ami)&apos;&apos;. International Journal of Communication Systems 30, e3195 (2017).","DOI":"10.1002\/dac.3195"},{"key":"73","doi-asserted-by":"publisher","unstructured":"Ravikanth Pappu, Ben Recht, Jason Taylor, and Neil Gershenfeld. ``Physical one-way functions&apos;&apos;. Science 297, 2026\u20132030 (2002).","DOI":"10.1126\/science.1074376"},{"key":"74","doi-asserted-by":"publisher","unstructured":"Jorge Guajardo, Sandeep S Kumar, Geert-Jan Schrijen, and Pim Tuyls. ``Fpga intrinsic pufs and their use for ip protection&apos;&apos;. In International workshop on cryptographic hardware and embedded systems. Pages 63\u201380. Springer (2007).","DOI":"10.1007\/978-3-540-74735-2_5"},{"key":"75","doi-asserted-by":"publisher","unstructured":"Blaise Gassend, Dwaine Clarke, Marten Van Dijk, and Srinivas Devadas. ``Silicon physical random functions&apos;&apos;. In 9th ACM conference on Computer and communications security. Pages 148\u2013160. ACM (2002).","DOI":"10.1145\/586110.586132"},{"key":"76","doi-asserted-by":"publisher","unstructured":"G Edward Suh and Srinivas Devadas. ``Physical unclonable functions for device authentication and secret key generation&apos;&apos;. In 44th ACM\/IEEE Design Automation Conference. Pages 9\u201314. IEEE (2007).","DOI":"10.1145\/1278480.1278484"},{"key":"77","doi-asserted-by":"publisher","unstructured":"Ulrich R\u00fchrmair, Frank Sehnke, Jan S\u00f6lter, Gideon Dror, Srinivas Devadas, and J\u00fcrgen Schmidhuber. ``Modeling attacks on physical unclonable functions&apos;&apos;. In Proceedings of the 17th ACM conference on Computer and communications security. Pages 237\u2013249. (2010).","DOI":"10.1145\/1866307.1866335"},{"key":"78","doi-asserted-by":"publisher","unstructured":"Fatemeh Ganji, Shahin Tajik, Fabian F\u00e4\u00dfler, and Jean-Pierre Seifert. ``Strong machine learning attack against PUFs with no mathematical model&apos;&apos;. In International Conference on Cryptographic Hardware and Embedded Systems. Pages 391\u2013411. Springer (2016).","DOI":"10.1007\/978-3-662-53140-2_19"},{"key":"79","doi-asserted-by":"publisher","unstructured":"Lars Tebelmann, Michael Pehl, and Vincent Immler. ``Side-channel analysis of the tero PUF&apos;&apos;. In International Workshop on Constructive Side-Channel Analysis and Secure Design. Pages 43\u201360. Springer (2019).","DOI":"10.1007\/978-3-030-16350-1_4"},{"key":"80","doi-asserted-by":"publisher","unstructured":"Mahmoud Khalafalla and Catherine Gebotys. ``PUFs deep attacks: Enhanced modeling attacks using deep learning techniques to break the security of double arbiter PUFs&apos;&apos;. In 2019 Design, Automation & Test in Europe Conference & Exhibition (DATE). Pages 204\u2013209. IEEE (2019).","DOI":"10.23919\/date.2019.8714862"},{"key":"81","unstructured":"Mina Doosti, Mahshid Delavar, Elham Kashefi, and Myrto Arapinis. ``A unified framework for quantum unforgeability&apos;&apos; (2021). arxiv:2103.13994."},{"key":"82","doi-asserted-by":"publisher","unstructured":"Gorjan Alagic, Tommaso Gagliardoni, and Christian Majenz. ``Unforgeable quantum encryption&apos;&apos;. In Jesper Buus Nielsen and Vincent Rijmen, editors, Advances in Cryptology \u2013 EUROCRYPT 2018. Pages 489\u2013519. Cham (2018). Springer International Publishing.","DOI":"10.1007\/978-3-319-78372-7_16"},{"key":"83","doi-asserted-by":"publisher","unstructured":"Ophelia Crawford, Barnaby van Straaten, Daochen Wang, Thomas Parks, Earl Campbell, and Stephen Brierley. ``Efficient quantum measurement of pauli operators in the presence of finite sampling error&apos;&apos;. Quantum 5, 385 (2021).","DOI":"10.22331\/q-2021-01-20-385"}],"container-title":["Quantum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/quantum-journal.org\/papers\/q-2025-05-12-1739\/pdf\/","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,5,12]],"date-time":"2025-05-12T13:59:10Z","timestamp":1747058350000},"score":1,"resource":{"primary":{"URL":"https:\/\/quantum-journal.org\/papers\/q-2025-05-12-1739\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,12]]},"references-count":84,"URL":"https:\/\/doi.org\/10.22331\/q-2025-05-12-1739","archive":["CLOCKSS"],"relation":{},"ISSN":["2521-327X"],"issn-type":[{"value":"2521-327X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,12]]},"article-number":"1739"}}