1. Research
  2. Publications

Publications

Export 61 results:
[ Author(Asc)] Title Type Year
Filters: Author is Andrew M. Childs  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
C
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.
A. M. Childs and Eisenberg, J. M., “Quantum algorithms for subset finding”, 2003.
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, Cleve, R., Deotto, E., Farhi, E., Gutmann, S., and Spielman, D. A., “Exponential algorithmic speedup by quantum walk”, 2002.
A. M. Childs and Kothari, R., “Simulating sparse Hamiltonians with star decompositions”, 2010.
A. M. Childs, Su, Y., Tran, M. C., Wiebe, N., and Zhu, S., “A Theory of Trotter Error”, To appear in Physical Review X, 2020.
A. M. Childs and Ge, Y., “Spatial search by continuous-time quantum walks on crystal lattices”, Physical Review A, vol. 89, no. 5, 2014.
A. M. Childs and Chuang, I. L., “Universal quantum computation with two-level trapped ions”, Physical Review A, vol. 63, no. 1, 2000.
A. M. Childs, Kothari, R., Ozols, M., and Roetteler, M., “Easy and hard functions for the Boolean hidden shift problem”, Proceedings of TQC 2013, vol. 22, pp. 50-79, 2013.
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.
A. M. Childs and Lee, T., “Optimal quantum adversary lower bounds for ordered search”, 2007.