Published in: LIPIcs, Volume 229, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)
Niel de Beaudrap, Aleks Kissinger, and John van de Wetering. Circuit Extraction for ZX-Diagrams Can Be #P-Hard. In 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 229, pp. 119:1-119:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{debeaudrap_et_al:LIPIcs.ICALP.2022.119, author = {de Beaudrap, Niel and Kissinger, Aleks and van de Wetering, John}, title = {{Circuit Extraction for ZX-Diagrams Can Be #P-Hard}}, booktitle = {49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)}, pages = {119:1--119:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-235-8}, ISSN = {1868-8969}, year = {2022}, volume = {229}, editor = {Boja\'{n}czyk, Miko{\l}aj and Merelli, Emanuela and Woodruff, David P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.119}, URN = {urn:nbn:de:0030-drops-164601}, doi = {10.4230/LIPIcs.ICALP.2022.119}, annote = {Keywords: ZX-calculus, circuit extraction, quantum circuits, #P} }
Published in: LIPIcs, Volume 158, 15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020)
Niel de Beaudrap, Xiaoning Bian, and Quanlong Wang. Fast and Effective Techniques for T-Count Reduction via Spider Nest Identities. In 15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 158, pp. 11:1-11:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{debeaudrap_et_al:LIPIcs.TQC.2020.11, author = {de Beaudrap, Niel and Bian, Xiaoning and Wang, Quanlong}, title = {{Fast and Effective Techniques for T-Count Reduction via Spider Nest Identities}}, booktitle = {15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020)}, pages = {11:1--11:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-146-7}, ISSN = {1868-8969}, year = {2020}, volume = {158}, editor = {Flammia, Steven T.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2020.11}, URN = {urn:nbn:de:0030-drops-120705}, doi = {10.4230/LIPIcs.TQC.2020.11}, annote = {Keywords: T-count, Parity-phase operations, Phase gadgets, Clifford hierarchy, ZX calculus} }
Published in: LIPIcs, Volume 117, 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)
Marco Aldi, Niel de Beaudrap, Sevag Gharibian, and Seyran Saeedi. On Efficiently Solvable Cases of Quantum k-SAT. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 38:1-38:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{aldi_et_al:LIPIcs.MFCS.2018.38, author = {Aldi, Marco and de Beaudrap, Niel and Gharibian, Sevag and Saeedi, Seyran}, title = {{On Efficiently Solvable Cases of Quantum k-SAT}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {38:1--38:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.38}, URN = {urn:nbn:de:0030-drops-96201}, doi = {10.4230/LIPIcs.MFCS.2018.38}, annote = {Keywords: search complexity, local Hamiltonian, Quantum SAT, algebraic geometry} }
Published in: LIPIcs, Volume 50, 31st Conference on Computational Complexity (CCC 2016)
Niel de Beaudrap and Sevag Gharibian. A Linear Time Algorithm for Quantum 2-SAT. In 31st Conference on Computational Complexity (CCC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 50, pp. 27:1-27:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{debeaudrap_et_al:LIPIcs.CCC.2016.27, author = {de Beaudrap, Niel and Gharibian, Sevag}, title = {{A Linear Time Algorithm for Quantum 2-SAT}}, booktitle = {31st Conference on Computational Complexity (CCC 2016)}, pages = {27:1--27:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-008-8}, ISSN = {1868-8969}, year = {2016}, volume = {50}, editor = {Raz, Ran}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.27}, URN = {urn:nbn:de:0030-drops-58363}, doi = {10.4230/LIPIcs.CCC.2016.27}, annote = {Keywords: quantum 2-SAT, transfer matrix, strongly connected components, limited backtracking, local Hamiltonian} }
Published in: LIPIcs, Volume 27, 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014)
Niel de Beaudrap. Difficult Instances of the Counting Problem for 2-quantum-SAT are Very Atypical. In 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 27, pp. 118-140, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@InProceedings{debeaudrap:LIPIcs.TQC.2014.118, author = {de Beaudrap, Niel}, title = {{Difficult Instances of the Counting Problem for 2-quantum-SAT are Very Atypical}}, booktitle = {9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014)}, pages = {118--140}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-73-6}, ISSN = {1868-8969}, year = {2014}, volume = {27}, editor = {Flammia, Steven T. and Harrow, Aram W.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2014.118}, URN = {urn:nbn:de:0030-drops-48129}, doi = {10.4230/LIPIcs.TQC.2014.118}, annote = {Keywords: Frustration-free, Hamiltonian, quantum, counting, satisfiability} }
Published in: LIPIcs, Volume 27, 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014)
Niel de Beaudrap and Martin Roetteler. Quantum Linear Network Coding as One-way Quantum Computation. In 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 27, pp. 217-233, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@InProceedings{debeaudrap_et_al:LIPIcs.TQC.2014.217, author = {de Beaudrap, Niel and Roetteler, Martin}, title = {{Quantum Linear Network Coding as One-way Quantum Computation}}, booktitle = {9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014)}, pages = {217--233}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-73-6}, ISSN = {1868-8969}, year = {2014}, volume = {27}, editor = {Flammia, Steven T. and Harrow, Aram W.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2014.217}, URN = {urn:nbn:de:0030-drops-48189}, doi = {10.4230/LIPIcs.TQC.2014.217}, annote = {Keywords: Network coding, quantum computing, measurement-based computation, simulation} }
Feedback for Dagstuhl Publishing