| Assessing requirements to scale to practical quantum advantage ME Beverland, P Murali, M Troyer, KM Svore, T Hoefler, V Kliuchnikov, ... arXiv preprint arXiv:2211.07629, 2022 | 112 | 2022 |
| Demonstration of logical qubits and repeated error correction with better-than-physical error rates MP Da Silva, C Ryan-Anderson, JM Bello-Rivas, A Chernoguzov, ... arXiv preprint arXiv:2404.02280, 2024 | 48 | 2024 |
| Secure software leasing without assumptions A Broadbent, S Jeffery, S Lord, S Podder, A Sundaram Theory of Cryptography Conference, 90-120, 2021 | 34 | 2021 |
| Assessing requirements to scale to practical quantum advantage (2022) ME Beverland, P Murali, M Troyer, KM Svore, T Hoefler, V Kliuchnikov, ... arXiv preprint arXiv:2211.07629, 2022 | 30 | 2022 |
| Quantum algorithms for reinforcement learning with a generative model D Wang, A Sundaram, R Kothari, A Kapoor, M Roetteler International Conference on Machine Learning, 10916-10926, 2021 | 27 | 2021 |
| Quantum hardness of learning shallow classical circuits S Arunachalam, AB Grilo, A Sundaram SIAM Journal on Computing 50 (3), 972-1013, 2021 | 25 | 2021 |
| Linear time algorithm for quantum 2SAT I Arad, M Santha, A Sundaram, S Zhang Theory of Computing 14 (1), 1 -- 27, 2018 | 24 | 2018 |
| Demonstration of logical qubits and repeated error correction with better-than-physical error rates (2024) MP da Silva, C Ryan-Anderson, JM Bello-Rivas, A Chernoguzov, ... arXiv preprint arXiv:2404.02280, 0 | 18 | |
| Quantum generalizations of the polynomial hierarchy with applications to QMA (2) S Gharibian, M Santha, J Sikora, A Sundaram, J Yirka arXiv preprint arXiv:1805.11139, 2018 | 17* | 2018 |
| Quantum learning algorithms imply circuit lower bounds S Arunachalam, AB Grilo, T Gur, IC Oliveira, A Sundaram 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 11 | 2022 |
| Quantum divide and conquer AM Childs, R Kothari, M Kovacs-Deak, A Sundaram, D Wang arXiv preprint arXiv:2210.06419, 2022 | 9 | 2022 |
| Gottesman types for quantum programs R Rand, A Sundaram, K Singhal, B Lackey arXiv preprint arXiv:2109.02197, 2021 | 9 | 2021 |
| On the complexity of trial and error for constraint satisfaction problems G Ivanyos, R Kulkarni, Y Qiao, M Santha, A Sundaram Journal of Computer and System Sciences 92, 48-64, 2018 | 7 | 2018 |
| Extending gottesman types beyond the clifford group R Rand, A Sundaram, K Singhal, B Lackey The Second International Workshop on Programming Languages for Quantum …, 2021 | 6 | 2021 |
| Quantum divide and conquer. CoRR 2022 AM Childs, R Kothari, M Kovacs-Deak, A Sundaram, D Wang arXiv preprint arXiv:2210.06419, 0 | 5 | |
| Static analysis of quantum programs via gottesman types R Rand, A Sundaram, K Singhal, B Lackey arXiv preprint arXiv:2101.08939, 2021 | 4 | 2021 |
| Unified architecture for a quantum lookup table S Zhu, A Sundaram, GH Low arXiv preprint arXiv:2406.18030, 2024 | 2 | 2024 |
| Hoare meets Heisenberg: A Lightweight Logic for Quantum Programs A Sundaram, R Rand, K Singhal, B Lackey | 1 | 2022 |
| A Rich Type System for Quantum Programs A Sundaram, R Rand, K Singhal, B Lackey arXiv preprint arXiv:2101.08939, 2021 | 1 | 2021 |
| A Type System for Quantum Resources R Rand, A Sundaram, K Singhal, B Lackey Draft. URL: https://ks. cs. uchicago. edu/publication/quantum-resourcetypes …, 2019 | 1 | 2019 |
Miklos SanthaSenior researcher in Computer Science, CNRS Paris and CQT Singapore在 liafa.univ-paris-diderot.fr 的電子郵件地址已通過驗證