Published in: LIPIcs, Volume 323, 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)
Arjan Cornelissen, Nikhil S. Mande, and Subhasree Patro. Quantum Sabotage Complexity. In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 19:1-19:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{cornelissen_et_al:LIPIcs.FSTTCS.2024.19, author = {Cornelissen, Arjan and Mande, Nikhil S. and Patro, Subhasree}, title = {{Quantum Sabotage Complexity}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {19:1--19:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.19}, URN = {urn:nbn:de:0030-drops-222082}, doi = {10.4230/LIPIcs.FSTTCS.2024.19}, annote = {Keywords: Sabotage complexity, quantum query complexity, Boolean functions, fractional block sensitivity} }
Published in: LIPIcs, Volume 266, 18th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2023)
Sofiene Jerbi, Arjan Cornelissen, Maris Ozols, and Vedran Dunjko. Quantum Policy Gradient Algorithms. In 18th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 266, pp. 13:1-13:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{jerbi_et_al:LIPIcs.TQC.2023.13, author = {Jerbi, Sofiene and Cornelissen, Arjan and Ozols, Maris and Dunjko, Vedran}, title = {{Quantum Policy Gradient Algorithms}}, booktitle = {18th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2023)}, pages = {13:1--13:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-283-9}, ISSN = {1868-8969}, year = {2023}, volume = {266}, editor = {Fawzi, Omar and Walter, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2023.13}, URN = {urn:nbn:de:0030-drops-183230}, doi = {10.4230/LIPIcs.TQC.2023.13}, annote = {Keywords: quantum reinforcement learning, policy gradient methods, parametrized quantum circuits} }
Published in: LIPIcs, Volume 250, 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)
Arjan Cornelissen, Nikhil S. Mande, and Subhasree Patro. Improved Quantum Query Upper Bounds Based on Classical Decision Trees. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 15:1-15:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{cornelissen_et_al:LIPIcs.FSTTCS.2022.15, author = {Cornelissen, Arjan and Mande, Nikhil S. and Patro, Subhasree}, title = {{Improved Quantum Query Upper Bounds Based on Classical Decision Trees}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {15:1--15:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.15}, URN = {urn:nbn:de:0030-drops-174071}, doi = {10.4230/LIPIcs.FSTTCS.2022.15}, annote = {Keywords: Quantum Query Complexity, Decision Trees, Decision Tree Rank} }
Published in: LIPIcs, Volume 170, 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)
Arjan Cornelissen, Stacey Jeffery, Maris Ozols, and Alvaro Piedrafita. Span Programs and Quantum Time Complexity. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 26:1-26:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{cornelissen_et_al:LIPIcs.MFCS.2020.26, author = {Cornelissen, Arjan and Jeffery, Stacey and Ozols, Maris and Piedrafita, Alvaro}, title = {{Span Programs and Quantum Time Complexity}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {26:1--26:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.26}, URN = {urn:nbn:de:0030-drops-126947}, doi = {10.4230/LIPIcs.MFCS.2020.26}, annote = {Keywords: quantum query algorithms, span programs, variable-time quantum search} }
Feedback for Dagstuhl Publishing