You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
A boolean linear transformation on $n$ qubits can be specifed by an $(n \times n)$ binary matrix and implemented with a CNOT circuit. A CNOT circuit is clearly Clifford.
Maybe it'd be nice to have a method like UnitaryTableau.from_parity_matrix or similar for this. Turns out you can construct a Tableau fairly directly by taking the transpose of the parity marix and putting it in the blocks of the Tableau.
A boolean linear transformation on$n$ qubits can be specifed by an $(n \times n)$ binary matrix and implemented with a CNOT circuit. A CNOT circuit is clearly Clifford.
Maybe it'd be nice to have a method like
UnitaryTableau.from_parity_matrix
or similar for this. Turns out you can construct a Tableau fairly directly by taking the transpose of the parity marix and putting it in the blocks of the Tableau.Originally suggested by @willsimmons1465
The text was updated successfully, but these errors were encountered: