Publications

Export 68 results:
[ Author(Desc)] 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, 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 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, Ostrander, A., and Su, Y., Faster quantum simulation by randomization, Quantum , vol. 3, no. 182, 2019.
A. M. Childs, Hung, S. - H., and Li, T., Quantum query complexity with matrix-vector products, Proceedings of the 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Leibniz International Proceedings in Informatics, vol. 198, pp. 55:1-55:19, 2021.
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, 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, 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, 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, Coudron, M., and Gilani, A. Shiraz, Quantum Algorithms and the Power of Forgetting, 14th Innovations in Theoretical Computer Science Conference (ITCS 2023), vol. 251, p. 37:1--37:22, 2023.
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.
A. M. Childs, Leung, D., Mancinska, L., and Ozols, M., A framework for bounding nonlocality of state discrimination, Communications in Mathematical Physics, vol. 323, no. 3, pp. 1121 - 1153, 2013.
A. M. Childs and Wocjan, P., On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems , 2005.
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. M. Childs, Jao, D., and Soukharev, V., Constructing elliptic curve isogenies in quantum subexponential time, Journal of Mathematical Cryptology, vol. 8, no. 1, pp. 1 - 29, 2014.
A. M. Childs and Li, T., Efficient simulation of sparse Markovian quantum dynamics, Quantum Information and Computation, vol. 17, pp. 901-947, 2017.