Published in: LIPIcs, Volume 287, 15th Innovations in Theoretical Computer Science Conference (ITCS 2024)
Roozbeh Bassirian, Bill Fefferman, and Kunal Marwaha. Quantum Merlin-Arthur and Proofs Without Relative Phase. In 15th Innovations in Theoretical Computer Science Conference (ITCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 287, pp. 9:1-9:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{bassirian_et_al:LIPIcs.ITCS.2024.9, author = {Bassirian, Roozbeh and Fefferman, Bill and Marwaha, Kunal}, title = {{Quantum Merlin-Arthur and Proofs Without Relative Phase}}, booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)}, pages = {9:1--9:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-309-6}, ISSN = {1868-8969}, year = {2024}, volume = {287}, editor = {Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.9}, URN = {urn:nbn:de:0030-drops-195370}, doi = {10.4230/LIPIcs.ITCS.2024.9}, annote = {Keywords: quantum complexity, QMA(2), PCPs} }
Published in: LIPIcs, Volume 275, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)
Fernando Granha Jeronimo. Fast Decoding of Explicit Almost Optimal ε-Balanced q-Ary Codes And Fast Approximation of Expanding k-CSPs. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 275, pp. 60:1-60:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{jeronimo:LIPIcs.APPROX/RANDOM.2023.60, author = {Jeronimo, Fernando Granha}, title = {{Fast Decoding of Explicit Almost Optimal \epsilon-Balanced q-Ary Codes And Fast Approximation of Expanding k-CSPs}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)}, pages = {60:1--60:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-296-9}, ISSN = {1868-8969}, year = {2023}, volume = {275}, editor = {Megow, Nicole and Smith, Adam}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.60}, URN = {urn:nbn:de:0030-drops-188858}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.60}, annote = {Keywords: Decoding, Approximation, GV bound, CSPs, HDXs, Regularity} }
Published in: LIPIcs, Volume 251, 14th Innovations in Theoretical Computer Science Conference (ITCS 2023)
Leonardo Nagami Coregliano, Fernando Granha Jeronimo, and Chris Jones. Exact Completeness of LP Hierarchies for Linear Codes. In 14th Innovations in Theoretical Computer Science Conference (ITCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 251, pp. 40:1-40:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{coregliano_et_al:LIPIcs.ITCS.2023.40, author = {Coregliano, Leonardo Nagami and Jeronimo, Fernando Granha and Jones, Chris}, title = {{Exact Completeness of LP Hierarchies for Linear Codes}}, booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)}, pages = {40:1--40:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-263-1}, ISSN = {1868-8969}, year = {2023}, volume = {251}, editor = {Tauman Kalai, Yael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.40}, URN = {urn:nbn:de:0030-drops-175433}, doi = {10.4230/LIPIcs.ITCS.2023.40}, annote = {Keywords: LP bound, linear codes, Delsarte’s LP, combinatorial polytopes, pseudoexpectation} }
Published in: LIPIcs, Volume 215, 13th Innovations in Theoretical Computer Science Conference (ITCS 2022)
Leonardo Nagami Coregliano, Fernando Granha Jeronimo, and Chris Jones. A Complete Linear Programming Hierarchy for Linear Codes. In 13th Innovations in Theoretical Computer Science Conference (ITCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 215, pp. 51:1-51:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{coregliano_et_al:LIPIcs.ITCS.2022.51, author = {Coregliano, Leonardo Nagami and Jeronimo, Fernando Granha and Jones, Chris}, title = {{A Complete Linear Programming Hierarchy for Linear Codes}}, booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)}, pages = {51:1--51:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-217-4}, ISSN = {1868-8969}, year = {2022}, volume = {215}, editor = {Braverman, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.51}, URN = {urn:nbn:de:0030-drops-156474}, doi = {10.4230/LIPIcs.ITCS.2022.51}, annote = {Keywords: Coding theory, code bounds, convex programming, linear programming hierarchy} }
Published in: LIPIcs, Volume 215, 13th Innovations in Theoretical Computer Science Conference (ITCS 2022)
Fernando Granha Jeronimo, Tushant Mittal, Ryan O'Donnell, Pedro Paredes, and Madhur Tulsiani. Explicit Abelian Lifts and Quantum LDPC Codes. In 13th Innovations in Theoretical Computer Science Conference (ITCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 215, pp. 88:1-88:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{jeronimo_et_al:LIPIcs.ITCS.2022.88, author = {Jeronimo, Fernando Granha and Mittal, Tushant and O'Donnell, Ryan and Paredes, Pedro and Tulsiani, Madhur}, title = {{Explicit Abelian Lifts and Quantum LDPC Codes}}, booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)}, pages = {88:1--88:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-217-4}, ISSN = {1868-8969}, year = {2022}, volume = {215}, editor = {Braverman, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.88}, URN = {urn:nbn:de:0030-drops-156846}, doi = {10.4230/LIPIcs.ITCS.2022.88}, annote = {Keywords: Graph lifts, expander graphs, quasi-cyclic LDPC codes, quantum LDPC codes} }
Published in: LIPIcs, Volume 215, 13th Innovations in Theoretical Computer Science Conference (ITCS 2022)
Chris Jones and Aaron Potechin. Almost-Orthogonal Bases for Inner Product Polynomials. In 13th Innovations in Theoretical Computer Science Conference (ITCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 215, pp. 89:1-89:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{jones_et_al:LIPIcs.ITCS.2022.89, author = {Jones, Chris and Potechin, Aaron}, title = {{Almost-Orthogonal Bases for Inner Product Polynomials}}, booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)}, pages = {89:1--89:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-217-4}, ISSN = {1868-8969}, year = {2022}, volume = {215}, editor = {Braverman, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.89}, URN = {urn:nbn:de:0030-drops-156853}, doi = {10.4230/LIPIcs.ITCS.2022.89}, annote = {Keywords: Orthogonal polynomials, Fourier analysis, combinatorics} }
Feedback for Dagstuhl Publishing