| Query and depth upper bounds for quantum unitaries via grover search G Rosenthal arXiv preprint arXiv:2111.07992, 2021 | 25 | 2021 |
| Interactive proofs for synthesizing quantum states and unitaries G Rosenthal, H Yuen arXiv preprint arXiv:2108.07192, 2021 | 21 | 2021 |
| Bounds on the QAC Complexity of Approximating Parity G Rosenthal arXiv preprint arXiv:2008.07470, 2020 | 10 | 2020 |
| Efficient Quantum State Synthesis with One Query G Rosenthal Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 9 | 2024 |
| Beating treewidth for average-case subgraph isomorphism G Rosenthal Algorithmica 83, 2521-2551, 2021 | 3 | 2021 |
| Quantum State and Unitary Complexity G Rosenthal University of Toronto (Canada), 2023 | 2 | 2023 |
| Ramon van Handel’s Remarks on the Discrete Cube G Rosenthal | 1 | 2020 |
| Quantum Channel Testing in Average-Case Distance H Aaronson, G Rosenthal, S Subramanian, A Datta, T Gur arXiv preprint arXiv:2409.12566, 2024 | | 2024 |
| 14th International Symposium on Parameterized and Exact Computation (IPEC 2019) BA Berendsohn, L Kozma, D Marx, S Bessy, M Bougeret, ADA Carneiro, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2019 | | 2019 |
