Published in: LIPIcs, Volume 232, 17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022)
Aleks Kissinger, John van de Wetering, and Renaud Vilmart. Classical Simulation of Quantum Circuits with Partial and Graphical Stabiliser Decompositions. In 17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 232, pp. 5:1-5:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{kissinger_et_al:LIPIcs.TQC.2022.5, author = {Kissinger, Aleks and van de Wetering, John and Vilmart, Renaud}, title = {{Classical Simulation of Quantum Circuits with Partial and Graphical Stabiliser Decompositions}}, booktitle = {17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022)}, pages = {5:1--5:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-237-2}, ISSN = {1868-8969}, year = {2022}, volume = {232}, editor = {Le Gall, Fran\c{c}ois and Morimae, Tomoyuki}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2022.5}, URN = {urn:nbn:de:0030-drops-165128}, doi = {10.4230/LIPIcs.TQC.2022.5}, annote = {Keywords: ZX-calculus, Stabiliser Rank, Quantum Simulation} }
Published in: LIPIcs, Volume 232, 17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022)
Andrew N. Glaudell, Neil J. Ross, John van de Wetering, and Lia Yeh. Qutrit Metaplectic Gates Are a Subset of Clifford+T. In 17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 232, pp. 12:1-12:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{glaudell_et_al:LIPIcs.TQC.2022.12, author = {Glaudell, Andrew N. and Ross, Neil J. and van de Wetering, John and Yeh, Lia}, title = {{Qutrit Metaplectic Gates Are a Subset of Clifford+T}}, booktitle = {17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022)}, pages = {12:1--12:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-237-2}, ISSN = {1868-8969}, year = {2022}, volume = {232}, editor = {Le Gall, Fran\c{c}ois and Morimae, Tomoyuki}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2022.12}, URN = {urn:nbn:de:0030-drops-165195}, doi = {10.4230/LIPIcs.TQC.2022.12}, annote = {Keywords: Quantum computation, qutrits, gate synthesis, metaplectic gate, Clifford+T} }
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.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.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} }
Feedback for Dagstuhl Publishing