Aaronson, S. (2015). Read the fine print. Nat. Phys., 11, 291–293. doi:10.1038/nphys3272.CrossRefGoogle Scholar

Aaronson, S. (2018). Shadow tomography of quantum states. Pages 325–338 of: STOC. doi:10.1145/3188745.3188802. arXiv:1711.01053.CrossRefGoogle Scholar

Aaronson, S. (2021). Open problems related to quantum query complexity. ACM Trans. Quantum Comput., 2. doi:10.1145/3488559. arXiv:2109.06917.CrossRefGoogle Scholar

Aaronson, S., and Gottesman, D. (2004). Improved simulation of stabilizer circuits. Phys. Rev. A, 70, 052328. doi:10.1103/PhysRevA.70.052328. arXiv:quant-ph/0406196.CrossRefGoogle Scholar

Aaronson, S., Chen, X., Hazan, E., et al. (2019). Online learning of quantum states. J. Stat. Mech. Theory Exp., 2019, 124019. doi:10.1088/1742-5468/ab3988. arXiv:1802.09025.CrossRefGoogle Scholar

Abbas, A., Ambainis, A., Augustino, B., et al. (2024). Challenges and opportunities in quantum optimization. Nat. Rev. Phys., 6, 718–735. doi:10.1038/s42254-024-00770-9. arXiv:2312.02279.CrossRefGoogle Scholar

Adachi, S. H., and Henderson, M. P. (2015). Application of quantum annealing to training of deep neural networks. arXiv:1510.06356.Google Scholar

Aggarwal, D., Brennen, G., Lee, T., et al. (2018). Quantum attacks on bitcoin, and how to protect against them. Ledger, 3. doi:10.5195/ledger.2018.127. arXiv:1710.10377.CrossRefGoogle Scholar

Agrawal, A. A., Wilson, T. L., Saadatmand, S., et al. (2024). Quantifying fault tolerant simulation of strongly correlated systems using the Fermi–Hubbard model. arXiv:2406.06511.Google Scholar

Aharonov, D., and Ben-Or, M. (2008). Fault-tolerant quantum computation with constant error rate. SIAM J. Comp., 38, 1207–1282. doi:10.1137/S0097539799359385. Earlier version in STOC’97. arXiv:quant-ph/9906129.CrossRefGoogle Scholar

Aharonov, D., and Ta-Shma, A. (2007). Adiabatic quantum state generation. SIAM J. Comp., 37, 47–82. doi:10.1137/060648829. Earlier version in STOC’03. arXiv:quant-ph/0301023.CrossRefGoogle Scholar

Aharonov, D., Ben-Or, M., Impagliazzo, R., and Nisan, N. (1996). Limitations of noisy reversible computation. arXiv:quant-ph/9611028.Google Scholar

Akhalwaya, I. Y., Ubaru, S., Clarkson, K. L., et al. (2022). Exponential advantage on noisy quantum computers. arXiv:2209.09371.Google Scholar

Akhalwaya, I. Y., Connolly, A., Guichard, R., et al. (2023). A modular engine for quantum Monte Carlo integration. arXiv:2308.06081.Google Scholar

Alagic, G., Apon, D., Cooper, D., et al. (2022). Status report on the third round of the NIST post-quantum cryptography standardization process. Tech. rept. NISTIR 8413. National Institute of Standards and Technology, Gaithersburg, MD. doi:10.6028/NIST.IR.8413-upd1.Google Scholar

Albash, T., and Lidar, D. A. (2018). Adiabatic quantum computation. Rev. Mod. Phys., 90, 015002. doi:10.1103/RevModPhys.90.015002. arXiv:1611.04471.CrossRefGoogle Scholar

Albert, V. V., and Faist, P. (eds). (2024). The error correction zoo. https://errorcorrectionzoo.org/, accessed: 2024-12-01.Google Scholar

Alexis, M., Lin, L., Mnatsakanyan, G., et al. (2024). Infinite quantum signal processing for arbitrary Szegő functions. arXiv:2407.05634.Google Scholar

Alexis, M., Mnatsakanyan, G., and Thiele, C. (2024). Quantum signal processing and nonlinear Fourier analysis. Rev. Mat. Complut., 37, 655–694. doi:10.1007/s13163-024-00494-5. arXiv:2310.12683.CrossRefGoogle Scholar

Aliferis, P., Gottesman, D., and Preskill, J. (2006). Quantum accuracy threshold for concatenated distance-3 codes. Quantum Inf. Comput., 6, 97–165. doi:10.26421/QIC6.2-1. arXiv:quant-ph/0504218.Google Scholar

Aliferis, P., Gottesman, D., and Preskill, J. (2008). Accuracy threshold for postselected quantum computation. Quantum Inf. Comput., 8, 181–244. doi:10.26421/QIC8.3-4-1. arXiv:quant-ph/0703264.Google Scholar

Altaisky, M. (2001). Quantum neural network. arXiv:quant-ph/0107012.Google Scholar

Altshuler, B., Krovi, H., and Roland, J. (2010). Anderson localization makes adiabatic quantum optimization fail. Proc. Natl. Acad. Sci., 107, 12446–12450. doi:10.1073/pnas.1002116107. arXiv:0912.0746.CrossRefGoogle ScholarPubMed

Ambainis, A. (2004). Quantum search algorithms. SIGACT News, 35, 22–35. doi:10.1145/992287.992296. arXiv:quant-ph/0504012.CrossRefGoogle Scholar

Ambainis, A. (2007). Quantum walk algorithm for element distinctness. SIAM J. Comp., 37, 210–239. doi:10.1137/S0097539705447311. Earlier version in FOCS’04. arXiv:quant-ph/0311001.CrossRefGoogle Scholar

Ambainis, A. (2012). Variable time amplitude amplification and quantum algorithms for linear algebra problems. Pages 636–647 of: STACS. doi:10.4230/LIPIcs.STACS.2012.636. arXiv:1010.4458.CrossRefGoogle Scholar

Ambainis, A., and Kokainis, M. (2017). Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games. Pages 989–1002 of: STOC. doi:10.1145/3055399.3055444. arXiv:1704.06774.CrossRefGoogle Scholar

Ambainis, A., Balodis, K., Iraids, J., et al. (2019). Quantum speedups for exponential-time dynamic programming algorithms. Pages 1783–1793 of: SODA. doi:10.1137/1.9781611975482.107. arXiv:2104.14384.CrossRefGoogle Scholar

Ambainis, A., Kokainis, M., and Vihrovs, J. (2023). Improved algorithm and lower bound for variable time quantum search. arXiv:2302.06749.Google Scholar

Amin, M. H., Andriyash, E., Rolfe, J., et al. (2018). Quantum Boltzmann machine. Phys. Rev. X, 8, 021050. doi:10.1103/PhysRevX.8.021050. arXiv:1601.02036.Google Scholar

An, D., and Lin, L. (2022). Quantum linear system solver based on timeoptimal adiabatic quantum computing and quantum approximate optimization algorithm. ACM Trans. Quantum Comput., 3. doi:10.1145/3498331. arXiv:1909.05500.CrossRefGoogle Scholar

An, D., and Trivisa, K. (2023). Quantum algorithms for linear and non-linear fractional reaction–diffusion equations. arXiv:2310.18900.Google Scholar

An, D., Linden, N., Liu, J.-P., et al. (2021). Quantum-accelerated multilevel Monte Carlo methods for stochastic differential equations in mathematical finance. Quantum, 5, 481. doi:10.22331/q-2021-06-24-481. arXiv:2012.06283.CrossRefGoogle Scholar

An, D., Fang, D., and Lin, L. (2021). Time-dependent unbounded Hamiltonian simulation with vector norm scaling. Quantum, 5, 459. doi:10.22331/q-2021-05-26-459. arXiv:2012.13105.CrossRefGoogle Scholar

An, D., Liu, J.-P., Wang, D., and Zhao, Q. (2022). A theory of quantum differential equation solvers: Limitations and fast-forwarding. arXiv:2211.05246.Google Scholar

An, D., Liu, J.-P., and Lin, L. (2023). Linear combination of Hamiltonian simulation for nonunitary dynamics with optimal state preparation cost. Phys. Rev. Lett., 131, 150603. doi:10.1103/PhysRevLett.131.150603. arXiv:2303.01029.CrossRefGoogle ScholarPubMed

An, D., Childs, A. M., and Lin, L. (2023). Quantum algorithm for linear non-unitary dynamics with near-optimal dependence on all parameters. arXiv:2312.03916.Google Scholar

Andersen, E. D., and Andersen, K. D. (2000). The Mosek interior point optimizer for linear programming: An implementation of the homogeneous algorithm. Pages 197–232 of: High Performance Optimization. doi:10.1007/978-1-4757-3216-0_8.CrossRefGoogle Scholar

Anschuetz, E., Olson, J., Aspuru-Guzik, A., and Cao, Y. (2019). Variational quantum factoring. Pages 74–85 of: Quantum Technology and Optimization Problems. doi:10.1007/978-3-030-14082-3_7. arXiv:1808.08927.CrossRefGoogle Scholar

Anschuetz, E. R., and Cao, Y. (2019). Realizing quantum Boltzmann machines through eigenstate thermalization. arXiv:1903.01359.Google Scholar

Anschuetz, E. R., and Kiani, B. T. (2022). Quantum variational algorithms are swamped with traps. Nat. Commun., 13, 7760. doi:10.1038/s41467-022-35364-5. arXiv:2205.05786.CrossRefGoogle ScholarPubMed

Anwar, H., Brown, B. J., Campbell, E. T., and Browne, D. E. (2014). Fast decoders for qudit topological codes. New J. Phys., 16, 063038. doi:10.1088/1367-2630/16/6/063038. arXiv:1311.4895.CrossRefGoogle Scholar

Aoki, H., Tsuji, N., Eckstein, M., et al. (2014). Nonequilibrium dynamical mean-field theory and its applications. Rev. Mod. Phys., 86, 779–837. doi:10.1103/RevModPhys.86.779. arXiv:1310.5329.CrossRefGoogle Scholar

Aoki, Y., Blum, T., Colangelo, G., et al. (2022). FLAG review 2021. Eur. Phys. J. C, 82, 869. arXiv:2111.09849.CrossRefGoogle Scholar

van Apeldoorn, J., and Gilyén, A. (2019). Improvements in quantum SDP-solving with applications. Pages 99:1–99:15 of: ICALP. doi:10.4230/LIPIcs.ICALP.2019.99. arXiv:1804.05058.Google Scholar

van Apeldoorn, J., and Gilyén, A. (2019). Quantum algorithms for zero-sum games. arXiv:1904.03180.Google Scholar

van Apeldoorn, J., Gilyén, A., Gribling, S., and de Wolf, R. (2020). Convex optimization using quantum oracles. Quantum, 4, 220. doi:10.22331/q-2020-01-13-220. arXiv:1809.00643.CrossRefGoogle Scholar

van Apeldoorn, J., Gilyén, A., Gribling, S., and de Wolf, R. (2020). Quantum SDP-solvers: Better upper and lower bounds. Quantum, 4, 230. doi:10.22331/q-2020-02-14-230. Earlier version in FOCS’17. arXiv:1705.01843.CrossRefGoogle Scholar

van Apeldoorn, J., Cornelissen, A., Gilyén, A., and Nannicini, G. (2023). Quantum tomography using state-preparation unitaries. Pages 1265–1318 of: SODA. doi:10.1137/1.9781611977554.ch47. arXiv:2207.08800.CrossRefGoogle Scholar

Apers, S., and de Wolf, R. (2020). Quantum speedup for graph sparsification, cut approximation and Laplacian solving. Pages 637–648 of: FOCS. doi:10.1109/FOCS46700.2020.00065. arXiv:1911.07306.CrossRefGoogle Scholar

Apers, S., and Gribling, S. (2023). Quantum speedups for linear programming via interior point methods. arXiv:2311.03215.Google Scholar

