Metraipolis › archive › dc_133e17b5da76
Pauli Gadget Synthesis for Gatesets with Arbitrary Even Arity Clifford Gates — arXiv:2611.06139
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.06139
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-05T18:32:32.443Z
- SHA-256 of the archived text
d3ece14108f3dcbd3536ae499bb970c7b96b4c739b3130453e10db7ec297ccdf- Stable URL of this page
https://metraipolis.com/documento/dc_133e17b5da76
How to cite
Pauli Gadget Synthesis for Gatesets with Arbitrary Even Arity Clifford Gates — arXiv:2611.06139 — arXiv (en), https://arxiv.org/abs/2611.06139 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_133e17b5da76 (Metraipolis archive dc_133e17b5da76, sha256 d3ece14108f3dcbd3536ae499bb970c7b96b4c739b3130453e10db7ec297ccdf)
BibTeX
@misc{dc133e17b5da76,
title = {Pauli Gadget Synthesis for Gatesets with Arbitrary Even Arity Clifford Gates — arXiv:2611.06139},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.06139},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_133e17b5da76; sha256 d3ece14108f3dcbd3536ae499bb970c7b96b4c739b3130453e10db7ec297ccdf},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.06139. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We propose an algorithm that can synthesize circuits to gate sets consisting of a 2n-arity Clifford gate and arbitrary single qubit rotations. To do this, we represent the circuit as a sequence of Pauli gadgets and jointly synthesize them by placing the multi-qubit Clifford in the synthesized circuit and pushing its adjoint through the remaining gadgets such that some qubits are disconnected from some gadgets. The pushed gadgets are collected in a Clifford tableau, which is decomposed afterwards. With the help of our algorithm we run experiments where we synthesize circuits to varying sizes of target multi-qubit gates. These experiments indicate that increases in gate size can lead to smaller output circuits, and that different connectivity constraints have meaningful differences in how higher arity gates effect the circuit sized. Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.ET, nuovi lavori del giorno). Categorie arXiv: Emerging Technologies (cs.ET). Pagina del lavoro: https://arxiv.org/abs/2611.06139 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-05T18:22:19.071Z dalla pagina https://arxiv.org/list/cs.ET/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).