Related papers: Counting unitaries of T-depth one

We introduce a measure for evaluating the efficiency of finite universal quantum gate sets $\mathcal{S}$, called the Quantum Circuit Overhead (QCO), and the related notion of $T$-Quantum Circuit Overhead ($T$-QCO). QCO compares the circuit…

For a number of useful quantum circuits, qudit constructions have been found which reduce resource requirements compared to the best known or best possible qubit construction. However, many of the necessary qutrit gates in these…

Consider the $m$-th roots of unity in {\bf C}, where $m>0$ is an integer. We address the following question: For what values of $n$ can one find $n$ such $m$-th roots of unity (with repetitions allowed) adding up to zero? We prove that the…

Quantum circuits for basic mathematical functions such as the square root are required to implement scientific computing algorithms on quantum computers. Quantum circuits that are based on Clifford+T gates can easily be made fault tolerant…

Consider the divisor sum $\sum_{n\leq N}\tau(n^2+2bn+c)$ for integers $b$ and $c$ which satisfy certain extra conditions. For this average sum we obtain an explicit upper bound, which is close to the optimal. As an application we improve…

A unitary design is a collection of unitary matrices that approximate the entire unitary group, much like a spherical design approximates the entire unit sphere. In this paper, we use irreducible representations of the unitary group to find…

Littlewood raised the question of how slowly ||f_n||_4^4-||f_n||_2^4 (where ||.||_r denotes the L^r norm on the unit circle) can grow for a sequence of polynomials f_n with unimodular coefficients and increasing degree. The results of this…

Let $n$ be a positive integer divisible by 8. The Clifford-cyclotomic gate set $\mathcal{G}_n$ consists of the Clifford gates, together with a $z$-rotation of order $n$. It is easy to show that, if a circuit over $\mathcal{G}_n$ represents…

We use the polynomials $m_s(t) = t^2 - 4 s$, $s \in \{-1, 1\}$, in an elementary process giving arbitrary large lists of {\it fundamental units} of quadratic fields of discriminants listed in ascending order. More precisely, let $\mathbf{B}…

What are the asymptotic moments of coefficients obtained when expanding prod_{m=1}^infty (1-q^m)^k in series? A few examples are given, as well as a new multiplicative representation for coefficients when k=10 and k=14.

The group of local unitary transformations acts on the space of n-qubit pure states, decomposing it into orbits. In a previous paper we proved that a product of singlet states (together with an unentangled qubit for a system with an odd…

We discuss two infinite classes of 4d supersymmetric theories, ${T}_N^{(m)}$ and ${\cal U}_N^{(m)}$, labelled by an arbitrary non-negative integer, $m$. The ${T}_N^{(m)}$ theory arises from the 6d, $A_{N-1}$ type ${\cal N}=(2,0)$ theory…

Resource-efficient and high-precision approximate synthesis of quantum circuits expressed in the Clifford+T gate set is vital for Fault-Tolerant quantum computing. Efficient optimal methods are known for single-qubit RZ unitaries, otherwise…

We give sharp sectional curvature estimates for complete immersed cylindrically bounded $m$-submanifolds $\phi:M\to N\times\mathbb{R}^{\ell}$, $n+\ell\leq 2m-1$ provided that either $\phi$ is proper with the second fundamental form with…

For a system of N qubits, spanning a Hilbert space of dimension d=2^N, it is known that there exists d+1 mutually unbiased bases. Different construction algorithms exist, and it is remarkable that different methods lead to sets of bases…

We prove a quantitative estimate on the number of certain singularities in almost minimizing clusters. In particular, we consider the singular points belonging to the lowest stratum of the Federer-Almgren stratification (namely, where each…

We present a finite set of projective measurements that, together with quantum memory and preparation of the |0> state, suffice for universal quantum computation. This extends work of Nielsen [quant-ph/0108020], who proposed a scheme in…

An extension of $k$-algebras $B \subset A$ is said to have depth one if there exists a positive integer $n$ such that $ A$ is a direct summand of $ B^n$ in $_B\mtr{Mod}_B$. Depth one extensions of semisimple algebras are completely…

We show how to use Clifford algebra techniques to describe the de Rham cohomology ring of equal rank compact symmetric spaces $G/K$. In particular, for $G/K=U(n)/U(k)\times U(n-k)$, we obtain a new way of multiplying Schur polynomials,…

We give a Euclidean division algorithm for the real quadratic fields $\mathbb{Q}(\sqrt{m})$ for $m \in \{2, 3, 6, 7, 11, 19\}$, with the property that the norm of the remainder depends on the first Euclidean minimum of the field. In each…