BBN Technologies has released v0.1 of Cliffords.jl, a package for efficient calculation of Clifford circuits using the so-called *tableau* representation:
https://github.com/BBN-Q/Cliffords.jl Some background for non-experts: the Pauli operators form a basis for the state-space of N two-level quantum systems (qubits). The operators that transform Pauli eigenstates to Pauli eigenstates are the Clifford group. While insufficient to describe universal quantum computation, the Clifford operators are relevant to a large class of quantum error correction codes. It turns out that one can simulate the action of an arbitrary circuit composed only of Clifford operations in polynomial space and time, a result known as the Gottesman-Knill theorem. The Cliffords.jl package provides a convenient syntax for simulating such Clifford circuits. The functionality of this package compared to other alternatives is a bit limited at the moment. For instance, we currently do not support circuits with measurements. However, Julia allows us to get good performance out of a rather high-level description of the transformation relations.
