| Unified derivations of measurement-based schemes for quantum computation | Publication | 2005-03-01 | A. M. Childs, D. W. Leung, M. A. Nielsen |
| TWO-WAY QUANTUM COMMUNICATION CHANNELS University of Calgary | Publication | 2006-02-01 | A. M. Childs, L. E. DEBBIE, H. Lo |
| Universal Computation by Quantum Walk | Publication | 2009-05-01 | A. M. Childs |
| Quantum algorithms for algebraic problems | Publication | 2010-01-01 | A. M. Childs, W. v. Dam |
| Levinson’s theorem for graphs | Publication | 2011-01-01 | A. M. Childs, D. J. Strouse |
| Levinson’s theorem for graphs II | Publication | 2012-01-01 | A. M. Childs, D. Gosset |
| Exponential algorithmic speedup by a quantum walk University of Calgary | Publication | 2003-01-01 | A. M. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, D. A. Spielman |
| Any AND-OR Formula of Size N Can Be Evaluated in Time $N^1/2+o(1) $ on a Quantum Computer , volume=39 | Publication | 2010-01-01 | A. Ambainis, A. M. Childs, B. W. Reichardt, R. Špalek, S. Zhang |
| Quantum Property Testing for Bounded-Degree Graphs | Publication | 2011-01-01 | A. Ambainis, A. M. Childs, Y. Liu |
