Reproduce “Pauli Gadget Synthesis for Gatesets with Arbitrary Even Arity Clifford Gates” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Leo Becker, Arianne Meijer - van de Griend
The authors develop a compiler that uses fixed-arity even-qubit Clifford gates to reshape Pauli gadgets and reduce their support. Randomized tests show that larger native gates generally reduce output multi-qubit gate counts, with gains depending on connectivity. In one molecular run, counts fall from 2,828 at arity 2 to 1,436 at arity 4; this is not a hardware speedup.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.