Crossref
Pauli Gadget Synthesis for Gatesets with Arbitrary Even Arity Clifford Gates
Electronic Proceedings in Theoretical Computer Science · 03.11.2026 · 456 · 18-39
DOI: 10.4204/eptcs.456.2 ↗Kurz gefasst
Fachartikel in der Zeitschrift Electronic Proceedings in Theoretical Computer Science, online erschienen am 03.11.2026. Verfasst von Leo Becker und 1 weiteren Autor:innen.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Becker, L., & Griend, A. M. V. D. (2026). Pauli Gadget Synthesis for Gatesets with Arbitrary Even Arity Clifford Gates. Electronic Proceedings in Theoretical Computer Science, 456, 18-39. https://doi.org/10.4204/eptcs.456.2
Vancouver
Becker L, Griend AMVD. Pauli Gadget Synthesis for Gatesets with Arbitrary Even Arity Clifford Gates. Electronic Proceedings in Theoretical Computer Science. 2026;456:18-39. doi:10.4204/eptcs.456.2
BibTeX
@article{Becker2026,
author = {Becker, Leo and Griend, Arianne Meijer - van de},
title = {Pauli Gadget Synthesis for Gatesets with Arbitrary Even Arity Clifford Gates},
journal = {Electronic Proceedings in Theoretical Computer Science},
year = {2026},
volume = {456},
pages = {18--39},
doi = {10.4204/eptcs.456.2}
}
EUVIMED