Publications

Export 1260 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
L. Chen, Chen, J., Djokovic, D. Z., and Zeng, B., Universal Subspaces for Local Unitary Groups of Fermionic Systems, Communications in Mathematical Physics, vol. 333, no. 2, pp. 541 - 563, 2015.
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.
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, Dawkins, H., Ji, Z., Johnston, N., Kribs, D., Shultz, F., and Zeng, B., Uniqueness of Quantum States Compatible with Given Measurement Results, Physical Review A, vol. 88, no. 1, 2013.
W. Chen, Beck, K. M., Bücker, R., Gullans, M., Lukin, M. D., Tanji-Suzuki, H., and Vuletic, V., All-Optical Switch and Transistor Gated by One Stored Photon, Science, vol. 341, no. 6147, pp. 768 - 770, 2013.
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, 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.
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, 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.
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, Leung, D. W., and Lo, H. - K., Two-way quantum communication channels, International Journal of Quantum Information, vol. 04, no. 01, pp. 63 - 83, 2006.
A. M. Childs and Wiebe, N., Product Formulas for Exponentials of Commutators, Journal of Mathematical Physics, vol. 54, no. 6, p. 062202, 2013.
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 Su, Y., Nearly optimal lattice simulation by product formulas, Phys. Rev. Lett. , vol. 123, no. 050503, 2019.
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 and van Dam, W., Quantum algorithm for a generalized hidden shift problem, 2005.
A. M. Childs and Li, T., Efficient simulation of sparse Markovian quantum dynamics, Quantum Information and Computation, vol. 17, pp. 901-947, 2017.
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.