How to efficiently select an arbitrary Clifford group element

9 Jun 2014 Robert Koenig John A. Smolin

We give an algorithm which produces a unique element of the Clifford group C_n on n qubits from an integer 0\le i < |C_n| (the number of elements in the group). The algorithm involves O(n^3) operations... (read more)

PDF Abstract
No code implementations yet. Submit your code now


Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

Methods used in the Paper

🤖 No Methods Found Help the community by adding them if they're not listed; e.g. Deep Residual Learning for Image Recognition uses ResNet