QRAM: A Survey and Critique

Samuel Jaques; Arthur G. Rattew

doi:10.22331/q-2025-12-02-1922

QRAM: A Survey and Critique

Samuel Jaques^1,2 and Arthur G. Rattew³

¹Department of Combinatorics and Optimization, University of Waterloo, 200 University Ave W, Waterloo, Canada
²Institute for Quantum computing, University of Waterloo, 200 University Ave W, Waterloo Canada
³Department of Materials, University of Oxford, Parks Road, Oxford OX1 3PH, United Kingdom

Published:	2025-12-02, volume 9, page 1922
Editor:	Jin-Peng Liu
Eprint:	arXiv:2305.10310v2
Doi:	https://doi.org/10.22331/q-2025-12-02-1922
Citation:	Quantum 9, 1922 (2025).

Find this paper interesting or want to discuss? Scite or leave a comment on SciRate.

Abstract

Quantum random-access memory (QRAM) is a mechanism to access data (quantum or classical) based on addresses which are themselves a quantum state. QRAM has a long and controversial history, and here we survey and expand arguments and constructions for and against.
We use two primary categories of QRAM from the literature: (1) active, which requires external intervention and control for each QRAM query (e.g. the error-corrected circuit model), and (2) passive, which requires no external input or energy once the query is initiated. In the active model, there is a powerful opportunity cost argument: in many applications, one could repurpose the control hardware for the qubits in the QRAM (or the qubits themselves) to run an extremely parallel classical algorithm to achieve the same results just as fast. We apply these arguments in detail to quantum linear algebra and prove that most asymptotic quantum advantage disappears with active QRAM systems, with some nuance related to the architectural assumptions.
Escaping the constraints of active QRAM requires ballistic computation with passive memory, which creates an array of dubious physical assumptions, which we examine in detail. Considering these details, in everything we could find, all non-circuit QRAM proposals fall short in one aspect or another.
In summary, we conclude that cheap, asymptotically scalable passive QRAM is unlikely with existing proposals, due to fundamental obstacles that we highlight. These obstacles are deeply rooted in the requirements of QRAM, but are not provably inevitable; we hope that our results will help guide research into QRAM technologies that circumvent or mitigate these obstacles. Finally, circuit-based QRAM still helps in many applications, and so we additionally provide a survey of state-of-the-art techniques as a resource for algorithm designers using QRAM.

► BibTeX data

