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