1. Research
  2. Publications

Publications

Export 108 results:
Author Title [ Type(Desc)] Year
Filters: Author is Andrew M. Childs  [Clear All Filters]
Conference Paper
S. Ben-David, Childs, A. M., Gilyen, A., Kretschmer, W., Podder, S., and Wang, D., “Symmetries, graph properties, and quantum speedups”, in Proceedings of the 61st IEEE Symposium on Foundations of Computer Science (FOCS 2020), pp. 649–660 (2020), 2020.
Journal Article
A. Bapat, Childs, A. M., Gorshkov, A. V., and Schoute, E., “Advantages and limitations of quantum routing”, PRX Quantum, vol. 4, no. 010313, 2023.
A. M. Childs, Leung, D. W., Verstraete, F., and Vidal, G., “Asymptotic entanglement capacity of the Ising and anisotropic Heisenberg interactions ”, 2002.
Y. Nam, Ross, N. J., Su, Y., Childs, A. M., and Maslov, D., “Automated optimization of large quantum circuits with continuous parameters”, npj:Quantum Information, vol. 4, no. 23, 2018.
D. W. Berry and Childs, A. M., “Black-box Hamiltonian simulation and unitary implementation”, 2009.
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 and Wang, D., “Can graph properties have exponential quantum speedup?”, 2020.
A. M. Childs, Leung, D., Mancinska, L., and Ozols, M., “Characterization of universal two-qubit Hamiltonians”, 2010.
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., “Complexity of the XY antiferromagnet at fixed magnetization”, Quantum Information and Computation, vol. 16, no. 1-2, pp. 1-18, 2016.
D. J. Brod and Childs, A. M., “The computational power of matchgates and the XY interaction on arbitrary graphs”, Quantum Information and Computation, vol. 14, no. 11-12, pp. 901-916, 2014.
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.
M. C. Tran, Chu, S. - K., Su, Y., Childs, A. M., and Gorshkov, A. V., “Destructive Error Interference in Product-Formula Lattice Simulation”, Phys. Rev. Lett. , vol. 124, no. 220502, 2020.
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, 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.
J. Lukas Bosse, Childs, A. M., Derby, C., Gambetta, F. Maria, Montanaro, A., and Santos, R. A., “Efficient and practical Hamiltonian simulation from time-dependent product formulas”, 2024.
Y. - A. Chen, Childs, A. M., Hafezi, M., Jiang, Z., Kim, H., and Xu, Y., “Efficient Product Formulas for Commutators and Applications to Quantum Simulation”, Physical Review Research, vol. 4, 2022.
J. - P. Liu, Kolden, H. Øie, Krovi, H. K., Loureiro, N. F., Trivisa, K., and Childs, A. M., “Efficient quantum algorithm for dissipative nonlinear differential equations”, Proceedings of the National Academy of Sciences, vol. 118, 2021.
A. M. Childs and Li, T., “Efficient simulation of sparse Markovian quantum dynamics”, Quantum Information and Computation, vol. 17, pp. 901-947, 2017.
Z. Liu, Devulapalli, D., Hangleiter, D., Liu, Y. - K., Kollár, A. J., Gorshkov, A. V., and Childs, A. M., “Efficiently verifiable quantum advantage on near-term analog quantum simulators”, 2024.
Q. Zhao, Zhou, Y., and Childs, A. M., “Entanglement accelerates quantum simulation”, 2024.
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, 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, 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, Cleve, R., Deotto, E., Farhi, E., Gutmann, S., and Spielman, D. A., “Exponential algorithmic speedup by quantum walk”, 2002.