Matthew Coudron

Coble, N. ., Coudron, M. ., Nelson, J. ., & Nezhadi, S. . (2023). Hamiltonians whose low-energy states require Ω(n) T gates. ArXiv. Retrieved from https://arxiv.org/abs/2310.01347 (Original work published October 2023)

Coble, N. ., Coudron, M. ., Nelson, J. ., & Nezhadi, S. . (2023). Local Hamiltonians with No Low-Energy Stabilizer States. In 18th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2023). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. http://doi.org/10.4230/LIPICS.TQC.2023.14 (Original work published July 2023)

Childs, A. M., Coudron, M. ., & Gilani, A. . (2023). Quantum Algorithms and the Power of Forgetting. 14th Innovations in Theoretical Computer Science Conference (ITCS 2023), 251, 37:1–37:22. http://doi.org/10.4230/LIPIcs.ITCS.2023.37 (Original work published February 2023)

Arora, A. ., Coladangelo, A. ., Coudron, M. ., Gheorghiu, A. ., Singh, U. ., & Waldner, H. . (2023). Quantum Depth in the Random Oracle Model. In STOC 2023: Proceedings of the 55th Annual ACM Symposium on Theory of Computing (pp. 1111–1124). New York, NY, USA: Association for Computing Machinery. http://doi.org/10.1145/3564246.3585153 (Original work published June 2023)

Dontha, S. ., Tan, S. ., Smith, S. ., Choi, S. ., & Coudron, M. . (2022). Approximating Output Probabilities of Shallow Quantum Circuits Which Are Geometrically-Local in Any Fixed Dimension. In 17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. http://doi.org/10.4230/LIPICS.TQC.2022.9 (Original work published July 2022)

Coudron, M. ., Stark, J. ., & Vidick, T. . (2021). Trading Locality for Time: Certifiable Randomness from Low-Depth Circuits. Communications in Mathematical Physics, 382, 49 – 86. http://doi.org/10.1007/s00220-021-03963-w (Original work published February 2021)

Coble, N. ., & Coudron, M. . (2022). Quasi-polynomial Time Approximation of Output Probabilities of Geometrically-local, Shallow Quantum Circuits. In 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) (pp. 598–609). IEEE. http://doi.org/10.1109/focs52979.2021.00065 (Original work published February 2022)

Coble, N. ., & Coudron, M. . (2020). Quasi-polynomial Time Approximation of Output Probabilities of Constant-depth, Geometrically-local Quantum Circuits. Accepted to QIP 2021. Retrieved from https://arxiv.org/abs/2012.05460 (Original work published December 2020)

Coudron, M. ., & Menda, S. . (2020). Computations with Greater Quantum Depth Are Strictly More Powerful (Relative to an Oracle). Symposium on the Theory of Computing (STOC) 2020 Conference. http://doi.org/10.1145/3357713.3384269 (Original work published April 2020)