Apers, S., Gilyén, A., and Jeffery, S. (2021). A unified framework of quantum walk search. Pages 6:1–6:13 of: STACS. doi:10.4230/LIPIcs.STACS.2021.6. arXiv:1912.04233.CrossRefGoogle Scholar

Apers, S., Gribling, S., Sen, S., and Szabó, D. (2023). A (simple) classical algorithm for estimating Betti numbers. Quantum, 7, 1202. doi:10.22331/q-2023-12-06-1202. arXiv:2211.09618.CrossRefGoogle Scholar

Arad, I., and Landau, Z. (2010). Quantum computation and the evaluation of tensor networks. SIAM J. Comp., 39, 3089–3121. doi:10.1137/080739379. arXiv:0805.0040.CrossRefGoogle Scholar

Argüello-Luengo, J., González-Tudela, A., Shi, T., et al. (2019). Analogue quantum chemistry simulation. Nature, 574, 215–218. doi:10.1038/s41586-019-1614-4. arXiv:1807.09228.CrossRefGoogle ScholarPubMed

Arora, S., and Kale, S. (2007). A combinatorial, primal-dual approach to semidefinite programs. Pages 227–236 of: STOC. doi:10.1145/1250790.1250823.CrossRefGoogle Scholar

Arora, S., Hazan, E., and Kale, S. (2005). Fast algorithms for approximate semidefinite programming using the multiplicative weights update method. Pages 339–348 of: FOCS. doi:10.1109/SFCS.2005.35.CrossRefGoogle Scholar

Arora, S., Hazan, E., and Kale, S. (2012). The multiplicative weights update method: a meta-algorithm and applications. Theory Comput., 8, 121–164. doi:10.4086/toc.2012.v008a006.CrossRefGoogle Scholar

Arovas, D. P., Berg, E., Kivelson, S. A., and Raghu, S. (2022). The Hubbard model. Annu. Rev. Condens. Matter Phys., 13, 239–274. doi:10.1146/annurev-conmatphys-031620-102024. arXiv:2103.12097.CrossRefGoogle Scholar

Arrasmith, A., Holmes, Z., Cerezo, M., and Coles, P. J. (2022). Equivalence of quantum barren plateaus to cost concentration and narrow gorges. Quantum Sci. Technol., 7, 045015. doi:10.1088/2058-9565/ac7d06. arXiv:2104.05868.CrossRefGoogle Scholar

Arrazola, J. M., Delgado, A., Bardhan, B. R., and Lloyd, S. (2020). Quantum-inspired algorithms in practice. Quantum, 4, 307. doi:10.22331/q-2020-08-13-307. arXiv:1905.10415.CrossRefGoogle Scholar

Arunachalam, S., Gheorghiu, V., Jochym-O’Connor, T., et al. (2015). On the robustness of bucket brigade quantum RAM. New J. Phys., 17, 123010. doi:10.1088/1367-2630/17/12/123010. arXiv:1502.03450.CrossRefGoogle Scholar

Arute, F., Arya, K., Babbush, R., et al. (2019). Quantum supremacy using a programmable superconducting processor. Nature, 574, 505–510. doi:10.1038/s41586-019-1666-5.CrossRefGoogle ScholarPubMed

Arute, F., Arya, K., Babbush, R., et al. (2020). Observation of separated dynamics of charge and spin in the Fermi–Hubbard model. arXiv:2010.07965.Google Scholar

Ashikhmin, A., Lai, C. Y., and Brun, T. A. (2020). Quantum data-syndrome codes. IEEE J. Sel. Areas Commun., 38, 449–462. doi:10.1109/JSAC.2020.2968997. arXiv:1907.01393.CrossRefGoogle Scholar

Aspuru-Guzik, A., Dutoi, A. D., Love, P. J., and Head-Gordon, M. (2005). Simulated quantum computation of molecular energies. Science, 309, 1704–1707. doi:10.1126/science.1113479. arXiv:0604193.CrossRefGoogle ScholarPubMed

Atas, Y. Y., Zhang, J., Lewis, R., et al. (2021). SU(2) hadrons on a quantum computer via a variational approach. Nat. Commun., 12, 6499. doi:10.1038/s41467-021-26825-4. arXiv:2102.08920.CrossRefGoogle Scholar

Augustino, B., Terlaky, T., and Zuluaga, L. F. (2022). An inexact-feasible quantum interior point method for second-order cone optimization. Tech. rept. 21T-009. Department of Industrial and Systems Engineering, Lehigh University.Google Scholar

Augustino, B., Leng, J., Nannicini, G., et al. (2023). A quantum central path algorithm for linear optimization. arXiv:2311.03977.Google Scholar

Augustino, B., Nannicini, G., Terlaky, T., and Zuluaga, L. F. (2023). Quantum interior point methods for semidefinite optimization. Quantum, 7, 1110. doi:10.22331/q-2023-09-11-1110. arXiv:2112.06025.CrossRefGoogle Scholar

Augustino, B., Nannicini, G., Terlaky, T., and Zuluaga, L. (2023). Solving the semidefinite relaxation of QUBOs in matrix multiplication time, and faster with a quantum computer. arXiv:2301.04237.Google Scholar

Babbush, R., McClean, J., Wecker, D., et al. (2015). Chemical basis of Trotter– Suzuki errors in quantum chemistry simulation. Phys. Rev. A, 91, 022311. doi:10.1103/PhysRevA.91.022311. arXiv:1410.8159.CrossRefGoogle Scholar

Babbush, R., Berry, D. W., Kivlichan, I. D., et al. (2016). Exponentially more precise quantum simulation of fermions in second quantization. New J. Phys., 18, 033032. doi:10.1088/1367-2630/18/3/033032. arXiv:1506.01020.CrossRefGoogle Scholar

Babbush, R., Berry, D. W., Sanders, Y. R., et al. (2017). Exponentially more precise quantum simulation of fermions in the configuration interaction representation. Quantum Sci. Technol., 3, 015006. doi:10.1088/2058-9565/aa9463. arXiv:1506.01029.Google Scholar

Babbush, R., Gidney, C., Berry, D. W., et al. (2018). Encoding electronic spectra in quantum circuits with linear T complexity. Phys. Rev. X, 8, 041015. doi:10.1103/PhysRevX.8.041015. arXiv:1805.03662.Google Scholar

Babbush, R., Wiebe, N., Mcclean, J., et al. (2018). Low-depth quantum simulation of materials. Phys. Rev. X, 8, 011044. doi:10.1103/PhysRevX.8.011044. arXiv:1706.00023.Google Scholar

Babbush, R., Berry, D. W., McClean, J. R., and Neven, H. (2019). Quantum simulation of chemistry with sublinear scaling in basis size. npj Quant. Inf., 5, 92. doi:10.1038/s41534-019-0199-y. arXiv:1807.09802.Google Scholar

Babbush, R., Berry, D. W., and Neven, H. (2019). Quantum simulation of the Sachdev–Ye–Kitaev model by asymmetric qubitization. Phys. Rev. A, 99, 040301. doi:10.1103/PhysRevA.99.040301. arXiv:1806.02793.CrossRefGoogle Scholar

Babbush, R., McClean, J. R., Newman, M., et al. (2021). Focus beyond quadratic speedups for error-corrected quantum advantage. PRX Quantum, 2, 010103. doi:10.1103/PRXQuantum.2.010103. arXiv:2011.04149.CrossRefGoogle Scholar

Babbush, R., Berry, D. W., Kothari, R., et al. (2023). Exponential quantum speedup in simulating coupled classical oscillators. arXiv:2303.13012.Google Scholar

Babbush, R., Huggins, W. J., Berry, D. W., et al. (2023). Quantum simulation of exact electron dynamics can be more efficient than classical mean-field methods. Nat. Commun., 14, 4058. doi:10.1038/s41467-023-39024-0. arXiv:2301.01203.CrossRefGoogle ScholarPubMed

Bagherimehrab, M., Sanders, Y. R., Berry, D. W., et al. (2022). Nearly optimal quantum algorithm for generating the ground state of a free quantum field theory. PRX Quantum, 3, 020364. doi:10.1103/PRXQuantum.3.020364. arXiv:2110.05708.CrossRefGoogle Scholar

Bagherimehrab, M., Nakaji, K., Wiebe, N., and Aspuru-Guzik, A. (2023). Fast quantum algorithm for differential equations. arXiv:2306.11802.Google Scholar

Baiardi, A., Stein, C. J., Barone, V., and Reiher, M. (2017). Vibrational density matrix renormalization group. J. Chem. Theory Comput., 13, 3764–3777. doi:10.1021/acs.jctc.7b00329. arXiv:1703.09313.CrossRefGoogle ScholarPubMed

Baker, J. S., and Radha, S. K. (2022). Wasserstein solution quality and the quantum approximate optimization algorithm: A portfolio optimization case study. arXiv:2202.06782.Google Scholar

Bakshi, A., and Tang, E. (2024). An improved classical singular value transformation for quantum machine learning. Pages 2398–2453 of: SODA. doi:10.1137/1.9781611977912.86. arXiv:2303.01492.CrossRefGoogle Scholar

Banaszek, K., Cramer, M., and Gross, D. (2013). Focus on quantum tomography. New J. Phys., 15, 125020. doi:10.1088/1367-2630/15/12/125020.CrossRefGoogle Scholar

Banchi, L., Pereira, J., and Pirandola, S. (2021). Generalization in quantum machine learning: A quantum information standpoint. PRX Quantum, 2, 040321. doi:10.1103/PRXQuantum.2.040321. arXiv:2102.08991.CrossRefGoogle Scholar

Banegas, G., and Bernstein, D. J. (2018). Low-communication parallel quantum multi-target preimage search. Pages 325–335 of: SAC. ePrint:2017/789.Google Scholar

Banuls, M.-C., Pérez-García, D., Wolf, M. M., et al. (2008). Sequentially generated states for the study of two-dimensional systems. Phys. Rev. A, 77, 052306. doi:10.1103/PhysRevA.77.052306. arXiv:0802.2472.CrossRefGoogle Scholar

Banuls, M. C., Cichy, K., Cirac, J. I., et al. (2019). Tensor networks and their use for lattice gauge theories. Page 022 of: LATTICE. doi:10.22323/1.334.0022. arXiv:1810.12838.CrossRefGoogle Scholar

Bañuls, M. C., Blatt, R., Catani, J., et al. (2020). Simulating lattice gauge theories within quantum technologies. Eur. Phys. J. D, 74, 165. doi:10.1140/epjd/e2020-100571-8. arXiv:1911.00003.CrossRefGoogle Scholar

Bao, N., Hayden, P., Salton, G., and Thomas, N. (2015). Universal quantum computation by scattering in the Fermi–Hubbard model. New J. Phys., 17, 093028. doi:10.1088/1367-2630/17/9/093028. arXiv:1409.3585.CrossRefGoogle Scholar

Barahona, F. (1982). On the computational complexity of Ising spin glass models. J. Phys. A, 15, 3241–3253. doi:10.1088/0305-4470/15/10/028.CrossRefGoogle Scholar

Barker, E. (2020). Recommendation for key management: Part 1—general. Tech. rept. SP 800-57 Part 1 Rev. 5. National Institute of Standards and Technology, Gaithersburg, MD. doi:10.6028/NIST.SP.800-57pt1r5.Google Scholar

Barker, E., and Dang, Q. (2015). Recommendation for key management, part 3: Application-specific key management guidance. Tech. rept. SP 800-57 Part 3 Rev. 1. National Institute of Standards and Technology, Gaithersburg, MD. doi:10.6028/NIST.SP.800-57pt3r1.Google Scholar

Barmes, I., and Bosch, B. (2019). Quantum computers and the bitcoin blockchain. https://deloitte.com/nl/nl/pages/innovatie/artikelen/quantum-computers-and-the-bitcoin-blockchain.html, accessed: 2023-09-30.Google Scholar

