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, Gosset, D., and Webb, Z., Universal computation by multi-particle quantum walk, Science, vol. 339, no. 6121, pp. 791 - 794, 2013.
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, 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 Chuang, I. L., Universal quantum computation with two-level trapped ions, Physical Review A, vol. 63, no. 1, 2000.
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 Wocjan, P., On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems , 2005.
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, Fu, H., Leung, D., Li, Z., Ozols, M., and Vyas, V., Streaming quantum state purification, 2023.
A. M. Childs and Strouse, D. J., Levinson's theorem for graphs, Journal of Mathematical Physics, vol. 52, no. 8, p. 082102, 2011.
A. M. Childs, Schulman, L. J., and Vazirani, U. V., Quantum algorithms for hidden nonlinear structures, 2007.
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.
A. M. Childs and Wang, D., Can graph properties have exponential quantum speedup?, 2020.
A. M. Childs and Goldstone, J., Spatial search by quantum walk, Physical Review A, vol. 70, no. 2, 2004.
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 and Wiebe, N., Product Formulas for Exponentials of Commutators, Journal of Mathematical Physics, vol. 54, no. 6, p. 062202, 2013.
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, 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 and van Dam, W., Quantum algorithm for a generalized hidden shift problem, 2005.
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 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 Li, T., Efficient simulation of sparse Markovian quantum dynamics, Quantum Information and Computation, vol. 17, pp. 901-947, 2017.
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, 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.