Pauli Gadget Synthesis for Gatesets with Arbitrary Even Arity Clifford Gates

Abstract

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.

arXiv commentIn Proceedings QPL 2026, arXiv:2611.04069

References in corpus (7)

• Improved Simulation of Stabilizer Circuits
• A quantum information processor with trapped ions
• Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning
• Phase Gadget Synthesis for Shallow Circuits
• A programmable three-qubit superconducting processor with all-to-all connectivity
• A Generic Compilation Strategy for the Unitary Coupled Cluster Ansatz
• Faster and shorter synthesis of Hamiltonian simulation circuits