Barmes, I., Bosch, B., and Verdonk, M. (2022). Quantum risk to the Ethereum blockchain—a bump in the road or a brick wall? https://deloitte.com/nl/nl/pages/risk/articles/quantum-risk-to-the-ethereum-blockchain.html, accessed: 2023-09-30.Google Scholar

Barone, V., Alessandrini, S., Biczysko, M., et al. (2021). Computational molecular spectroscopy. Nat. Rev. Methods Primers, 1, 38. doi:10.1038/s43586-021-00034-1.CrossRefGoogle Scholar

Barrett, B. R., Navratil, P., and Vary, J. P. (2013). Ab initio no core shell model. Prog. Part. Nucl. Phys., 69, 131–181. doi:10.1016/j.ppnp.2012.10.003.CrossRefGoogle Scholar

Bärtschi, A., Caravelli, F., Coffrin, C., et al. (2024). Potential applications of quantum computing at Los Alamos National Laboratory. arXiv:2406.06625.Google Scholar

Bauer, B., Bravyi, S., Motta, M., and Chan, G. K.-L. (2020). Quantum algorithms for quantum chemistry and quantum materials science. Chem. Rev., 120, 12685–12717. doi:10.1021/acs.chemrev.9b00829. arXiv:2001.03685.CrossRefGoogle ScholarPubMed

Bauer, C. W., Nachman, B., and Freytsis, M. (2021). Simulating collider physics on quantum computers using effective field theories. Phys. Rev. Lett., 127, 212001. doi:10.1103/PhysRevLett.127.212001. arXiv:2102.05044.CrossRefGoogle ScholarPubMed

Bauer, C. W., Davoudi, Z., Balantekin, A. B., et al. (2023). Quantum simulation for high-energy physics. PRX Quantum, 4, 027001. doi:10.1103/PRXQuantum.4.027001. arXiv:2204.03381.CrossRefGoogle Scholar

Bauer, C. W., Davoudi, Z., Klco, N., and Savage, M. J. (2023). Quantum simulation of fundamental particles and forces. Nat. Rev. Phys., 5, 420–432. doi:10.1038/s42254-023-00599-8.CrossRefGoogle Scholar

Bausch, J. (2022). Fast black-box quantum state preparation. Quantum, 6. doi:10.22331/q-2022-08-04-773. arXiv:2009.10709.CrossRefGoogle Scholar

Bausch, J., Senior, A. W., Heras, F. J. H., et al. (2023). Learning to decode the surface code with a recurrent, transformer-based neural network. arXiv:2310.05900.Google Scholar

Beane, S., Detmold, W., Orginos, K., and Savage, M. (2011). Nuclear physics from lattice QCD. Prog. Part. Nuc. Phys., 66, 1–40. doi:10.1016/j.ppnp.2010.08.002. arXiv:1004.2935.Google Scholar

Beauregard, S. (2003). Circuit for Shor’s algorithm using 2n+3 qubits. Quantum Inf. Comput., 3, 175–185. doi:10.26421/QIC3.2-8. arXiv:quant-ph/0205095.Google Scholar

Beck, D., Carlson, J., Davoudi, Z., et al. (2023). Quantum information science and technology for nuclear physics: Input into U.S. long-range planning, 2023. arXiv:2303.00113.Google Scholar

Beckman, D., Chari, A. N., Devabhaktuni, S., and Preskill, J. (1996). Efficient networks for quantum factoring. Phys. Rev. A, 54, 1034–1063. doi:10.1103/PhysRevA.54.1034. arXiv:quant-ph/9602016.CrossRefGoogle ScholarPubMed

Beer, K., Bondarenko, D., Farrelly, T., et al. (2020). Training deep quantum neural networks. Nat. Commun., 11, 808. doi:10.1038/s41467-020-14454-2. arXiv:1902.10445.CrossRefGoogle ScholarPubMed

Bellonzi, N., Kunitsa, A., Cantin, J. T., et al. (2024). Feasibility of accelerating homogeneous catalyst discovery with fault-tolerant quantum computers. arXiv:2406.06335.Google Scholar

Ben-Or, M., Gottesman, D., and Hassidim, A. (2013). Quantum refrigerator. arXiv:1301.1995.Google Scholar

Bender, M., Bernard, R., Bertsch, G., et al. (2020). Future of nuclear fission theory. J. Phys. G, 47, 113002. doi:10.1088/1361-6471/abab4f. arXiv:2005.10216.CrossRefGoogle Scholar

Benedetti, M., Realpe-Gómez, J., Biswas, R., and Perdomo-Ortiz, A. (2017). Quantum-assisted learning of hardware-embedded probabilistic graphical models. Phys. Rev. X, 7, 041052. doi:10.1103/PhysRevX.7.041052. arXiv:1609.02542.Google Scholar

Benedetti, M., Garcia-Pintos, D., Perdomo, O., et al. (2019). A generative modeling approach for benchmarking and training shallow quantum circuits. npj Quant. Inf., 5, 1–9. doi:10.1038/s41534-019-0157-8. arXiv:1801.07686.Google Scholar

Benedetti, M., Lloyd, E., Sack, S., and Fiorentini, M. (2019). Parameterized quantum circuits as machine learning models. Quantum Sci. Technol., 4, 043001. doi:10.1088/2058-9565/ab4eb5. arXiv:1906.07682.CrossRefGoogle Scholar

Benedetti, M., Fiorentini, M., and Lubasch, M. (2021). Hardware-efficient variational quantum algorithms for time evolution. Phys. Rev. Res., 3, 033083. doi:10.1103/PhysRevResearch.3.033083. arXiv:2009.12361.CrossRefGoogle Scholar

Benioff, P. (1980). The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines. J. Stat. Phys., 22, 563–591. doi:10.1007/BF01011339.CrossRefGoogle Scholar

Bennett, C. H., and Brassard, G. (2014). Quantum cryptography: Public key distribution and coin tossing. Theor. Comput. Sci., 560, 7–11. doi:10.1016/j.tcs.2014.05.025. arXiv:2003.06557.CrossRefGoogle Scholar

Bennett, C. H., Bernstein, E., Brassard, G., and Vazirani, U. (1997). Strengths and weaknesses of quantum computing. SIAM J. Comp., 26, 1510–1523. doi:10.1137/S0097539796300933. arXiv:quant-ph/9701001.CrossRefGoogle Scholar

Bergholm, V., Izaac, J., Schuld, M., et al. (2018). Pennylane: Automatic differentiation of hybrid quantum-classical computations. arXiv:1811.04968. https://pennylane.ai/codebook, accessed: 2024-12-01.Google Scholar

van den Berg, E., and Temme, K. (2020). Circuit optimization of Hamiltonian simulation by simultaneous diagonalization of Pauli clusters. Quantum, 4, 322. doi:10.22331/q-2020-09-12-322. arXiv:2003.13599.CrossRefGoogle Scholar

Bermudez, A., Xu, X., Nigmatullin, R., et al. (2017). Assessing the progress of trapped-ion processors towards fault-tolerant quantum computation. Phys. Rev. X, 7, 041061. doi:10.1103/physrevx.7.041061. arXiv:1705.02771.Google Scholar

Bernstein, D. J., and Lange, T. (2017). Post-quantum cryptography. Nature, 549, 188–194. doi:10.1038/nature23461. ePrint:2017/314.CrossRefGoogle ScholarPubMed

Bernstein, D. J., Engels, S., Lange, T., et al. (2016). Faster elliptic-curve discrete logarithms on FPGAs. ePrint:2016/382.Google Scholar

Bernstein, D. J., Biasse, J.-F., and Mosca, M. (2017). A lowresource quantum factoring algorithm. Pages 330–346 of: PQCrypto. doi:10.1007/978-3-319-59879-6_19. ePrint:2017/352.CrossRefGoogle Scholar

Bernstein, E., and Vazirani, U. (1997). Quantum complexity theory. SIAM J. Comp., 26, 1411–1473. doi:10.1137/S0097539796300921. Earlier version in STOC’93.CrossRefGoogle Scholar

Berntson, B. K., and Sünderhauf, C. (2024). Complementary polynomials in quantum signal processing. arXiv:2406.04246.Google Scholar

Berry, D. W. (2014). High-order quantum algorithm for solving linear differential equations. J. Phys. A, 47, 105301. doi:10.1088/1751-8113/47/10/105301.CrossRefGoogle Scholar

Berry, D. W., and Costa, C. S., P. (2024). Quantum algorithm for timedependent differential equations using Dyson series. Quantum, 8, 1369. doi:10.22331/q-2024-06-13-1369. arXiv:2212.03544.CrossRefGoogle Scholar

Berry, D. W., and Childs, A. M. (2012). Black-box Hamiltonian simulation and unitary implementation. Quantum Inf. Comput., 12, 29–62. doi:10.26421/QIC12.1-2. arXiv:0910.4157.Google Scholar

Berry, D. W., Ahokas, G., Cleve, R., and Sanders, B. C. (2007). Efficient quantum algorithms for simulating sparse Hamiltonians. Commun. Math. Phys., 270, 359–371. doi:10.1007/s00220-006-0150-x. arXiv:quant-ph/0508139.CrossRefGoogle Scholar

Berry, D. W., Childs, A. M., Cleve, R., et al. (2014). Exponential improvement in precision for simulating sparse Hamiltonians. Pages 283–292 of: STOC. doi:10.1145/2591796.2591854. arXiv:1312.1414.CrossRefGoogle Scholar

Berry, D. W., Childs, A. M., and Kothari, R. (2015). Hamiltonian simulation with nearly optimal dependence on all parameters. Pages 792–809 of: FOCS. doi:10.1109/FOCS.2015.54. arXiv:1501.01715.CrossRefGoogle Scholar

Berry, D. W., Childs, A. M., Cleve, R., et al. (2015). Simulating Hamiltonian dynamics with a truncated Taylor series. Phys. Rev. Lett., 114, 090502. doi:10.1103/PhysRevLett.114.090502. arXiv:1412.4687.CrossRefGoogle ScholarPubMed

Berry, D. W., Childs, A. M., Ostrander, A., and Wang, G. (2017). Quantum algorithm for linear differential equations with exponentially improved dependence on precision. Commun. Math. Phys., 356, 1057–1081. doi:10.1007/s00220-017-3002-y. arXiv:1701.03684.CrossRefGoogle Scholar

Berry, D. W., Kieferová, M., Scherer, A., et al. (2018). Improved techniques for preparing eigenstates of fermionic Hamiltonians. npj Quant. Inf., 4, 22. doi:10.1038/s41534-018-0071-5. arXiv:1711.10460.Google Scholar

Berry, D. W., Gidney, C., Motta, M., et al. (2019). Qubitization of arbitrary basis quantum chemistry leveraging sparsity and low rank factorization. Quantum, 3, 208. doi:10.22331/q-2019-12-02-208. arXiv:1902.02134.CrossRefGoogle Scholar

Berry, D. W., Childs, A. M., Su, Y., et al. (2020). Time-dependent Hamiltonian simulation with L¹-norm scaling. Quantum, 4, 254. doi:10.22331/q-2020-04-20-254. arXiv:1906.07115.CrossRefGoogle Scholar

Berry, D. W., Rubin, N. C., Elnabawy, A. O., et al. (2023). Quantum simulation of realistic materials in first quantization using non-local pseudopotentials. arXiv:2312.07654.Google Scholar

Berry, D. W., Su, Y., Gyurik, C., et al. (2024). Analyzing prospects for quantum advantage in topological data analysis. PRX Quantum, 5, 010319. doi:10.1103/PRXQuantum.5.010319. arXiv:2209.13581.CrossRefGoogle Scholar

Berry, D. W., Tong, Y., Khattar, T., et al. (2024). Rapid initial state preparation for the quantum simulation of strongly correlated molecules. arXiv:2409.11748.Google Scholar

