Bounds on the QAC0 Complexity of Approximating Parity. - Gregory Rosenthal (CoRR, 2020)

Bounds on the QAC^0 Complexity of Approximating Parity. - Gregory Rosenthal (ITCS, 2021)

Beating Treewidth for Average-Case Subgraph Isomorphism. - Gregory Rosenthal (Algorithmica, 2021)

Query and Depth Upper Bounds for Quantum Unitaries via Grover Search. - Gregory Rosenthal (CoRR, 2021)

Interactive Proofs for Synthesizing Quantum States and Unitaries. - Gregory Rosenthal; Henry Yuen (ITCS, 2022)

Quantum State and Unitary Complexity - Gregory Rosenthal (2023)

Efficient Quantum State Synthesis with One Query. - Gregory Rosenthal (SODA, 2024)

Quantum Channel Testing in Average-Case Distance. - Hugo Aaronson; Gregory Rosenthal; Sathyawageeswar Subramanian; Animesh Datta; Tom Gur (CoRR, 2024)