Daniel Grier

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 25

Top Topics

Wall Street Journal

Regular Languages

Query Complexity

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Daniel Grier, Hakop Pashayan, Luke Schaeffer
Principal eigenstate classical shadows. CoRR (2024)
David Gosset, Daniel Grier, Alex Kerzner, Luke Schaeffer
Fast simulation of planar Clifford circuits. Quantum 8 (2024)
Daniel Grier, Hakop Pashayan, Luke Schaeffer
Principal eigenstate classical shadows. COLT (2024)
Daniel Grier, Sihan Liu, Gaurav Mahajan
Improved classical shadows from local symmetries in the Schur basis. CoRR (2024)
Adam Bouland, Daniel Jost Brod, Ishaun Datta, Bill Fefferman, Daniel Grier, Felipe Hernandez, Michal Oszmaniec
Complexity-theoretic foundations of BosonSampling with a linear number of modes. CoRR (2023)
Daniel Grier, Luke Schaeffer
The Classification of Clifford Gates over Qubits. Quantum 6 (2022)
Daniel Grier, Hakop Pashayan, Luke Schaeffer
Sample-optimal classical shadows for pure states. CoRR (2022)
Stephen A. Fenner, Daniel Grier, Rohit Gurjar, Arpita Korwar, Thomas Thierauf
The Complexity of Poset Games. J. Graph Algorithms Appl. 26 (1) (2022)
Daniel Grier, Daniel J. Brod, Juan Miguel Arrazola, Marcos Benicio de Andrade Alonso, Nicolás Quesada
The Complexity of Bipartite Gaussian Boson Sampling. Quantum 6 (2022)
Daniel Grier, Nathan Ju, Luke Schaeffer
Interactive quantum advantage with noisy, shallow Clifford circuits. CoRR (2021)
Daniel Grier, Daniel J. Brod, Juan Miguel Arrazola, Marcos Benicio de Andrade Alonso, Nicolás Quesada
The Complexity of Bipartite Gaussian Boson Sampling. CoRR (2021)
David Gosset, Daniel Grier, Alex Kerzner, Luke Schaeffer
Fast simulation of planar Clifford circuits. CoRR (2020)
Daniel Grier, Luke Schaeffer
Interactive shallow Clifford circuits: quantum advantage against NC¹ and beyond. STOC (2020)
Daniel Padé, Stephen A. Fenner, Daniel Grier, Thomas Thierauf
Depth-2 QAC circuits cannot simulate quantum parity. CoRR (2020)
Scott Aaronson, Daniel Grier, Luke Schaeffer
A Quantum Query Complexity Trichotomy for Regular Languages. Electron. Colloquium Comput. Complex. 26 (2019)
Daniel Grier, Luke Schaeffer
and beyond. CoRR (2019)
Scott Aaronson, Daniel Grier, Luke Schaeffer
A Quantum Query Complexity Trichotomy for Regular Languages. FOCS (2019)
Daniel Grier, Luke Schaeffer
New Hardness Results for the Permanent Using Linear Optics. Computational Complexity Conference (2018)
Scott Aaronson, Daniel Grier, Luke Schaeffer
A Quantum Query Complexity Trichotomy for Regular Languages. CoRR (2018)
Scott Aaronson, Daniel Grier, Luke Schaeffer
The Classification of Reversible Bit Operations. ITCS (2017)
Daniel Grier, Luke Schaeffer
New Hardness Results for the Permanent Using Linear Optics. Electron. Colloquium Comput. Complex. 23 (2016)
Itai Arad, Adam Bouland, Daniel Grier, Miklos Santha, Aarthi Sundaram, Shengyu Zhang
On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems. MFCS (2016)
Itai Arad, Adam Bouland, Daniel Grier, Miklos Santha, Aarthi Sundaram, Shengyu Zhang
On the complexity of probabilistic trials for hidden satisfiability problems. CoRR (2016)
Daniel Grier, Luke Schaeffer
New Hardness Results for the Permanent Using Linear Optics. CoRR (2016)
Daniel Grier, Luke Schaeffer
The Classification of Stabilizer Operations over Qubits. CoRR (2016)
Stephen A. Fenner, Daniel Grier, Jochen Messner, Luke Schaeffer, Thomas Thierauf
Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games. ISAAC (2015)
Scott Aaronson, Daniel Grier, Luke Schaeffer
The Classification of Reversible Bit Operations. Electron. Colloquium Comput. Complex. 22 (2015)
Scott Aaronson, Daniel Grier, Luke Schaeffer
The Classification of Reversible Bit Operations. CoRR (2015)
Stephen A. Fenner, Daniel Grier, Jochen Messner, Luke Schaeffer, Thomas Thierauf
Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games. Electron. Colloquium Comput. Complex. 22 (2015)
Daniel Grier
Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete. ICALP (1) (2013)
Daniel Grier
Deciding the Winner of an Arbitrary Finite Poset Game is PSPACE-Complete CoRR (2012)