Publications

Export 803 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
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.
Y. - H. Chen, Chung, K. - M., Lai, C. - Y., Vadhan, S. P., and Wu, X., Computational Notions of Quantum Min-Entropy, 2017.
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 and Winter, A., Non-Additivity of the Entanglement of Purification (Beyond Reasonable Doubt) , 2012.
J. Chen, Ji, Z., Zeng, B., and Zhou, D. L., From Ground States to Local Hamiltonians, Physical Review A, vol. 86, no. 2, 2012.
J. Chen, Cubitt, T. S., Harrow, A. W., and Smith, G., Entanglement can completely defeat quantum noise, Physical Review Letters, vol. 107, no. 25, 2011.
J. Chen, Childs, A. M., and Hung, S. - H., Quantum algorithm for multivariate polynomial interpolation, Proceedings of The Royal Society A, vol. 474, no. 2209, 2018.
G. Cheng and Swingle, B., Chaos in a quantum rotor model, 2019.
N. - H. Chia, Gilyen, A., Li, T., Lin, H. - H., Tang, E., and Wang, C., Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing quantum machine learning, 2019.
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.
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 van Dam, W., Quantum algorithm for a generalized hidden shift problem, 2005.
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 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., Mancinska, L., and Ozols, M., Characterization of universal two-qubit Hamiltonians, 2010.
A. M. Childs, Kothari, R., and Somma, R. D., Quantum algorithm for systems of linear equations with exponentially improved dependence on precision, SIAM Journal on Computing, vol. 46, no. 6, pp. 1920-1950, 2017.
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. 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, Farhi, E., Goldstone, J., and Gutmann, S., Finding cliques by quantum adiabatic evolution, 2000.
A. M. Childs, Universal computation by quantum walk, Physical Review Letters, vol. 102, no. 18, 2009.
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, van Dam, W., Hung, S. - H., and Shparlinski, I. E., Optimal quantum algorithm for polynomial interpolation, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), vol. 55, p. 16:1--16:13, 2016.