Recognition: unknown
Representation of Quantum Circuits with Clifford and π/8 Gates
read the original abstract
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)$.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
Price and Payoff: Non-Determinism in Fault Tolerant Quantum Computation
Stochastic magic-state production in fault-tolerant quantum computing inflates execution time but reduces peak resource demand, allowing stochastic-aware factory allocation to cut space-time volume by up to 27% and fa...
-
Parity-unfolded distillation architecture for noise-biased platforms
A new fault-tolerant scheme called parity unfolding distills gates from any Clifford hierarchy level using 2^{k+3} + O(2^{k/2}) biased-noise qubits, cutting logical error rates by 43% and resources by 26% for arbitrar...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.