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 
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.
Y. - A. Chen and Hsin, P. - S., Exactly Solvable Lattice Hamiltonians and Gravitational Anomalies, 2021.
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.
Y. - H. Chen, Chung, K. - M., Lai, C. - Y., Vadhan, S. P., and Wu, X., Computational Notions of Quantum Min-Entropy, 2017.
J. Chen, Ji, Z., Kribs, D. W., and Zeng, B., Minimum Entangling Power is Close to Its Maximum, 2012.
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., 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.
J. Chen, Duan, R., Ji, Z., Ying, M., and Yu, J., Existence of Universal Entangler, Journal of Mathematical Physics, vol. 49, no. 1, p. 012103, 2008.
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., 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.
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, Coudron, M., and Gilani, A. Shiraz, Quantum Algorithms and the Power of Forgetting, 14th Innovations in Theoretical Computer Science Conference (ITCS 2023), vol. 251, p. 37:1--37:22, 2023.
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 Wang, D., Can graph properties have exponential quantum speedup?, 2020.
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, Farhi, E., and Preskill, J., Robustness of adiabatic quantum computation, Physical Review A, vol. 65, no. 1, 2001.
A. M. Childs, Harrow, A. W., and Wocjan, P., Weak Fourier-Schur sampling, the hidden subgroup problem, and the quantum collision problem , 2006.