Publications | QuICS

Export 89 results:

Author Title [ Type

] Year

Filters: Author is Andrew M. Childs [Clear All Filters]

Journal Article

A. M. Childs, Deotto, E., Farhi, E., Goldstone, J., Gutmann, S., and Landahl, A. J., “Quantum search by measurement”, Physical Review A, vol. 66, no. 3, 2002.

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 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. Ambainis, Childs, A. M., Le Gall, F., and Tani, S., “The quantum query complexity of certification”, 2009.

A. Ambainis, Childs, A. M., and Liu, Y. - K., “Quantum property testing for bounded-degree graphs”, Proc. RANDOM, pp. 365-376, 2010.

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. M. Childs and Wocjan, P., “On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems ”, 2005.

D. Wang, You, X., Li, T., and Childs, A. M., “Quantum exploration algorithms for multi-armed bandits”, To appear in Proceedings of the 35th Conference on Artificial Intelligence (AAAI 2021), 2020.

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 and Ivanyos, G., “Quantum computation of discrete logarithms in semigroups”, Journal of Mathematical Cryptology, vol. 8, no. 4, 2014.

A. M. Childs and Eisenberg, J. M., “Quantum algorithms for subset finding”, 2003.

A. M. Childs, Schulman, L. J., and Vazirani, U. V., “Quantum algorithms for hidden nonlinear structures”, 2007.

A. M. Childs and van Dam, W., “Quantum algorithms for algebraic problems”, Reviews of Modern Physics, vol. 82, no. 1, pp. 1 - 52, 2010.

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, 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.

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.

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.

S. Chakrabarti, Childs, A. M., Hung, S. - H., Li, T., Wang, C., and Wu, X., “Quantum algorithm for estimating volumes of convex bodies”, 2019.

A. M. Childs and van Dam, W., “Quantum algorithm for a generalized hidden shift problem”, 2005.

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 Young, J., “Optimal state discrimination and unstructured search in nonlinear quantum mechanics”, Physical Review A, vol. 93, no. 2, p. 022314, 2016.

A. M. Childs, van Dam, W., Hung, S. - H., and Shparlinski, I. E., “Optimal quantum algorithm for polynomial interpolation”, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), vol. 55, p. 16:1--16:13, 2016.

A. M. Childs and Lee, T., “Optimal quantum adversary lower bounds for ordered search”, 2007.

D. Bacon, Childs, A. M., and van Dam, W., “Optimal measurements for the dihedral hidden subgroup problem”, 2005.

G. Alagic, Childs, A. M., Grilo, A. B., and Hung, S. - H., “Non-interactive classical verification of quantum computation”, Theory of Cryptography Conference (TCC), vol. Lecture Notes in Computer Science 12552, pp. 153-180, 2020.