| MIP* = RE Z Ji, A Natarajan, T Vidick, J Wright, H Yuen arXiv preprint arXiv:2001.04383, 2020 | 380* | 2020 |
| Exploring entanglement and optimization within the hamiltonian variational ansatz R Wiersema, C Zhou, Y de Sereville, JF Carrasquilla, YB Kim, H Yuen PRX quantum 1 (2), 020319, 2020 | 222 | 2020 |
| Cryptography from pseudorandom quantum states P Ananth, L Qian, H Yuen Annual International Cryptology Conference, 208-236, 2022 | 105 | 2022 |
| Infinite randomness expansion with a constant number of devices M Coudron, H Yuen Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 94* | 2014 |
| New security notions and feasibility results for authentication of quantum data S Garg, H Yuen, M Zhandry Advances in Cryptology–CRYPTO 2017: 37th Annual International Cryptology …, 2017 | 55 | 2017 |
| Quantum statistical query learning S Arunachalam, AB Grilo, H Yuen arXiv preprint arXiv:2002.08240, 2020 | 41 | 2020 |
| Anchored parallel repetition for nonlocal games M Bavarian, T Vidick, H Yuen SIAM Journal on Computing 51 (2), 214-253, 2022 | 39* | 2022 |
| Pseudorandom (function-like) quantum state generators: New definitions and applications P Ananth, A Gulati, L Qian, H Yuen Theory of Cryptography Conference, 237-265, 2022 | 35 | 2022 |
| Testing and learning quantum juntas nearly optimally T Chen, S Nadimpalli, H Yuen Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 34 | 2023 |
| Raz-McKenzie simulation with the inner product gadget X Wu, P Yao, HS Yuen Electronic Colloquium on Computational Complexity (ECCC) 24 (10), 2017 | 33 | 2017 |
| Quantum search-to-decision reductions and the state synthesis problem S Irani, A Natarajan, C Nirkhe, S Rao, H Yuen arXiv preprint arXiv:2111.02999, 2021 | 32 | 2021 |
| A quantum lower bound for distinguishing random functions from random permutations H Yuen arXiv preprint arXiv:1310.2885, 2013 | 32 | 2013 |
| Perfect zero knowledge for quantum multiprover interactive proofs AB Grilo, W Slofstra, H Yuen 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019 | 29 | 2019 |
| Robust randomness amplifiers: Upper and lower bounds M Coudron, T Vidick, H Yuen International Workshop on Approximation Algorithms for Combinatorial …, 2013 | 29 | 2013 |
| Interactive Proofs for Synthesizing Quantum States and Unitaries G Rosenthal, H Yuen 13th Innovations in Theoretical Computer Science Conference (ITCS 2022) 215 …, 2021 | 28 | 2021 |
| Quantum proof systems for iterated exponential time, and beyond J Fitzsimons, Z Ji, T Vidick, H Yuen Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 27 | 2019 |
| Quantum garbled circuits Z Brakerski, H Yuen Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 26 | 2022 |
| An improved sample complexity lower bound for (fidelity) quantum state tomography H Yuen Quantum 7, 890, 2023 | 25* | 2023 |
| Unitary Complexity and the Uhlmann Transformation Problem J Bostanci, Y Efron, T Metger, A Poremba, L Qian, H Yuen arXiv preprint arXiv:2306.13073, 2023 | 23 | 2023 |
| A parallel repetition theorem for all entangled games H Yuen arXiv preprint arXiv:1604.04340, 2016 | 23 | 2016 |
Thomas VidickProfessor, CMS, CaltechVerified email at caltech.edu