Related papers: Counting unitaries of T-depth one

Suppose that $ m\equiv 1\mod 4 $ is a prime and that $ n\equiv 3\mod 4 $ is a primitive root modulo $ m $. In this paper we obtain a relation between the class number of the imaginary quadratic field $ \Q(\sqrt{-nm}) $ and the digits of the…

We construct $\varepsilon$-approximate unitary $k$-designs on $n$ qubits in circuit depth $O(\log k \log \log n k / \varepsilon)$. The depth is exponentially improved over all known results in all three parameters $n$, $k$, $\varepsilon$.…

We present an exact synthesis algorithm for qutrit unitaries in $\mathcal{U}_{3^n}(\mathbb{Z}[1/3,e^{2\pi i/3}])$ over the Clifford$+T$ gate set with at most one ancilla. This extends the already known result of qutrit metaplectic gates…

We examine the following problem: given a collection of Clifford gates, describe the set of unitaries generated by circuits composed of those gates. Specifically, we allow the standard circuit operations of composition and tensor product,…

For qubits, Monte Carlo estimation of the average fidelity of Clifford unitaries is efficient -- it requires a number of experiments that is independent of the number $n$ of qubits and classical computational resources that scale only…

Quantum circuit equivalence checking asks whether two circuits implement the same unitary. It guarantees compiler correctness and safe optimization, yet most existing approaches scale exponentially with the number of qubits or the circuit…

We consider a model of quantum computation in which the set of elementary operations is limited to Clifford unitaries, the creation of the state $|0\rangle$ computational basis. In addition, we allow the creation of a one-qubit ancilla in a…

Obtaining the symmetries of a model is a critical step towards developing an understanding and ultimately analytically or numerically solving the model. However, finding symmetries is generally extremely complicated, often being the result…

Let $q, m\geq 2$ be integers with $(m,q-1)=1$. Denote by $s_q(n)$ the sum of digits of $n$ in the $q$-ary digital expansion. Further let $p(x)\in mathbb{Z}[x]$ be a polynomial of degree $h\geq 3$ with $p(\mathbb{N})\subset \mathbb{N}$. We…

Let $F_{q}$ be any finite field of characteristic $p>0$ having $q = p^{n}$ elements. In this paper, we have obtained the complete structure of unit groups of group algebras $F_{q}[QD_{2^k}]$, for $k = 4$ and $5$, for any prime $p>0$, where…

We introduce twisted unitary $t$-groups, a generalization of unitary $t$-groups under a twisting by an irreducible representation. We then apply representation theoretic methods to the Knill-Laflamme error correction conditions to show that…

For integers $n,k,s$, we give a formula for the number $T(n,k,s)$ of order $k$ subsets of the ring $\mathbb{Z}/n\mathbb{Z}$ whose sum of elements is $s$ modulo $n$. To do so, we describe explicitly a sequence of matrices $M(k)$, for…

The decomposition of an arbitrary axiomatic topological quantum field theory or TQFT into indecomposable theories is given. In particular, unitary TQFT's in arbitrary dimensions are shown to decompose into a sum of theories in which the…

Clifford algebras are used for definition of spinors. Because of using spin-1/2 systems as an adequate model of quantum bit, a relation of the algebras with quantum information science has physical reasons. But there are simple mathematical…

We present an algorithm for the approximate decomposition of diagonal operators, focusing specifically on decompositions over the Clifford+$T$ basis, that minimize the number of phase-rotation gates in the synthesized approximation circuit.…

In the study of 2d (the space dimension) topological orders, it is well-known that bulk excitations are classified by unitary modular tensor categories. But these categories only describe the local observables on an open 2-disk in the long…

Let $p$ be a prime integer and $n,i$ be positive integers such that \linebreak $S=\{-1, \ \theta, \ \mu_i=1+\theta+... + \theta^{i-1} \ \mid 1 < i < \frac{p^n}{2}, \ gcd(p^n,i)=1 \}$ generates the group of units of $\mathbb{Z}[\theta],$…

We describe a simple algorithm for sampling $n$-qubit Clifford operators uniformly at random. The algorithm outputs the Clifford operators in the form of quantum circuits with at most $5n + 2n^2$ elementary gates and a maximum depth of…

A system of unitary transformations providing two optimal copies of an arbitrary input cubit is obtained. An algorithm based on classical Boolean algebra and allowing one to find any unitary transformation realized by the quantum CNOT…

We give a novel procedure for approximating general single-qubit unitaries from a finite universal gate set by reducing the problem to a novel magnitude approximation problem, achieving an immediate improvement in sequence length by a…