1. Research
  2. Publications

Publications

Export 1253 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, 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, Ji, Z., Wei, Z., and Zeng, B., “Correlations in excited states of local Hamiltonians”, Physical Review A, vol. 85, no. 4, 2012.
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.
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.
Y. - A. Chen and Tata, S., “Higher cup products on hypercubic lattices: application to lattice models of topological phases”, 2021.
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.
G. Cheng and Swingle, B., “Chaos in a quantum rotor model”, 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.
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, Chung, K. - M., and Yamakawa, T., “A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Rounds”, 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, Patterson, R. B., and MacKay, D. J. C., “Exact sampling from non-attractive distributions using summary states”, Physical Review E, vol. 63, no. 3, 2001.
A. M. Childs and Wocjan, P., “On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems ”, 2005.
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.
A. M. Childs, Schulman, L. J., and Vazirani, U. V., “Quantum algorithms for hidden nonlinear structures”, 2007.
A. M. Childs and Strouse, D. J., “Levinson's theorem for graphs”, Journal of Mathematical Physics, vol. 52, no. 8, p. 082102, 2011.
A. M. Childs, Gosset, D., and Webb, Z., “Complexity of the XY antiferromagnet at fixed magnetization”, Quantum Information and Computation, vol. 16, no. 1-2, pp. 1-18, 2016.
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, Liu, J. - P., and Ostrander, A., “High-precision quantum algorithms for partial differential equations”, Quantum 5, 574, vol. 5, no. 574, 2021.
A. M. Childs and Wang, D., “Can graph properties have exponential quantum speedup?”, 2020.