Breaking and Making Quantum Money: Toward a New Quantum Cryptographic Protocol. - Andrew Lutomirski; Scott Aaronson; Edward Farhi; David Gosset; Jonathan A. Kelner; Avinatan Hassidim; Peter W. Shor (ICS, 2010)

A Quantum Monte Carlo method at fixed energy. - Edward Farhi; Jeffrey Goldstone; David Gosset; Harvey B. Meyer (Comput. Phys. Commun., 2011)

Quantum adiabatic algorithms, small gaps, and different paths. - Edward Farhi; Jeffrey Goldstone; David Gosset; Sam Gutmann; Harvey B. Meyer; Peter W. Shor (Quantum Inf. Comput., 2011)

Unstructured randomness, small gaps and localization. - Edward Farhi; Jeffrey Goldstone; David Gosset; Sam Gutmann; Peter W. Shor (Quantum Inf. Comput., 2011)

Quantum money from knots. - Edward Farhi; David Gosset; Avinatan Hassidim; Andrew Lutomirski; Peter W. Shor (ITCS, 2012)

Quantum money. - Scott Aaronson; Edward Farhi; David Gosset; Avinatan Hassidim; Jonathan A. Kelner; Andrew Lutomirski (Commun. ACM, 2012)

Quantum 3-SAT Is QMA1-Complete. - David Gosset; Daniel Nagaj (FOCS, 2013)

An algorithm for the T-count. - David Gosset; Vadym Kliuchnikov; Michele Mosca; Vincent Russo (Quantum Inf. Comput., 2014)

Momentum switches. - Andrew M. Childs; David Gosset; Daniel Nagaj; Mouktik Raha; Zak Webb (Quantum Inf. Comput., 2015)

The Bose-Hubbard Model is QMA-complete. - Andrew M. Childs; David Gosset; Zak Webb (Theory Comput., 2015)

Polynomial-time classical simulation of quantum ferromagnets. - Sergey Bravyi 001; David Gosset (CoRR, 2016)

Complexity of the XY antiferromagnet at fixed magnetization. - Andrew M. Childs; David Gosset; Zak Webb (Quantum Inf. Comput., 2016)

Quantum 3-SAT Is QMA1-Complete. - David Gosset; Daniel Nagaj (SIAM J. Comput., 2016)

Quantum advantage with shallow circuits. - Sergey Bravyi 001; David Gosset; Robert König (CoRR, 2017)

QCMA hardness of ground space connectivity for commuting Hamiltonians. - David Gosset; Jenish C. Mehta; Thomas Vidick (Quantum, 2017)

Quantum Advantage with Noisy Shallow Circuits in 3D. - Sergey Bravyi 001; David Gosset; Robert König; Marco Tomamichel (FOCS, 2019)

A Compressed Classical Description of Quantum States. - David Gosset; John A. Smolin (TQC, 2019)

Classical algorithms for quantum mean values. - Sergey Bravyi 001; David Gosset; Ramis Movassagh (CoRR, 2019)

Simulation of quantum circuits by low-rank stabilizer decompositions. - Sergey Bravyi 001; Dan E. Browne; Padraic Calpin; Earl T. Campbell; David Gosset; Mark Howard (Quantum, 2019)

Entanglement subvolume law for 2d frustration-free spin systems. - Anurag Anshu; Itai Arad; David Gosset (STOC, 2020)

Beyond Product State Approximations for a Quantum Analogue of Max Cut. - Anurag Anshu; David Gosset; Karen Morenz (TQC, 2020)

Improved approximation algorithms for bounded-degree local Hamiltonians. - Anurag Anshu; David Gosset; Karen J. Morenz Korol; Mehdi Soleimanifar (CoRR, 2021)

On the complexity of quantum partition functions. - Sergey Bravyi 001; Anirban Chowdhury; David Gosset; Pawel Wocjan (CoRR, 2021)

Improved upper bounds on the stabilizer rank of magic states. - Hammam Qassim; Hakop Pashayan; David Gosset (Quantum, 2021)

An area law for 2d frustration-free spin systems. - Anurag Anshu; Itai Arad; David Gosset (STOC, 2022)

Quantum complexity of the Kronecker coefficients. - Sergey Bravyi 001; Anirban Chowdhury; David Gosset; Vojtech Havlícek; Guanyu Zhu (CoRR, 2023)

A rapidly mixing Markov chain from any gapped quantum many-body system. - Sergey Bravyi 001; Giuseppe Carleo; David Gosset; Yinchen Liu (Quantum, 2023)

Classical Simulation of Peaked Shallow Quantum Circuits. - Sergey Bravyi 001; David Gosset; Yinchen Liu (STOC, 2024)

Quantum advantage from measurement-induced entanglement in random shallow circuits. - Adam Bene Watts; David Gosset; Yinchen Liu; Mehdi Soleimanifar (CoRR, 2024)

Fast simulation of planar Clifford circuits. - David Gosset; Daniel Grier; Alex Kerzner; Luke Schaeffer (Quantum, 2024)

Triply efficient shadow tomography. - Robbie King; David Gosset; Robin Kothari; Ryan Babbush (SODA, 2025)