David Gosset

Orcid: 0000-0003-3975-2253

According to our database1, David Gosset authored at least 27 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Fast simulation of planar Clifford circuits.
Quantum, February, 2024

2023
A rapidly mixing Markov chain from any gapped quantum many-body system.
Quantum, November, 2023

Quantum complexity of the Kronecker coefficients.
CoRR, 2023

2022
An area law for 2d frustration-free spin systems.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2021
Improved upper bounds on the stabilizer rank of magic states.
Quantum, 2021

On the complexity of quantum partition functions.
CoRR, 2021

Improved approximation algorithms for bounded-degree local Hamiltonians.
CoRR, 2021

2020
Beyond Product State Approximations for a Quantum Analogue of Max Cut.
Proceedings of the 15th Conference on the Theory of Quantum Computation, 2020

Entanglement subvolume law for 2d frustration-free spin systems.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

2019
Classical algorithms for quantum mean values.
CoRR, 2019

A Compressed Classical Description of Quantum States.
Proceedings of the 14th Conference on the Theory of Quantum Computation, 2019

Quantum Advantage with Noisy Shallow Circuits in 3D.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2017
Quantum advantage with shallow circuits.
CoRR, 2017

2016
Quantum 3-SAT Is QMA<sub>1</sub>-Complete.
SIAM J. Comput., 2016

Complexity of the XY antiferromagnet at fixed magnetization.
Quantum Inf. Comput., 2016

QCMA hardness of ground space connectivity for commuting Hamiltonians.
CoRR, 2016

Polynomial-time classical simulation of quantum ferromagnets.
CoRR, 2016

2015
The Bose-Hubbard Model is QMA-complete.
Theory Comput., 2015

Momentum switches.
Quantum Inf. Comput., 2015

2014
An algorithm for the T-count.
Quantum Inf. Comput., 2014

2013
Quantum 3-SAT Is QMA1-Complete.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012
Quantum money.
Commun. ACM, 2012

Quantum money from knots.
Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

2011
Unstructured randomness, small gaps and localization.
Quantum Inf. Comput., 2011

Quantum adiabatic algorithms, small gaps, and different paths.
Quantum Inf. Comput., 2011

A Quantum Monte Carlo method at fixed energy.
Comput. Phys. Commun., 2011

2010
Breaking and Making Quantum Money: Toward a New Quantum Cryptographic Protocol.
Proceedings of the Innovations in Computer Science, 2010


  Loading...