Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete. - Daniel Grier (ICALP (1), 2013)

The Classification of Reversible Bit Operations. - Scott Aaronson; Daniel Grier; Luke Schaeffer (Electron. Colloquium Comput. Complex., 2015)

Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games. - Stephen A. Fenner; Daniel Grier; Jochen Messner; Luke Schaeffer; Thomas Thierauf (Electron. Colloquium Comput. Complex., 2015)

On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems. - Itai Arad; Adam Bouland; Daniel Grier; Miklos Santha; Aarthi Sundaram; Shengyu Zhang 002 (MFCS, 2016)

The Classification of Stabilizer Operations over Qubits. - Daniel Grier; Luke Schaeffer (CoRR, 2016)

New Hardness Results for the Permanent Using Linear Optics. - Daniel Grier; Luke Schaeffer (Electron. Colloquium Comput. Complex., 2016)

Interactive shallow Clifford circuits: quantum advantage against NC1 and beyond. - Daniel Grier; Luke Schaeffer (CoRR, 2019)

A Quantum Query Complexity Trichotomy for Regular Languages. - Scott Aaronson; Daniel Grier; Luke Schaeffer (Electron. Colloquium Comput. Complex., 2019)

Interactive shallow Clifford circuits: quantum advantage against NC¹ and beyond. - Daniel Grier; Luke Schaeffer (STOC, 2020)

Depth-2 QAC circuits cannot simulate quantum parity. - Daniel Padé; Stephen A. Fenner; Daniel Grier; Thomas Thierauf (CoRR, 2020)

Interactive quantum advantage with noisy, shallow Clifford circuits. - Daniel Grier; Nathan Ju; Luke Schaeffer (CoRR, 2021)

The Complexity of Poset Games. - Stephen A. Fenner; Daniel Grier; Rohit Gurjar; Arpita Korwar; Thomas Thierauf (J. Graph Algorithms Appl., 2022)

The Classification of Clifford Gates over Qubits. - Daniel Grier; Luke Schaeffer (Quantum, 2022)

The Complexity of Bipartite Gaussian Boson Sampling. - Daniel Grier; Daniel J. Brod; Juan Miguel Arrazola; Marcos Benicio de Andrade Alonso; Nicolás Quesada (Quantum, 2022)

Complexity-theoretic foundations of BosonSampling with a linear number of modes. - Adam Bouland; Daniel Jost Brod; Ishaun Datta; Bill Fefferman; Daniel Grier; Felipe Hernandez; Michal Oszmaniec (CoRR, 2023)

Principal eigenstate classical shadows. - Daniel Grier; Hakop Pashayan; Luke Schaeffer (COLT, 2024)

Improved classical shadows from local symmetries in the Schur basis. - Daniel Grier; Sihan Liu; Gaurav Mahajan (CoRR, 2024)

Sample-optimal classical shadows for pure states. - Daniel Grier; Hakop Pashayan; Luke Schaeffer (Quantum, 2024)

Fast simulation of planar Clifford circuits. - David Gosset; Daniel Grier; Alex Kerzner; Luke Schaeffer (Quantum, 2024)

Quantum Threshold Is Powerful. - Daniel Grier; Jackson Morris (CCC, 2025)

Tight bounds on depth-2 QAC-circuits computing parity. - Stephen A. Fenner; Daniel Grier; Daniel Padé; Thomas Thierauf (CoRR, 2025)