![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
David Gosset
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j12]David Gosset, Daniel Grier, Alex Kerzner, Luke Schaeffer:
Fast simulation of planar Clifford circuits. Quantum 8: 1251 (2024) - [c10]Sergey Bravyi
, David Gosset
, Yinchen Liu
:
Classical Simulation of Peaked Shallow Quantum Circuits. STOC 2024: 561-572 - [i14]Adam Bene Watts, David Gosset, Yinchen Liu, Mehdi Soleimanifar:
Quantum advantage from measurement-induced entanglement in random shallow circuits. CoRR abs/2407.21203 (2024) - 2023
- [j11]Sergey Bravyi, Giuseppe Carleo
, David Gosset, Yinchen Liu:
A rapidly mixing Markov chain from any gapped quantum many-body system. Quantum 7: 1173 (2023) - [i13]Sergey Bravyi, Anirban Chowdhury, David Gosset, Vojtech Havlícek, Guanyu Zhu:
Quantum complexity of the Kronecker coefficients. CoRR abs/2302.11454 (2023) - 2022
- [c9]Anurag Anshu, Itai Arad, David Gosset:
An area law for 2d frustration-free spin systems. STOC 2022: 12-18 - 2021
- [j10]Hammam Qassim, Hakop Pashayan
, David Gosset:
Improved upper bounds on the stabilizer rank of magic states. Quantum 5: 606 (2021) - [i12]Anurag Anshu, David Gosset, Karen J. Morenz Korol
, Mehdi Soleimanifar:
Improved approximation algorithms for bounded-degree local Hamiltonians. CoRR abs/2105.01193 (2021) - [i11]Sergey Bravyi, Anirban Chowdhury, David Gosset, Pawel Wocjan:
On the complexity of quantum partition functions. CoRR abs/2110.15466 (2021) - 2020
- [c8]Anurag Anshu, Itai Arad, David Gosset:
Entanglement subvolume law for 2d frustration-free spin systems. STOC 2020: 868-874 - [c7]Anurag Anshu
, David Gosset
, Karen Morenz
:
Beyond Product State Approximations for a Quantum Analogue of Max Cut. TQC 2020: 7:1-7:15 - [i10]David Gosset, Daniel Grier, Alex Kerzner, Luke Schaeffer:
Fast simulation of planar Clifford circuits. CoRR abs/2009.03218 (2020)
2010 – 2019
- 2019
- [c6]Sergey Bravyi, David Gosset, Robert König, Marco Tomamichel:
Quantum Advantage with Noisy Shallow Circuits in 3D. FOCS 2019: 995-999 - [c5]David Gosset, John A. Smolin:
A Compressed Classical Description of Quantum States. TQC 2019: 8:1-8:9 - [i9]Sergey Bravyi, David Gosset, Ramis Movassagh:
Classical algorithms for quantum mean values. CoRR abs/1909.11485 (2019) - 2018
- [i8]David Gosset, John A. Smolin:
A compressed classical description of quantum states. CoRR abs/1801.05721 (2018) - 2017
- [i7]Sergey Bravyi, David Gosset, Robert König:
Quantum advantage with shallow circuits. CoRR abs/1704.00690 (2017) - 2016
- [j9]Andrew M. Childs
, David Gosset, Zak Webb:
Complexity of the XY antiferromagnet at fixed magnetization. Quantum Inf. Comput. 16(1&2): 1-18 (2016) - [j8]David Gosset, Daniel Nagaj
:
Quantum 3-SAT Is QMA1-Complete. SIAM J. Comput. 45(3): 1080-1128 (2016) - [i6]David Gosset, Jenish C. Mehta, Thomas Vidick:
QCMA hardness of ground space connectivity for commuting Hamiltonians. CoRR abs/1610.03582 (2016) - [i5]Sergey Bravyi, David Gosset:
Polynomial-time classical simulation of quantum ferromagnets. CoRR abs/1612.05602 (2016) - 2015
- [j7]Andrew M. Childs
, David Gosset, Daniel Nagaj, Mouktik Raha, Zak Webb:
Momentum switches. Quantum Inf. Comput. 15(7&8): 601-621 (2015) - [j6]Andrew M. Childs
, David Gosset, Zak Webb:
The Bose-Hubbard Model is QMA-complete. Theory Comput. 11: 491-603 (2015) - 2014
- [j5]David Gosset, Vadym Kliuchnikov, Michele Mosca, Vincent Russo:
An algorithm for the T-count. Quantum Inf. Comput. 14(15-16): 1261-1276 (2014) - [c4]Andrew M. Childs
, David Gosset, Zak Webb:
The Bose-Hubbard Model is QMA-complete. ICALP (1) 2014: 308-319 - 2013
- [c3]David Gosset, Daniel Nagaj
:
Quantum 3-SAT Is QMA1-Complete. FOCS 2013: 756-765 - [i4]David Gosset, Daniel Nagaj:
Quantum 3-SAT is QMA1-complete. CoRR abs/1302.0290 (2013) - [i3]Andrew M. Childs, David Gosset, Zak Webb:
The Bose-Hubbard model is QMA-complete. CoRR abs/1311.3297 (2013) - 2012
- [j4]Scott Aaronson, Edward Farhi, David Gosset, Avinatan Hassidim, Jonathan A. Kelner, Andrew Lutomirski:
Quantum money. Commun. ACM 55(8): 84-92 (2012) - [c2]Edward Farhi, David Gosset, Avinatan Hassidim, Andrew Lutomirski, Peter W. Shor:
Quantum money from knots. ITCS 2012: 276-289 - 2011
- [j3]Edward Farhi, Jeffrey Goldstone, David Gosset, Harvey B. Meyer:
A Quantum Monte Carlo method at fixed energy. Comput. Phys. Commun. 182(8): 1663-1673 (2011) - [j2]Edward Farhi, Jeffrey Goldstone, David Gosset, Sam Gutmann, Harvey B. Meyer, Peter W. Shor:
Quantum adiabatic algorithms, small gaps, and different paths. Quantum Inf. Comput. 11(3&4): 181-214 (2011) - [j1]Edward Farhi, Jeffrey Goldstone, David Gosset, Sam Gutmann, Peter W. Shor:
Unstructured randomness, small gaps and localization. Quantum Inf. Comput. 11(9&10): 840-854 (2011) - 2010
- [c1]Andrew Lutomirski, Scott Aaronson, Edward Farhi, David Gosset, Jonathan A. Kelner, Avinatan Hassidim, Peter W. Shor:
Breaking and Making Quantum Money: Toward a New Quantum Cryptographic Protocol. ICS 2010: 20-31 - [i2]Edward Farhi, David Gosset, Avinatan Hassidim, Andrew Lutomirski, Peter W. Shor:
Quantum money from knots. CoRR abs/1004.5127 (2010)
2000 – 2009
- 2009
- [i1]Edward Farhi, Jeffrey Goldstone, David Gosset, Sam Gutmann, Harvey B. Meyer, Peter W. Shor:
Quantum Adiabatic Algorithms, Small Gaps, and Different Paths. CoRR abs/0909.4766 (2009)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-25 20:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint