| The classification of reversible bit operations S Aaronson, D Grier, L Schaeffer arXiv preprint arXiv:1504.05155, 2015 | 66 | 2015 |
| A quantum query complexity trichotomy for regular languages S Aaronson, D Grier, L Schaeffer 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019 | 28 | 2019 |
| Interactive shallow clifford circuits: quantum advantage against NC¹ and beyond D Grier, L Schaeffer Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 25 | 2020 |
| The complexity of bipartite Gaussian boson sampling D Grier, DJ Brod, JM Arrazola, MB de Andrade Alonso, N Quesada Quantum 6, 863, 2022 | 22 | 2022 |
| The Classification of Clifford Gates over Qubits D Grier, L Schaeffer Quantum 6, 734, 2022 | 22* | 2022 |
| Deciding the winner of an arbitrary finite poset game is PSPACE-complete D Grier International Colloquium on Automata, Languages, and Programming, 497-503, 2013 | 21 | 2013 |
| New hardness results for the permanent using linear optics D Grier, L Schaeffer arXiv preprint arXiv:1610.04670, 2016 | 20 | 2016 |
| Fast simulation of planar Clifford circuits D Gosset, D Grier, A Kerzner, L Schaeffer Quantum 8, 1251, 2024 | 10 | 2024 |
| Game values and computational complexity: An analysis via black-white combinatorial games SA Fenner, D Grier, J Messner, L Schaeffer, T Thierauf International Symposium on Algorithms and Computation, 689-699, 2015 | 9 | 2015 |
| Classical algorithms for forrelation S Bravyi, D Gosset, D Grier, L Schaeffer arXiv preprint arXiv:2102.06963, 2021 | 8 | 2021 |
| Sample-optimal classical shadows for pure states D Grier, H Pashayan, L Schaeffer arXiv preprint arXiv:2211.11810, 2022 | 7 | 2022 |
| Interactive quantum advantage with noisy, shallow Clifford circuits D Grier, N Ju, L Schaeffer arXiv preprint arXiv:2102.06833, 2021 | 5 | 2021 |
| Depth-2 QAC circuits cannot simulate quantum parity D Padé, S Fenner, D Grier, T Thierauf arXiv preprint arXiv:2005.12169, 2020 | 5 | 2020 |
| Classical algorithms for forrelation. 2021 S Bravyi, D Gosset, D Grier, L Schaeffer arXiv preprint arXiv:2102.06963, 0 | 5 | |
| MB d. A. Alonso, and N. Quesada D Grier, DJ Brod, JM Arrazola Quantum 6 (863), 31, 2022 | 3 | 2022 |
| Complexity-theoretic foundations of BosonSampling with a linear number of modes A Bouland, D Brod, I Datta, B Fefferman, D Grier, F Hernandez, ... arXiv preprint arXiv:2312.00286, 2023 | 2 | 2023 |
| 8th Innovations in Theoretical Computer Science Conference (ITCS 2017) JR Lee, I Panageas, G Piliouras, Z Allen-Zhu, L Orecchia, T Kaufman, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2017 | 2 | 2017 |
| On the complexity of probabilistic trials for hidden satisfiability problems I Arad, A Bouland, D Grier, M Santha, A Sundaram, S Zhang arXiv preprint arXiv:1606.03585, 2016 | 1 | 2016 |
| On the cyclic van der Waerden number D Grier Geombinatorics 21, 129-131, 0 | 1 | |
| The Complexity of Poset Games S Fenner, D Grier, R Gurjar, A Korwar, T Thierauf Journal of Graph Algorithms and Applications 26 (1), 1-14, 2022 | | 2022 |
