List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|
| Quasi-polynomial time approximation of output probabilities of geometrically-local, shallow quantum circuits | 2025-08-13 | Paper |
| Local Hamiltonians with no low-energy stabilizer states | 2024-11-20 | Paper |
| Quantum algorithms and the power of forgetting | 2024-09-25 | Paper |
| Approximating output probabilities of shallow quantum circuits which are geometrically-local in any fixed dimension | 2024-06-27 | Paper |
| Quantum depth in the random oracle model | 2024-05-08 | Paper |
Universality of EPR pairs in entanglement-assisted communication complexity, and the communication cost of state conversion
(available as arXiv preprint) | 2022-07-27 | Paper |
Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision
(available as arXiv preprint) | 2022-07-27 | Paper |
Trading locality for time: certifiable randomness from low-depth circuits
Communications in Mathematical Physics | 2021-04-08 | Paper |
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 | 2021-01-19 | Paper |
Interactive proofs with approximately commuting provers
Automata, Languages, and Programming | 2015-10-27 | Paper |
Interactive proofs with approximately commuting provers
Automata, Languages, and Programming | 2015-10-27 | Paper |
Infinite randomness expansion with a constant number of devices
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Robust randomness amplifiers: upper and lower bounds
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
Robust randomness amplifiers: upper and lower bounds
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
| Unfrustration Condition and Degeneracy of Qudits on Trees | 2012-09-19 | Paper |
Research outcomes over time
This page was built for person: Matthew Coudron
