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 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 and Ge, Y., “Spatial search by continuous-time quantum walks on crystal lattices”, Physical Review A, vol. 89, no. 5, 2014.
A. M. Childs, Ostrander, A., and Su, Y., “Faster quantum simulation by randomization”, Quantum , vol. 3, no. 182, 2019.
A. M. Childs, Leung, D., Mancinska, L., and Ozols, M., “Characterization of universal two-qubit Hamiltonians”, 2010.
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, 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 Kothari, R., “Limitations on the simulation of non-sparse Hamiltonians”, 2009.
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, 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, 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.
A. M. Childs, Farhi, E., Goldstone, J., and Gutmann, S., “Finding cliques by quantum adiabatic evolution”, 2000.
A. M. Childs, “Universal computation by quantum walk”, Physical Review Letters, vol. 102, no. 18, 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, 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, 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, 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 and Kothari, R., “Simulating sparse Hamiltonians with star decompositions”, 2010.
A. M. Childs, Hung, S. - H., and Li, T., “Quantum Query Complexity with Matrix-Vector Products”, 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), 2021.
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, Harrow, A. W., and Wocjan, P., “Weak Fourier-Schur sampling, the hidden subgroup problem, and the quantum collision problem ”, 2006.
A. M. Childs, Farhi, E., and Preskill, J., “Robustness of adiabatic quantum computation”, Physical Review A, vol. 65, no. 1, 2001.
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, 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 van Dam, W., “Quantum algorithms for algebraic problems”, Reviews of Modern Physics, vol. 82, no. 1, pp. 1 - 52, 2010.