相关论文: Counting unitaries of T-depth one

We study single-copy stabilizer learning, the problem of identifying a stabilizer group of dimension $n-t$ from an $n$-qubit quantum state $\rho$. We obtain two complementary results. First, in the average case, logarithmic-depth local…

In this paper we present new formulas, which represent commutators and anticommutators of Clifford algebra elements as sums of elements of different ranks. Using these formulas we consider subalgebras of Lie algebras of pseudounitary…

Let $D$ and $E$ be subspaces of the tensor product of the finite-dimensional Hilbert spaces $\mathbb{C}^m \otimes \mathbb{C}^n$. We show that the number of product vectors in $D$ with their partial conjugates in $E$ is uniformly bounded…

Due to the technical difficulty of building large quantum computers, it is important to be able to estimate how faithful a given implementation is to an ideal quantum computer. The common approach of completely characterizing the…

Decompositions of the unitary group U(n) are useful tools in quantum information theory as they allow one to decompose unitary evolutions into local evolutions and evolutions causing entanglement. Several recursive decompositions have been…

Let $(a;q)_n=\prod_{0\le k<n}(1-aq^k)$ for n=0,1,2,.... Define q-Euler numbers $E_n(q)$, q-Sali\'e numbers $S_n(q)$ and q-Carlitz numbers $C_n(q)$ as follows: $$\sum_{n=0}^{\infty}E_n(q)\frac{x^n}{(q,q)_n}…

Let $A$ be an associative algebra with a superinvolution $*$ over a field of characteristic zero, and let $c_n^*(A)$, $n = 1, 2, \ldots$, denote its sequence of $*$-codimensions. It is well known that this sequence is either polynomially…

The Universal T-matrix is the capstone of the structure that consists of a quantum group and its dual, and the central object from which spring the T-matrices (monodromies) of all the associated integrable models. A closed expression is…

The structure of the unitary unit group of the group algebra ${\F}_{2^k} Q_{8}$ is described as a Hamiltonian group.

The applications of random quantum circuits range from quantum computing and quantum many-body systems to the physics of black holes. Many of these applications are related to the generation of quantum pseudorandomness: Random quantum…

In this paper, we construct a symmetric group ${\rm Sym}_{2(4^n-1)}$, which contains a subgroup isomorphic to the $n$-qubit projective Clifford group $\mathcal{C}_n$. To establish this result, we investigate the centralizers of the $z$ gate…

Amdeberhan conjectured that the number of $(t,t+1, t+2)$-core partitions is $\sum_{0\leq k\leq [\frac{t}{2}]}\frac{1}{k+1}\binom{t}{2k}\binom{2k}{k}$. In this paper, we obtain the generating function of the numbers $f_t$ of $(t, t + 1, ...,…

We describe derivations of the Clifford algebra of a nondegenerate quadratic form on a countable dimensional vector space over an algebraically closed field of characteristic not equal to $2$. We also construct an algebraic automorphism of…

A quantum compiler is a software program for decomposing ("compiling") an arbitrary unitary matrix into a sequence of elementary operations (SEO). The author of this paper is also the author of a quantum compiler called Qubiter. Qubiter…

Before executing a quantum algorithm, one must first decompose the algorithm into machine-level instructions compatible with the architecture of the quantum computer, a process known as quantum compiling. There are many different quantum…

We present an arithmetic circuit performing constant modular addition having $\mathcal{O}(n)$ depth of Toffoli gates and using a total of $n+3$ qubits. This is an improvement by a factor of two compared to the width of the state-of-the-art…

As part of a protocol, we braid in a certain way six anyons of topological charges $222211$ in the Kauffman-Jones version of $SU(2)$ Chern-Simons theory at level $4$. The gate we obtain is a braid for the usual qutrit $2222$ but with…

An algebra extension $A \| B$ is right depth two in this paper if its tensor-square is $A$-$B$-isomorphic to a direct summand of any (not necessarily finite) direct sum of $A$ with itself. For example, normal subgroups of infinite groups,…

Quantum Error Correction (QEC) is the cornerstone of practical Fault-Tolerant Quantum Computing (FTQC), but incurs enormous resource overheads. Circuits must decompose into Clifford+T gates, and the non-transversal T gates demand costly…

Schur studied limits of the arithmetic means $s_n$ of zeros for polynomials of degree $n$ with integer coefficients and simple zeros in the closed unit disk. If the leading coefficients are bounded, Schur proved that $\limsup_{n\to\infty}…