Publications

Export 765 results:
[ Author(Asc)] 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. Chotia, Neyenhuis, B., Moses, S. A., Yan, B., Covey, J. P., Foss-Feig, M., Rey, A. Maria, Jin, D. S., and Ye, J., Long-lived dipolar molecules and Feshbach molecules in a 3D optical lattice , Physical Review Letters, vol. 108, no. 8, 2012.
E. Chitambar, Miller, C., and Shi, Y., Matrix pencils and entanglement classification, Journal of Mathematical Physics, vol. 51, no. 7, p. 072205, 2010.
E. Chitambar, Miller, C., and Shi, Y., Deciding Unitary Equivalence Between Matrix Polynomials and Sets of Bipartite Quantum States, Quantum Information and Computation, vol. 11, no. 9-10, pp. 813–819, 2011.
C. Chin, Grimm, R., Julienne, P., and Tiesinga, E., Feshbach Resonances in Ultracold Gases, Reviews of Modern Physics, vol. 82, no. 2, pp. 1225 - 1286, 2010.
C. Chin, Vuletic, V., Kerman, A. J., Chu, S., Tiesinga, E., Leo, P. J., and Williams, C. J., Ultracold Cs$_2$ Feshbach Spectroscopy, 2003.
A. M. Childs and Kothari, R., Simulating sparse Hamiltonians with star decompositions, 2010.
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, 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 van Dam, W., Quantum algorithms for algebraic problems, Reviews of Modern Physics, vol. 82, no. 1, pp. 1 - 52, 2010.
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 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, 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, 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, Secure assisted quantum computation, 2001.
A. M. Childs and Goldstone, J., Spatial search and the Dirac equation, Physical Review A, vol. 70, no. 4, 2004.
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, 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, 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 Ivanyos, G., Quantum computation of discrete logarithms in semigroups, Journal of Mathematical Cryptology, vol. 8, no. 4, 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 and Lee, T., Optimal quantum adversary lower bounds for ordered search, 2007.
A. M. Childs and Li, T., Efficient simulation of sparse Markovian quantum dynamics, Quantum Information and Computation, vol. 17, pp. 901-947, 2017.