1. Research
  2. Publications

Publications

Export 1257 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 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.
Y. - A. Chen and Tata, S., “Higher cup products on hypercubic lattices: application to lattice models of topological phases”, 2021.
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, 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.
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”, to appear in Proceedings of STOC 2020, 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, Chung, K. - M., and Yamakawa, T., “A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Rounds”, 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. 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, 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 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, Leng, J., Li, T., Liu, J. - P., and Zhang, C., “Quantum simulation of real-space dynamics”, Quantum, vol. 6, p. 860, 2022.
A. M. Childs, Maslov, D., Nam, Y., Ross, N. J., and Su, Y., “Toward the first quantum simulation with quantum speedup”, Proceedings of the National Academy of Sciences, vol. 115 , pp. 9456-9461, 2018.
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, Hung, S. - H., and Li, T., “Quantum Query Complexity with Matrix-Vector Products”, 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), 2021.