Abstract | ||
---|---|---|
Consider the universal gate set for quantum computing consisting of the gates X, CX, CCX, ${\omega}{\dagger}H$ and S. All of these gates have matrix entries in the ring $\mathbb Z [\frac{1}{2}, i]$, the smallest subring of the complex numbers containing $\frac{1}{2}$ and $i$. Amy, Glaudell, and Ross proved the converse, i.e., any unitary matrix with entries in $\mathbb Z [\frac{1}{2}, i]$ can be realized by a quantum circuit over the above gate set using at most one ancilla. In this paper, we give a finite presentation by generators and relations of $U_n(\mathbb Z [\frac{1}{2}, i])$, the group of unitary $n\times n$-matrices with entries in $\mathbb Z [\frac{1}{2}, i]$. |
Year | DOI | Venue |
---|---|---|
2021 | 10.4204/EPTCS.343.8 | International Workshop on Quantum Physics and Logic (QPL) |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Xiaoning Bian | 1 | 0 | 0.34 |
Peter Selinger | 2 | 434 | 36.65 |