default search action
Matthew Coudron
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c12]Andrew M. Childs
, Matthew Coudron, Amin Shiraz Gilani:
Quantum Algorithms and the Power of Forgetting. ITCS 2023: 37:1-37:22 - [c11]Atul Singh Arora, Andrea Coladangelo
Quantum Depth in the Random Oracle Model. STOC 2023: 1111-1124 - [c10]Nolan J. Coble
Local Hamiltonians with No Low-Energy Stabilizer States. TQC 2023: 14:1-14:21 - [i9]Nolan J. Coble, Matthew Coudron, Jon Nelson, Seyed Sajjad Nezhadi:
Local Hamiltonians with no low-energy stabilizer states. CoRR abs/2302.14755 (2023) - [i8]Nolan J. Coble, Matthew Coudron, Jon Nelson, Seyed Sajjad Nezhadi:
Hamiltonians whose low-energy states require Ω(n) T gates. CoRR abs/2310.01347 (2023) - 2022
- [c9]Suchetan Dontha, Shi Jie Samuel Tan
Approximating Output Probabilities of Shallow Quantum Circuits Which Are Geometrically-Local in Any Fixed Dimension. TQC 2022: 9:1-9:17 - [i7]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 abs/2202.08349 (2022) - [i6]Atul Singh Arora, Andrea Coladangelo, Matthew Coudron, Alexandru Gheorghiu, Uttam Singh, Hendrik Waldner:
Quantum Depth in the Random Oracle Model. CoRR abs/2210.06454 (2022) - [i5]Andrew M. Childs, Matthew Coudron, Amin Shiraz Gilani:
Quantum algorithms and the power of forgetting. CoRR abs/2211.12447 (2022) - 2021
- [c8]Nolan J. Coble
Quasi-polynomial Time Approximation of Output Probabilities of Geometrically-local, Shallow Quantum Circuits. FOCS 2021: 598-609 - 2020
- [c7]Matthew Coudron, Sanketh Menda:
Computations with greater quantum depth are strictly more powerful (relative to an oracle). STOC 2020: 889-901 - [i4]Nolan J. Coble, Matthew Coudron:
Quasi-polynomial Time Approximation of Output Probabilities of Constant-depth, Geometrically-local Quantum Circuits. CoRR abs/2012.05460 (2020)
2010 – 2019
- 2019
- [c6]Matthew Coudron
Universality of EPR Pairs in Entanglement-Assisted Communication Complexity, and the Communication Cost of State Conversion. CCC 2019: 20:1-20:25 - [c5]Matthew Coudron
Complexity Lower Bounds for Computing the Approximately-Commuting Operator Value of Non-Local Games to High Precision. CCC 2019: 25:1-25:20 - [i3]Matthew Coudron, William Slofstra:
Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision. CoRR abs/1905.11635 (2019) - [i2]Matthew Coudron, Sanketh Menda:
Computations with Greater Quantum Depth Are Strictly More Powerful (Relative to an Oracle). CoRR abs/1909.10503 (2019) - 2017
- [b1]Matthew Coudron:
Entangled protocols and non-local games for testing quantum systems. Massachusetts Institute of Technology, Cambridge, USA, 2017 - 2015
- [c4]Matthew Coudron, Thomas Vidick
Interactive Proofs with Approximately Commuting Provers. ICALP (1) 2015: 355-366 - [i1]Matthew Coudron, Thomas Vidick:
Interactive proofs with approximately commuting provers. CoRR abs/1510.00102 (2015) - 2014
- [c3]Matthew Coudron, Henry Yuen:
Infinite randomness expansion with a constant number of devices. STOC 2014: 427-436 - 2013
- [c2]Matthew Coudron, Thomas Vidick
Robust Randomness Amplifiers: Upper and Lower Bounds. APPROX-RANDOM 2013: 468-483 - 2012
- [c1]Matthew Coudron, Gilad Lerman:
On the Sample Complexity of Robust PCA. NIPS 2012: 3230-3238
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: