Representation of Quantum Circuits with Clifford and $\pi/8$ Gates

In this paper, we introduce the notion of a normal form of one qubit quantum circuits over the basis $\{H, P, T\}$, where $H$, $P$ and $T$ denote the Hadamard, Phase and $\pi/8$ gates, respectively. This basis is known as the {\it standard set} and its universality has been shown by Boykin et al. [FOCS '99]. Our normal form has several nice properties: (i) Every circuit over this basis can easily be transformed into a normal form, and (ii) Every two normal form circuits compute same unitary matrix if and only if both circuits are identical. We also show that the number of unitary operations that can be represented by a circuit over this basis that contains at most $n$ $T$-gates is exactly $192 \cdot (3 \cdot 2^n - 2)$.

[1]  Scott Aaronson,et al.  Improved Simulation of Stabilizer Circuits , 2004, ArXiv.

[2]  Carlton M. Caves,et al.  Graphical description of the action of Clifford operators on stabilizer states , 2007 .

[3]  P. Oscar Boykin,et al.  On universal and fault-tolerant quantum computing: a novel basis and a new constructive proof of universality for Shor's basis , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[4]  Alexander Schrijver,et al.  New Limits on Fault-Tolerant Quantum Computation , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[5]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[6]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.