default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Grier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j4]David Gosset, Daniel Grier, Alex Kerzner, Luke Schaeffer:
Fast simulation of planar Clifford circuits. Quantum 8: 1251 (2024)- 2022
- [j3]Stephen A. Fenner, Daniel Grier, Rohit Gurjar, Arpita Korwar, Thomas Thierauf:
The Complexity of Poset Games. J. Graph Algorithms Appl. 26(1): 1-14 (2022) - [j2]Daniel Grier, Luke Schaeffer:
The Classification of Clifford Gates over Qubits. Quantum 6: 734 (2022) - [j1]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: 863 (2022)
Conference and Workshop Papers
- 2024
- [c8]Daniel Grier, Hakop Pashayan, Luke Schaeffer:
Principal eigenstate classical shadows. COLT 2024: 2122-2165 - 2020
- [c7]Daniel Grier, Luke Schaeffer:
Interactive shallow Clifford circuits: quantum advantage against NC¹ and beyond. STOC 2020: 875-888 - 2019
- [c6]Scott Aaronson, Daniel Grier, Luke Schaeffer:
A Quantum Query Complexity Trichotomy for Regular Languages. FOCS 2019: 942-965 - 2018
- [c5]Daniel Grier, Luke Schaeffer:
New Hardness Results for the Permanent Using Linear Optics. CCC 2018: 19:1-19:29 - 2017
- [c4]Scott Aaronson, Daniel Grier, Luke Schaeffer:
The Classification of Reversible Bit Operations. ITCS 2017: 23:1-23:34 - 2016
- [c3]Itai Arad, Adam Bouland, Daniel Grier, Miklos Santha, Aarthi Sundaram, Shengyu Zhang:
On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems. MFCS 2016: 12:1-12:14 - 2015
- [c2]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: 689-699 - 2013
- [c1]Daniel Grier:
Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete. ICALP (1) 2013: 497-503
Informal and Other Publications
- 2024
- [i19]Daniel Grier, Sihan Liu, Gaurav Mahajan:
Improved classical shadows from local symmetries in the Schur basis. CoRR abs/2405.09525 (2024) - [i18]Daniel Grier, Hakop Pashayan, Luke Schaeffer:
Principal eigenstate classical shadows. CoRR abs/2405.13939 (2024) - 2023
- [i17]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 abs/2312.00286 (2023) - 2022
- [i16]Daniel Grier, Hakop Pashayan, Luke Schaeffer:
Sample-optimal classical shadows for pure states. CoRR abs/2211.11810 (2022) - 2021
- [i15]Daniel Grier, Nathan Ju, Luke Schaeffer:
Interactive quantum advantage with noisy, shallow Clifford circuits. CoRR abs/2102.06833 (2021) - [i14]Daniel Grier, Daniel J. Brod, Juan Miguel Arrazola, Marcos Benicio de Andrade Alonso, Nicolás Quesada:
The Complexity of Bipartite Gaussian Boson Sampling. CoRR abs/2110.06964 (2021) - 2020
- [i13]Daniel Padé, Stephen A. Fenner, Daniel Grier, Thomas Thierauf:
Depth-2 QAC circuits cannot simulate quantum parity. CoRR abs/2005.12169 (2020) - [i12]David Gosset, Daniel Grier, Alex Kerzner, Luke Schaeffer:
Fast simulation of planar Clifford circuits. CoRR abs/2009.03218 (2020) - 2019
- [i11]Daniel Grier, Luke Schaeffer:
Interactive shallow Clifford circuits: quantum advantage against NC1 and beyond. CoRR abs/1911.02555 (2019) - [i10]Scott Aaronson, Daniel Grier, Luke Schaeffer:
A Quantum Query Complexity Trichotomy for Regular Languages. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [i9]Scott Aaronson, Daniel Grier, Luke Schaeffer:
A Quantum Query Complexity Trichotomy for Regular Languages. CoRR abs/1812.04219 (2018) - 2016
- [i8]Daniel Grier, Luke Schaeffer:
The Classification of Stabilizer Operations over Qubits. CoRR abs/1603.03999 (2016) - [i7]Itai Arad, Adam Bouland, Daniel Grier, Miklos Santha, Aarthi Sundaram, Shengyu Zhang:
On the complexity of probabilistic trials for hidden satisfiability problems. CoRR abs/1606.03585 (2016) - [i6]Daniel Grier, Luke Schaeffer:
New Hardness Results for the Permanent Using Linear Optics. CoRR abs/1610.04670 (2016) - [i5]Daniel Grier, Luke Schaeffer:
New Hardness Results for the Permanent Using Linear Optics. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [i4]Scott Aaronson, Daniel Grier, Luke Schaeffer:
The Classification of Reversible Bit Operations. CoRR abs/1504.05155 (2015) - [i3]Scott Aaronson, Daniel Grier, Luke Schaeffer:
The Classification of Reversible Bit Operations. Electron. Colloquium Comput. Complex. TR15 (2015) - [i2]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. TR15 (2015) - 2012
- [i1]Daniel Grier:
Deciding the Winner of an Arbitrary Finite Poset Game is PSPACE-Complete. CoRR abs/1209.1750 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
