Papers › Reducing stabilizer circuits without the symplectic group
Reducing stabilizer circuits without the symplectic group
Marc Bataille
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We start by studying the subgroup structures underlying stabilizer circuits. Then we apply our results to provide two normal forms for stabilizer circuits. These forms are computed by induction using simple conjugation rules in the Clifford group and our algorithms do not rely on a special decomposition in the symplectic group. The first normal form has shape CX-CZ-P-Z-X-H-CZ-P-H, where CX (resp. CZ) denotes a layer of CNOT (resp. controlled-Z) gates, P a layer of phase gates, X (resp. Z) a layer of Pauli-X (resp. Pauli-Z) gates. Then we replace most of the controlled-Z gates by CNOT gates to obtain a second normal form of type P-CX-CZ-CX-Z-X-H-CZ-CX-P-H. In this second form, both controlled-Z layers have depth 1 and together contain therefore at most n controlled-Z gates. We also consider normal forms for stabilizer states and graph states. Finally we carry out a few tests on classical and quantum computers in order to show experimentally the utility of these normal forms to reduce the gate count of a stabilizer circuit.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections