Matthew Coudron

ORCID

Publication Activity (10 Years)

Years Active: 2012-2023
Publications (10 Years): 19

Top Venues

CoRR

STOC

TQC

Computational Complexity Conference

Massachusetts Institute of Technology, Cambridge, USA (PHD)

Education History

Massachusetts Institute of Technology, Cambridge, USA

PHD

Publications

Nolan J. Coble, Matthew Coudron, Jon Nelson, Seyed Sajjad Nezhadi
Local Hamiltonians with no low-energy stabilizer states. CoRR (2023)
Andrew M. Childs, Matthew Coudron, Amin Shiraz Gilani
Quantum Algorithms and the Power of Forgetting. ITCS (2023)
Nolan J. Coble, Matthew Coudron, Jon Nelson, Seyed Sajjad Nezhadi
Hamiltonians whose low-energy states require Ω(n) T gates. CoRR (2023)
Atul Singh Arora, Andrea Coladangelo, Matthew Coudron, Alexandru Gheorghiu, Uttam Singh, Hendrik Waldner
Quantum Depth in the Random Oracle Model. STOC (2023)
Nolan J. Coble, Matthew Coudron, Jon Nelson, Seyed Sajjad Nezhadi
Local Hamiltonians with No Low-Energy Stabilizer States. TQC (2023)
Suchetan Dontha, Shi Jie Samuel Tan, Stephen Smith, Sangheon Choi, Matthew Coudron
Approximating Output Probabilities of Shallow Quantum Circuits Which Are Geometrically-Local in Any Fixed Dimension. TQC (2022)
Nolan J. Coble, Matthew Coudron
Quasi-polynomial Time Approximation of Output Probabilities of Geometrically-local, Shallow Quantum Circuits. FOCS (2022)
Suchetan Dontha, Shi Jie Samuel Tan, Stephen Smith, Sangheon Choi, Matthew Coudron
Approximating Output Probabilities of Shallow Quantum Circuits which are Geometrically-local in any Fixed Dimension. CoRR (2022)
Andrew M. Childs, Matthew Coudron, Amin Shiraz Gilani
Quantum algorithms and the power of forgetting. CoRR (2022)
Atul Singh Arora, Andrea Coladangelo, Matthew Coudron, Alexandru Gheorghiu, Uttam Singh, Hendrik Waldner
Quantum Depth in the Random Oracle Model. CoRR (2022)
Nolan J. Coble, Matthew Coudron
Quasi-polynomial Time Approximation of Output Probabilities of Geometrically-local, Shallow Quantum Circuits. FOCS (2021)
Nolan J. Coble, Matthew Coudron
Quasi-polynomial Time Approximation of Output Probabilities of Constant-depth, Geometrically-local Quantum Circuits. CoRR (2020)
Matthew Coudron, Sanketh Menda
Computations with greater quantum depth are strictly more powerful (relative to an oracle). STOC (2020)
Matthew Coudron, William Slofstra
Complexity Lower Bounds for Computing the Approximately-Commuting Operator Value of Non-Local Games to High Precision. Computational Complexity Conference (2019)
Matthew Coudron, Sanketh Menda
Computations with Greater Quantum Depth Are Strictly More Powerful (Relative to an Oracle). CoRR (2019)
Matthew Coudron, William Slofstra
Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision. CoRR (2019)
Matthew Coudron, Aram W. Harrow
Universality of EPR Pairs in Entanglement-Assisted Communication Complexity, and the Communication Cost of State Conversion. Computational Complexity Conference (2019)
Matthew Coudron, Thomas Vidick
Interactive Proofs with Approximately Commuting Provers. ICALP (1) (2015)
Matthew Coudron, Thomas Vidick
Interactive proofs with approximately commuting provers. CoRR (2015)
Matthew Coudron, Henry Yuen
Infinite randomness expansion with a constant number of devices. STOC (2014)
Matthew Coudron, Thomas Vidick, Henry Yuen
Robust Randomness Amplifiers: Upper and Lower Bounds. APPROX-RANDOM (2013)
Matthew Coudron, Gilad Lerman
On the Sample Complexity of Robust PCA. NIPS (2012)

Matthew Coudron.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Matthew Coudron