Beullens, W. (2022). Breaking rainbow takes a weekend on a laptop. Pages 464–479 of: CRYPTO. doi:10.1007/978-3-031-15979-4_16. ePrint:2022/214.CrossRefGoogle Scholar

Beverland, M. E., Kubica, A., and Svore, K. M. (2021). Cost of universality: A comparative study of the overhead of state distillation and code switching with color codes. PRX Quantum, 2, 020341. doi:10.1103/PRXQuantum.2.020341. arXiv:2101.02211.CrossRefGoogle Scholar

Beverland, M. E., Murali, P., Troyer, M., et al. (2022). Assessing requirements to scale to practical quantum advantage. arXiv:2211.07629.Google Scholar

Bharti, K., Cervera-Lierta, A., Kyaw, T. H., et al. (2022). Noisy intermediate-scale quantum algorithms. Rev. Mod. Phys., 94, 015004. doi:10.1103/RevModPhys.94.015004. arXiv:2101.08448.CrossRefGoogle Scholar

Bhaskar, M. K., Hadfield, S., Papageorgiou, A., and Petras, I. (2016). Quantum algorithms and circuits for scientific computing. Quantum Inf. Comput., 16. doi:10.26421/QIC16.3-4-2. arXiv:1511.08253.Google Scholar

Biamonte, J., and Bergholm, V. (2017). Tensor networks in a nutshell. arXiv:1708.00006.Google Scholar

Biamonte, J., Wittek, P., Pancotti, N., et al. (2017). Quantum machine learning. Nature, 549, 195–202. doi:10.1038/nature23474. arXiv:1611.09347.CrossRefGoogle ScholarPubMed

Bilgin, E., and Boixo, S. (2010). Preparing thermal states of quantum systems by dimension reduction. Phys. Rev. Lett., 105, 170405. doi:10.1103/PhysRevLett.105.170405. arXiv:1008.4162.CrossRefGoogle ScholarPubMed

Binder, S., Ekström, A., Hagen, G., et al. (2016). Effective field theory in the harmonic oscillator basis. Phys. Rev. C, 93, 044332. doi:10.1103/PhysRevC.93.044332. arXiv:1512.03802.CrossRefGoogle Scholar

Bittel, L., and Kliesch, M. (2021). Training variational quantum algorithms is NP-hard. Phys. Rev. Lett., 127, 120502. doi:10.1103/PhysRevLett.127.120502. arXiv:2101.07267.CrossRefGoogle ScholarPubMed

Blais, A., Grimsmo, A. L., Girvin, S. M., and Wallraff, A. (2021). Circuit quantum electrodynamics. Rev. Mod. Phys., 93, 025005. doi:10.1103/RevModPhys.93.025005. arXiv:2005.12667.CrossRefGoogle Scholar

Blanchet, J., Szegedy, M., and Wang, G. (2024). Quadratic speed-up in infinite variance quantum Monte Carlo. arXiv:2401.07497.Google Scholar

Bloch, I., Dalibard, J., and Nascimbène, S. (2012). Quantum simulations with ultracold quantum gases. Nat. Phys., 8, 267–276. doi:10.1038/nphys2259.CrossRefGoogle Scholar

Blunt, N. S., Camps, J., Crawford, O., et al. (2022). Perspective on the current state-of-the-art of quantum computing for drug discovery applications. J. Chem. Theory Comput., 18, 7001–7023. doi:10.1021/acs.jctc.2c00574. arXiv:2206.00551.CrossRefGoogle ScholarPubMed

Blunt, N. S., Caune, L., Izsák, R., et al. (2023). Statistical phase estimation and error mitigation on a superconducting quantum processor. PRX Quantum, 4, 040341. doi:10.1103/PRXQuantum.4.040341. arXiv:2304.05126.CrossRefGoogle Scholar

Bogdanov, A., Khovratovich, D., and Rechberger, C. (2011). Biclique cryptanalysis of the full AES. Pages 344–371 of: ASIACRYPT. doi:10.1007/978-3-642-25385-0_19. ePrint:2011/449.CrossRefGoogle Scholar

Boixo, S., and Somma, R. D. (2010). Necessary condition for the quantum adiabatic approximation. Phys. Rev. A, 81, 032308. doi:10.1103/PhysRevA.81.032308. arXiv:0911.1362.CrossRefGoogle Scholar

Boixo, S., Knill, E., and Somma, R. D. (2010). Fast quantum algorithms for traversing paths of eigenstates. arXiv:1005.3034.Google Scholar

Bolte, J., Boustany, R., Pauwels, E., and Pesquet-Popescu, B. (2022). Nonsmooth automatic differentiation: A cheap gradient principle and other complexity results. arXiv:2206.01730.Google Scholar

Bolusani, S., Besanc¸on, M., Bestuzheva, K., et al. (2024). The SCIP optimization suite 9.0. arXiv:2402.17702.Google Scholar

Bombín, H. (2015). Gauge color codes: Optimal transversal gates and gauge fixing in topological stabilizer codes. New J. Phys., 17, 083002. doi:10.1088/1367-2630/17/8/083002. arXiv:1311.0879.CrossRefGoogle Scholar

Bombín, H. (2015). Single-shot fault-tolerant quantum error correction. Phys. Rev. X, 5, 031043. doi:10.1103/physrevx.5.031043. arXiv:1404.5504.Google Scholar

Bombín, H. (2018). 2D quantum computation with 3D topological codes. arXiv:1810.09571.Google Scholar

Bombín, H., and Martin-Delgado, M. (2007). Exact topological quantum order in d = 3 and beyond: Branyons and brane-net condensates. Phys. Rev. B, 75, 075103. doi:10.1103/PhysRevB.75.075103. arXiv:cond-mat/0607736.CrossRefGoogle Scholar

Bombín, H., and Martin-Delgado, M. A. (2006). Topological quantum distillation. Phys. Rev. Lett., 97, 180501. doi:10.1103/PhysRevLett.97.180501. arXiv:quant-ph/0605138.CrossRefGoogle ScholarPubMed

Bombín, H., Dawson, C., Liu, Y.-H., et al. (2023). Modular decoding: Parallelizable real-time decoding for quantum computers. arXiv:2303.04846.Google Scholar

Bombín, H. G. D.-C., and Poulin, D. (2012). Universal topological phase of two-dimensional stabilizer codes. New J. Phys., 14, 073048. doi:10.1088/1367-2630/14/7/073048. arXiv:1103.4606.CrossRefGoogle Scholar

Bonfà, P., Frassineti, J., Isah, M. M., et al. (2021). UNDI: An open-source library to simulate muon-nuclear interactions in solids. Comput. Phys. Commun., 260, 107719. doi:10.1016/j.cpc.2020.107719.CrossRefGoogle Scholar

Bonilla Ataides, J. P., Tuckett, D. K., Bartlett, S. D., et al. (2021). The XZZX surface code. Nat. Commun., 12, 2172. doi:10.1038/s41467-021-22274-1. arXiv:2009.07851.CrossRefGoogle ScholarPubMed

Bosse, J. L., and Montanaro, A. (2022). Probing ground-state properties of the kagome antiferromagnetic Heisenberg model using the variational quantum eigensolver. Phys. Rev. B, 105, 094409. doi:10.1103/PhysRevB.105.094409. arXiv:2108.08086.CrossRefGoogle Scholar

Boudot, F., Gaudry, P., Guillevic, A., et al. (2020). Comparing the difficulty of factorization and discrete logarithm: A 240-digit experiment. Pages 62–91 of: CRYPTO. doi:10.1007/978-3-030-56880-1_3. arXiv:2006.06197.CrossRefGoogle Scholar

Bouland, A., van Dam, W., Joorati, H., et al. (2020). Prospects and challenges of quantum finance. arXiv:2011.06492.Google Scholar

Bouland, A., Dandapani, A., and Prakash, A. (2023). A quantum spectral method for simulating stochastic processes, with applications to Monte Carlo. arXiv:2303.06719.Google Scholar

Bouland, A., Getachew, Y. M., Jin, Y., et al. (2023). Quantum speedups for zero-sum games via improved dynamic Gibbs sampling. Pages 2932–2952 of: ICML. arXiv:2301.03763.Google Scholar

Boulebnane, S., and Montanaro, A. (2024). Solving Boolean satisfiability problems with the quantum approximate optimization algorithm. PRX Quantum, 5, 030348. doi:10.1103/PRXQuantum.5.030348. arXiv:2208.06909.CrossRefGoogle Scholar

Boyd, S., and Vandenberghe, L. (2004). Convex optimization. Cambridge University Press. doi:10.1017/CBO9780511804441.Google Scholar

Brandão, F. G. S. L., and Svore, K. M. (2017). Quantum speedups for solving semidefinite programs. Pages 415–426 of: FOCS. doi:10.1109/FOCS.2017.45. arXiv:1609.05537.CrossRefGoogle Scholar

Brandão, F. G. S. L., Kalev, A., Li, T., et al. (2019). Quantum SDP solvers: Large speed-ups, optimality, and applications to quantum learning. Pages 27:1–27:14 of: ICALP. doi:10.4230/LIPIcs.ICALP.2019.27. arXiv:1710.02581.Google Scholar

Brandão, F. G. S. L., Kueng, R., and Franc¸a, D. S. (2022). Faster quantum and classical SDP approximations for quadratic binary optimization. Quantum, 6, 625. doi:10.22331/q-2022-01-20-625. arXiv:1909.04613.Google Scholar

Brandhofer, S., Braun, D., Dehn, V., et al. (2023). Benchmarking the performance of portfolio optimization with QAOA. Quantum Inf. Process., 22, 1–27. doi:10.1007/s11128-022-03766-5. arXiv:2207.10555.Google Scholar

van den Brand, J., Lee, Y. T., Sidford, A., and Song, Z. (2020). Solving tall dense linear programs in nearly linear time. Pages 775–788 of: STOC. doi:10.1145/3357713.3384309. arXiv:2002.02304.CrossRefGoogle Scholar

Brassard, G., Høyer, P., Mosca, M., and Tapp, A. (2002). Quantum amplitude amplification and estimation. Pages 53–74 of: Quantum computation and quantum information: A millennium volume, vol. 305. doi:10.1090/conm/305/05215. arXiv:quant-ph/0005055.CrossRefGoogle Scholar

Bravo-Prieto, C., LaRose, R., Cerezo, M., et al. (2019). Variational quantum linear solver. arXiv:1909.05820.Google Scholar

Bravyi, S. (2015). Monte Carlo simulation of stoquastic Hamiltonians. Quantum Inf. Comput., 15, 1122–1140. doi:10.26421/QIC15.13-14-3. arXiv:1402.2295.Google Scholar

Bravyi, S., and Cross, A. (2015). Doubled color codes. arXiv:1509.03239.Google Scholar

Bravyi, S., and Kitaev, A. (2005). Universal quantum computation with ideal Clifford gates and noisy ancillas. Phys. Rev. A, 71, 022316. doi:10.1103/physreva.71.022316. arXiv:quant-ph/0403025.CrossRefGoogle Scholar

Bravyi, S., and Terhal, B. (2010). Complexity of stoquastic frustration-free Hamiltonians. SIAM J. Comp., 39, 1462–1485. doi:10.1137/08072689X. arXiv:0806.1746.CrossRefGoogle Scholar

Bravyi, S., Suchara, M., and Vargo, A. (2014). Efficient algorithms for maximum likelihood decoding in the surface code. Phys. Rev. A, 90, 032326. doi:10.1103/PhysRevA.90.032326. arXiv:1405.4883.CrossRefGoogle Scholar

Bravyi, S., Englbrecht, M., König, R., and Peard, N. (2018). Correcting coherent errors with surface codes. npj Quant. Inf., 4. doi:10.1038/s41534-018-0106-y.Google Scholar

