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 and Ivanyos, G., “Quantum computation of discrete logarithms in semigroups”, Journal of Mathematical Cryptology, vol. 8, no. 4, 2014.
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, Li, T., Liu, J. - P., Wang, C., and Zhang, R., “Quantum Algorithms for Sampling Log-Concave Distributions and Estimating Normalizing Constants”, Advances in Neural Information Processing Systems (NeurIPS 2022), vol. 35, no. 23205, 2022.
A. M. Childs and Wang, D., “Can graph properties have exponential quantum speedup?”, 2020.
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, 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, 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, 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, Kothari, R., Kovacs-Deak, M., Sundaram, A., and Wang, D., “Quantum divide and conquer”, 2022.
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 and Li, T., “Efficient simulation of sparse Markovian quantum dynamics”, Quantum Information and Computation, vol. 17, pp. 901-947, 2017.
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.
A. M. Childs and Strouse, D. J., “Levinson's theorem for graphs”, Journal of Mathematical Physics, vol. 52, no. 8, p. 082102, 2011.
A. M. Childs, Schulman, L. J., and Vazirani, U. V., “Quantum algorithms for hidden nonlinear structures”, 2007.
A. M. Childs, Kothari, R., and Somma, R. D., “Quantum algorithm for systems of linear equations with exponentially improved dependence on precision”, SIAM Journal on Computing, vol. 46, no. 6, pp. 1920-1950, 2017.
A. M. Childs, Gosset, D., and Webb, Z., “Complexity of the XY antiferromagnet at fixed magnetization”, Quantum Information and Computation, vol. 16, no. 1-2, pp. 1-18, 2016.
A. M. Childs and Goldstone, J., “Spatial search by quantum walk”, Physical Review A, vol. 70, no. 2, 2004.