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. 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 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, 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.
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 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.
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.
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.
N. - H. Chia, Li, T., Lin, H. - H., and Wang, C., Quantum-inspired classical sublinear-time algorithm for solving low-rank semidefinite programming via sampling approaches, 2019.
G. Cheng and Swingle, B., Chaos in a quantum rotor model, 2019.
J. Chen, Ji, Z., Kribs, D., Wei, Z., and Zeng, B., Ground-State Spaces of Frustration-Free Hamiltonians, Journal of Mathematical Physics, vol. 53, no. 10, p. 102201, 2012.
J. Chen and Johnston, N., The Minimum Size of Unextendible Product Bases in the Bipartite Case (and Some Multipartite Cases) , Communications in Mathematical Physics, vol. 333, no. 1, pp. 351 - 365, 2015.
J. Chen, Ji, Z., Kribs, D. W., and Zeng, B., Minimum Entangling Power is Close to Its Maximum, 2012.
J. Chen, Ji, Z., Ruskai, M. Beth, Zeng, B., and Zhou, D. - L., Comment on some results of Erdahl and the convex structure of reduced density matrices, Journal of Mathematical Physics, vol. 53, no. 7, p. 072203, 2012.
J. Chen, Guo, C., Ji, Z., Poon, Y. - T., Yu, N., Zeng, B., and Zhou, J., Joint product numerical range and geometry of reduced density matrices, 2016.
J. Chen, Duan, R., Ji, Z., Ying, M., and Yu, J., Existence of Universal Entangler, Journal of Mathematical Physics, vol. 49, no. 1, p. 012103, 2008.
J. Chen, Johnston, N., Li, C. - K., and Plosker, S., Quantifying the coherence of pure quantum states, Physical Review A, vol. 94, no. 4, p. 042313, 2016.
J. Chen and Winter, A., Non-Additivity of the Entanglement of Purification (Beyond Reasonable Doubt) , 2012.