Bravyi, S., Kliesch, A., Koenig, R., and Tang, E. (2020). Obstacles to variational quantum optimization from symmetry protection. Phys. Rev. Lett., 125, 260505. doi:10.1103/PhysRevLett.125.260505. arXiv:1910.08980.CrossRefGoogle ScholarPubMed

Bravyi, S., Chowdhury, A., Gosset, D., and Wocjan, P. (2022). Quantum Hamiltonian complexity in thermal equilibrium. Nat. Phys., 18, 1367–1370. doi:10.1038/s41567-022-01742-5. arXiv:2110.15466.CrossRefGoogle Scholar

Bravyi, S. B., and Kitaev, A. Y. (1998). Quantum codes on a lattice with boundary. arXiv:quant-ph/9811052.Google Scholar

Bravyi, S. B., and Kitaev, A. Y. (2002). Fermionic quantum computation. Ann. Phys., 298, 210–226. doi:10.1006/aphy.2002.6254. arXiv:quant-ph/0003137.CrossRefGoogle Scholar

Brenner, S. C., and Scott, L. R. (2008). The mathematical theory of finite element methods. Springer. doi:10.1007/978-0-387-75934-0.Google Scholar

Breuckmann, N. P., and Eberhardt, J. N. (2021). Balanced product quantum codes. IEEE Trans. Inf. Theory, 67, 6653–6674. doi:10.1109/tit.2021.3097347. arXiv:2012.09271.CrossRefGoogle Scholar

Breuckmann, N. P., Duivenvoorden, K., Michels, D., and Terhal, B. M. (2017). Local decoders for the 2D and 4D toric code. Quantum Inf. Comput., 17, 0181. doi:10.26421/QIC17.3-4-1. arXiv:1609.00510.Google Scholar

Bridgeman, J. C., and Chubb, C. T. (2017). Hand-waving and interpretive dance: An introductory course on tensor networks. J. Phys. A, 50, 223001. doi:10.1088/1751-8121/aa6dc3. arXiv:1603.03039.CrossRefGoogle Scholar

Bridgeman, J. C., Kubica, A., and Vasmer, M. (2024). Lifting topological codes: Three-dimensional subsystem codes from two-dimensional anyon models. PRX Quantum, 5. doi:10.1103/prxquantum.5.020310. arXiv:2305.06365.CrossRefGoogle Scholar

Browaeys, A., and Lahaye, T. (2020). Many-body physics with individually controlled Rydberg atoms. Nat. Phys., 16, 132–142. doi:10.1038/s41567-019-0733-z. arXiv:2002.07413.CrossRefGoogle Scholar

Brown, A. R., Gharibyan, H., Leichenauer, S., et al. (2023). Quantum gravity in the lab. I. Teleportation by size and traversable wormholes. PRX Quantum, 4, 010320. doi:10.1103/PRXQuantum.4.010320. arXiv:1911.06314.CrossRefGoogle Scholar

Brown, B. J. (2023). Conservation laws and quantum error correction: Towards a generalised matching decoder. IEEE BITS Inf. Theory Mag., 1–12. doi:10.1109/MBITS.2023.3246025. arXiv:2207.06428.Google Scholar

Brown, B. J., Laubscher, K., Kesselring, M. S., and Wootton, J. R. (2017). Poking holes and cutting corners to achieve Clifford gates with the surface code. Phys. Rev. X, 7, 021029. doi:10.1103/PhysRevX.7.021029. arXiv:1609.04673.Google Scholar

Brüstle, N., and Wiebe, N. (2024). Quantum and classical algorithms for nonlinear unitary dynamics. arXiv:2407.07685.Google Scholar

Bruzewicz, C. D., Chiaverini, J., McConnell, R., and Sage, J. M. (2019). Trapped-ion quantum computing: Progress and challenges. Appl. Phys. Rev., 6, 021314. doi:10.1063/1.5088164. arXiv:1904.04178.CrossRefGoogle Scholar

Bădescu, C., and O’Donnell, R. (2021). Improved quantum data analysis. Pages 1398–1411 of: STOC. doi:10.1145/3406325.3451109. arXiv:2011.10908.CrossRefGoogle Scholar

Buhrman, H., Patro, S., and Speelman, F. (2021). A framework of quantum strong exponential-time hypotheses. Pages 19:1–19:19 of: STACS, vol. 187. doi:10.4230/LIPIcs.STACS.2021.19. arXiv:1911.05686.CrossRefGoogle Scholar

Bürgisser, P., Franks, C., Garg, A., et al. (2018). Efficient algorithms for tensor scaling, quantum marginals, and moment polytopes. Pages 883–897 of: FOCS. doi:10.1109/FOCS.2018.00088. arXiv:1804.04739.CrossRefGoogle Scholar

von Burg, V., Low, G. H., Häner, T., et al. (2021). Quantum computing enhanced computational catalysis. Phys. Rev. Res., 3, 033055. doi:10.1103/PhysRevResearch.3.033055. arXiv:2007.14460.CrossRefGoogle Scholar

Byrnes, T., and Yamamoto, Y. (2006). Simulating lattice gauge theories on a quantum computer. Phys. Rev. A, 73, 022328. doi:10.1103/PhysRevA.73.022328. arXiv:quant-ph/0510027.CrossRefGoogle Scholar

Cade, C., and Crichigno, P. M. (2021). Complexity of supersymmetric systems and the cohomology problem. arXiv:2107.00011.Google Scholar

Cade, C., Mineh, L., Montanaro, A., and Stanisic, S. (2020). Strategies for solving the Fermi–Hubbard model on near-term quantum computers. Phys. Rev. B, 102, 235122. doi:10.1103/PhysRevB.102.235122. arXiv:1912.06007.CrossRefGoogle Scholar

Cade, C., Folkertsma, M., Niesen, I., and Weggemans, J. (2022). Quantum algorithms for community detection and their empirical run-times. arXiv:2203.06208.Google Scholar

Cade, C., Folkertsma, M., Niesen, I., and Weggemans, J. (2023). Quantifying Grover speed-ups beyond asymptotic analysis. Quantum, 7, 1133. doi:10.22331/q-2023-10-10-1133. arXiv:2203.04975.CrossRefGoogle Scholar

Cai, Z. (2020). Resource estimation for quantum variational simulations of the Hubbard model. Phys. Rev. Appl., 14, 014059. doi:10.1103/PhysRevApplied.14.014059. arXiv:1910.02719.CrossRefGoogle Scholar

Calabrese, P., and Cardy, J. (2005). Evolution of entanglement entropy in one-dimensional systems. J. Stat. Mech. Theory Exp., 04010. doi:10.1088/1742-5468/2005/04/P04010. arXiv:cond-mat/0503393.Google Scholar

Calabro, C., Impagliazzo, R., and Paturi, R. (2009). The complexity of satisfiability of small depth circuits. Pages 75–85 of: Parameterized and Exact Computation. doi:10.1007/978-3-642-11269-0_6.CrossRefGoogle Scholar

Calderbank, A. R., and Shor, P. W. (1996). Good quantum error-correcting codes exist. Phys. Rev. A, 54, 1098–1105. doi:10.1103/physreva.54.1098. arXiv:quant-ph/9512032.CrossRefGoogle ScholarPubMed

Campbell, E. (2019). Random compiler for fast Hamiltonian simulation. Phys. Rev. Lett., 123. doi:10.1103/physrevlett.123.070503. arXiv:1811.08017.CrossRefGoogle ScholarPubMed

Campbell, E., Khurana, A., and Montanaro, A. (2019). Applying quantum algorithms to constraint satisfaction problems. Quantum, 3, 167. doi:10.22331/q-2019-07-18-167. arXiv:1810.05582.CrossRefGoogle Scholar

Campbell, E. T. (2019). A theory of single-shot error correction for adversarial noise. Quantum Sci. Technol., 4, 025006. doi:10.1088/2058-9565/aafc8f. arXiv:1805.09271.CrossRefGoogle Scholar

Campbell, E. T. (2021). Early fault-tolerant simulations of the Hubbard model. Quantum Sci. Technol., 7, 015007. doi:10.1088/2058-9565/ac3110. arXiv:2012.09238.Google Scholar

Campbell, E. T., Terhal, B. M., and Vuillot, C. (2017). Roads towards fault-tolerant universal quantum computation. Nature, 549, 172–179. doi:10.1038/nature23460. arXiv:1612.07330.CrossRefGoogle ScholarPubMed

Camps, D., Lin, L., Van Beeumen, R., and Yang, C. (2024). Explicit quantum circuits for block encodings of certain sparse matrices. SIAM J. Matrix Anal. Appl., 45, 801–827. doi:10.1137/22M1484298. arXiv:2203.10236.CrossRefGoogle Scholar

Cao, Y., Papageorgiou, A., Petras, I., et al. (2013). Quantum algorithm and circuit design solving the poisson equation. New J. Phys., 15, 013021. doi:10.1088/1367-2630/15/1/013021. arXiv:1207.2485.CrossRefGoogle Scholar

Cao, Y., Romero, J., Olson, J. P., et al. (2019). Quantum chemistry in the age of quantum computing. Chem. Rev., 119, 10856–10915. doi:10.1021/acs.chemrev.8b00803. arXiv:1812.09976.CrossRefGoogle ScholarPubMed

Carbone, A., Cipollone, A., Barbieri, C., et al. (2013). Self-consistent Green’s functions formalism with three-body interactions. Phys. Rev. C, 88, 054326. doi:10.1103/PhysRevC.88.054326. arXiv:1310.3688.CrossRefGoogle Scholar

Carena, M., Lamm, H., Li, Y.-Y., and Liu, W. (2021). Lattice renormalization of quantum simulations. Phys. Rev. D, 104, 094519. doi:10.1103/PhysRevD.104.094519. arXiv:2107.01166.CrossRefGoogle Scholar

Carlson, J., Gandolfi, S., Pederiva, F., et al. (2015). Quantum Monte Carlo methods for nuclear physics. Rev. Mod. Phys., 87, 1067. doi:10.1103/RevModPhys.87.1067. arXiv:1412.3081.CrossRefGoogle Scholar

Carlson, J., Savage, M. J., Gerber, R., et al. (2017). Nuclear physics exascale requirements review: An Office of Science review sponsored jointly by Advanced Scientific Computing Research and Nuclear Physics, June 15–17, 2016, Gaithersburg, Maryland. Tech. rept. OSTI 1906717. U.S. Department of Energy Office of Scientific and Technical Information. doi:10.2172/1369223.Google ScholarPubMed

Caro, M. C., Gil-Fuster, E., Meyer, J. J., et al. (2021). Encoding-dependent generalization bounds for parametrized quantum circuits. Quantum, 5, 582. doi:10.22331/q-2021-11-17-582. arXiv:2106.03880.CrossRefGoogle Scholar

Caro, M. C., Huang, H.-Y., Cerezo, M., et al. (2022). Generalization in quantum machine learning from few training data. Nat. Commun., 13, 4919. doi:10.1038/s41467-022-32550-3. arXiv:2111.05292.CrossRefGoogle ScholarPubMed

Caro, M. C., Huang, H.-Y., Ezzell, N., et al. (2023). Out-of-distribution generalization for learning quantum dynamics. Nat. Commun., 14, 3751. doi:10.1038/s41467-023-39381-w. arXiv:2204.10268.CrossRefGoogle ScholarPubMed

CarringtonJr, T. (2017). Perspective: Computing (ro-)vibrational spectra of molecules with more than four atoms. J. Chem. Phys., 146, 120902. doi:10.1063/1.4979117.CrossRefGoogle ScholarPubMed

Casares, P. A. M., Campos, R., and Martin-Delgado, M. A. (2022). TFermion: A non-Clifford gate cost assessment library of quantum phase estimation algorithms for quantum chemistry. Quantum, 6, 768. doi:10.22331/q-2022-07-20-768. arXiv:2110.05899.CrossRefGoogle Scholar

