BibTeX records: Matthew Coudron

download as .bib file

@inproceedings{DBLP:conf/innovations/ChildsCG23,
  author       = {Andrew M. Childs and
                  Matthew Coudron and
                  Amin Shiraz Gilani},
  editor       = {Yael Tauman Kalai},
  title        = {Quantum Algorithms and the Power of Forgetting},
  booktitle    = {14th Innovations in Theoretical Computer Science Conference, {ITCS}
                  2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, {USA}},
  series       = {LIPIcs},
  volume       = {251},
  pages        = {37:1--37:22},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2023},
  url          = {https://doi.org/10.4230/LIPIcs.ITCS.2023.37},
  doi          = {10.4230/LIPICS.ITCS.2023.37},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/innovations/ChildsCG23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AroraCCGSW23,
  author       = {Atul Singh Arora and
                  Andrea Coladangelo and
                  Matthew Coudron and
                  Alexandru Gheorghiu and
                  Uttam Singh and
                  Hendrik Waldner},
  editor       = {Barna Saha and
                  Rocco A. Servedio},
  title        = {Quantum Depth in the Random Oracle Model},
  booktitle    = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
                  {STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
  pages        = {1111--1124},
  publisher    = {{ACM}},
  year         = {2023},
  url          = {https://doi.org/10.1145/3564246.3585153},
  doi          = {10.1145/3564246.3585153},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/AroraCCGSW23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tqc/CobleCNN23,
  author       = {Nolan J. Coble and
                  Matthew Coudron and
                  Jon Nelson and
                  Seyed Sajjad Nezhadi},
  editor       = {Omar Fawzi and
                  Michael Walter},
  title        = {Local Hamiltonians with No Low-Energy Stabilizer States},
  booktitle    = {18th Conference on the Theory of Quantum Computation, Communication
                  and Cryptography, {TQC} 2023, July 24-28, 2023, Aveiro, Portugal},
  series       = {LIPIcs},
  volume       = {266},
  pages        = {14:1--14:21},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2023},
  url          = {https://doi.org/10.4230/LIPIcs.TQC.2023.14},
  doi          = {10.4230/LIPICS.TQC.2023.14},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/tqc/CobleCNN23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-14755,
  author       = {Nolan J. Coble and
                  Matthew Coudron and
                  Jon Nelson and
                  Seyed Sajjad Nezhadi},
  title        = {Local Hamiltonians with no low-energy stabilizer states},
  journal      = {CoRR},
  volume       = {abs/2302.14755},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2302.14755},
  doi          = {10.48550/ARXIV.2302.14755},
  eprinttype    = {arXiv},
  eprint       = {2302.14755},
  timestamp    = {Thu, 02 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2302-14755.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-01347,
  author       = {Nolan J. Coble and
                  Matthew Coudron and
                  Jon Nelson and
                  Seyed Sajjad Nezhadi},
  title        = {Hamiltonians whose low-energy states require {\(\Omega\)}(n) {T} gates},
  journal      = {CoRR},
  volume       = {abs/2310.01347},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2310.01347},
  doi          = {10.48550/ARXIV.2310.01347},
  eprinttype    = {arXiv},
  eprint       = {2310.01347},
  timestamp    = {Thu, 26 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2310-01347.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tqc/DonthaTSCC22,
  author       = {Suchetan Dontha and
                  Shi Jie Samuel Tan and
                  Stephen Smith and
                  Sangheon Choi and
                  Matthew Coudron},
  editor       = {Fran{\c{c}}ois Le Gall and
                  Tomoyuki Morimae},
  title        = {Approximating Output Probabilities of Shallow Quantum Circuits Which
                  Are Geometrically-Local in Any Fixed Dimension},
  booktitle    = {17th Conference on the Theory of Quantum Computation, Communication
                  and Cryptography, {TQC} 2022, July 11-15, 2022, Urbana Champaign,
                  Illinois, {USA}},
  series       = {LIPIcs},
  volume       = {232},
  pages        = {9:1--9:17},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2022},
  url          = {https://doi.org/10.4230/LIPIcs.TQC.2022.9},
  doi          = {10.4230/LIPICS.TQC.2022.9},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/tqc/DonthaTSCC22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-08349,
  author       = {Suchetan Dontha and
                  Shi Jie Samuel Tan and
                  Stephen Smith and
                  Sangheon Choi and
                  Matthew Coudron},
  title        = {Approximating Output Probabilities of Shallow Quantum Circuits which
                  are Geometrically-local in any Fixed Dimension},
  journal      = {CoRR},
  volume       = {abs/2202.08349},
  year         = {2022},
  url          = {https://arxiv.org/abs/2202.08349},
  eprinttype    = {arXiv},
  eprint       = {2202.08349},
  timestamp    = {Tue, 01 Mar 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2202-08349.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-06454,
  author       = {Atul Singh Arora and
                  Andrea Coladangelo and
                  Matthew Coudron and
                  Alexandru Gheorghiu and
                  Uttam Singh and
                  Hendrik Waldner},
  title        = {Quantum Depth in the Random Oracle Model},
  journal      = {CoRR},
  volume       = {abs/2210.06454},
  year         = {2022},
  url          = {https://doi.org/10.48550/arXiv.2210.06454},
  doi          = {10.48550/ARXIV.2210.06454},
  eprinttype    = {arXiv},
  eprint       = {2210.06454},
  timestamp    = {Wed, 19 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2210-06454.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-12447,
  author       = {Andrew M. Childs and
                  Matthew Coudron and
                  Amin Shiraz Gilani},
  title        = {Quantum algorithms and the power of forgetting},
  journal      = {CoRR},
  volume       = {abs/2211.12447},
  year         = {2022},
  url          = {https://doi.org/10.48550/arXiv.2211.12447},
  doi          = {10.48550/ARXIV.2211.12447},
  eprinttype    = {arXiv},
  eprint       = {2211.12447},
  timestamp    = {Thu, 24 Nov 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2211-12447.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CobleC21,
  author       = {Nolan J. Coble and
                  Matthew Coudron},
  title        = {Quasi-polynomial Time Approximation of Output Probabilities of Geometrically-local,
                  Shallow Quantum Circuits},
  booktitle    = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
                  2021, Denver, CO, USA, February 7-10, 2022},
  pages        = {598--609},
  publisher    = {{IEEE}},
  year         = {2021},
  url          = {https://doi.org/10.1109/FOCS52979.2021.00065},
  doi          = {10.1109/FOCS52979.2021.00065},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/focs/CobleC21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CoudronM20,
  author       = {Matthew Coudron and
                  Sanketh Menda},
  editor       = {Konstantin Makarychev and
                  Yury Makarychev and
                  Madhur Tulsiani and
                  Gautam Kamath and
                  Julia Chuzhoy},
  title        = {Computations with greater quantum depth are strictly more powerful
                  (relative to an oracle)},
  booktitle    = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
                  of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
  pages        = {889--901},
  publisher    = {{ACM}},
  year         = {2020},
  url          = {https://doi.org/10.1145/3357713.3384269},
  doi          = {10.1145/3357713.3384269},
  timestamp    = {Mon, 18 Dec 2023 07:33:37 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/CoudronM20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-05460,
  author       = {Nolan J. Coble and
                  Matthew Coudron},
  title        = {Quasi-polynomial Time Approximation of Output Probabilities of Constant-depth,
                  Geometrically-local Quantum Circuits},
  journal      = {CoRR},
  volume       = {abs/2012.05460},
  year         = {2020},
  url          = {https://arxiv.org/abs/2012.05460},
  eprinttype    = {arXiv},
  eprint       = {2012.05460},
  timestamp    = {Tue, 05 Jan 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2012-05460.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CoudronH19,
  author       = {Matthew Coudron and
                  Aram W. Harrow},
  editor       = {Amir Shpilka},
  title        = {Universality of {EPR} Pairs in Entanglement-Assisted Communication
                  Complexity, and the Communication Cost of State Conversion},
  booktitle    = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
                  2019, New Brunswick, NJ, {USA}},
  series       = {LIPIcs},
  volume       = {137},
  pages        = {20:1--20:25},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2019.20},
  doi          = {10.4230/LIPICS.CCC.2019.20},
  timestamp    = {Thu, 02 Feb 2023 13:27:04 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/CoudronH19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CoudronS19,
  author       = {Matthew Coudron and
                  William Slofstra},
  editor       = {Amir Shpilka},
  title        = {Complexity Lower Bounds for Computing the Approximately-Commuting
                  Operator Value of Non-Local Games to High Precision},
  booktitle    = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
                  2019, New Brunswick, NJ, {USA}},
  series       = {LIPIcs},
  volume       = {137},
  pages        = {25:1--25:20},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2019.25},
  doi          = {10.4230/LIPICS.CCC.2019.25},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/CoudronS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-11635,
  author       = {Matthew Coudron and
                  William Slofstra},
  title        = {Complexity lower bounds for computing the approximately-commuting
                  operator value of non-local games to high precision},
  journal      = {CoRR},
  volume       = {abs/1905.11635},
  year         = {2019},
  url          = {http://arxiv.org/abs/1905.11635},
  eprinttype    = {arXiv},
  eprint       = {1905.11635},
  timestamp    = {Mon, 03 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1905-11635.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-10503,
  author       = {Matthew Coudron and
                  Sanketh Menda},
  title        = {Computations with Greater Quantum Depth Are Strictly More Powerful
                  (Relative to an Oracle)},
  journal      = {CoRR},
  volume       = {abs/1909.10503},
  year         = {2019},
  url          = {http://arxiv.org/abs/1909.10503},
  eprinttype    = {arXiv},
  eprint       = {1909.10503},
  timestamp    = {Fri, 27 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1909-10503.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/ndltd/Coudron17,
  author       = {Matthew Coudron},
  title        = {Entangled protocols and non-local games for testing quantum systems},
  school       = {Massachusetts Institute of Technology, Cambridge, {USA}},
  year         = {2017},
  url          = {https://hdl.handle.net/1721.1/111879},
  timestamp    = {Wed, 04 May 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/phd/ndltd/Coudron17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/CoudronV15,
  author       = {Matthew Coudron and
                  Thomas Vidick},
  editor       = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
                  Kazuo Iwama and
                  Naoki Kobayashi and
                  Bettina Speckmann},
  title        = {Interactive Proofs with Approximately Commuting Provers},
  booktitle    = {Automata, Languages, and Programming - 42nd International Colloquium,
                  {ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {9134},
  pages        = {355--366},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-662-47672-7\_29},
  doi          = {10.1007/978-3-662-47672-7\_29},
  timestamp    = {Fri, 27 Mar 2020 09:02:59 +0100},
  biburl       = {https://dblp.org/rec/conf/icalp/CoudronV15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CoudronV15,
  author       = {Matthew Coudron and
                  Thomas Vidick},
  title        = {Interactive proofs with approximately commuting provers},
  journal      = {CoRR},
  volume       = {abs/1510.00102},
  year         = {2015},
  url          = {http://arxiv.org/abs/1510.00102},
  eprinttype    = {arXiv},
  eprint       = {1510.00102},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/CoudronV15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CoudronY14,
  author       = {Matthew Coudron and
                  Henry Yuen},
  editor       = {David B. Shmoys},
  title        = {Infinite randomness expansion with a constant number of devices},
  booktitle    = {Symposium on Theory of Computing, {STOC} 2014, New York, NY, USA,
                  May 31 - June 03, 2014},
  pages        = {427--436},
  publisher    = {{ACM}},
  year         = {2014},
  url          = {https://doi.org/10.1145/2591796.2591873},
  doi          = {10.1145/2591796.2591873},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/CoudronY14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/CoudronVY13,
  author       = {Matthew Coudron and
                  Thomas Vidick and
                  Henry Yuen},
  editor       = {Prasad Raghavendra and
                  Sofya Raskhodnikova and
                  Klaus Jansen and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Robust Randomness Amplifiers: Upper and Lower Bounds},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 16th International Workshop, {APPROX} 2013, and 17th
                  International Workshop, {RANDOM} 2013, Berkeley, CA, USA, August 21-23,
                  2013. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8096},
  pages        = {468--483},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-40328-6\_33},
  doi          = {10.1007/978-3-642-40328-6\_33},
  timestamp    = {Tue, 21 Sep 2021 09:36:24 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/CoudronVY13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/CoudronL12,
  author       = {Matthew Coudron and
                  Gilad Lerman},
  editor       = {Peter L. Bartlett and
                  Fernando C. N. Pereira and
                  Christopher J. C. Burges and
                  L{\'{e}}on Bottou and
                  Kilian Q. Weinberger},
  title        = {On the Sample Complexity of Robust {PCA}},
  booktitle    = {Advances in Neural Information Processing Systems 25: 26th Annual
                  Conference on Neural Information Processing Systems 2012. Proceedings
                  of a meeting held December 3-6, 2012, Lake Tahoe, Nevada, United States},
  pages        = {3230--3238},
  year         = {2012},
  url          = {https://proceedings.neurips.cc/paper/2012/hash/78b9cab19959e4af8ff46156ee460c74-Abstract.html},
  timestamp    = {Mon, 16 May 2022 15:41:51 +0200},
  biburl       = {https://dblp.org/rec/conf/nips/CoudronL12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics