1. Research
  2. Publications

Publications

Export 178 results:
[ Author(Asc)] Title Type Year
Filters: First Letter Of Last Name is C  [Clear All Filters]
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
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 Nielsen, M. A., “Unified derivations of measurement-based schemes for quantum computation”, Physical Review A, vol. 71, no. 3, 2005.
A. M. Childs and Eisenberg, J. M., “Quantum algorithms for subset finding”, 2003.
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, 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 and Kothari, R., “Simulating sparse Hamiltonians with star decompositions”, 2010.
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, Liu, J. - P., and Ostrander, A., “High-precision quantum algorithms for partial differential equations”, Quantum 5, 574, vol. 5, no. 574, 2021.
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.
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.
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, Chung, K. - M., Liu, Q., and Yamakawa, T., “On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Rounds”, 2021.
G. Cheng and Swingle, B., “Chaos in a quantum rotor model”, 2019.
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, 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.
Y. - A. Chen and Tata, S., “Higher cup products on hypercubic lattices: application to lattice models of topological phases”, 2021.
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.
J. Chen and Winter, A., “Non-Additivity of the Entanglement of Purification (Beyond Reasonable Doubt) ”, 2012.
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.
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.
Y. - A. Chen, Gorshkov, A. V., and Xu, Y., “Error-correcting codes for fermionic quantum simulation”, 2022.