Castryck, W., and Decru, T. (2023). An efficient key recovery attack on SIDH. Pages 423–447 of: EUROCRYPT. doi:10.1007/978-3-031-30589-4_15. ePrint:2022/975.CrossRefGoogle Scholar

Cerezo, M., Sone, A., Volkoff, T., et al. (2021). Cost function dependent barren plateaus in shallow parametrized quantum circuits. Nat. Commun., 12, 1–12. doi:10.1038/s41467-021-21728-w. arXiv:2001.00550.CrossRefGoogle ScholarPubMed

Cerezo, M., Arrasmith, A., Babbush, R., et al. (2021). Variational quantum algorithms. Nat. Rev. Phys., 625–644. doi:10.1038/s42254-021-00348-9. arXiv:2012.09265.CrossRefGoogle Scholar

Cerezo, M., Verdon, G., Huang, H.-Y., et al. (2022). Challenges and opportunities in quantum machine learning. Nat. Comput. Sci., 2, 567–576. doi:10.1038/s43588-022-00311-3. arXiv:2303.09491.CrossRefGoogle ScholarPubMed

Cerezo, M., Larocca, M., García-Martín, D., et al. (2023). Does provable absence of barren plateaus imply classical simulability? Or, why we need to rethink variational quantum computing. arXiv:2312.09121.Google Scholar

Cerjan, C. (1993). Numerical grid methods and their application to Schrödinger’s equation. Vol. 412. Springer Science & Business Media. doi:10.1007/978-94-015-8240-7.CrossRefGoogle Scholar

Chakrabarti, S., Childs, A. M., Li, T., and Wu, X. (2020). Quantum algorithms and lower bounds for convex optimization. Quantum, 4, 221. doi:10.22331/q-2020-01-13-221. arXiv:1809.01731.CrossRefGoogle Scholar

Chakrabarti, S., Krishnakumar, R., Mazzola, G., et al. (2021). A threshold for quantum advantage in derivative pricing. Quantum, 5, 463. doi:10.22331/q-2021-06-01-463. arXiv:2012.03819.CrossRefGoogle Scholar

Chakrabarti, S., Minssen, P., Yalovetzky, R., and Pistoia, M. (2022). Universal quantum speedup for branch-and-bound, branch-and-cut, and tree-search algorithms. arXiv:2210.03210.Google Scholar

Chakraborty, S., Gilyén, A., and Jeffery, S. (2019). The power of block-encoded matrix powers: Improved regression techniques via faster Hamiltonian simulation. Pages 33:1–33:14 of: ICALP. doi:10.4230/LIPIcs.ICALP.2019.33. arXiv:1804.01973.Google Scholar

Chamberland, C., and Cross, A. W. (2019). Fault-tolerant magic state preparation with flag qubits. Quantum, 3, 143. doi:10.22331/q-2019-05-20-143. arXiv:1811.00566.CrossRefGoogle Scholar

Chamberland, C., Noh, K., Arrangoiz-Arriola, P., et al. (2022). Building a fault-tolerant quantum computer using concatenated cat codes. PRX Quantum, 3, 010329. doi:10.1103/PRXQuantum.3.010329. arXiv:2012.04108.CrossRefGoogle Scholar

Chamberland, C., Goncalves, L., Sivarajah, P., et al. (2023). Techniques for combining fast local decoders with global decoders under circuit-level noise. Quantum Sci. Technol., 8, 045011. doi:10.1088/2058-9565/ace64d. arXiv:2208.01178.CrossRefGoogle Scholar

Chan, G. K.-L. (2024). Spiers memorial lecture: Quantum chemistry, classical heuristics, and quantum advantage. Faraday Discuss., 254, 11–52. doi:10.1039/D4FD00141A. arXiv:2407.11235.CrossRefGoogle ScholarPubMed

Chan, H. H. S., Meister, R., Jones, T., et al. (2023). Grid-based methods for chemistry simulations on a quantum computer. Sci. Adv., 9, eabo7484. doi:10.1126/sciadv.abo7484. arXiv:2202.05864.CrossRefGoogle ScholarPubMed

Chao, R., and Reichardt, B. W. (2020). Flag fault-tolerant error correction for any stabilizer code. PRX Quantum, 1. doi:10.1103/prxquantum.1.010302. arXiv:1912.09549.CrossRefGoogle Scholar

Chao, R., Ding, D., Gilyén, A., et al. (2020). Finding angles for quantum signal processing with machine precision. arXiv:2003.02831.Google Scholar

Chen, C.-F., and Brandão, F. G. S. L. (2021). Fast thermalization from the eigenstate thermalization hypothesis. arXiv:2112.07646.Google Scholar

Chen, C.-F., and Brandão, F. G. S. L. (2024). Average-case speedup for product formulas. Commun. Math. Phys., 405, 32. doi:10.1007/s00220-023-04912-5. arXiv:2111.05324.CrossRefGoogle Scholar

Chen, C.-F., Huang, H.-Y., Kueng, R., and Tropp, J. A. (2021). Concentration for random product formulas. PRX Quantum, 2. doi:10.1103/prxquantum.2.040305. arXiv:2008.11751.CrossRefGoogle Scholar

Chen, C.-F., Kastoryano, M. J., and Gilyén, A. (2023). An efficient and exact noncommutative quantum Gibbs sampler. arXiv:2311.09207.Google Scholar

Chen, C.-F., Kastoryano, M. J., Brandão, F. G. S. L., and Gilyén, A. (2023). Quantum thermal state preparation. arXiv:2303.18224.Google Scholar

Chen, C.-F., Lucas, A., and Yin, C. (2023). Speed limits and locality in many-body quantum dynamics. Rep. Prog. Phys., 86, 116001. doi:10.1088/1361-6633/acfaae. arXiv:2303.07386.Google Scholar

Chen, J., Stoudenmire, E., and White, S. R. (2023). Quantum Fourier transform has small entanglement. PRX Quantum, 4, 040318. doi:10.1103/PRXQuantum.4.040318. arXiv:2210.08468.CrossRefGoogle Scholar

Chen, L., Jordan, S., Liu, Y.-K., et al. (2016). Report on post-quantum cryptography. Tech. rept. NISTIR 8105. National Institute of Standards and Technology, Gaithersburg, MD. doi:10.6028/NIST.IR.8105.CrossRefGoogle Scholar

Chen, M.-H., Yu, C.-H., Gao, J.-L., et al. (2022). Quantum algorithm for Gaussian process regression. Phys. Rev. A, 106, 012406. doi:10.1103/PhysRevA.106.012406. arXiv:2106.06701.CrossRefGoogle Scholar

Chen, S., Cotler, J., Huang, H.-Y., and Li, J. (2022). Exponential separations between learning with and without quantum memory. Pages 574–585 of: FOCS. doi:10.1109/FOCS52979.2021.00063. arXiv:2111.05881.CrossRefGoogle Scholar

Chen, Y., and de Wolf, R. (2023). Quantum algorithms and lower bounds for linear regression with norm constraints. Pages 38:1–38:21 of: ICALP. doi:10.4230/LIPIcs.ICALP.2023.38. arXiv:2110.13086.Google Scholar

Chen, Y., Gilyén, A., and de Wolf, R. (2025). A quantum speed-up for approximating the top eigenvectors of a matrix. In: SODA. Accepted, arXiv:2405.14765.Google Scholar

Chen, Z.-Y., Xue, C., Chen, S.-M., et al. (2022). Quantum approach to accelerate finite volume method on steady computational fluid dynamics problems. Quantum Inf. Process., 21, 137. doi:10.1007/s11128-022-03478-w. arXiv:2102.03557.CrossRefGoogle Scholar

Chen, Z.-Y., Xue, C., Sun, T.-P., et al. (2023). An efficient and error-resilient protocol for quantum random access memory with generalized data size. arXiv:2303.05207.Google Scholar

Chepurko, N., Clarkson, K., Horesh, L., et al. (2022). Quantum-inspired algorithms from randomized numerical linear algebra. Pages 3879–3900 of: ICML, vol. 162. arXiv:2011.04125.Google Scholar

Chia, N.-H., Gilyén, A. P., Li, T., et al. (2022). Sampling-based sublinear lowrank matrix arithmetic framework for dequantizing quantum machine learning. J. ACM, 69, 1–72. doi:10.1145/3549524. Earlier version in STOC’20. arXiv:1910.06151.CrossRefGoogle Scholar

Chiang, C.-F., and Wocjan, P. (2010). Quantum algorithm for preparing thermal Gibbs states-detailed analysis. Pages 138–147 of: Quantum Cryptography and Computing, vol. 26. doi:10.3233/978-1-60750-547-1-138. arXiv:1001.1130.CrossRefGoogle Scholar

Chiesa, A., Tacchino, F., Grossi, M., et al. (2019). Quantum hardware simulating four-dimensional inelastic neutron scattering. Nat. Phys., 15, 455–459. doi:10.1038/s41567-019-0437-4. arXiv:1809.07974.CrossRefGoogle Scholar

Childs, A., Jao, D., and Soukharev, V. (2014). Constructing elliptic curve isogenies in quantum subexponential time. J. Math. Cryptol., 8, 1–29. doi:10.1515/jmc-2012-0016. arXiv:1012.4019.CrossRefGoogle Scholar

Childs, A. M. (2010). On the relationship between continuousand discrete-time quantum walk. Commun. Math. Phys., 294, 581–603. doi:10.1007/s00220-009-0930-1. arXiv:0810.0312.CrossRefGoogle Scholar

Childs, A. M. (2022). Lecture notes on quantum algorithms. https://cs.umd.edu/˜amchilds/qa/, accessed: 2024-12-01.Google Scholar

Childs, A. M., and van Dam, W. (2010). Quantum algorithms for algebrai problems. Rev. Mod. Phys., 82, 1–52. doi:10.1103/RevModPhys.82.1. arXiv:0812.0380.CrossRefGoogle Scholar

Childs, A. M., and Kothari, R. (2011). Simulating sparse Hamiltonians with star decompositions. Pages 94–103 of: TQC. doi:10.1007/978-3-642-18073-6_8. arXiv:1003.3683.CrossRefGoogle Scholar

Childs, A. M., and Liu, J.-P. (2020). Quantum spectral methods for differential equations. Commun. Math. Phys., 375, 1427–1457. doi:10.1007/s00220-020-03699-z. arXiv:1901.00961.CrossRefGoogle Scholar

Childs, A. M., and Su, Y. (2019). Nearly optimal lattice simulation by product formulas. Phys. Rev. Lett., 123, 050503. doi:10.1103/PhysRevLett.123.050503. arXiv:1901.00564.CrossRefGoogle ScholarPubMed

Childs, A. M., and Wiebe, N. (2012). Hamiltonian simulation using linear combinations of unitary operations. Quantum Inf. Comput., 12, 901–924. doi:10.26421/QIC12.11-12. arXiv:1202.5822.Google Scholar

Childs, A. M., Kothari, R., and Somma, R. D. (2017). Quantum algorithm for systems of linear equations with exponentially improved dependence on precision. SIAM J. Comp., 46, 1920–1950. doi:10.1137/16M1087072. arXiv:1511.02306.CrossRefGoogle Scholar

Childs, A. M., Maslov, D., Nam, Y., et al. (2018). Toward the first quantum simulation with quantum speedup. Proc. Natl. Acad. Sci., 115, 9456–9461. doi:10.1073/pnas.1801723115. arXiv:1711.10980.CrossRefGoogle ScholarPubMed

Childs, A. M., Ostrander, A., and Su, Y. (2019). Faster quantum simulation by randomization. Quantum, 3, 182. doi:10.22331/q-2019-09-02-182. arXiv:1805.08385.CrossRefGoogle Scholar

Childs, A. M., Liu, J.-P., and Ostrander, A. (2021). High-precision quantum algorithms for partial differential equations. Quantum, 5, 574. doi:10.22331/q-2021-11-10-574. arXiv:2002.07868.CrossRefGoogle Scholar

