Export 1260 results:
[ Author(Desc)] Title Type Year
Filters: Filter is   [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 
A. M. Childs, Ostrander, A., and Su, Y., Faster quantum simulation by randomization, Quantum , vol. 3, no. 182, 2019.
A. M. Childs and Goldstone, J., Spatial search and the Dirac equation, Physical Review A, vol. 70, no. 4, 2004.
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, 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., Deotto, E., Farhi, E., Gutmann, S., and Spielman, D. A., Exponential algorithmic speedup by quantum walk, 2002.
A. M. Childs and Liu, J. - P., Quantum spectral methods for differential equations, Commun. Math. Phys. , vol. 375, pp. 1427-1457, 2020.
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, 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 and Lee, T., Optimal quantum adversary lower bounds for ordered search, 2007.
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, 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, 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, Schoute, E., and Unsal, C. M., Circuit Transformations for Quantum Architectures, Proceedings of TQC 2019, LIPIcs, vol. 135 , no. 3, 2019.
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, 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 Eisenberg, J. M., Quantum algorithms for subset finding, 2003.
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, Gosset, D., and Webb, Z., Universal computation by multi-particle quantum walk, Science, vol. 339, no. 6121, pp. 791 - 794, 2013.
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 Su, Y., Nearly optimal lattice simulation by product formulas, Phys. Rev. Lett. , vol. 123, no. 050503, 2019.
A. M. Childs, Liu, J. - P., and Ostrander, A., High-precision quantum algorithms for partial differential equations, Quantum 5, 574, vol. 5, no. 574, 2021.
A. M. Childs, Kothari, R., Kovacs-Deak, M., Sundaram, A., and Wang, D., Quantum divide and conquer, 2022.