Coudron, Matthew

1. Quasi-polynomial time approximation of output probabilities of geometrically-local, shallow quantum circuits
   2020/12/10 by Coble, Nolan J., Coudron, Matthew · 2 citations
   #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Physical sciences #Quantum Physics (quant-ph)
2. Trading locality for time: certifiable randomness from low-depth circuits
   2018/10/09 by Coudron, Matthew, Stark, Jalex, Vidick, Thomas · 1 citation
   #FOS: Physical sciences #Quantum Physics (quant-ph)
3. Approximating Output Probabilities of Shallow Quantum Circuits which are Geometrically-local in any Fixed Dimension
   2022/02/16 by Dontha, Suchetan, Tan, Shi Jie Samuel, Smith, Stephen +2 · 1 citation
   #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Physical sciences #Quantum Physics (quant-ph)
4. Hamiltonians whose low-energy states require Ω(n) T gates
   2023/10/02 by Nolan J. Coble, Coble, Nolan J., Matthew Coudron +5 · 1 citation
   Computer Science · Physics and Astronomy · #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph) #Quantum-Dot Cellular Automata #Surface and Thin Film Phenomena
5. Provably Overwhelming Transformer Models with Designed Inputs
   2025/02/09 by Stambler, Lev, Nezhadi, Seyed Sajjad, Coudron, Matthew · 1 citation
   #Artificial Intelligence (cs.AI) #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Machine Learning (cs.LG)