Childs, A. M., Su, Y., Tran, M. C., et al. (2021). Theory of Trotter error with commutator scaling. Phys. Rev. X, 11. doi:10.1103/physrevx.11.011020. arXiv:1912.08854.Google Scholar

Childs, A. M., Leng, J., Li, T., et al. (2022). Quantum simulation of realspace dynamics. Quantum, 6, 860. doi:10.22331/q-2022-11-17-860. arXiv:2203.17006.CrossRefGoogle Scholar

Cho, C. H., Berry, D. W., and Hsieh, M.-H. (2022). Doubling the order of approximation via the randomized product formula. arXiv:2210.11281.Google Scholar

Chowdhury, A. N., and Somma, R. D. (2017). Quantum algorithms for Gibbs sampling and hitting-time estimation. Quantum Inf. Comput., 17, 41–64. doi:10.26421/QIC17.1-2. arXiv:1603.02940.Google Scholar

Chowdhury, A. N., Somma, R. D., and SubaŞı, Y. (2021). Computing partition functions in the one-clean-qubit model. Phys. Rev. A, 103, 032422. doi:10.1103/PhysRevA.103.032422. arXiv:1910.11842.CrossRefGoogle Scholar

Chubb, C. T. (2021). General tensor network decoding of 2D Pauli codes. arXiv:2101.04125.Google Scholar

Ciavarella, A., Klco, N., and Savage, M. J. (2021). Trailhead for quantum simulation of SU(3) Yang–Mills lattice gauge theory in the local multiplet basis. Phys. Rev. D, 103, 094501. doi:10.1103/PhysRevD.103.094501. arXiv:2101.10227.CrossRefGoogle Scholar

Ciliberto, C., Herbster, M., Ialongo, A. D., et al. (2018). Quantum machine learning: A classical perspective. Proc. R. Soc. A, 474, 20170551. doi:10.1098/rspa.2017.0551. arXiv:1707.08561.CrossRefGoogle ScholarPubMed

Cirstoiu, C., Holmes, Z., Iosue, J., et al. (2020). Variational fast forwarding for quantum simulation beyond the coherence time. npj Quant. Inf., 6, 82. doi:10.1038/s41534-020-00302-0. arXiv:1910.04292.Google Scholar

Clader, B. D., Jacobs, B. C., and Sprouse, C. R. (2013). Preconditioned quantum linear system algorithm. Phys. Rev. Lett., 110, 250504. doi:10.1103/PhysRevLett.110.250504. arXiv:1301.2340.CrossRefGoogle ScholarPubMed

Clader, B. D., Dalzell, A. M., Stamatopoulos, N., et al. (2022). Quantum resources required to block-encode a matrix of classical data. IEEE Trans. Quantum Eng., 3, 1–23. doi:10.1109/TQE.2022.3231194. arXiv:2206.03505.CrossRefGoogle Scholar

Cleve, R., and Wang, C. (2017). Efficient quantum algorithms for simulating Lindblad evolution. Pages 17:1–17:14 of: ICALP. doi:10.4230/LIPIcs.ICALP.2017.17. arXiv:1612.09512.Google Scholar

Cleve, R., and Watrous, J. (2000). Fast parallel circuits for the quantum Fourier transform. Pages 526–536 of: FOCS. doi:10.1109/SFCS.2000.892140. arXiv:quant-ph/0006004.CrossRefGoogle Scholar

Cleve, R., Ekert, A., Macchiavello, C., and Mosca, M. (1998). Quantum algorithms revisited. Proc. R. Soc. A, 454, 339–354. doi:10.1098/rspa.1998.0164. arXiv:quant-ph/9708016.CrossRefGoogle Scholar

Clinton, L., Bausch, J., and Cubitt, T. (2021). Hamiltonian simulation algorithms for near-term quantum hardware. Nat. Commun., 12, 4989. doi:10.1038/s41467-021-25196-0. arXiv:2003.06886.CrossRefGoogle ScholarPubMed

Clinton, L., Cubitt, T., Flynn, B., et al. (2024). Towards nearterm quantum simulation of materials. Nat. Commun., 15, 211. doi:10.1038/s41467-023-43479-6. arXiv:2205.15256.CrossRefGoogle ScholarPubMed

Coecke, B., and Kissinger, A. (2017). Picturing quantum processes. Cambridge University Press. doi:10.1017/9781316219317.Google Scholar

Cohen, L. Z., Kim, I. H., Bartlett, S. D., and Brown, B. J. (2022). Low-overhead fault-tolerant quantum computing using long-range connectivity. Sci. Adv., 8. doi:10.1126/sciadv.abn1717.CrossRefGoogle ScholarPubMed

Cohen, M. B., Lee, Y. T., and Song, Z. (2021). Solving linear programs in the current matrix multiplication time. J. ACM, 68. doi:10.1145/3424305. arXiv:1810.07896.CrossRefGoogle Scholar

Commeau, B., Cerezo, M., Holmes, Z., et al. (2020). Variational Hamiltonian diagonalization for dynamical quantum simulation. arXiv:2009.02559.Google Scholar

Cong, I., Choi, S., and Lukin, M. D. (2019). Quantum convolutional neural networks. Nat. Phys., 15, 1273–1278. doi:10.1038/s41567-019-0648-8. arXiv:1810.03787.CrossRefGoogle Scholar

Coppersmith, D., Gamarnik, D., Hajiaghayi, M., and Sorkin, G. B. (2004). Random MAX SAT, random MAX CUT, and their phase transitions. Rand. Struct. Algorithms, 24, 502–545. doi:10.1002/rsa.20015. Earlier version in SODA’03. arXiv:math/0306047.Google Scholar

Cornelissen, A., and Hamoudi, Y. (2023). A sublinear-time quantum algorithm for approximating partition functions. Pages 1245–1264 of: SODA. doi:10.1137/1.9781611977554.ch46. arXiv:2207.08643.CrossRefGoogle Scholar

Cornelissen, A., and Jerbi, S. (2021). Quantum algorithms for multivariate Monte Carlo estimation. arXiv:2107.03410.Google Scholar

Cornelissen, A., Hamoudi, Y., and Jerbi, S. (2022). Near-optimal quantum algorithms for multivariate mean estimation. Pages 33–43 of: STOC. doi:10.1145/3519935.3520045. arXiv:2111.09787.CrossRefGoogle Scholar

Cornuejols, G., and Tütüncü, R. (2006). Optimization methods in finance. Vol. 5. Cambridge University Press.CrossRefGoogle Scholar

Costa, P. C., Jordan, S., and Ostrander, A. (2019). Quantum algorithm for simulating the wave equation. Phys. Rev. A, 99, 012323. doi:10.1103/PhysRevA.99.012323.CrossRefGoogle Scholar

Costa, P. C., An, D., Sanders, Y. R., et al. (2022). Optimal scaling quantum linear-systems solver via discrete adiabatic theorem. PRX Quantum, 3, 040303. doi:10.1103/PRXQuantum.3.040303. arXiv:2111.08152.CrossRefGoogle Scholar

Costa, P. C. S., An, D., Babbush, R., and Berry, D. (2023). The discrete adiabatic quantum linear system solver has lower constant factors than the randomized adiabatic solver. arXiv:2312.07690.Google Scholar

Costa, P. C. S., Schleich, P., Morales, M. E. S., and Berry, D. W. (2023). Further improving quantum algorithms for nonlinear differential equations via higherorder methods and rescaling. arXiv:2312.09518.Google Scholar

Cotler, J. S., Gur-Ari, G., Hanada, M., et al. (2017). Black holes and random matrices. J. High Energy Phys., 2017, 1–54. doi:10.1007/JHEP05(2017)118. arXiv:1611.04650.CrossRefGoogle Scholar

Cramer, M., Plenio, M. B., Flammia, S. T., et al. (2010). Efficient quantum state tomography. Nat. Commun., 1, 149. doi:10.1038/ncomms1147. arXiv:1101.4366.CrossRefGoogle ScholarPubMed

Cramer, R., Ducas, L., and Wesolowski, B. (2017). Short Stickelberger class relations and application to Ideal-SVP. Pages 324–348 of: EUROCRYPT. ePrint:2016/885.Google Scholar

Crichigno, M., and Kohler, T. (2022). Clique homology is QMA1-hard. arXiv:2209.11793.Google Scholar

Criger, B., and Ashraf, I. (2018). Multi-path summation for decoding 2d topological codes. Quantum, 2, 102. doi:10.22331/q-2018-10-19-102. arXiv:1709.02154.CrossRefGoogle Scholar

Crooks, G. E. (2019). Gradients of parameterized quantum gates using the parameter-shift rule and gate decomposition. arXiv:1905.13311.Google Scholar

Crosson, E., and Harrow, A. W. (2016). Simulated quantum annealing can be exponentially faster than classical simulated annealing. Pages 714–723 of: FOCS. doi:10.1109/FOCS.2016.81. arXiv:1601.03030.CrossRefGoogle Scholar

Crosson, E., and Lidar, D. (2021). Prospects for quantum enhancement with diabatic quantum annealing. Nat. Rev. Phys., 3, 466–489. doi:10.1038/s42254-021-00313-6. arXiv:2008.09913.CrossRefGoogle Scholar

Crosson, E., and Slezak, S. (2020). Classical simulation of high temperature quantum Ising models. doi:10.48550/arXiv.2002.02232. arXiv:2002.02232.CrossRefGoogle Scholar

Cunningham, J., and Roland, J. (2024). Eigenpath traversal by poissondistributed phase randomisation. arXiv:2406.03972.Google Scholar

Daley, A. J., Bloch, I., Kokail, C., et al. (2022). Practical quantum advantage in quantum simulation. Nature, 607, 667–676. doi:10.1038/s41586-022-04940-6.CrossRefGoogle ScholarPubMed

Dalzell, A. M. (2024). A shortcut to an optimal quantum linear system solver. arXiv:2406.12086.Google Scholar

Dalzell, A. M., Clader, B. D., Salton, G., et al. (2023). End-to-end resource analysis for quantum interior-point methods and portfolio optimization. PRX Quantum, 4, 040325. doi:10.1103/PRXQuantum.4.040325. arXiv:2211.12489.CrossRefGoogle Scholar

Dalzell, A. M., Pancotti, N., Campbell, E. T., and Brandão, F. G. (2023). Mind the gap: Achieving a super-Grover quantum speedup by jumping to the end. Pages 1131–1144 of: STOC. doi:10.1145/3564246.3585203. arXiv:2212.01513.CrossRefGoogle Scholar

Damm, C., Holzer, M., and McKenzie, P. (2002). The complexity of tensor calculus. Comput. Complex., 11, 54–89. doi:10.1007/s00037-000-0170-4.CrossRefGoogle Scholar

Darmawan, A. S., and Poulin, D. (2017). Tensor-network simulations of the surface code under realistic noise. Phys. Rev. Lett., 119, 040502. doi:10.1103/PhysRevLett.119.040502. arXiv:1607.06460.CrossRefGoogle ScholarPubMed

Davoudi, Z., Detmold, W., Shanahan, P., et al. (2021). Nuclear matrix elements from lattice QCD for electroweak and beyond-Standard-Model processes. Phys. Rep., 900, 1–74. doi:10.1016/j.physrep.2020.10.004.CrossRefGoogle Scholar

Davoudi, Z., Neil, E. T., Bauer, C. W., et al. (2022). Report of the Snowmass 2021 topical group on lattice gauge theory. Proceedings of the US Community Study on the Future of Particle Physics (Snowmass 2021). arXiv:2209.10758.Google Scholar

Davoudi, Z., Shaw, A. F., and Stryker, J. R. (2023). General quantum algorithms for Hamiltonian simulation with applications to a non-abelian lattice gauge theory. Quantum, 7, 1213. doi:10.22331/q-2023-12-20-1213. arXiv:2212.14030.CrossRefGoogle Scholar

