1. Research
  2. Publications

Publications

Export 1304 results:
Author [ Title(Asc)] 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
A. M. Childs, Jao, D., and Soukharev, V., “Constructing elliptic curve isogenies in quantum subexponential time”, Journal of Mathematical Cryptology, vol. 8, no. 1, pp. 1 - 29, 2014.
H. Fu, “Constant-sized correlations are sufficient to robustly self-test maximally entangled states with unbounded dimension”, Quantum, vol. 6, p. 614, 2022.
K. - M. Chung, Lee, Y., Lin, H. - H., and Wu, X., “Constant-round Blind Classical Verification of Quantum Sampling”, 2020.
Y. - K. Liu, “Consistency of Local Density Matrices is QMA-complete”, Proc. RANDOM , pp. 438-449, 2006.
J. Bringewatt, Sato, N., Melnitchouk, W., Qiu, J. - W., Steffens, F., and Constantinou, M., “Confronting lattice parton distributions with global QCD analysis”, 2020.
C. David White, Cao, C. J., and Swingle, B., “Conformal field theories are magical”, Physical Review B, vol. 103, no. 7, p. 075145, 2021.
F. Liu, Lundgren, R., Titum, P., Pagano, G., Zhang, J., Monroe, C., and Gorshkov, A. V., “Confined Dynamics in Long-Range Interacting Quantum Spin Chains”, Phys. Rev. Lett., vol. 122 , no. 150601, 2019.
A. Stairs and Bub, J., “Conditionalizing and commutativity: a note on Malley”, 2005.
M. Coudron and Menda, S., “Computations with Greater Quantum Depth Are Strictly More Powerful (Relative to an Oracle)”, Accepted to the Symposium on the Theory of Computing (STOC) 2020 conference, 2020.
A. Singh Arora, Bharti, K., Cojocaru, A., and Coladangelo, A., “A computational test of quantum contextuality, and even simpler proofs of quantumness”, FOCS 2024 Accepted Paper, 2024.
H. Fu, Wang, D., and Zhao, Q., “Computational self-testing of multi-qubit states and measurements”, 2022.
G. Alagic, Broadbent, A., Fefferman, B., Gagliardoni, T., Schaffner, C., and Jules, M. St., “Computational Security of Quantum Encryption”, in Computational Security of Quantum Encryption. In: Nascimento A., Barreto P. (eds) Information Theoretic Security. , 2016.
J. Bermejo-Vega, Lin, C. Yen- Yu, and Van den Nest, M., “The computational power of normalizer circuits over black-box groups”, 2014.
D. J. Brod and Childs, A. M., “The computational power of matchgates and the XY interaction on arbitrary graphs”, Quantum Information and Computation, vol. 14, no. 11-12, pp. 901-916, 2014.
Y. - H. Chen, Chung, K. - M., Lai, C. - Y., Vadhan, S. P., and Wu, X., “Computational Notions of Quantum Min-Entropy”, 2017.
D. Hangleiter and Eisert, J., “Computational advantage of quantum random sampling”, 2022.
A. Seif, Hafezi, M., and Liu, Y. - K., “Compressed Sensing Measurement of Long-Range Correlated Noise”, 2021.
M. Gullans, Caranti, M., Mills, A. R., and Petta, J. R., “Compressed gate characterization for quantum devices with time-correlated noise”, 2023.
A. Munson, Kothakonda, N. Bhavya Tej, Haferkamp, J., Halpern, N. Yunger, Eisert, J., and Faist, P., “Complexity-constrained quantum thermodynamics”, 2024.
N. Maskara, Deshpande, A., Tran, M. C., Ehrenberg, A., Fefferman, B., and Gorshkov, A. V., “Complexity phase diagram for interacting and long-range bosonic Hamiltonians”, 2019.
A. M. Childs, Gosset, D., and Webb, Z., “Complexity of the XY antiferromagnet at fixed magnetization”, Quantum Information and Computation, vol. 16, no. 1-2, pp. 1-18, 2016.
Y. - K. Liu, “The Complexity of the Consistency and N-representability Problems for Quantum States”, 2007.
A. Deshpande, Fefferman, B., Foss-Feig, M., and Gorshkov, A. V., “Complexity of sampling as an order parameter”, 2017.
O. Shtanko, Deshpande, A., Julienne, P. S., and Gorshkov, A. V., “Complexity of Fermionic Dissipative Interactions and Applications to Quantum Computing”, PRX Quantum, vol. 2, 2021.
J. Yi, Ye, W., Gottesman, D., and Liu, Z. - W., “Complexity and order in approximate quantum error-correcting codes”, Nature Physics, 2024.