B References

Aaronson, Scott, and Patrick Rall. 2020. “Quantum Approximate Counting, Simplified.” In Symposium on Simplicity in Algorithms, 24–32. SIAM.

Ahmadi, Hamed, and Chen-Fu Chiang. 2010. “Quantum Phase Estimation with Arbitrary Constant-Precision Phase Shift Operators.” arXiv Preprint arXiv:1012.4727.

Ambainis, A. 2012. “Variable Time Amplitude Amplification and a Faster Quantum Algorithm for Solving Systems of Linear Equations 29th Int.” In Symp. Theoretical Aspects of Computer Science (STACS 2012), 14:636–47.

Ambainis, Andris. 2012. “Variable Time Amplitude Amplification and Quantum Algorithms for Linear Algebra Problems.” In STACS’12 (29th Symposium on Theoretical Aspects of Computer Science), 14:636–47. LIPIcs.

Ambainis, Andris, Kaspars Balodis, Jānis Iraids, Martins Kokainis, Krišjānis Prūsis, and Jevgēnijs Vihrovs. 2019. “Quantum Speedups for Exponential-Time Dynamic Programming Algorithms.” In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 1783–93. SIAM.

Andrew, Childs. 2017. “Lecture Notes on Quantum Algorithms.” https://www.cs.umd.edu/~amchilds/qa/.

Berry, Dominic W, Andrew M Childs, Richard Cleve, Robin Kothari, and Rolando D Somma. 2015. “Simulating Hamiltonian Dynamics with a Truncated Taylor Series.” Physical Review Letters 114 (9): 090502.

Berry, Dominic W, Andrew M Childs, and Robin Kothari. 2015. “Hamiltonian Simulation with Nearly Optimal Dependence on All Parameters.” In 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 792–809. IEEE.

Boyer, Michel, Gilles Brassard, Peter Høyer, and Alain Tapp. 1998. “Tight Bounds on Quantum Searching.” Fortschritte Der Physik: Progress of Physics 46 (4-5): 493–505.

Brassard, Gilles, Peter Hoyer, Michele Mosca, and Alain Tapp. 2002. “Quantum Amplitude Amplification and Estimation.” Contemporary Mathematics 305: 53–74.

Chakraborty, Shantanav, András Gilyén, and Stacey Jeffery. 2019. “The Power of Block-Encoded Matrix Powers: Improved Regression Techniques via Faster Hamiltonian Simulation.” In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.

Childs, Andrew M, Robin Kothari, and Rolando D Somma. 2015. “Quantum linear systems algorithm with exponentially improved dependence on precision.”

Childs, Andrew M, and Nathan Wiebe. 2012. “Hamiltonian Simulation Using Linear Combinations of Unitary Operations.” arXiv Preprint arXiv:1202.5822.

Durr, Christoph, and Peter Hoyer. 1996. “A Quantum Algorithm for Finding the Minimum.” arXiv Preprint Quant-Ph/9607014.

Gilyén, András, Yuan Su, Guang Hao Low, and Nathan Wiebe. 2019. “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, 193–204.

Grinko, Dmitry, Julien Gacon, Christa Zoufal, and Stefan Woerner. 2019. “Iterative Quantum Amplitude Estimation.” arXiv Preprint arXiv:1912.05559.

Grover, Lov K. 2005. “Fixed-Point Quantum Search.” Physical Review Letters 95 (15): 150501.

Hamoudi, Yassine, Maharshi Ray, Patrick Rebentrost, Miklos Santha, Xin Wang, and Siyi Yang. 2020. “Quantum Algorithms for Hedging and the Sparsitron.” arXiv Preprint arXiv:2002.06003.

Kerenidis, Iordanis, Jonas Landman, Alessandro Luongo, and Anupam Prakash. 2019. “Q-Means: A Quantum Algorithm for Unsupervised Machine Learning.” In Advances in Neural Information Processing Systems, 4136–46.

Kerenidis, Iordanis, and Anupam Prakash. 2020. “Quantum Gradient Descent for Linear Systems and Least Squares.” Physical Review A 101 (2): 022316.

Kitaev, A Yu. 1996. “Quantum Measurements and the Abelian Stabilizer Problem.” In Electronic Colloq. On Computational Complexity.

Low, Guang Hao, and Isaac L Chuang. 2017. “Hamiltonian Simulation by Uniform Spectral Amplification.” arXiv Preprint arXiv:1707.05391.

———. 2019. “Hamiltonian Simulation by Qubitization.” Quantum 3: 163.

Montanaro, Ashley. 2015. “Quantum Speedup of Monte Carlo Methods.” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 471 (2181): 20150301.

Nannicini, Giacomo. 2019. “Fast Quantum Subroutines for the Simplex Method.” arXiv Preprint arXiv:1910.10649.

Nielsen, Michael A, and Isaac Chuang. 2002. “Quantum Computation and Quantum Information.” AAPT.

Otterbach, JS, R Manenti, N Alidoust, A Bestwick, M Block, B Bloom, S Caldwell, et al. 2017. “Unsupervised Machine Learning on a Hybrid Quantum Computer.” arXiv Preprint arXiv:1712.05771.

Subramanian, Sathyawageeswar, Stephen Brierley, and Richard Jozsa. 2019. “Implementing Smooth Functions of a Hermitian Matrix on a Quantum Computer.” Journal of Physics Communications 3 (6): 065002.

Ta-Shma, Amnon. 2013. “Inverting Well Conditioned Matrices in Quantum Logspace.” In Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, 881–90.

Van Apeldoorn, Joran, András Gilyén, Sander Gribling, and Ronald de Wolf. 2020. “Quantum SDP-Solvers: Better Upper and Lower Bounds.” Quantum 4: 230.

Wiebe, Nathan, Ashish Kapoor, and Krysta M Svore. 2018. “Quantum Nearest-Neighbor Algorithms for Machine Learning.” Quantum Information and Computation 15.

Yoder, Theodore J, Guang Hao Low, and Isaac L Chuang. 2014. “Fixed-Point Quantum Search with an Optimal Number of Queries.” Physical Review Letters 113 (21): 210501.