Publications

Export 765 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
L. I. Childress, Taylor, J. M., Sorensen, A. S., and Lukin, M. D., Fault-tolerant quantum repeaters with minimal physical resources, and implementations based on single photon emitters, Physical Review A, vol. 72, no. 5, 2005.
L. Childress, Taylor, J. M., Sorensen, A. S., and Lukin, M. D., Fault-tolerant Quantum Communication with Minimal Physical Requirements, Physical Review Letters, vol. 96, no. 7, 2006.
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, 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, 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, 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 and Kothari, R., Simulating sparse Hamiltonians with star decompositions, 2010.
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, Farhi, E., and Preskill, J., Robustness of adiabatic quantum computation, Physical Review A, vol. 65, no. 1, 2001.
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, 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.
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 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, Secure assisted quantum computation, 2001.
A. M. Childs, Preskill, J., and Renes, J., Quantum information and precision measurement, Journal of Modern Optics, vol. 47, no. 2-3, pp. 155 - 176, 2000.
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 and Goldstone, J., Spatial search and the Dirac equation, Physical Review A, vol. 70, no. 4, 2004.
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.