This program implements the algorithm 1 from the paper Fast exact synthesis of two-qubit unitaries using a near-minimum number of T gates. Since it is not easy to input a matrix, here you can input a 2-qubit Cliffortd+T circuit, and the program first computes the matrix and then re-synthesizes a circuit, which equals the input upto a global phase. We use the following Clifford+T gates:
Finding MA normal forms for single qubit operators.
![]() |
Opened on: 07/02/2025. Last edited on: 07/03/2025 |
|