| 2021 | AAAI | Quantum Exploration Algorithms for Multi-Armed Bandits. | Daochen Wang, Xuchen You, Tongyang Li, Andrew M. Childs |
| 2021 | ICALP | Quantum Query Complexity with Matrix-Vector Products. | Andrew M. Childs, Shih-Han Hung, Tongyang Li |
| 2020 | FOCS | Symmetries, Graph Properties, and Quantum Speedups. | Shalev Ben-David, Andrew M. Childs, Andrs Gilyn, William Kretschmer, Supartha Podder, Daochen Wang |
| 2020 | TCC | Non-interactive Classical Verification of Quantum Computation. | Gorjan Alagic, Andrew M. Childs, Alex B. Grilo, Shih-Han Hung |
| 2016 | ICALP | Optimal Quantum Algorithm for Polynomial Interpolation. | Andrew M. Childs, Wim van Dam, Shih-Han Hung, Igor E. Shparlinski |
| 2015 | FOCS | Hamiltonian Simulation with Nearly Optimal Dependence on all Parameters. | Dominic W. Berry, Andrew M. Childs, Robin Kothari |
| 2014 | ICALP | The Bose-Hubbard Model is QMA-complete. | Andrew M. Childs, David Gosset, Zak Webb |
| 2014 | STOC | Exponential improvement in precision for simulating sparse Hamiltonians. | Dominic W. Berry, Andrew M. Childs, Richard Cleve, Robin Kothari, Rolando D. Somma |
| 2013 | ICALP | Time-Efficient Quantum Walks for 3-Distinctness. | Aleksandrs Belovs, Andrew M. Childs, Stacey Jeffery, Robin Kothari, Frdric Magniez |
| 2012 | ESA | The Quantum Query Complexity of Read-Many Formulas. | Andrew M. Childs, Shelby Kimmel, Robin Kothari |
| 2011 | STACS | Quantum query complexity of minor-closed graph properties. | Andrew M. Childs, Robin Kothari |
| 2008 | ICALP | Optimal Quantum Adversary Lower Bounds for Ordered Search. | Andrew M. Childs, Troy Lee |
| 2007 | FOCS | Any AND-OR Formula of Size N can be Evaluated in time N | Andris Ambainis, Andrew M. Childs, Ben Reichardt, Robert Spalek, Shengyu Zhang |
| 2007 | FOCS | Quantum Algorithms for Hidden Nonlinear Structures. | Andrew M. Childs, Leonard J. Schulman, Umesh V. Vazirani |
| 2007 | SODA | Quantum algorithm for a generalized hidden shift problem. | Andrew M. Childs, Wim van Dam |
| 2007 | STACS | Weak Fourier-Schur Sampling, the Hidden Subgroup Problem, and the Quantum Collision Problem. | Andrew M. Childs, Aram W. Harrow, Pawel Wocjan |
| 2005 | FOCS | From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups. | Dave Bacon, Andrew M. Childs, Wim van Dam |
| 2003 | STOC | Exponential algorithmic speedup by a quantum walk. | Andrew M. Childs, Richard Cleve, Enrico Deotto, Edward Farhi, Sam Gutmann, Daniel A. Spielman |