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., 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, 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, Leung, D. W., and Lo, H. - K., “Two-way quantum communication channels”, International Journal of Quantum Information, vol. 04, no. 01, pp. 63 - 83, 2006.
A. M. Childs, Kothari, R., Kovacs-Deak, M., Sundaram, A., and Wang, D., “Quantum divide and conquer”, 2022.
A. M. Childs and Wiebe, N., “Product Formulas for Exponentials of Commutators”, Journal of Mathematical Physics, vol. 54, no. 6, p. 062202, 2013.
A. M. Childs, “On the relationship between continuous- and discrete-time quantum walk”, Communications in Mathematical Physics, vol. 294, no. 2, pp. 581 - 603, 2010.
A. M. Childs, Leung, D. W., and Vidal, G., “Reversible simulation of bipartite product Hamiltonians”, IEEE Transactions on Information Theory, vol. 50, no. 6, pp. 1189 - 1197, 2004.
A. M. Childs and van Dam, W., “Quantum algorithm for a generalized hidden shift problem”, 2005.
A. M. Childs and Kothari, R., “Quantum query complexity of minor-closed graph properties”, Proc. 28th Symposium on Theoretical Aspects of Computer Science (STACS 2011), Leibniz International Proceedings in Informatics, vol. 9, pp. 661-672, 2011.
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 and Ge, Y., “Spatial search by continuous-time quantum walks on crystal lattices”, Physical Review A, vol. 89, no. 5, 2014.
A. M. Childs, Leung, D. W., Verstraete, F., and Vidal, G., “Asymptotic entanglement capacity of the Ising and anisotropic Heisenberg interactions ”, 2002.
A. M. Childs, Fu, H., Leung, D., Li, Z., Ozols, M., and Vyas, V., “Streaming quantum state purification”, 2023.
A. M. Childs, Leung, D., Mancinska, L., and Ozols, M., “Characterization of universal two-qubit Hamiltonians”, 2010.
A. M. Childs and Kothari, R., “Limitations on the simulation of non-sparse Hamiltonians”, 2009.
A. M. Childs, Leung, D. W., and Nielsen, M. A., “Unified derivations of measurement-based schemes for quantum computation”, Physical Review A, vol. 71, no. 3, 2005.
A. M. Childs and Gosset, D., “Levinson's theorem for graphs II”, Journal of Mathematical Physics, vol. 53, no. 10, p. 102207, 2012.
A. M. Childs, “Universal computation by quantum walk”, Physical Review Letters, vol. 102, no. 18, 2009.
A. M. Childs, Farhi, E., Goldstone, J., and Gutmann, S., “Finding cliques by quantum adiabatic evolution”, 2000.
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., “Interpolatability distinguishes LOCC from separable von Neumann measurements”, Journal of Mathematical Physics, vol. 54, no. 11, p. 112204, 2013.
A. M. Childs and Kothari, R., “Simulating sparse Hamiltonians with star decompositions”, 2010.
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, 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, 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.