| Quantum pseudorandomness and classical complexity W Kretschmer arXiv preprint arXiv:2103.09320, 2021 | 111 | 2021 |
| Quantum cryptography in algorithmica W Kretschmer, L Qian, M Sinha, A Tal Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1589-1602, 2023 | 60 | 2023 |
| Simulation of qubit quantum circuits via Pauli propagation P Rall, D Liang, J Cook, W Kretschmer Physical Review A 99 (6), 062337, 2019 | 58 | 2019 |
| Symmetries, graph properties, and quantum speedups S Ben-David, AM Childs, A Gilyén, W Kretschmer, S Podder, D Wang SIAM Journal on Computing 53 (6), FOCS20-368-FOCS20-415, 2024 | 38 | 2024 |
| Improved stabilizer estimation via bell difference sampling S Grewal, V Iyer, W Kretschmer, D Liang Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 1352-1363, 2024 | 27 | 2024 |
| Efficient Learning of Quantum States Prepared With Few Non-Clifford Gates S Grewal, V Iyer, W Kretschmer, D Liang arXiv preprint arXiv:2305.13409, 2023 | 24 | 2023 |
| Quantum lower bounds for approximate counting via Laurent polynomials S Aaronson, R Kothari, W Kretschmer, J Thaler arXiv preprint arXiv:1904.08914, 2019 | 24 | 2019 |
| The Acrobatics of BQP S Aaronson, DV Ingram, W Kretschmer arXiv preprint arXiv:2111.10409, 2021 | 22 | 2021 |
| Low-Stabilizer-Complexity Quantum States Are Not Pseudorandom S Grewal, V Iyer, W Kretschmer, D Liang arXiv preprint arXiv:2209.14530, 2022 | 16 | 2022 |
| A Qubit, a Coin, and an Advice String Walk Into a Relational Problem S Aaronson, H Buhrman, W Kretschmer arXiv preprint arXiv:2302.10332, 2023 | 13 | 2023 |
| Structured factored inference for probabilistic programming A Pfeffer, B Ruttenberg, W Kretschmer, A OConnor International Conference on Artificial Intelligence and Statistics, 1224-1232, 2018 | 11* | 2018 |
| The quantum supremacy tsirelson inequality W Kretschmer Quantum 5, 560, 2021 | 9 | 2021 |
| Agnostic Tomography of Stabilizer Product States S Grewal, V Iyer, W Kretschmer, D Liang arXiv preprint arXiv:2404.03813, 2024 | 4 | 2024 |
| Lower bounding the AND-OR tree via symmetrization W Kretschmer ACM Transactions on Computation Theory (TOCT) 13 (1), 1-11, 2021 | 4 | 2021 |
| Pseudoentanglement Ain't Cheap S Grewal, V Iyer, W Kretschmer, D Liang arXiv preprint arXiv:2404.00126, 2024 | 2 | 2024 |
| Quantum-Computable One-Way Functions without One-Way Functions W Kretschmer, L Qian, A Tal arXiv preprint arXiv:2411.02554, 2024 | 1 | 2024 |
| Learning the closest product state A Bakshi, J Bostanci, W Kretschmer, Z Landau, A Liu, R O'Donnell, ... arXiv preprint arXiv:2411.04283, 2024 | | 2024 |
| Inherently quantum lower bounds on computational complexity WW Kretschmer | | 2023 |
| Two-Disk Compound Symmetry Groups RA Hearn, W Kretschmer, T Rokicki, B Streeter, E Vergo arXiv preprint arXiv:2302.12950, 2023 | | 2023 |
| Quantum Mass Production Theorems W Kretschmer arXiv preprint arXiv:2212.14399, 2022 | | 2022 |
