1. Research
  2. Publications

Publications

Export 106 results:
Author Title [ Type(Desc)] Year
Filters: Author is A. M. Childs  [Clear All Filters]
Journal Article
A. M. Childs and Wiebe, N., “Product Formulas for Exponentials of Commutators”, Journal of Mathematical Physics, vol. 54, no. 6, p. 062202, 2013.
A. M. Childs and van Dam, W., “Quantum algorithm for a generalized hidden shift problem”, 2005.
S. Chakrabarti, Childs, A. M., Hung, S. - H., Li, T., Wang, C., and Wu, X., “Quantum algorithm for estimating volumes of convex bodies”, ACM Transactions on Quantum Computing, vol. 4, 2023.
D. W. Berry, Childs, A. M., Ostrander, A., and Wang, G., “Quantum algorithm for linear differential equations with exponentially improved dependence on precision”, Communications in Mathematical Physics, vol. 356, no. 3, pp. 1057-1081, 2017.
D. An, Childs, A. M., and Lin, L., “Quantum algorithm for linear non-unitary dynamics with near-optimal dependence on all parameters”, 2023.
J. Chen, Childs, A. M., and Hung, S. - H., “Quantum algorithm for multivariate polynomial interpolation”, Proceedings of The Royal Society A, vol. 474, no. 2209, 2018.
A. M. Childs, Kothari, R., and Somma, R. D., “Quantum algorithm for systems of linear equations with exponentially improved dependence on precision”, SIAM Journal on Computing, vol. 46, no. 6, pp. 1920-1950, 2017.
S. Chakrabarti, Childs, A. M., Li, T., and Wu, X., “Quantum algorithms and lower bounds for convex optimization”, Quantum, vol. 4, no. 221, 2020.
A. M. Childs, Coudron, M., and Gilani, A. Shiraz, “Quantum Algorithms and the Power of Forgetting”, 14th Innovations in Theoretical Computer Science Conference (ITCS 2023), vol. 251, p. 37:1--37:22, 2023.
A. M. Childs and van Dam, W., “Quantum algorithms for algebraic problems”, Reviews of Modern Physics, vol. 82, no. 1, pp. 1 - 52, 2010.
A. M. Childs, Schulman, L. J., and Vazirani, U. V., “Quantum algorithms for hidden nonlinear structures”, 2007.
A. M. Childs, Li, T., Liu, J. - P., Wang, C., and Zhang, R., “Quantum Algorithms for Sampling Log-Concave Distributions and Estimating Normalizing Constants”, Advances in Neural Information Processing Systems (NeurIPS 2022), vol. 35, no. 23205, 2022.
J. D. Watson, Bringewatt, J., Shaw, A. F., Childs, A. M., Gorshkov, A. V., and Davoudi, Z., “Quantum Algorithms for Simulating Nuclear Effective Field Theories”, 2023.
A. M. Childs and Eisenberg, J. M., “Quantum algorithms for subset finding”, 2003.
A. M. Childs and Ivanyos, G., “Quantum computation of discrete logarithms in semigroups”, Journal of Mathematical Cryptology, vol. 8, no. 4, 2014.
S. Arunachalam, Belovs, A., Childs, A. M., Kothari, R., Rosmanis, A., and de Wolf, R., “Quantum Coupon Collector”, Proceedings of the 15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020), Leibniz International Proceedings in Informatics, vol. 158, pp. 10:1-10:17, 2020.
A. M. Childs, Kothari, R., Kovacs-Deak, M., Sundaram, A., and Wang, D., “Quantum divide and conquer”, 2022.
D. Wang, You, X., Li, T., and Childs, A. M., “Quantum exploration algorithms for multi-armed bandits”, Proceedings of the 35th Conference on Artificial Intelligence (AAAI 2021), vol. 35, no. 11, pp. 10102-10110, 2021.
A. M. Childs and Wocjan, P., “On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems ”, 2005.
A. M. Childs, Preskill, J., and Renes, J., “Quantum information and precision measurement”, Journal of Modern Optics, vol. 47, no. 2-3, pp. 155 - 176, 2000.
A. Ambainis, Childs, A. M., and Liu, Y. - K., “Quantum property testing for bounded-degree graphs”, Proc. RANDOM, pp. 365-376, 2010.
A. Ambainis, Childs, A. M., Le Gall, F., and Tani, S., “The quantum query complexity of certification”, 2009.
A. M. Childs and Kothari, R., “Quantum query complexity of minor-closed graph properties”, Proc. 28th Symposium on Theoretical Aspects of Computer Science (STACS 2011), Leibniz International Proceedings in Informatics, vol. 9, pp. 661-672, 2011.
A. M. Childs, Kimmel, S., and Kothari, R., “The quantum query complexity of read-many formulas”, Lecture Notes in Computer Science, vol. 7501, pp. 337-348, 2012.
A. M. Childs, Hung, S. - H., and Li, T., “Quantum query complexity with matrix-vector products”, Proceedings of the 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Leibniz International Proceedings in Informatics, vol. 198, pp. 55:1-55:19, 2021.