Matthew Coudron

Orcid: 0000-0002-3296-4723

According to our database1, Matthew Coudron authored at least 15 papers between 2012 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Hamiltonians whose low-energy states require Ω(n) T gates.
CoRR, 2023

Local Hamiltonians with No Low-Energy Stabilizer States.
Proceedings of the 18th Conference on the Theory of Quantum Computation, 2023

Quantum Depth in the Random Oracle Model.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Quantum Algorithms and the Power of Forgetting.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022
Approximating Output Probabilities of Shallow Quantum Circuits Which Are Geometrically-Local in Any Fixed Dimension.
Proceedings of the 17th Conference on the Theory of Quantum Computation, 2022

2021
Quasi-polynomial Time Approximation of Output Probabilities of Geometrically-local, Shallow Quantum Circuits.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
Quasi-polynomial Time Approximation of Output Probabilities of Constant-depth, Geometrically-local Quantum Circuits.
CoRR, 2020

Computations with greater quantum depth are strictly more powerful (relative to an oracle).
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

2019
Complexity Lower Bounds for Computing the Approximately-Commuting Operator Value of Non-Local Games to High Precision.
Proceedings of the 34th Computational Complexity Conference, 2019

Universality of EPR Pairs in Entanglement-Assisted Communication Complexity, and the Communication Cost of State Conversion.
Proceedings of the 34th Computational Complexity Conference, 2019

2017
Entangled protocols and non-local games for testing quantum systems.
PhD thesis, 2017

2015
Interactive Proofs with Approximately Commuting Provers.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014
Infinite randomness expansion with a constant number of devices.
Proceedings of the Symposium on Theory of Computing, 2014

2013
Robust Randomness Amplifiers: Upper and Lower Bounds.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012
On the Sample Complexity of Robust PCA.
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012


  Loading...