1. Research
  2. Publications

Publications

Export 1260 results:
[ Author(Desc)] Title Type Year
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, 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, 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, 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 and Ivanyos, G., “Quantum computation of discrete logarithms in semigroups”, Journal of Mathematical Cryptology, vol. 8, no. 4, 2014.
A. M. Childs, van Dam, W., Hung, S. - H., and Shparlinski, I. E., “Optimal quantum algorithm for polynomial interpolation”, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), vol. 55, p. 16:1--16:13, 2016.
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, Farhi, E., and Gutmann, S., “An example of the difference between quantum and classical random walks”, Quantum Information Processing, vol. 1, no. 1/2, pp. 35 - 43, 2001.
A. M. Childs, Fu, H., Leung, D., Li, Z., Ozols, M., and Vyas, V., “Streaming quantum state purification”, 2023.
A. M. Childs and Lee, T., “Optimal quantum adversary lower bounds for ordered search”, 2007.
A. M. Childs, Chuang, I. L., and Leung, D. W., “Realization of quantum process tomography in NMR”, Physical Review A, vol. 64, no. 1, 2001.
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, Jeffery, S., Kothari, R., and Magniez, F., “A Time-Efficient Quantum Walk for 3-Distinctness Using Nested Updates”, 2013.
A. M. Childs and Young, J., “Optimal state discrimination and unstructured search in nonlinear quantum mechanics”, Physical Review A, vol. 93, no. 2, p. 022314, 2016.
A. M. Childs and Eisenberg, J. M., “Quantum algorithms for subset finding”, 2003.
A. M. Childs, Su, Y., Tran, M. C., Wiebe, N., and Zhu, S., “Theory of Trotter Error with Commutator Scaling”, Phys. Rev. X, vol. 11, no. 1, p. 49, 2021.
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, Gosset, D., and Webb, Z., “Universal computation by multi-particle quantum walk”, Science, vol. 339, no. 6121, pp. 791 - 794, 2013.
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, 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, 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 and Chuang, I. L., “Universal quantum computation with two-level trapped ions”, Physical Review A, vol. 63, no. 1, 2000.
A. M. Childs, Leng, J., Li, T., Liu, J. - P., and Zhang, C., “Quantum simulation of real-space dynamics”, Quantum, vol. 6, p. 860, 2022.
A. M. Childs, Ostrander, A., and Su, Y., “Faster quantum simulation by randomization”, Quantum , vol. 3, no. 182, 2019.
A. M. Childs and Wocjan, P., “On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems ”, 2005.
A. M. Childs, Patterson, R. B., and MacKay, D. J. C., “Exact sampling from non-attractive distributions using summary states”, Physical Review E, vol. 63, no. 3, 2001.