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, Childs, A. M., and Hung, S. - H., “Quantum algorithm for multivariate polynomial interpolation”, Proceedings of The Royal Society A, vol. 474, no. 2209, 2018.
Y. - A. Chen and Hsin, P. - S., “Exactly Solvable Lattice Hamiltonians and Gravitational Anomalies”, 2021.
J. Chen, Ji, Z., Zeng, B., and Zhou, D. L., “From Ground States to Local Hamiltonians”, Physical Review A, vol. 86, no. 2, 2012.
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.
Y. - A. Chen, Childs, A. M., Hafezi, M., Jiang, Z., Kim, H., and Xu, Y., “Efficient Product Formulas for Commutators and Applications to Quantum Simulation”, Physical Review Research, vol. 4, 2022.
J. Chen, Ji, Z., Wei, Z., and Zeng, B., “Correlations in excited states of local Hamiltonians”, Physical Review A, vol. 85, no. 4, 2012.
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, 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, 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.
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, Chung, K. - M., Liu, Q., and Yamakawa, T., “On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Rounds”, 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.
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 Gosset, D., “Levinson's theorem for graphs II”, Journal of Mathematical Physics, vol. 53, no. 10, p. 102207, 2012.
A. M. Childs, “Universal computation by quantum walk”, Physical Review Letters, vol. 102, no. 18, 2009.
A. M. Childs, Farhi, E., Goldstone, J., and Gutmann, S., “Finding cliques by quantum adiabatic evolution”, 2000.
A. M. Childs, Leung, D., Mancinska, L., and Ozols, M., “Interpolatability distinguishes LOCC from separable von Neumann measurements”, Journal of Mathematical Physics, vol. 54, no. 11, p. 112204, 2013.
A. M. Childs, Reichardt, B. W., Spalek, R., and Zhang, S., “Every NAND formula of size N can be evaluated in time N^1/2+o(1) on a quantum computer ”, 2007.
A. M. Childs and Kothari, R., “Simulating sparse Hamiltonians with star decompositions”, 2010.
A. M. Childs, Gosset, D., and Webb, Z., “The Bose-Hubbard model is QMA-complete”, Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP 2014), vol. 8572, pp. 308-319, 2014.
A. M. Childs, Harrow, A. W., and Wocjan, P., “Weak Fourier-Schur sampling, the hidden subgroup problem, and the quantum collision problem ”, 2006.