1. Research
  2. Publications

Publications

Export 112 results:
Author Title Type [ Year(Asc)]
Filters: Author is Andrew M. Childs  [Clear All Filters]
2010
A. M. Childs and Kothari, R., “Simulating sparse Hamiltonians with star decompositions”, 2010.
A. M. Childs, “On the relationship between continuous- and discrete-time quantum walk”, Communications in Mathematical Physics, vol. 294, no. 2, pp. 581 - 603, 2010.
2009
A. M. Childs, “Universal computation by quantum walk”, Physical Review Letters, vol. 102, no. 18, 2009.
D. W. Berry and Childs, A. M., “Black-box Hamiltonian simulation and unitary implementation”, 2009.
A. M. Childs and Kothari, R., “Limitations on the simulation of non-sparse Hamiltonians”, 2009.
A. M. Childs, Cleve, R., Jordan, S. P., and Yeung, D., “Discrete-query quantum algorithm for NAND trees”, Theory of Computing, vol. 5, no. 1, pp. 119 - 123, 2009.
A. Ambainis, Childs, A. M., Le Gall, F., and Tani, S., “The quantum query complexity of certification”, 2009.
2007
A. M. Childs, Landahl, A. J., and Parrilo, P. A., “Improved quantum algorithms for the ordered search problem via semidefinite programming ”, Physical Review A, vol. 75, no. 3, 2007.
A. M. Childs and Lee, T., “Optimal quantum adversary lower bounds for ordered search”, 2007.
A. M. Childs, Schulman, L. J., and Vazirani, U. V., “Quantum algorithms for hidden nonlinear structures”, 2007.
A. M. Childs, Reichardt, B. W., Spalek, R., and Zhang, S., “Every NAND formula of size N can be evaluated in time N^1/2+o(1) on a quantum computer ”, 2007.
M. Aschbacher, Childs, A. M., and Wocjan, P., “The limitations of nice mutually unbiased bases”, Journal of Algebraic Combinatorics, vol. 25, no. 2, pp. 111 - 123, 2007.
2006
A. M. Childs, Harrow, A. W., and Wocjan, P., “Weak Fourier-Schur sampling, the hidden subgroup problem, and the quantum collision problem ”, 2006.
A. M. Childs, Leung, D. W., and Lo, H. - K., “Two-way quantum communication channels”, International Journal of Quantum Information, vol. 04, no. 01, pp. 63 - 83, 2006.
2005
A. M. Childs, Leung, D. W., and Nielsen, M. A., “Unified derivations of measurement-based schemes for quantum computation”, Physical Review A, vol. 71, no. 3, 2005.
A. M. Childs and Wocjan, P., “On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems ”, 2005.
A. M. Childs and van Dam, W., “Quantum algorithm for a generalized hidden shift problem”, 2005.
D. Bacon, Childs, A. M., and van Dam, W., “From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups ”, 2005.
D. Bacon, Childs, A. M., and van Dam, W., “Optimal measurements for the dihedral hidden subgroup problem”, 2005.
2004
A. M. Childs and Goldstone, J., “Spatial search by quantum walk”, Physical Review A, vol. 70, no. 2, 2004.
A. M. Childs and Goldstone, J., “Spatial search and the Dirac equation”, Physical Review A, vol. 70, no. 4, 2004.
A. M. Childs, Leung, D. W., and Vidal, G., “Reversible simulation of bipartite product Hamiltonians”, IEEE Transactions on Information Theory, vol. 50, no. 6, pp. 1189 - 1197, 2004.
2003
A. M. Childs, Haselgrove, H. L., and Nielsen, M. A., “Lower bounds on the complexity of simulating quantum gates”, Physical Review A, vol. 68, no. 5, 2003.
A. M. Childs and Eisenberg, J. M., “Quantum algorithms for subset finding”, 2003.
2002
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.