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, Ji, Z., Yu, N., and Zeng, B., “Detecting Consistency of Overlapping Quantum Marginals by Separability”, Physical Review A, vol. 93, no. 3, p. 032105, 2016.
Y. - A. Chen, Gorshkov, A. V., and Xu, Y., “Error-correcting codes for fermionic quantum simulation”, 2022.
J. Chen, Ji, Z., Li, C. - K., Poon, Y. - T., Shen, Y., Yu, N., Zeng, B., and Zhou, D., “Discontinuity of Maximum Entropy Inference and Quantum Phase Transitions”, New Journal of Physics, vol. 17, no. 8, p. 083019, 2015.
J. Chen and Ying, M., “Ancilla-Assisted Discrimination of Quantum Gates”, 2008.
J. Chen, Chen, X., Duan, R., Ji, Z., and Zeng, B., “No-go Theorem for One-way Quantum Computing on Naturally Occurring Two-level Systems ”, Physical Review A, vol. 83, no. 5, 2011.
J. Chen, Ji, Z., Klyachko, A., Kribs, D. W., and Zeng, B., “Rank Reduction for the Local Consistency Problem”, Journal of Mathematical Physics, vol. 53, no. 2, p. 022202, 2012.
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., Kribs, D., Lütkenhaus, N., and Zeng, B., “Symmetric Extension of Two-Qubit States”, Physical Review A, vol. 90, no. 3, 2014.
Y. - A. Chen and Hsin, P. - S., “Exactly Solvable Lattice Hamiltonians and Gravitational Anomalies”, 2021.
G. Cheng and Swingle, B., “Chaos in a quantum rotor model”, 2019.
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.
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.
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, 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, Cleve, R., Deotto, E., Farhi, E., Gutmann, S., and Spielman, D. A., “Exponential algorithmic speedup by quantum walk”, 2002.
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, 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.
A. M. Childs and Su, Y., “Nearly optimal lattice simulation by product formulas”, Phys. Rev. Lett. , vol. 123, no. 050503, 2019.
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 Lee, T., “Optimal quantum adversary lower bounds for ordered search”, 2007.