@article{Jaques2025qramsurveycritique,
  doi = {10.22331/q-2025-12-02-1922},
  url = {https://doi.org/10.22331/q-2025-12-02-1922},
  title = {{QRAM}: {A} {S}urvey and {C}ritique},
  author = {Jaques, Samuel and Rattew, Arthur G.},
  journal = {{Quantum}},
  issn = {2521-327X},
  publisher = {{Verein zur F{\"{o}}rderung des Open Access Publizierens in den Quantenwissenschaften}},
  volume = {9},
  pages = {1922},
  month = dec,
  year = {2025}
}

► References

[1] Scott Aaronson. Read the fine print. Nature Physics, 11 (4): 291–293, April 2015. 10.1038/nphys3272.
https://doi.org/10.1038/nphys3272

[2] Martin R. Albrecht and Yixin Shen. Quantum augmented dual attack. Cryptology ePrint Archive, Paper 2022/656, 2022.

[3] Martin R. Albrecht, Vlad Gheorghiu, Eamonn W. Postlethwaite, and John M. Schanck. Estimating quantum speedups for lattice sieves. In Shiho Moriai and Huaxiong Wang, editors, Advances in Cryptology – ASIACRYPT 2020, pages 583–613, Cham, 2020. Springer International Publishing. ISBN 978-3-030-64834-3. https://doi.org/10.1007/978-3-030-64834-3_20.
https://doi.org/10.1007/978-3-030-64834-3_20

[4] AMD. AMD instinct™ MI250X accelerator, 2022. URL https://www.amd.com/en/products/server-accelerators/instinct-mi250x.
https://www.amd.com/en/products/server-accelerators/instinct-mi250x

[5] Srinivasan Arunachalam, Vlad Gheorghiu, Tomas Jochym-O'Connor, Michele Mosca, and Priyaa Varshinee Srinivasan. On the robustness of bucket brigade quantum RAM. New Journal of Physics, 17 (12): 123010, December 2015. 10.1088/1367-2630/17/12/123010.
https://doi.org/10.1088/1367-2630/17/12/123010

[6] Ryo Asaka, Kazumitsu Sakai, and Ryoko Yahagi. Quantum random access memory via quantum walk. Quantum Science and Technology, 6 (3): 035004, 2021. https://doi.org/10.1088/2058-9565/abf484.
https://doi.org/10.1088/2058-9565/abf484

[7] Ryo Asaka, Kazumitsu Sakai, and Ryoko Yahagi. Two-level quantum walkers on directed graphs. ii. application to quantum random access memory. Phys. Rev. A, 107: 022416, Feb 2023. 10.1103/PhysRevA.107.022416.
https://doi.org/10.1103/PhysRevA.107.022416

[8] Ryan Babbush, Craig Gidney, Dominic W. Berry, Nathan Wiebe, Jarrod McClean, Alexandru Paler, Austin Fowler, and Hartmut Neven. Encoding electronic spectra in quantum circuits with linear t complexity. Phys. Rev. X, 8: 041015, Oct 2018. 10.1103/PhysRevX.8.041015.
https://doi.org/10.1103/PhysRevX.8.041015

[9] Ryan Babbush, Jarrod R. McClean, Michael Newman, Craig Gidney, Sergio Boixo, and Hartmut Neven. Focus beyond quadratic speedups for error-corrected quantum advantage. PRX Quantum, 2: 010103, Mar 2021a.
https://doi.org/10.1103/PRXQuantum.2.010103

[10] Ryan Babbush, Jarrod R McClean, Michael Newman, Craig Gidney, Sergio Boixo, and Hartmut Neven. Focus beyond quadratic speedups for error-corrected quantum advantage. PRX Quantum, 2 (1): 010103, 2021b.
https://doi.org/10.1103/PRXQuantum.2.010103

[11] Ainesh Bakshi and Ewin Tang. An Improved Classical Singular Value Transformation for Quantum Machine Learning, pages 2398–2453. 10.1137/1.9781611977912.86.
https://doi.org/10.1137/1.9781611977912.86

[12] Gustavo Banegas, Daniel J. Bernstein, Iggy Van Hoof, and Tanja Lange. Concrete quantum cryptanalysis of binary elliptic curves. IACR Transactions on Cryptographic Hardware and Embedded Systems, pages 451–472, December 2020. 10.46586/tches.v2021.i1.451-472.
https://doi.org/10.46586/tches.v2021.i1.451-472

[13] Robert Beals, Stephen Brierley, Oliver Gray, Aram W. Harrow, Samuel Kutin, Noah Linden, Dan Shepherd, and Mark Stather. Efficient distributed quantum computing. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 469 (2153): 20120686, May 2013. 10.1098/rspa.2012.0686.
https://doi.org/10.1098/rspa.2012.0686

[14] Akrem Benatia, Weixing Ji, Yizhuo Wang, and Feng Shi. Sparse matrix partitioning for optimizing SpMV on CPU-GPU heterogeneous platforms. The International Journal of High Performance Computing Applications, 34 (1): 66–80, November 2019. 10.1177/1094342019886628.
https://doi.org/10.1177/1094342019886628

[15] D. J. Bernstein. Circuits for integer factorization: a proposal, 2001. https://cr.yp.to/papers.html#nfscircuit.
https://cr.yp.to/papers.html#nfscircuit

[16] D. J. Bernstein. Cost analysis of hash collisions: Will quantum computers make sharcs obsolete? Workshop Record of SHARCS’09: Special-purpose Hardware for Attacking Cryptographic Systems, 2009.

[17] Daniel J. Bernstein and Tanja Lange. Non-uniform cracks in the concrete: The power of free precomputation. In Kazue Sako and Palash Sarkar, editors, Advances in Cryptology - ASIACRYPT 2013, pages 321–340, Berlin, Heidelberg, 2013. Springer Berlin Heidelberg. ISBN 978-3-642-42045-0. https://doi.org/10.1007/978-3-642-42045-0_17.
https://doi.org/10.1007/978-3-642-42045-0_17

[18] Daniel J. Bernstein, Stacey Jeffery, Tanja Lange, and Alexander Meurer. Quantum algorithms for the subset-sum problem. In Philippe Gaborit, editor, Post-Quantum Cryptography, pages 16–33, Berlin, Heidelberg, 2013. Springer Berlin Heidelberg. ISBN 978-3-642-38616-9. https://doi.org/10.1007/978-3-642-38616-9_2.
https://doi.org/10.1007/978-3-642-38616-9_2

[19] Dominic W. Berry, Craig Gidney, Mario Motta, Jarrod R. McClean, and Ryan Babbush. Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization. Quantum, 3: 208, December 2019. ISSN 2521-327X. 10.22331/q-2019-12-02-208.
https://doi.org/10.22331/q-2019-12-02-208

[20] Mihir K. Bhaskar, Stuart Hadfield, Anargyros Papageorgiou, and Iasonas Petras. Quantum algorithms and circuits for scientific computing. Quantum Info. Comput., 16 (3–4): 197–236, March 2016. ISSN 1533-7146. https://doi.org/10.26421/qic16.3-4-2.
https://doi.org/10.26421/qic16.3-4-2

[21] Jacob Biamonte, Peter Wittek, Nicola Pancotti, Patrick Rebentrost, Nathan Wiebe, and Seth Lloyd. Quantum machine learning. Nature, 549 (7671): 195–202, 2017. https://doi.org/10.1038/nature23474.
https://doi.org/10.1038/nature23474

[22] G. Bilardi and F.P. Preparata. Horizons of parallel computation. Journal of Parallel and Distributed Computing, 27 (2): 172–182, 1995. ISSN 0743-7315. https://doi.org/10.1006/jpdc.1995.1080.
https://doi.org/10.1006/jpdc.1995.1080

[23] Xavier Bonnetain and André Schrottenloher. Quantum security analysis of CSIDH. In Advances in Cryptology – EUROCRYPT 2020, pages 493–522. Springer International Publishing, 2020. 10.1007/978-3-030-45724-2_17.
https://doi.org/10.1007/978-3-030-45724-2_17

[24] Xavier Bonnetain, André Chailloux, André Schrottenloher, and Yixin Shen. Finding many collisions via reusable quantum walks: Application to lattice sieving. In Advances in Cryptology – EUROCRYPT 2023: 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings, Part V, page 221–251, Berlin, Heidelberg, 2023. Springer-Verlag. ISBN 978-3-031-30588-7. https://doi.org/10.1007/978-3-031-30589-4_8.
https://doi.org/10.1007/978-3-031-30589-4_8

[25] Gilles Brassard, Peter Høyer, and Alain Tapp. Quantum cryptanalysis of hash and claw-free functions. ACM SIGACT News, 28 (2): 14–19, June 1997. 10.1145/261342.261346.
https://doi.org/10.1145/261342.261346

[26] Gilles Brassard, Peter Høyer, Michele Mosca, and Alain Tapp. Quantum amplitude amplification and estimation. Quantum Computation and Information, page 53–74, 2002. ISSN 0271-4132. 10.1090/conm/305/05215. URL http://dx.doi.org/10.1090/conm/305/05215.
https://doi.org/10.1090/conm/305/05215

[27] Benjamin J. Brown, Daniel Loss, Jiannis K. Pachos, Chris N. Self, and James R. Wootton. Quantum memories at finite temperature. Reviews of Modern Physics, 88 (4), November 2016. 10.1103/revmodphys.88.045005.
https://doi.org/10.1103/revmodphys.88.045005

[28] Tom Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah, Jared D Kaplan, Prafulla Dhariwal, Arvind Neelakantan, Pranav Shyam, Girish Sastry, Amanda Askell, Sandhini Agarwal, Ariel Herbert-Voss, Gretchen Krueger, Tom Henighan, Rewon Child, Aditya Ramesh, Daniel Ziegler, Jeffrey Wu, Clemens Winter, Chris Hesse, Mark Chen, Eric Sigler, Mateusz Litwin, Scott Gray, Benjamin Chess, Jack Clark, Christopher Berner, Sam McCandlish, Alec Radford, Ilya Sutskever, and Dario Amodei. Language models are few-shot learners. In H. Larochelle, M. Ranzato, R. Hadsell, M.F. Balcan, and H. Lin, editors, Advances in Neural Information Processing Systems, volume 33, pages 1877–1901. Curran Associates, Inc., 2020.

[29] Arnau Sala Cadellans. A transmon based quantum switch for a quantum random access memory. Master's thesis, Leiden University Faculty of Science, Leiden, Netherlands, 2015.

[30] Yu Cai, Saugata Ghose, Erich F. Haratsch, Yixin Luo, and Onur Mutlu. Error characterization, mitigation, and recovery in flash-memory-based solid-state drives. Proceedings of the IEEE, 105 (9): 1666–1704, 2017. 10.1109/JPROC.2017.2713127.
https://doi.org/10.1109/JPROC.2017.2713127

[31] Aaron Carroll and Gernot Heiser. An analysis of power consumption in a smartphone. In Proceedings of the 2010 USENIX Conference on USENIX Annual Technical Conference, USENIXATC'10, page 21, USA, 2010. USENIX Association.

[32] Tore Vincent Carstens and Dirk Oliver Theis. Note on (active-)qram-style data access as a quantum circuit, 2018. URL https://arxiv.org/abs/1810.10759.
arXiv:1810.10759

[33] André Chailloux and Johanna Loyer. Lattice sieving via quantum random walks. In Mehdi Tibouchi and Huaxiong Wang, editors, Advances in Cryptology – ASIACRYPT 2021, pages 63–91, Cham, 2021. Springer International Publishing. ISBN 978-3-030-92068-5. https://doi.org/10.1007/978-3-030-92068-5_3.
https://doi.org/10.1007/978-3-030-92068-5_3

[34] Jorge Chávez-Saab, Jesús-Javier Chi-Domínguez, Samuel Jaques, and Francisco Rodríguez-Henríquez. The SQALE of CSIDH: sublinear vélu quantum-resistant isogeny action with low exponents. Journal of Cryptographic Engineering, August 2021. 10.1007/s13389-021-00271-w.
https://doi.org/10.1007/s13389-021-00271-w

[35] Kevin C. Chen, Wenhan Dai, Carlos Errando-Herranz, Seth Lloyd, and Dirk Englund. Heralded quantum random access memory in a scalable photonic integrated circuit platform. In Conference on Lasers and Electro-Optics. Optica Publishing Group, 2021. 10.1364/cleo_qels.2021.fth1p.7.
https://doi.org/10.1364/cleo_qels.2021.fth1p.7

[36] Nadiia Chepurko, Kenneth Clarkson, Lior Horesh, Honghao Lin, and David Woodruff. Quantum-inspired algorithms from randomized numerical linear algebra. In International Conference on Machine Learning, pages 3879–3900. PMLR, 2022.

[37] Nai-Hui Chia, András Pal Gilyén, Tongyang Li, Han-Hsuan Lin, Ewin Tang, and Chunhao Wang. Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing quantum machine learning. Journal of the ACM, 69 (5): 1–72, 2022. https://doi.org/10.1145/3549524.
https://doi.org/10.1145/3549524

[38] Charles Q. Choi. The beating heart of the world’s first exascale supercomputer. IEEE Spectrum, 2022. https://spectrum.ieee.org/frontier-exascale-supercomputer.
https://spectrum.ieee.org/frontier-exascale-supercomputer

[39] Carlo Ciliberto, Mark Herbster, Alessandro Davide Ialongo, Massimiliano Pontil, Andrea Rocchetto, Simone Severini, and Leonard Wossnig. Quantum machine learning: a classical perspective. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 474 (2209): 20170551, January 2018. 10.1098/rspa.2017.0551.
https://doi.org/10.1098/rspa.2017.0551

[40] B. David Clader, Alexander M. Dalzell, Nikitas Stamatopoulos, Grant Salton, Mario Berta, and William J. Zeng. Quantum resources required to block-encode a matrix of classical data, 2022.
https://doi.org/10.1109/TQE.2022.3231194

[41] Tim Dettmers, Mike Lewis, Younes Belkada, and Luke Zettlemoyer. Llm.int8(): 8-bit matrix multiplication for transformers at scale. In Proceedings of the 36th International Conference on Neural Information Processing Systems, NIPS '22, Red Hook, NY, USA, 2022. Curran Associates Inc. ISBN 9781713871088.

[42] Laurent El Ghaoui. Inversion error, condition number, and approximate inverses of uncertain matrices. Linear algebra and its applications, 343: 171–193, 2002. https://doi.org/10.1016/S0024-3795(01)00273-7.
https://doi.org/10.1016/S0024-3795(01)00273-7

[43] Richard P. Feynman. Quantum mechanical computers. Optics News, 11 (2): 11–20, Feb 1985. 10.1364/ON.11.2.000011.
https://doi.org/10.1364/ON.11.2.000011

[44] Elias Frantar, Saleh Ashkboos, Torsten Hoefler, and Dan Alistarh. Gptq: Accurate post-training quantization for generative pre-trained transformers. arXiv preprint arXiv:2210.17323, 2022.
arXiv:2210.17323

[45] Craig Gidney. Windowed quantum arithmetic. arXiv:1905.07682, 2019.
arXiv:1905.07682

[46] Craig Gidney. Quantum dictionaries without qram. arXiv:2204.13835, 2022.
arXiv:2204.13835

[47] Craig Gidney and Martin Ekerå. How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits. Quantum, 5: 433, April 2021. ISSN 2521-327X. 10.22331/q-2021-04-15-433.
https://doi.org/10.22331/q-2021-04-15-433

[48] András Gilyén, Seth Lloyd, and Ewin Tang. Quantum-inspired low-rank stochastic regression with logarithmic dependence on the dimension. arXiv preprint arXiv:1811.04909, 2018.
arXiv:1811.04909

[49] András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe. Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pages 193–204, 2019. https://doi.org/10.1145/3313276.3316366.
https://doi.org/10.1145/3313276.3316366

[50] R. Gioiosa. Resilience for extreme scale computing. In Rugged Embedded Systems, pages 123–148. Elsevier, 2017. 10.1016/b978-0-12-802459-1.00005-1.
https://doi.org/10.1016/b978-0-12-802459-1.00005-1

[51] Vittorio Giovannetti, Seth Lloyd, and Lorenzo Maccone. Architectures for a quantum random access memory. Phys. Rev. A, 78: 052310, Nov 2008a. 10.1103/PhysRevA.78.052310.
https://doi.org/10.1103/PhysRevA.78.052310

[52] Vittorio Giovannetti, Seth Lloyd, and Lorenzo Maccone. Quantum random access memory. Phys. Rev. Lett., 100: 160501, Apr 2008b. 10.1103/PhysRevLett.100.160501.
https://doi.org/10.1103/PhysRevLett.100.160501

[53] John T. Godfrey. Binary digital computer, U.S. Patent 3390471A, Jul. 1968.

[54] Google. Cloud TPU documentation: System architecture, 2022. https://cloud.google.com/tpu/docs/system-architecture-tpu-vm.
https://cloud.google.com/tpu/docs/system-architecture-tpu-vm

[55] Ananth Grama, Anshul Gupta, George Karypis, and Vipin Kumar. Introduction to Parallel Computing. Addison Wesley, 2003. ISBN 0-201-64865-2.

[56] J. Alex Halderman, Seth D. Schoen, Nadia Heninger, William Clarkson, William Paul, Joseph A. Calandrino, Ariel J. Feldman, Jacob Appelbaum, and Edward W. Felten. Lest we remember: Cold-boot attacks on encryption keys. Commun. ACM, 52 (5): 91–98, may 2009. ISSN 0001-0782. 10.1145/1506409.1506429.
https://doi.org/10.1145/1506409.1506429

[57] Thomas Häner, Samuel Jaques, Michael Naehrig, Martin Roetteler, and Mathias Soeken. Improved quantum circuits for elliptic curve discrete logarithms. In Post-Quantum Cryptography, pages 425–444. Springer International Publishing, 2020. 10.1007/978-3-030-44223-1_23.
https://doi.org/10.1007/978-3-030-44223-1_23

[58] Connor T. Hann. Practicality of Quantum Random Access Memory. PhD thesis, Yale Graduate School of Arts and Sciences Dissertations, 2021.

[59] Connor T. Hann, Gideon Lee, S.M. Girvin, and Liang Jiang. Resilience of quantum random access memory to generic noise. PRX Quantum, 2 (2), April 2021. 10.1103/prxquantum.2.020311.
https://doi.org/10.1103/prxquantum.2.020311

[60] Aram W. Harrow, Avinatan Hassidim, and Seth Lloyd. Quantum algorithm for linear systems of equations. Phys. Rev. Lett., 103: 150502, Oct 2009. 10.1103/PhysRevLett.103.150502.
https://doi.org/10.1103/PhysRevLett.103.150502

[61] Max Heiser. Improved quantum hypercone locality sensitive filtering in lattice sieving. Cryptology ePrint Archive, Paper 2021/1295, 2021. https://eprint.iacr.org/2021/1295.
https://eprint.iacr.org/2021/1295

[62] Fang-Yu Hong, Yang Xiang, Zhi-Yan Zhu, Li-zhen Jiang, and Liang-neng Wu. Robust quantum random access memory. Phys. Rev. A, 86: 010306, Jul 2012. 10.1103/PhysRevA.86.010306.
https://doi.org/10.1103/PhysRevA.86.010306

[63] Samuel Jaques and John M. Schanck. Quantum cryptanalysis in the RAM model: Claw-finding attacks on SIKE. In Alexandra Boldyreva and Daniele Micciancio, editors, Advances in Cryptology - CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019, Proceedings, Part I, volume 11692 of Lecture Notes in Computer Science, pages 32–61. Springer, 2019. 10.1007/978-3-030-26948-7_2. URL https://doi.org/10.1007/978-3-030-26948-7_2.
https://doi.org/10.1007/978-3-030-26948-7_2

[64] N. Jiang, Y.-F. Pu, W. Chang, C. Li, S. Zhang, and L.-M. Duan. Experimental realization of 105-qubit random access quantum memory. npj Quantum Information, 5 (1), April 2019. 10.1038/s41534-019-0144-0.
https://doi.org/10.1038/s41534-019-0144-0

[65] Jung Jun Park, Kyunghyun Baek, M S Kim, Hyunchul Nha, Jaewan Kim, and Jeongho Bang. T-depth-optimized quantum search with quantum data-access machine. Quantum Science and Technology, 9 (1): 015011, nov 2023. 10.1088/2058-9565/ad04e5. URL https://doi.org/10.1088/2058-9565/ad04e5.
https://doi.org/10.1088/2058-9565/ad04e5

[66] Ghazal Kachigar and Jean-Pierre Tillich. Quantum information set decoding algorithms, 2017. URL arXiv:1703.00263.
arXiv:1703.00263

[67] Dhiraj Kalamkar, Dheevatsa Mudigere, Naveen Mellempudi, Dipankar Das, Kunal Banerjee, Sasikanth Avancha, Dharma Teja Vooturi, Nataraj Jammalamadaka, Jianyu Huang, Hector Yuen, et al. A study of bfloat16 for deep learning training. arXiv preprint arXiv:1905.12322, 2019.
arXiv:1905.12322

[68] Ravindran Kannan and Santosh Vempala. Randomized algorithms in numerical linear algebra. Acta Numerica, 26: 95–135, 2017. 10.1017/S0962492917000058.
https://doi.org/10.1017/S0962492917000058

[69] Iordanis Kerenidis and Anupam Prakash. Quantum recommendation systems. arXiv preprint arXiv:1603.08675, 2016.
arXiv:1603.08675

[70] Elena Kirshanova. Improved quantum information set decoding. In Tanja Lange and Rainer Steinwandt, editors, Post-Quantum Cryptography, pages 507–527, Cham, 2018. Springer International Publishing. ISBN 978-3-319-79063-3. https://doi.org/10.1007/978-3-319-79063-3_24.
https://doi.org/10.1007/978-3-319-79063-3_24

[71] A. Yu. Kitaev, A. Shen, and M. N. Vyalyi. Classical and Quantum Computation. American Mathematical Society, USA, 2002. ISBN 082182161X. http://dx.doi.org/10.1090/gsm/047/31.
https://doi.org/10.1090/gsm/047/31

[72] G. Kuperberg. Another subexponential-time quantum algorithm for the dihedral hidden subgroup problem. In TQC 2013, LIPIcs 22, pages 20–34, 2013. 10.4230/LIPIcs.TQC.2013.20. URL https://doi.org/10.4230/LIPIcs.TQC.2013.20.
https://doi.org/10.4230/LIPIcs.TQC.2013.20

[73] Thijs Laarhoven. Sieving for closest lattice vectors (with preprocessing). In Roberto Avanzi and Howard Heys, editors, Selected Areas in Cryptography – SAC 2016, pages 523–542, Cham, 2017. Springer International Publishing. ISBN 978-3-319-69453-5. https://doi.org/10.1007/978-3-319-69453-5_28.
https://doi.org/10.1007/978-3-319-69453-5_28

[74] Thijs Laarhoven, Michele Mosca, and Joop van de Pol. Finding shortest lattice vectors faster using quantum search. Designs, Codes and Cryptography, 77 (2-3): 375–400, April 2015. 10.1007/s10623-015-0067-5.
https://doi.org/10.1007/s10623-015-0067-5

[75] C. Lecaplain, C. Javerzac-Galy, M. L. Gorodetsky, and T. J. Kippenberg. Mid-infrared ultra-high-q resonators based on fluoride crystalline materials. Nature Communications, 7 (1), November 2016. 10.1038/ncomms13383.
https://doi.org/10.1038/ncomms13383

[76] Lin Lin. Lecture notes on quantum algorithms for scientific computation. arXiv preprint arXiv:2201.08309, 2022.
arXiv:2201.08309

[77] Junyu Liu, Minzhao Liu, Jin-Peng Liu, Ziyu Ye, Yunfei Wang, Yuri Alexeev, Jens Eisert, and Liang Jiang. Towards provably efficient quantum algorithms for large-scale machine-learning models. Nature Communications, 15 (1), January 2024. ISSN 2041-1723. 10.1038/s41467-023-43957-x.
https://doi.org/10.1038/s41467-023-43957-x

[78] Guang Hao Low and Isaac L Chuang. Hamiltonian simulation by qubitization. Quantum, 3: 163, 2019. https://doi.org/10.22331/q-2019-07-12-163.
https://doi.org/10.22331/q-2019-07-12-163

[79] Guang Hao Low, Vadym Kliuchnikov, and Luke Schaeffer. Trading T gates for dirty qubits in state preparation and unitary synthesis, June 2024. ISSN 2521-327X. URL https://doi.org/10.22331/q-2024-06-17-1375.
https://doi.org/10.22331/q-2024-06-17-1375

[80] John M Martyn, Zane M Rossi, Andrew K Tan, and Isaac L Chuang. Grand unification of quantum algorithms. PRX Quantum, 2 (4): 040203, 2021. https://doi.org/10.1103/PRXQuantum.2.040203.
https://doi.org/10.1103/PRXQuantum.2.040203

[81] Olivia Di Matteo, Vlad Gheorghiu, and Michele Mosca. Fault-tolerant resource estimation of quantum random-access memories. IEEE Transactions on Quantum Engineering, 1: 1–13, 2020. 10.1109/TQE.2020.2965803.
https://doi.org/10.1109/TQE.2020.2965803

[82] Vidyabhushan Mohan. Modelling the physical characteristics of NAND flash memory. PhD thesis, School of Engineering and Applied Science, University of Virginia, 2010.

[83] E. S. Moiseev and S. A. Moiseev. Time-bin quantum RAM. Journal of Modern Optics, 63 (20): 2081–2092, May 2016. https://doi.org/https://doi.org/10.6028/NIST.IR.8413.
https://doi.org/10.6028/NIST.IR.8413

[84] Dustin Moody. Status report on the third round of the NIST post-quantum cryptography standardization process. Technical report, National Institute of Standards and Technology, 2022.
https://doi.org/10.6028/NIST.IR.8413

[85] Michele Mosca and Marco Piani. Quantum threat timeline report 2020. Technical report, Global Risk Institute, 2021.

[86] Michael Newman and Yaoyun Shi. Limitations on transversal computation through quantum homomorphic encryption. Quantum Info. Comput., 18 (11–12): 927–948, sep 2018. ISSN 1533-7146. https://doi.org/10.26421/qic18.11-12-3.
https://doi.org/10.26421/qic18.11-12-3

[87] Murphy Yuezhen Niu, Alexander Zlokapa, Michael Broughton, Sergio Boixo, Masoud Mohseni, Vadim Smelyanskyi, and Hartmut Neven. Entangling quantum generative adversarial networks. Phys. Rev. Lett., 128: 220505, Jun 2022. 10.1103/PhysRevLett.128.220505.
https://doi.org/10.1103/PhysRevLett.128.220505

[88] James O'Sullivan, Oscar W. Kennedy, Kamanasish Debnath, Joseph Alexander, Christoph W. Zollitsch, Mantas Šimėnas, Akel Hashim, Christopher N. Thomas, Stafford Withington, Irfan Siddiqi, Klaus Mølmer, and John J. L. Morton. Random-access quantum memory using chirped pulse phase encoding. Phys. Rev. X, 12: 041014, Nov 2022. 10.1103/PhysRevX.12.041014.
https://doi.org/10.1103/PhysRevX.12.041014

[89] Alexandru Paler, Oumarou Oumarou, and Robert Basmadjian. Parallelizing the queries in a bucket-brigade quantum random access memory. Phys. Rev. A, 102: 032608, Sep 2020. 10.1103/PhysRevA.102.032608.
https://doi.org/10.1103/PhysRevA.102.032608

[90] Daniel K. Park, Francesco Petruccione, and June-Koo Kevin Rhee. Circuit-based quantum random access memory for classical data. Scientific Reports, 9 (1), March 2019. 10.1038/s41598-019-40439-3.
https://doi.org/10.1038/s41598-019-40439-3

[91] Fernando Pastawski and Beni Yoshida. Fault-tolerant logical gates in quantum error-correcting codes. Phys. Rev. A, 91: 012305, Jan 2015. 10.1103/PhysRevA.91.012305.
https://doi.org/10.1103/PhysRevA.91.012305

[92] Chris Peikert. He gives c-sieves on the CSIDH. In Advances in Cryptology – EUROCRYPT 2020, pages 463–492. Springer International Publishing, 2020. 10.1007/978-3-030-45724-2_16.
https://doi.org/10.1007/978-3-030-45724-2_16

[93] Koustubh Phalak, Junde Li, and Swaroop Ghosh. Approximate quantum random access memory architectures, 2022. URL https://arxiv.org/abs/2210.14804.
arXiv:2210.14804

[94] Koustubh Phalak, Avimita Chatterjee, and Swaroop Ghosh. Quantum random access memory for dummies. Sensors, 23 (17), 2023. ISSN 1424-8220. 10.3390/s23177462. URL https://www.mdpi.com/1424-8220/23/17/7462.
https://doi.org/10.3390/s23177462
https://www.mdpi.com/1424-8220/23/17/7462

[95] Marco Pistoia, Syed Farhan Ahmad, Akshay Ajagekar, Alexander Buts, Shouvanik Chakrabarti, Dylan Herman, Shaohan Hu, Andrew Jena, Pierre Minssen, Pradeep Niroula, et al. Quantum machine learning for finance ICCAD special session paper. In 2021 IEEE/ACM International Conference On Computer Aided Design (ICCAD), pages 1–9. IEEE, 2021. https://doi.org/10.1109/ICCAD51958.2021.9643469.
https://doi.org/10.1109/ICCAD51958.2021.9643469

[96] Arthur G Rattew and Bálint Koczor. Preparing arbitrary continuous functions in quantum registers with logarithmic complexity. arXiv preprint arXiv:2205.00519, 2022.
arXiv:2205.00519

[97] Patrick Rebentrost, Masoud Mohseni, and Seth Lloyd. Quantum support vector machine for big data classification. Physical review letters, 113 (13): 130503, 2014. https://doi.org/10.1103/PhysRevLett.113.130503.
https://doi.org/10.1103/PhysRevLett.113.130503

[98] Oded Regev and Liron Schiff. Impossibility of a quantum speed-up with a faulty oracle. In Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir, and Igor Walukiewicz, editors, Automata, Languages and Programming, pages 773–781, Berlin, Heidelberg, 2008. Springer Berlin Heidelberg. ISBN 978-3-540-70575-8. https://doi.org/10.1007/978-3-540-70575-8_63.
https://doi.org/10.1007/978-3-540-70575-8_63

[99] Chitwan Saharia, William Chan, Saurabh Saxena, Lala Lit, Jay Whang, Emily Denton, Seyed Kamyar Seyed Ghasemipour, Burcu Karagol Ayan, S. Sara Mahdavi, Raphael Gontijo-Lopes, Tim Salimans, Jonathan Ho, David J Fleet, and Mohammad Norouzi. Photorealistic text-to-image diffusion models with deep language understanding. In Proceedings of the 36th International Conference on Neural Information Processing Systems, NIPS '22, Red Hook, NY, USA, 2022. Curran Associates Inc. ISBN 9781713871088.

[100] John M. Schanck. via Twitter, Jun 2021. https://web.archive.org/web/20220710183049/https://twitter.com/susurrusus/status/1532131390338215937.
https://web.archive.org/web/20220710183049/https://twitter.com/susurrusus/status/1532131390338215937

[101] Bianca Schroeder, Eduardo Pinheiro, and Wolf-Dietrich Weber. Dram errors in the wild: A large-scale field study. Commun. ACM, 54 (2): 100–107, feb 2011. ISSN 0001-0782. 10.1145/1897816.1897844.
https://doi.org/10.1145/1897816.1897844

[102] Claude. E. Shannon. The synthesis of two-terminal switching circuits. The Bell System Technical Journal, 28 (1): 59–98, 1949. 10.1002/j.1538-7305.1949.tb03624.x.
https://doi.org/10.1002/j.1538-7305.1949.tb03624.x

[103] Damien Steiger. Racing in parallel: Quantum versus classical, 2016.

[104] Xiaoming Sun, Guojing Tian, Shuai Yang, Pei Yuan, and Shengyu Zhang. Asymptotically optimal circuit depth for quantum state preparation and general unitary synthesis. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, pages 1–1, 2023. 10.1109/TCAD.2023.3244885.
https://doi.org/10.1109/TCAD.2023.3244885

[105] Richard S Sutton and Andrew G Barto. Reinforcement learning: An introduction. MIT press, 2018.

[106] Ewin Tang. A quantum-inspired classical algorithm for recommendation systems. In Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, pages 217–228, 2019. https://doi.org/10.1145/3313276.3316310.
https://doi.org/10.1145/3313276.3316310

[107] Seiichiro Tani. An improved claw finding algorithm using quantum walk. In Mathematical Foundations of Computer Science 2007, pages 536–547. Springer Berlin Heidelberg, 2007. 10.1007/978-3-540-74456-6_48.
https://doi.org/10.1007/978-3-540-74456-6_48

[108] Tezzaron Semiconductor, January 2004.

[109] W. Tittel, M. Afzelius, T. Chaneliére, R.L. Cone, S. Kröll, S.A. Moiseev, and M. Sellars. Photon-echo quantum memory in solid state systems. Laser & Photonics Reviews, 4 (2): 244–267, 2010. https://doi.org/10.1002/lpor.200810056.
https://doi.org/10.1002/lpor.200810056

[110] Vlatko Vedral, Adriano Barenco, and Artur Ekert. Quantum networks for elementary arithmetic operations. Physical Review A, 54 (1): 147, 1996. https://doi.org/10.1103/PhysRevA.54.147.
https://doi.org/10.1103/PhysRevA.54.147

[111] Zhiling Wang, Zenghui Bao, Yan Li, Yukai Wu, Weizhou Cai, Weiting Wang, Xiyue Han, Jiahui Wang, Yipu Song, Luyan Sun, Hongyi Zhang, and Luming Duan. An ultra-high gain single-photon transistor in the microwave regime. Nature Communications, 13 (1), October 2022. 10.1038/s41467-022-33921-6.
https://doi.org/10.1038/s41467-022-33921-6

[112] Pei Yuan and Shengyu Zhang. Optimal (controlled) quantum state preparation and improved unitary synthesis by quantum circuits with any number of ancillary qubits. Quantum, 7: 956, March 2023. ISSN 2521-327X. 10.22331/q-2023-03-20-956. URL https://doi.org/10.22331/q-2023-03-20-956.
https://doi.org/10.22331/q-2023-03-20-956

[113] X. X. Yuan, J.-J. Ma, P.-Y. Hou, X.-Y. Chang, C. Zu, and L.-M. Duan. Experimental demonstration of a quantum router. Scientific Reports, 5 (1), July 2015. 10.1038/srep12452.
https://doi.org/10.1038/srep12452

[114] Xiao-Ming Zhang, Tongyang Li, and Xiao Yuan. Quantum state preparation with optimal circuit depth: Implementations and applications. Phys. Rev. Lett., 129: 230504, Nov 2022a. https://doi.org/10.1103/PhysRevLett.129.230504.
https://doi.org/10.1103/PhysRevLett.129.230504

[115] Xiao-Ming Zhang, Tongyang Li, and Xiao Yuan. Quantum state preparation with optimal circuit depth: Implementations and applications. Physical Review Letters, 129 (23): 230504, 2022b.
https://doi.org/10.1103/PhysRevLett.129.230504

[116] Darko Zivanovic, Pouya Esmaili Dokht, Sergi Moré, Javier Bartolome, Paul M. Carpenter, Petar Radojković, and Eduard Ayguadé. Dram errors in the field: A statistical approach. In Proceedings of the International Symposium on Memory Systems, MEMSYS '19, page 69–84, New York, NY, USA, 2019. Association for Computing Machinery. ISBN 9781450372060. 10.1145/3357526.3357558.
https://doi.org/10.1145/3357526.3357558

Cited by

[1] Yun-Jie Wang, Tai-Ping Sun, Xi-Ning Zhuang, Xiao-Fan Xu, Huan-Yu Liu, Cheng Xue, Yu-Chun Wu, Zhao-Yun Chen, and Guo-Ping Guo, "Refined criteria for quantum random-access memory error suppression via an efficient large-scale simulator", Physical Review Applied 25 4, 044069 (2026).

[2] Tae-Won Kim and Byung-Soo Choi, "Analysis of quantum primitives for quantum utility", Quantum Information Processing 25 6, 181 (2026).

[3] Almudena Carrera Vazquez and Aleksandros Sobczyk, "Spectral Gaps with Quantum Counting Queries and Oblivious State Preparation", Quantum 10, 2067 (2026).

[4] Laura Lewis, Dar Gilboa, and Jarrod R. McClean, "Quantum advantage for learning shallow neural networks with natural data distributions", Nature Communications 17 1, 1341 (2025).

[5] Connor T. Hann, "Quantum random access memory put to the test", Nature Physics 22 5, 651 (2026).

[6] Joao F. Doriguello, George Giapitzakis, Alessandro Luongo, and Aditya Morolia, Lecture Notes in Computer Science 16491, 3 (2026) ISBN:978-3-032-22694-5.

[7] Francesco Cesa, Hannes Bernien, and Hannes Pichler, "Resource-state quantum RAM for fast and error-correctable queries", Nature Communications 17 1, 7152 (2026).

[8] Simone Perriello, Alessandro Barenghi, and Gerardo Pelosi, Proceedings of the 23rd ACM International Conference on Computing Frontiers 254 (2026) ISBN:9798400725685.

[9] Yuan Liu, Shraddha Singh, Kevin C. Smith, Eleanor Crane, John M. Martyn, Alec Eickbusch, Alexander Schuckert, Richard D. Li, Jasmine Sinanan-Singh, Micheline B. Soley, Takahiro Tsunoda, Isaac L. Chuang, Nathan Wiebe, and Steven M. Girvin, "Hybrid Oscillator-Qubit Quantum Processors: Instruction Set Architectures, Abstract Machine Models, and Applications", PRX Quantum 7 1, 010201 (2026).

[10] Paul Frixons, Valerie Gilchrist, Péter Kutas, Simon-Philipp Merz, Christophe Petit, and Lam L. Pham, Lecture Notes in Computer Science 16541, 633 (2026) ISBN:978-3-032-25290-6.

[11] Alexander M. Dalzell, Sam McArdle, Mario Berta, Przemyslaw Bienias, Chi-Fang Chen, András Gilyén, Connor T. Hann, Michael J. Kastoryano, Emil T. Khabiboulline, Aleksander Kubica, Grant Salton, Samson Wang, and Fernando G. S. L. Brandão, "Quantum algorithms: A survey of applications and end-to-end complexities", arXiv:2310.03011, (2023).

[12] Amira Abbas, Andris Ambainis, Brandon Augustino, Andreas Bärtschi, Harry Buhrman, Carleton Coffrin, Giorgio Cortiana, Vedran Dunjko, Daniel J. Egger, Bruce G. Elmegreen, Nicola Franco, Filippo Fratini, Bryce Fuller, Julien Gacon, Constantin Gonciulea, Sander Gribling, Swati Gupta, Stuart Hadfield, Raoul Heese, Gerhard Kircher, Thomas Kleinert, Thorsten Koch, Georgios Korpas, Steve Lenk, Jakub Marecek, Vanio Markov, Guglielmo Mazzola, Stefano Mensa, Naeimeh Mohseni, Giacomo Nannicini, Corey O'Meara, Elena Peña Tapia, Sebastian Pokutta, Manuel Proissl, Patrick Rebentrost, Emre Sahin, Benjamin C. B. Symons, Sabine Tornow, Víctor Valls, Stefan Woerner, Mira L. Wolf-Bauwens, Jon Yard, Sheir Yarkoni, Dirk Zechiel, Sergiy Zhuk, and Christa Zoufal, "Challenges and opportunities in quantum optimization", Nature Reviews Physics 6 12, 718 (2024).

[13] Dylan Herman, Cody Googin, Xiaoyuan Liu, Yue Sun, Alexey Galda, Ilya Safro, Marco Pistoia, and Yuri Alexeev, "Quantum computing for finance", Nature Reviews Physics 5 8, 450 (2023).

[14] Shuchen Zhu, Aarthi Sundaram, and Guang Hao Low, "Unified architecture for quantum lookup tables", Physical Review Research 7 4, 043230 (2025).

[15] Naixu Guo, Zhan Yu, Matthew Choi, Yizhan Han, Aman Agrawal, Kouhei Nakaji, Alán Aspuru-Guzik, and Patrick Rebentrost, "Quantum Transformer: Accelerating model inference via quantum linear algebra", arXiv:2402.16714, (2024).

[16] Mauro E. S. Morales, Lirandë Pira, Philipp Schleich, Kelvin Koor, Pedro C. S. Costa, Dong An, Alán Aspuru-Guzik, Lin Lin, Patrick Rebentrost, and Dominic W. Berry, "Quantum linear system solvers: A survey of algorithms and applications", Reviews of Modern Physics 98 2, 025005 (2026).

[17] Felix Tennie, Sylvain Laizet, Seth Lloyd, and Luca Magri, "Quantum computing for nonlinear differential equations and turbulence", Nature Reviews Physics 7 4, 220 (2025).

[18] Hsin-Yuan Huang, Soonwon Choi, Jarrod R. McClean, and John Preskill, "Vast World of Quantum Advantage", Physical Review X 16 3, 030501 (2026).

[19] Koichi Miyamoto, Soichiro Yamazaki, Fumio Uchida, Kotaro Fujisawa, and Naoki Yoshida, "Quantum algorithm for the Vlasov simulation of the large-scale structure formation with massive neutrinos", Physical Review Research 6 1, 013200 (2024).

[20] Arthur G. Rattew and Patrick Rebentrost, "Non-Linear Transformations of Quantum Amplitudes: Exponential Improvement, Generalization, and Applications", arXiv:2309.09839, (2023).

[21] Chenxu Liu, Meng Wang, Samuel A. Stein, Yufei Ding, and Ang Li, "Quantum Memory: A Missing Piece in Quantum Computing Units", arXiv:2309.14432, (2023).

[22] R. Au-Yeung, B. Camino, O. Rathore, and V. Kendon, "Quantum algorithms for scientific computing", Reports on Progress in Physics 87 11, 116001 (2024).

[23] Yuri Alexeev, Maximilian Amsler, Paul Baity, Marco Antonio Barroca, Sanzio Bassini, Torey Battelle, Daan Camps, David Casanova, Young Jai Choi, Frederic T. Chong, Charles Chung, Chris Codella, Antonio D. Corcoles, James Cruise, Alberto Di Meglio, Jonathan Dubois, Ivan Duran, Thomas Eckl, Sophia Economou, Stephan Eidenbenz, Bruce Elmegreen, Clyde Fare, Ismael Faro, Cristina Sanz Fernández, Rodrigo Neumann Barros Ferreira, Keisuke Fuji, Bryce Fuller, Laura Gagliardi, Giulia Galli, Jennifer R. Glick, Isacco Gobbi, Pranav Gokhale, Salvador de la Puente Gonzalez, Johannes Greiner, Bill Gropp, Michele Grossi, Emanuel Gull, Burns Healy, Benchen Huang, Travis S. Humble, Nobuyasu Ito, Artur F. Izmaylov, Ali Javadi-Abhari, Douglas Jennewein, Shantenu Jha, Liang Jiang, Barbara Jones, Wibe Albert de Jong, Petar Jurcevic, William Kirby, Stefan Kister, Masahiro Kitagawa, Joel Klassen, Katherine Klymko, Kwangwon Koh, Masaaki Kondo, Doga Murat Kurkcuoglu, Krzysztof Kurowski, Teodoro Laino, Ryan Landfield, Matt Leininger, Vicente Leyton-Ortega, Ang Li, Meifeng Lin, Junyu Liu, Nicolas Lorente, Andre Luckow, Simon Martiel, Francisco Martin-Fernandez, Margaret Martonosi, Claire Marvinney, Arcesio Castaneda Medina, Dirk Merten, Antonio Mezzacapo, Kristel Michielsen, Abhishek Mitra, Tushar Mittal, Kyungsun Moon, Joel Moore, Mario Motta, Young-Hye Na, Yunseong Nam, Prineha Narang, Yu-ya Ohnishi, Daniele Ottaviani, Matthew Otten, Scott Pakin, Vincent R. Pascuzzi, Ed Penault, Tomasz Piontek, Jed Pitera, Patrick Rall, Gokul Subramanian Ravi, Niall Robertson, Matteo Rossi, Piotr Rydlichowski, Hoon Ryu, Georgy Samsonidze, Mitsuhisa Sato, Nishant Saurabh, Vidushi Sharma, Kunal Sharma, Soyoung Shin, George Slessman, Mathias Steiner, Iskandar Sitdikov, In-Saeng Suh, Eric Switzer, Wei Tang, Joel Thompson, Synge Todo, Minh Tran, Dimitar Trenev, Christian Trott, Huan-Hsin Tseng, Esin Tureci, David García Valinas, Sofia Vallecorsa, Christopher Wever, Konrad Wojciechowski, Xiaodi Wu, Shinjae Yoo, Nobuyuki Yoshioka, Victor Wen-zhe Yu, Seiji Yunoki, Sergiy Zhuk, and Dmitry Zubarev, "Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions", arXiv:2312.09733, (2023).

[24] Jonathan Allcock, Jinge Bao, Joao F. Doriguello, Alessandro Luongo, and Miklos Santha, "Constant-depth circuits for Boolean functions and quantum memory devices using multi-qubit gates", Quantum 8, 1530 (2024).

[25] Zhao-Yun Chen, Teng-Yang Ma, Chuang-Chao Ye, Liang Xu, Wen Bai, Lei Zhou, Ming-Yang Tan, Xi-Ning Zhuang, Xiao-Fan Xu, Yun-Jie Wang, Tai-Ping Sun, Yong Chen, Lei Du, Liang-Liang Guo, Hai-Feng Zhang, Hao-Ran Tao, Tian-Le Wang, Xiao-Yan Yang, Ze-An Zhao, Peng Wang, Sheng Zhang, Ren-Ze Zhao, Chi Zhang, Zhi-Long Jia, Wei-Cheng Kong, Meng-Han Dou, Jun-Chao Wang, Huan-Yu Liu, Cheng Xue, Peng-Jun-Yi Zhang, Sheng-Hong Huang, Peng Duan, Yu-Chun Wu, and Guo-Ping Guo, "Enabling large-scale and high-precision fluid simulations on near-term quantum computers", Computer Methods in Applied Mechanics and Engineering 432, 117428 (2024).

[26] Renato M. S. Farias, Thiago O. Maciel, Giancarlo Camilo, Ruge Lin, Sergi Ramos-Calderer, and Leandro Aolita, "Quantum encoder for fixed-Hamming-weight subspaces", Physical Review Applied 23 4, 044014 (2025).

[27] Arjan Cornelissen, Joao F. Doriguello, Alessandro Luongo, and Ewin Tang, "Do you know what q-means?", arXiv:2308.09701, (2023).

[28] Zhenning Liu, Xiantao Li, Chunhao Wang, and Jin-Peng Liu, "Toward end-to-end quantum simulation for protein dynamics", arXiv:2411.03972, (2024).

[29] Joao F. Doriguello, George Giapitzakis, Alessandro Luongo, and Aditya Morolia, "On the practicality of quantum sieving algorithms for the shortest vector problem", arXiv:2410.13759, (2024).

[30] Hsin-Yuan Huang, Michael Broughton, Norhan Eassa, Hartmut Neven, Ryan Babbush, and Jarrod R. McClean, "Generative quantum advantage for classical and quantum problems", arXiv:2509.09033, (2025).

[31] Aurora Maurizio and Guglielmo Mazzola, "Quantum Computing for Genomics: Conceptual Challenges and Practical Perspectives", PRX Life 3 4, 047001 (2025).

[32] Rui Mao, Guojing Tian, and Xiaoming Sun, "Toward optimal circuit size for sparse quantum state preparation", Physical Review A 110 3, 032439 (2024).

[33] Shifan Xu, Connor T. Hann, Ben Foxman, Steven M. Girvin, and Yongshan Ding, "Systems Architecture for Quantum Random Access Memory", arXiv:2306.03242, (2023).

[34] D. K. Weiss, Shruti Puri, and S. M. Girvin, "Quantum Random Access Memory Architectures Using 3D Superconducting Cavities", PRX Quantum 5 2, 020312 (2024).

[35] Sam McArdle, Alexander M. Dalzell, Aleksander Kubica, and Fernando G. S. L. Brandão, "The Fast for the Curious: How to accelerate fault-tolerant quantum applications", arXiv:2510.26078, (2025).

[36] Ramon Antonio Rodriges Zalipynis, "Quantum Tensor DBMS and Quantum Gantt Charts: Towards Exponentially Faster Earth Data Engineering", Earth 5 3, 491 (2024).

[37] Xiao-Ming Zhang and Xiao Yuan, "Circuit complexity of quantum access models for encoding classical data", npj Quantum Information 10 1, 42 (2024).

[38] Zhaoyou Wang, Hong Qiao, Andrew N. Cleland, and Liang Jiang, "Quantum Random Access Memory with Transmon-Controlled Phonon Routing", Physical Review Letters 134 21, 210601 (2025).

[39] Sebastiano Corli, Lorenzo Moro, Daniele Dragoni, Massimiliano Dispenza, and Enrico Prati, "Quantum machine learning algorithms for anomaly detection: A review", arXiv:2408.11047, (2024).

[40] Anton S. Albino, Lucas Q. Galvão, Mauro Q. Nooblath Neto, Ethan Hansen, and Clebson Cruz, "Quantum Algorithm for Finding Minimum Values in a Quantum Random Access Memory", Brazilian Journal of Physics 55 6, 284 (2025).

[41] Joao F. Doriguello, Debbie Lim, Chi Seng Pun, Patrick Rebentrost, and Tushar Vaidya, "Quantum Algorithms for the Pathwise Lasso", arXiv:2312.14141, (2023).

[42] Alexander M. Dalzell, András Gilyén, Connor T. Hann, Sam McArdle, Grant Salton, Quynh T. Nguyen, Aleksander Kubica, and Fernando G. S. L. Brandão, "A distillation-teleportation protocol for fault-tolerant QRAM", arXiv:2505.20265, (2025).

[43] Taehee Ko and Sungbin Lim, "Analytic and Stochastic Approach to Quantum Advantages in Ground State and Quantum State Preparation Problems", arXiv:2510.01563, (2025).

[44] Sheng Zhang, Yun-Jie Wang, Peng Wang, Ren-Ze Zhao, Xiao-Yan Yang, Ze-An Zhao, Tian-Le Wang, Hai-Feng Zhang, Zhi-Fei Li, Yuan Wu, Hao-Ran Tao, Liang-Liang Guo, Lei Du, Chi Zhang, Zhi-Long Jia, Wei-Cheng Kong, Zhuo-Zhi Zhang, Xiang-Xiang Song, Yu-Chun Wu, Zhao-Yun Chen, Peng Duan, and Guo-Ping Guo, "Demonstrating Coherent Quantum Routers for Bucket-Brigade Quantum Random Access Memory on a Superconducting Processor", arXiv:2505.13958, (2025).

[45] Rohan Mehta, Gideon Lee, and Liang Jiang, "Analysis and Suppression of Errors in Quantum Random Access Memory under Extended Noise Models", arXiv:2412.10318, (2024).

[46] Niraj Kumar, Romina Yalovetzky, Changhao Li, Pierre Minssen, and Marco Pistoia, "Des-q: a quantum algorithm to provably speedup retraining of decision trees", arXiv:2309.09976, (2023).

[47] Su Yeon Chang and M. Cerezo, "A Primer on Quantum Machine Learning", arXiv:2511.15969, (2025).

[48] Arthur G. Rattew, Po-Wei Huang, Naixu Guo, Lirandë Pira, and Patrick Rebentrost, "Accelerating Inference for Multilayer Neural Networks with Quantum Computers", arXiv:2510.07195, (2025).

[49] Giacomo Nannicini, "Quantum algorithms for optimizers", arXiv:2408.07086, (2024).

[50] Pengcheng Liao, Barry C. Sanders, and Tim Byrnes, "Quadratic quantum speedup for perceptron training", Physical Review A 110 6, 062412 (2024).

[51] Zhu Sun, Gregory Boyd, Zhenyu Cai, Hamza Jnane, Bálint Koczor, Richard Meister, Romy Minko, Benjamin Pring, Simon C. Benjamin, and Nikitas Stamatopoulos, "Low-depth phase oracle using a parallel piecewise circuit", Physical Review A 111 6, 062420 (2025).

[52] Linyun Cao and Youle Wang, "Quantum kernel method for learning graph data via quantum walk", Physical Review A 112 4, 042408 (2025).

[53] William J. Huggins, Tanuj Khattar, and Nathan Wiebe, "Productionizing Quantum Mass Production", arXiv:2506.00132, (2025).

[54] Tae-Won Kim and Byung-Soo Choi, "Dequantizability from inputs", arXiv:2405.13273, (2024).

[55] Anna Bernasconi, Alessandro Berti, Gianna Maria del Corso, and Alessandro Poggiali, "Quantum Subroutine for Efficient Matrix Multiplication", IEEE Access 12, 116274 (2024).

[56] Frederik F. Flöther, Jan Mikolon, and Maria Longobardi, "Accelerating the drive towards energy-efficient generative AI with quantum computing algorithms", Quantum Science and Technology 10 4, 040501 (2025).

[57] Alessandro Luongo and Changpeng Shao, "Quantum algorithms for spectral sums", arXiv:2011.06475, (2020).

[58] Yun-Jie Wang, Sheng Zhang, Tai-Ping Sun, Ze-An Zhao, Xiao-Fan Xu, Xi-Ning Zhuang, Huan-Yu Liu, Cheng Xue, Peng Duan, Yu-Chun Wu, Zhao-Yun Chen, and Guo-Ping Guo, "Hardware-Efficient Quantum Random Access Memory Design with a Native Gate Set on Superconducting Platforms", arXiv:2306.10250, (2023).

[59] Guangyi Li, Yu Gan, Zeguan Wu, Xueyue Zhang, Zheshen Zhang, and Junyu Liu, "Stab-QRAM: A Clifford-Only Quantum Oracle for Affine Boolean Data", arXiv:2509.26494, (2025).

[60] Till Appel, Zofia Binczyk, Francesco Conoscenti, Petr Ivashkov, Seyed Ali Hosseini, Ricardo Garcia, and Carmen Recio, "Linearization Scheme of Shallow Water Equations for Quantum Algorithms", arXiv:2506.22345, (2025).

[61] Yannick Strocka, Mohamed Belhassen, Tim Schröder, and Gregor Pieplow, "Software Framework for Optically Accessible Quantum Memory Using Group-IV Color Centers in Diamond", arXiv:2510.07045, (2025).

[62] Giuseppe De Riso, Giuseppe Catalano, Seth Lloyd, Vittorio Giovannetti, and Dario De Santis, "A resource-efficient quantum-walker Quantum RAM", arXiv:2508.02855, (2025).

[63] Dominic Lowe, M. S. Kim, and Roberto Bondesan, "Assessing Quantum Advantage for Gaussian Process Regression", arXiv:2505.22502, (2025).

[64] Mingsheng Ying and Zhicheng Zhang, "Quantum Recursive Programming with Quantum Case Statements", arXiv:2311.01725, (2023).

[65] Ákos Nagy and Cindy Zhang, "Novel oracle constructions for quantum random access memory", arXiv:2405.20225, (2024).

[66] Mingsheng Ying and Zhicheng Zhang, "Verification of Recursively Defined Quantum Circuits", arXiv:2404.05934, (2024).

[67] Zhicheng Zhang and Mingsheng Ying, "Quantum Register Machine: Efficient Implementation of Quantum Recursive Programs", arXiv:2408.10054, (2024).

[68] Andris Ambainis and Debbie Lim, "Quantum Algorithm for Apprenticeship Learning", arXiv:2507.07492, (2025).

[69] D. K. Weiss, Shifan Xu, Shruti Puri, Yongshan Ding, and S. M. Girvin, "Faulty towers: recovering a functioning quantum random access memory in the presence of defective routers", arXiv:2411.15612, (2024).

[70] Simon Apers, Arjan Cornelissen, and Samson Wang, "Randomized and quantum approximate matrix multiplication", arXiv:2510.08509, (2025).

[71] Hans Gundlach, Hrvoje Kukina, Jayson Lynch, and Neil Thompson, "Quantum Deep Learning Still Needs a Quantum Leap", arXiv:2511.01253, (2025).

[72] Ansh Singal and Kaitlin N. Smith, "Heterogeneously error-corrected QRAMs", arXiv:2504.21687, (2025).

[73] George Woodman, Ruben S. Andrist, Thomas Häner, Damian S. Steiger, Martin J. A. Schuetz, Helmut G. Katzgraber, and Marcin Detyniecki, "Modern Computational Methods in Reinsurance Optimization: From Simulated Annealing to Quantum Branch & Bound", arXiv:2504.16530, (2025).

[74] Shifan Xu, Alvin Lu, and Yongshan Ding, "Fat-Tree QRAM: A High-Bandwidth Shared Quantum Random Access Memory for Parallel Queries", arXiv:2502.06767, (2025).

[75] Po-Wei Huang and Patrick Rebentrost, "Quantum algorithm for large-scale market equilibrium computation", arXiv:2405.13788, (2024).

[76] Andris Ambainis, Joao F. Doriguello, and Debbie Lim, "A Bit of Freedom Goes a Long Way: Classical and Quantum Algorithms for Reinforcement Learning under a Generative Model", arXiv:2507.22854, (2025).

[77] Lucas Q. Galvão, Anna Beatriz M. de Souza, Alexandre Oliveira S. Santos, André Saimon S. Sousa, and Clebson Cruz, "Solving Linear Systems of Equations with the Quantum HHL Algorithm: A Tutorial on the Physical and Mathematical Foundations for Undergraduate Students", arXiv:2509.16640, (2025).

[78] Susanna Caroppo, Jevgēnijs Vihrovs, Dārta Zajakina, and Aleksejs Zajakins, "Quantum Time-Space Tradeoffs for Exponential Dynamic Programming", arXiv:2604.02233, (2026).

[79] S. E. Bootsma and M. De Vries, "A Survey on the Quantum Security of Block Cipher-Based Cryptography", IEEE Access 12, 194711 (2024).

[80] Joao F. Doriguello, Debbie Lim, Chi Seng Pun, Patrick Rebentrost, and Tushar Vaidya, "Quantum Algorithms for the Pathwise Lasso", Quantum 9, 1674 (2025).

[81] Alessandro Berti and Francesco Ghisoni, "Efficient Quantum State Preparation with Bucket Brigade QRAM", arXiv:2510.16149, (2025).

[82] Tuyen Nguyen, Mária Kieferová, and Amira Abbas, "On Quantum Learning Advantage Under Symmetries", arXiv:2602.02008, (2026).

[83] Neeshu Rathi and Sanjeev Kumar, "A Quantum Bagging Algorithm with Unsupervised Base Learners for Label Corrupted Datasets", arXiv:2509.07040, (2025).

[84] Minkyu Kim and Panjin Kim, "Assessing the feasibility of quantum learning algorithms for noisy linear problems", Scientific Reports 14 1, 29160 (2024).

[85] Pradeep Lamichhane and Danda B. Rawat, "Bits to Qubits: A Comparative Study of Memory Management in Classical and Quantum Systems", IEEE Access 13, 187477 (2025).

[86] Omer Rathore, Alastair Basden, Nicholas Chancellor, and Halim Kusumaatmaja, "Encoding strategies for quantum enhanced fluid simulations: opportunities and challenges", arXiv:2604.24694, (2026).

[87] Niraj Kumar, Romina Yalovetzky, Changhao Li, Pierre Minssen, and Marco Pistoia, "Des-q: a quantum algorithm to provably speedup retraining of decision trees", Quantum 9, 1588 (2025).

[88] Giacomo Lancellotti, Simone Perriello, Alessandro Barenghi, and Gerardo Pelosi, "Solving the Subset Sum Problem via Quantum Walk Search", IEEE Transactions on Computers 75 1, 164 (2026).

[89] Alessandro Berti and Francesco Ghisoni, "Efficient Complex-Valued State Preparation on Bucket Brigade QRAM", arXiv:2604.25644, (2026).

[90] Karoliina Oksanen, Quan Hoang, and Alexandru Paler, "Medusa: Detecting and Removing Failures for Scalable Quantum Computing", arXiv:2511.16289, (2025).

[91] Robert Malaney, "Packet Routing for the Quantum Internet", arXiv:2607.06075, (2026).

The above citations are from Crossref's cited-by service (last updated successfully 2026-08-17 15:09:37) and SAO/NASA ADS (last updated successfully 2026-08-17 15:09:38). The list may be incomplete as not all publishers provide suitable and complete citation data.

This Paper is published in Quantum under the Creative Commons Attribution 4.0 International (CC BY 4.0) license. Copyright remains with the original copyright holders such as the authors or their institutions.