Matthew Coudron

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