1. Research
  2. Publications

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
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.
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, 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 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.
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.
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, 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.
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, 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., 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 and Ivanyos, G., “Quantum computation of discrete logarithms in semigroups”, Journal of Mathematical Cryptology, vol. 8, no. 4, 2014.
A. M. Childs, Ostrander, A., and Su, Y., “Faster quantum simulation by randomization”, Quantum , vol. 3, no. 182, 2019.
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, 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 Lee, T., “Optimal quantum adversary lower bounds for ordered search”, 2007.
A. M. Childs and Li, T., “Efficient simulation of sparse Markovian quantum dynamics”, Quantum Information and Computation, vol. 17, pp. 901-947, 2017.