1. Research
  2. Publications

Publications

Export 108 results:
Author Title Type [ Year(Desc)]
Filters: Author is Andrew M. Childs  [Clear All Filters]
2007
M. Aschbacher, Childs, A. M., and Wocjan, P., “The limitations of nice mutually unbiased bases”, Journal of Algebraic Combinatorics, vol. 25, no. 2, pp. 111 - 123, 2007.
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, Schulman, L. J., and Vazirani, U. V., “Quantum algorithms for hidden nonlinear structures”, 2007.
A. M. Childs and Lee, T., “Optimal quantum adversary lower bounds for ordered search”, 2007.
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.
2009
A. Ambainis, Childs, A. M., Le Gall, F., and Tani, S., “The quantum query complexity of certification”, 2009.
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 and Kothari, R., “Limitations on the simulation of non-sparse Hamiltonians”, 2009.
D. W. Berry and Childs, A. M., “Black-box Hamiltonian simulation and unitary implementation”, 2009.
A. M. Childs, “Universal computation by quantum walk”, Physical Review Letters, vol. 102, no. 18, 2009.
2010
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 Kothari, R., “Simulating sparse Hamiltonians with star decompositions”, 2010.
A. M. Childs, Leung, D., Mancinska, L., and Ozols, M., “Characterization of universal two-qubit Hamiltonians”, 2010.
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. Ambainis, Childs, A. M., and Liu, Y. - K., “Quantum property testing for bounded-degree graphs”, Proc. RANDOM, pp. 365-376, 2010.
2011
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 Strouse, D. J., “Levinson's theorem for graphs”, Journal of Mathematical Physics, vol. 52, no. 8, p. 082102, 2011.
2012
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 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 and Gosset, D., “Levinson's theorem for graphs II”, Journal of Mathematical Physics, vol. 53, no. 10, p. 102207, 2012.
2013
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, Gosset, D., and Webb, Z., “Universal computation by multi-particle quantum walk”, Science, vol. 339, no. 6121, pp. 791 - 794, 2013.
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, 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, 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.