1. Salman Beigi and Peter W. Shor. $\mathcal{C}_3$, semi-Clifford and generalized semi-Clifford operations. Quantum Info. Comput., 10 (1): 41–59, January 2010. URL http://arxiv.org/abs/0810.5108.
2. P. Oscar Boykin, Tal Mor, Matthew Pulver, Vwani Roychowdhury, and Farrokh Vatan. On universal and fault-tolerant quantum computing: A novel basis and a new constructive proof of universality for Shor's basis. page 486, USA, 1999. IEEE Computer Society. https://doi.org/10.1109/SFFCS.1999.814621.
3. Sergey Bravyi and Jeongwan Haah. Magic-state distillation with low overhead. Phys. Rev. A, 86 (5): 052329, 2012. https://doi.org/10.1103/PhysRevA.86.052329.
4. Sergey Bravyi and Alexei Kitaev. Universal quantum computation with ideal Clifford gates and noisy ancillas. Phys. Rev. A, 71: 022316, Feb 2005. https://doi.org/10.1103/PhysRevA.71.022316.
5. Robert A. Calderbank, Stephen Howard, Sina Jafarpour, and Jeremy Kent. Sparse approximation and compressed sensing using the Reed-Muller sieve. Technical Report, Princeton University, TR-888-10, 2010. URL https://www.cs.princeton.edu/research/techreps/TR-888-10.