Daniel Grier

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