Daniel Grier

According to our database, Daniel Grier authored at least 21 papers between 2013 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Tight bounds on depth-2 QAC-circuits computing parity.

Stephen A. Fenner, Daniel Grier, Daniel Padé, Thomas Thierauf

CoRR, April, 2025

Quantum Threshold Is Powerful.

Daniel Grier, Jackson Morris

Proceedings of the 40th Computational Complexity Conference, 2025

2024

Fast simulation of planar Clifford circuits.

David Gosset, Daniel Grier, Alex Kerzner, Luke Schaeffer

Quantum, February, 2024

Sample-optimal classical shadows for pure states.

Daniel Grier, Hakop Pashayan, Luke Schaeffer

Quantum, 2024

Improved classical shadows from local symmetries in the Schur basis.

Daniel Grier, Sihan Liu, Gaurav Mahajan

CoRR, 2024

Principal eigenstate classical shadows.

Daniel Grier, Hakop Pashayan, Luke Schaeffer

Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

2023

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

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, September, 2022

The Classification of Clifford Gates over Qubits.

Daniel Grier, Luke Schaeffer

Quantum, 2022

The Complexity of Poset Games.

Stephen A. Fenner, Daniel Grier, Rohit Gurjar, Arpita Korwar, Thomas Thierauf

J. Graph Algorithms Appl., 2022

2021

Interactive quantum advantage with noisy, shallow Clifford circuits.

Daniel Grier, Nathan Ju, Luke Schaeffer

CoRR, 2021

2020

Depth-2 QAC circuits cannot simulate quantum parity.

Daniel Padé, Stephen A. Fenner, Daniel Grier, Thomas Thierauf

CoRR, 2020

Interactive shallow Clifford circuits: quantum advantage against NC¹ and beyond.

Daniel Grier, Luke Schaeffer

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

2019

Interactive shallow Clifford circuits: quantum advantage against NC¹ and beyond.

Daniel Grier, Luke Schaeffer

CoRR, 2019

A Quantum Query Complexity Trichotomy for Regular Languages.

Scott Aaronson, Daniel Grier, Luke Schaeffer

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018

New Hardness Results for the Permanent Using Linear Optics.

Daniel Grier, Luke Schaeffer

Proceedings of the 33rd Computational Complexity Conference, 2018

2017

The Classification of Reversible Bit Operations.

Scott Aaronson, Daniel Grier, Luke Schaeffer

Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

2016

The Classification of Stabilizer Operations over Qubits.

Daniel Grier, Luke Schaeffer

CoRR, 2016

On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems.

Itai Arad, Adam Bouland, Daniel Grier, Miklos Santha, Aarthi Sundaram, Shengyu Zhang

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015

Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games.

Stephen A. Fenner, Daniel Grier, Jochen Messner, Luke Schaeffer, Thomas Thierauf

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2013

Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete.

Daniel Grier

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013