Near-Optimal exact 2-qubit Clifford+CS circuit synthesis with better K-count

This program implements the algorithm in the main theorem from the paper Exact Synthesis of Two-Qubit Clifford+CS Circuits with a Near-Minimal Number of K and CS Gates. Source code is here. Please see the README in the source code for instructions of running this web app. Recall that the Clifford+CS operators are generated by:

Step 1. Input a command

E.g., "./Main -data 0"

E.g., "./Main "((10,[[(1,19),(4,4),(12,-9),(9,18)],[(11,-21),(4,12),(9,6),(4,13)],[(-9,3),(-12,12),(-13,12),(18,3)],[(-3,1),(12,20),(-15,-12),(-10,1)]]))""

For security reasons, there is a limit of 2000 on the size of your input.

Step 2. Click Run button

See Also

Optimal exact 2-qubit Clifford+CS circuit synthesis.

Near-optimal exact 2-qubit Clifford+T circuit synthesis.

Opened on: 05/14/2026. Last edited on: 05/14/2026