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 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.
J. Chen, Ji, Z., Zeng, B., and Zhou, D. L., “From Ground States to Local Hamiltonians”, Physical Review A, vol. 86, no. 2, 2012.
Y. - A. Chen and Tata, S., “Higher cup products on hypercubic lattices: application to lattice models of topological phases”, 2021.
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, 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.
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, 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.
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 Vidal, G., “Reversible simulation of bipartite product Hamiltonians”, IEEE Transactions on Information Theory, vol. 50, no. 6, pp. 1189 - 1197, 2004.
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, 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 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 and Ge, Y., “Spatial search by continuous-time quantum walks on crystal lattices”, Physical Review A, vol. 89, no. 5, 2014.
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.
A. M. Childs and Li, T., “Efficient simulation of sparse Markovian quantum dynamics”, Quantum Information and Computation, vol. 17, pp. 901-947, 2017.