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, 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, Ji, Z., Kribs, D., Lütkenhaus, N., and Zeng, B., Symmetric Extension of Two-Qubit States, Physical Review A, vol. 90, no. 3, 2014.
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.
Y. - A. Chen and Tata, S., Higher cup products on hypercubic lattices: application to lattice models of topological phases, 2021.
J. Chen, Ji, Z., Ruskai, M. Beth, Zeng, B., and Zhou, D., Principle of Maximum Entropy and Ground Spaces of Local Hamiltonians, 2010.
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, Gorshkov, A. V., and Xu, Y., Error-correcting codes for fermionic quantum simulation, 2022.
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.
G. Cheng and Swingle, B., Chaos in a quantum rotor model, 2019.
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, 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, 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. 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, 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, Ostrander, A., and Su, Y., Faster quantum simulation by randomization, Quantum , vol. 3, no. 182, 2019.
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 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, Leung, D., Mancinska, L., and Ozols, M., Characterization of universal two-qubit Hamiltonians, 2010.
A. M. Childs, Leung, D. W., Verstraete, F., and Vidal, G., Asymptotic entanglement capacity of the Ising and anisotropic Heisenberg interactions , 2002.