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, 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.
A. M. Childs, Maslov, D., Nam, Y., Ross, N. J., and Su, Y., “Toward the first quantum simulation with quantum speedup”, Proceedings of the National Academy of Sciences, vol. 115 , pp. 9456-9461, 2018.
A. M. Childs and Gosset, D., “Levinson's theorem for graphs II”, Journal of Mathematical Physics, vol. 53, no. 10, p. 102207, 2012.
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.
A. M. Childs, Ostrander, A., and Su, Y., “Faster quantum simulation by randomization”, Quantum , vol. 3, no. 182, 2019.
A. M. Childs and Wiebe, N., “Hamiltonian Simulation Using Linear Combinations of Unitary Operations”, Quantum Information and Computation, vol. 12, no. 11-12, pp. 901-924, 2012.
A. M. Childs, Farhi, E., Goldstone, J., and Gutmann, S., “Finding cliques by quantum adiabatic evolution”, 2000.
A. M. Childs and Goldstone, J., “Spatial search by quantum walk”, Physical Review A, vol. 70, no. 2, 2004.
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, 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, Schoute, E., and Unsal, C. M., “Circuit Transformations for Quantum Architectures”, Proceedings of TQC 2019, LIPIcs, vol. 135 , no. 3, 2019.
A. M. Childs, Gosset, D., and Webb, Z., “The Bose-Hubbard model is QMA-complete”, Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP 2014), vol. 8572, pp. 308-319, 2014.
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.