1. Research
  2. Publications

Publications

Export 1259 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, Chen, L., and Zeng, B., “Unextendible Product Basis for Fermionic Systems”, Journal of Mathematical Physics, vol. 55, no. 8, p. 082207, 2014.
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.
Y. - A. Chen and Hsin, P. - S., “Exactly Solvable Lattice Hamiltonians and Gravitational Anomalies”, 2021.
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.
Y. - A. Chen, Childs, A. M., Hafezi, M., Jiang, Z., Kim, H., and Xu, Y., “Efficient Product Formulas for Commutators and Applications to Quantum Simulation”, Physical Review Research, vol. 4, 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.
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, Li, T., Lin, H. - H., and Wang, C., “Quantum-inspired classical sublinear-time algorithm for solving low-rank semidefinite programming via sampling approaches”, 2019.
N. - H. Chia, Chou, C. - N., Zhang, J., and Zhang, R., “Quantum Meets the Minimum Circuit Size Problem”, 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, Chung, K. - M., Liu, Q., and Yamakawa, T., “On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Rounds”, 2021.
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, 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, Li, T., Liu, J. - P., Wang, C., and Zhang, R., “Quantum Algorithms for Sampling Log-Concave Distributions and Estimating Normalizing Constants”, Advances in Neural Information Processing Systems (NeurIPS 2022), vol. 35, no. 23205, 2022.
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, Coudron, M., and Gilani, A. Shiraz, “Quantum Algorithms and the Power of Forgetting”, 14th Innovations in Theoretical Computer Science Conference (ITCS 2023), vol. 251, p. 37:1--37:22, 2023.
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.