de Beaudrap, N., and Horsman, D. (2020). The ZX calculus is a language for surface code lattice surgery. Quantum, 4, 218. doi:10.22331/q-2020-01-09-218. arXiv:1704.08670.CrossRefGoogle Scholar

De Palma, G., Marvian, M., Rouzé, C., and Franc¸a, D. S. (2023). Limitations of variational quantum algorithms: A quantum optimal transport approach. PRX Quantum, 4, 010309. doi:10.1103/PRXQuantum.4.010309. arXiv:2204.03455.CrossRefGoogle Scholar

Dean, D. J. (2007). Beyond the nuclear shell model. Phys. Today, 60, 48–53. doi:10.1063/1.2812123.CrossRefGoogle Scholar

Delfosse, N., and Nickerson, N. H. (2021). Almost-linear time decoding algorithm for topological codes. Quantum, 5, 595. doi:10.22331/q-2021-12-02-595. arXiv:1709.06218.CrossRefGoogle Scholar

Delfosse, N., Reichardt, B. W., and Svore, K. M. (2022). Beyond single-shot fault-tolerant quantum error correction. IEEE Trans. Inf. Theory, 68, 287–301. doi:10.1109/tit.2021.3120685. arXiv:2002.05180.CrossRefGoogle Scholar

Delgado, A., Hamilton, K. E., Date, P., et al. (2022). Quantum computing for data analysis in high-energy physics. arXiv:2203.08805.Google Scholar

Delgado, A., Casares, P. A. M., dos Reis, R., et al. (2022). Simulating key properties of lithium-ion batteries with a fault-tolerant quantum computer. Phys. Rev. A, 106, 032428. doi:10.1103/PhysRevA.106.032428. arXiv:2204.11890.CrossRefGoogle Scholar

Deng, C., Sun, F., Qian, X., et al. (2019). TIE: Energy-efficient tensor trainbased inference engine for deep neural network. Pages 264–278 of: ISCA. doi:10.1145/3307650.3322258.CrossRefGoogle Scholar

Dennis, E., Kitaev, A., Landahl, A., and Preskill, J. (2002). Topological quantum memory. J. Math. Phys., 43, 4452–4505. doi:10.1063/1.1499754. arXiv:quant-ph/0110143.CrossRefGoogle Scholar

Derby, C., Klassen, J., Bausch, J., and Cubitt, T. (2021). Compact fermion to qubit mappings. Phys. Rev. B, 104, 035118. doi:10.1103/PhysRevB.104.035118. arXiv:2003.06939.CrossRefGoogle Scholar

Derrida, B. (1980). Random-energy model: Limit of a family of disordered models. Phys. Rev. Lett., 45, 79–82. doi:10.1103/PhysRevLett.45.79.CrossRefGoogle Scholar

Deutsch, D. (1985). Quantum theory, the Church–Turing principle and the universal quantum computer. Proc. R. Soc. A, 400, 97–117. doi:10.1098/rspa.1985.0070.Google Scholar

Deutsch, D., and Jozsa, R. (1992). Rapid solution of problems by quantum computation. Proc. R. Soc. A, 439, 553–558. doi:10.1098/rspa.1992.0167.Google Scholar

Devoret, M. H., and Schoelkopf, R. J. (2013). Superconducting circuits for quantum information: An outlook. Science, 339, 1169–1174. doi:10.1126/science.123193.CrossRefGoogle ScholarPubMed

Di Matteo, O., Gheorghiu, V., and Mosca, M. (2020). Fault-tolerant resource estimation of quantum random-access memories. IEEE Trans. Quantum Eng., 1, 1–13. doi:10.1109/TQE.2020.2965803. arXiv:1902.01329.CrossRefGoogle Scholar

Ding, C., Bao, T.-Y., and Huang, H.-L. (2022). Quantum-inspired support vector machine. IEEE Trans. Neural Netw. Learn. Syst., 33, 7210–7222. doi:10.1109/TNNLS.2021.3084467. arXiv:1906.08902.CrossRefGoogle ScholarPubMed

Ding, Z., Chen, C.-F., and Lin, L. (2024). Single-ancilla ground state preparation via Lindbladians. Phys. Rev. Res., 6, 033147. doi:10.1103/PhysRevResearch.6.033147. arXiv:2308.15676.CrossRefGoogle Scholar

Dinur, I., Evra, S., Livne, R., et al. (2022). Locally testable codes with constant rate, distance, and locality. Pages 357–374 of: STOC. doi:10.1145/3519935.3520024. arXiv:2111.04808.CrossRefGoogle Scholar

DiVincenzo, D. P., and Aliferis, P. (2007). Effective fault-tolerant quantum computation with slow measurements. Phys. Rev. Lett., 98. doi:10.1103/physrevlett.98.020501.CrossRefGoogle ScholarPubMed

Dodin, I. Y., and Startsev, E. A. (2021). On applications of quantum computing to plasma simulations. Phys. Plasmas, 28, 092101. doi:10.1063/5.0056974. arXiv:2005.14369.CrossRefGoogle Scholar

Domahidi, A., Chu, E., and Boyd, S. (2013). ECOS: An SOCP solver for embedded systems. Pages 3071–3076 of: ECC. doi:10.23919/ECC.2013.6669541.CrossRefGoogle Scholar

Dong, Y., Meng, X., Whaley, K. B., and Lin, L. (2021). Efficient phasefactor evaluation in quantum signal processing. Phys. Rev. A, 103, 042419. doi:10.1103/PhysRevA.103.042419. arXiv:2002.11649.CrossRefGoogle Scholar

Dong, Y., Gross, J., and Niu, M. Y. (2022). Beyond Heisenberg limit quantum metrology through quantum signal processing. arXiv:2209.11207.Google Scholar

Dong, Y., Lin, L., and Tong, Y. (2022). Ground-state preparation and energy estimation on early fault-tolerant quantum computers via quantum eigenvalue transformation of unitary matrices. PRX Quantum, 3, 040305. doi:10.1103/PRXQuantum.3.040305. arXiv:2204.05955.CrossRefGoogle Scholar

Dong, Y., Lin, L., Ni, H., and Wang, J. (2022). Infinite quantum signal processing. arXiv:2209.10162.Google Scholar

Dong, Y., Lin, L., Ni, H., and Wang, J. (2023). Robust iterative method for symmetric quantum signal processing in all parameter regimes. arXiv:2307.12468.Google Scholar

Doriguello, J. a. F., Luongo, A., Bao, J., et al. (2022). Quantum algorithm for stochastic optimal stopping problems with applications in finance. Pages 2:1–2:24 of: TQC. doi:10.4230/LIPIcs.TQC.2022.2. arXiv:2111.15332.CrossRefGoogle Scholar

Du, Y., Hsieh, M.-H., Liu, T., and Tao, D. (2020). Expressive power of parametrized quantum circuits. Phys. Rev. Res., 2, 033125. doi:10.1103/PhysRevResearch.2.033125. arXiv:1810.11922.CrossRefGoogle Scholar

Dua, A., Kubica, A., Jiang, L., et al. (2024). Clifford-deformed surface codes. PRX Quantum, 5. doi:10.1103/prxquantum.5.010347. arXiv:2201.07802.CrossRefGoogle Scholar

Duclos-Cianci, G., and Poulin, D. (2010). Fast decoders for topological quantum codes. Phys. Rev. Lett., 104, 050504. doi:10.1103/PhysRevLett.104.050504. arXiv:0911.0581.CrossRefGoogle ScholarPubMed

Dukalski, M. (2021). Toward an application of quantum computing in geophysics. Pages 1–5 of: Fifth EAGE Workshop on High Performance Computing for Upstream, vol. 2021. doi:10.3997/2214-4609.2021612005.CrossRefGoogle Scholar

Dumitrescu, E. F., McCaskey, A. J., Hagen, G., et al. (2018). Cloud quantum computing of an atomic nucleus. Phys. Rev. Lett., 120, 210501. doi:10.1103/PhysRevLett.120.210501. arXiv:1801.03897.CrossRefGoogle ScholarPubMed

Dürr, C., and Høyer, P. (1996). A quantum algorithm for finding the minimum. arXiv:quant-ph/9607014.Google Scholar

Dürr, C., Heiligman, M., Høyer, P., and Mhalla, M. (2006). Quantum query complexity of some graph problems. SIAM J. Comp., 35, 1310–1328. doi:10.1137/050644719. Earlier version in ICALP’04. arXiv:quant-ph/0401091.CrossRefGoogle Scholar

Dürr, S., Fodor, Z., Frison, J., et al. (2008). Ab initio determination of light hadron masses. Science, 322, 1224–1227. doi:10.1126/science.1163233. arXiv:0906.3599.CrossRefGoogle ScholarPubMed

Eastin, B., and Knill, E. (2009). Restrictions on transversal encoded quantum gate sets. Phys. Rev. Lett., 102, 110502. doi:10.1103/physrevlett.102.110502. arXiv:0811.4262.CrossRefGoogle ScholarPubMed

Ebadi, S., Wang, T. T., Levine, H., et al. (2021). Quantum phases of matter on a 256-atom programmable quantum simulator. Nature, 595, 227. doi:10.1038/s41586-021-03582-4. arXiv:2012.12281.CrossRefGoogle ScholarPubMed

Edmonds, J. (1965). Paths, trees, and flowers. Can. J. Math., 17, 449–467. doi:10.4153/CJM-1965-045-4.CrossRefGoogle Scholar

Elben, A., Flammia, S. T., Huang, H.-Y., et al. (2023). The randomized measurement toolbox. Nat. Rev. Phys., 5, 9–24. doi:10.1038/s42254-022-00535-2. arXiv:2203.11374.Google Scholar

Elenewski, J. E., Camara, C. M., and Kalev, A. (2024). Prospects for NMR spectral prediction on fault-tolerant quantum computers. arXiv:2406.09340.Google Scholar

Elfving, V. E., Broer, B. W., Webber, M., et al. (2020). How will quantum computers provide an industrially relevant computational advantage in quantum chemistry? arXiv:2009.12472.Google Scholar

Elgart, A., and Hagedorn, G. A. (2012). A note on the switching adiabatic theorem. J. Math. Phys., 53, 102202. doi:10.1063/1.4748968. arXiv:1204.2318.CrossRefGoogle Scholar

Engel, A., Smith, G., and Parker, S. E. (2019). Quantum algorithm for the Vlasov equation. Phys. Rev. A, 100, 062315. doi:10.1103/PhysRevA.100.062315. arXiv:1907.09418.CrossRefGoogle Scholar

Engineering, S., and (SEAR), A. (2024). iMessage with PQ3: The new state of the art in quantum-secure messaging at scale. https://security.apple.com/blog/imessage-pq3/, accessed: 2024-06-05.Google Scholar

Fang, D., Lin, L., and Tong, Y. (2023). Time-marching based quantum solvers for time-dependent linear differential equations. Quantum, 7, 955. doi:10.22331/q-2023-03-20-955. arXiv:2208.06941.CrossRefGoogle Scholar

Farhi, E., and Harrow, A. W. (2016). Quantum supremacy through the quantum approximate optimization algorithm. arXiv:1602.07674.Google Scholar

Farhi, E., and Neven, H. (2018). Classification with quantum neural networks on near term processors. arXiv:1802.06002.Google Scholar

Farhi, E., Goldstone, J., Gutmann, S., and Sipser, M. (2000). Quantum computation by adiabatic evolution. arXiv:quant-ph/0001106.Google Scholar

Farhi, E., Goldstone, J., Gosset, D., et al. (2009). Quantum adiabatic algorithms, small gaps, and different paths. Quantum Inf. Comput., 11, 181–214. doi:10.26421/QIC11.3-4-1. arXiv:0909.4766.Google Scholar