1. Research
  2. Publications

Publications

Export 1260 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
Y. - A. Chen, Gorshkov, A. V., and Xu, Y., “Error-correcting codes for fermionic quantum simulation”, 2022.
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, 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.
Y. - A. Chen and Tata, S., “Higher cup products on hypercubic lattices: application to lattice models of topological phases”, 2021.
J. Chen and Winter, A., “Non-Additivity of the Entanglement of Purification (Beyond Reasonable Doubt) ”, 2012.
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.
Q. Chen, Du, Y., Zhao, Q., Jiao, Y., Lu, X., and Wu, X., “Efficient and practical quantum compiler towards multi-qubit systems with deep reinforcement learning”, 2022.
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.
G. Cheng and Swingle, B., “Chaos in a quantum rotor model”, 2019.
N. - H. Chia, Chung, K. - M., and Yamakawa, T., “A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Rounds”, 2020.
N. - H. Chia, Chung, K. - M., Liu, Q., and Yamakawa, T., “On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Rounds”, 2021.
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”, to appear in Proceedings of STOC 2020, 2020.
N. - H. Chia, Chou, C. - N., Zhang, J., and Zhang, R., “Quantum Meets the Minimum Circuit Size Problem”, 2021.
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. 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.
A. M. Childs, Leung, D. W., and Lo, H. - K., “Two-way quantum communication channels”, International Journal of Quantum Information, vol. 04, no. 01, pp. 63 - 83, 2006.
A. M. Childs, Hung, S. - H., and Li, T., “Quantum query complexity with matrix-vector products”, Proceedings of the 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Leibniz International Proceedings in Informatics, vol. 198, pp. 55:1-55:19, 2021.
A. M. Childs and Wiebe, N., “Product Formulas for Exponentials of Commutators”, Journal of Mathematical Physics, vol. 54, no. 6, p. 062202, 2013.
A. M. Childs, Leung, D. W., and Vidal, G., “Reversible simulation of bipartite product Hamiltonians”, IEEE Transactions on Information Theory, vol. 50, no. 6, pp. 1189 - 1197, 2004.
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, “On the relationship between continuous- and discrete-time quantum walk”, Communications in Mathematical Physics, vol. 294, no. 2, pp. 581 - 603, 2010.
A. M. Childs and van Dam, W., “Quantum algorithm for a generalized hidden shift problem”, 2005.
A. M. Childs, Hung, S. - H., and Li, T., “Quantum Query Complexity with Matrix-Vector Products”, 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), 2021.