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, Schoute, E., and Unsal, C. M., “Circuit Transformations for Quantum Architectures”, Proceedings of TQC 2019, LIPIcs, vol. 135 , no. 3, 2019.
A. M. Childs, Harrow, A. W., and Wocjan, P., “Weak Fourier-Schur sampling, the hidden subgroup problem, and the quantum collision problem ”, 2006.
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, 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 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, Gosset, D., Nagaj, D., Raha, M., and Webb, Z., “Momentum switches”, Quantum Information and Computation, vol. 15, no. 7-8, pp. 601-621, 2015.
A. M. Childs and Su, Y., “Nearly optimal lattice simulation by product formulas”, Phys. Rev. Lett. , vol. 123, no. 050503, 2019.
A. M. Childs, Preskill, J., and Renes, J., “Quantum information and precision measurement”, Journal of Modern Optics, vol. 47, no. 2-3, pp. 155 - 176, 2000.
A. M. Childs, “Secure assisted quantum computation”, 2001.
A. M. Childs and Goldstone, J., “Spatial search and the Dirac equation”, Physical Review A, vol. 70, no. 4, 2004.
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, 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 and Ivanyos, G., “Quantum computation of discrete logarithms in semigroups”, Journal of Mathematical Cryptology, vol. 8, no. 4, 2014.
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 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 Wang, D., “Can graph properties have exponential quantum speedup?”, 2020.
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.