Export 91 results:
Author Title [ Type(Asc)] Year
Filters: Author is Andrew M. Childs  [Clear All Filters]
Journal Article
G. Alagic, Childs, A. M., Grilo, A. B., and Hung, S. - H., Non-interactive classical verification of quantum computation, Theory of Cryptography Conference (TCC), vol. Lecture Notes in Computer Science 12552, pp. 153-180, 2020.
A. Bapat, Schoute, E., Gorshkov, A. V., and Childs, A. M., Nearly optimal time-independent reversal of a spin chain, 2020.
A. M. Childs and Su, Y., Nearly optimal lattice simulation by product formulas, Phys. Rev. Lett. , vol. 123, no. 050503, 2019.
A. M. Childs, Gosset, D., Nagaj, D., Raha, M., and Webb, Z., Momentum switches, Quantum Information and Computation, vol. 15, no. 7-8, pp. 601-621, 2015.
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.
M. C. Tran, Guo, A. Y., Su, Y., Garrison, J. R., Eldredge, Z., Foss-Feig, M., Childs, A. M., and Gorshkov, A. V., Locality and digital quantum simulation of power-law interactions, Phys. Rev. X 9, 031006, vol. 9, no. 031006, 2019.
A. M. Childs and Kothari, R., Limitations on the simulation of non-sparse Hamiltonians, 2009.
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 and Gosset, D., Levinson's theorem for graphs II, Journal of Mathematical Physics, vol. 53, no. 10, p. 102207, 2012.
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, 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, 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. Y. Guo, Deshpande, A., Chu, S. - K., Eldredge, Z., Bienias, P., Devulapalli, D., Su, Y., Childs, A. M., and Gorshkov, A. V., Implementing a Fast Unbounded Quantum Fanout Gate Using Power-Law Interactions, 2020.
A. M. Childs, Liu, J. - P., and Ostrander, A., High-precision quantum algorithms for partial differential equations, 2020.
D. W. Berry, Childs, A. M., and Kothari, R., Hamiltonian simulation with nearly optimal dependence on all parameters, Proceedings of the 56th IEEE Symposium on Foundations of Computer Science, pp. 792-809, 2015.
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.
D. Bacon, Childs, A. M., and van Dam, W., From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups , 2005.
A. M. Childs, Leung, D., Mancinska, L., and Ozols, M., A framework for bounding nonlocality of state discrimination, Communications in Mathematical Physics, vol. 323, no. 3, pp. 1121 - 1153, 2013.
A. M. Childs, Farhi, E., Goldstone, J., and Gutmann, S., Finding cliques by quantum adiabatic evolution, 2000.
A. M. Childs, Ostrander, A., and Su, Y., Faster quantum simulation by randomization, Quantum , vol. 3, no. 182, 2019.
D. W. Berry, Childs, A. M., Cleve, R., Kothari, R., and Somma, R. D., Exponential improvement in precision for simulating sparse Hamiltonians, Proceedings of the 46th ACM Symposium on Theory of Computing (STOC 2014), pp. 283-292, 2014.
A. M. Childs, Cleve, R., Deotto, E., Farhi, E., Gutmann, S., and Spielman, D. A., Exponential algorithmic speedup by quantum walk, 2002.
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, 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, 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.