Related papers: An explicit family of unitaries with exponentially…
Binary self-dual codes with large minimum distances, such as the extended Hamming code and the Golay code, are fascinating objects in the coding theory. They are closely related to sporadic simple groups, lattices and invariant theory. A…
We prove that $poly(t) \cdot n^{1/D}$-depth local random quantum circuits with two qudit nearest-neighbor gates on a $D$-dimensional lattice with n qudits are approximate $t$-designs in various measures. These include the "monomial"…
B\"uchi's problem asks whether there exists a positive integer $M$ such that any sequence $(x_n)$ of at least $M$ integers, whose second difference of squares is the constant sequence $(2)$, satisifies $x_n^2=(x+n)^2$ for some $x\in\Z$. A…
Any quantum computation consists of a sequence of unitary evolutions described by a finite set of Hamiltonians. When this set is taken to consist of only products of Pauli operators, we show that the minimal such set generating…
We classify all post-critically finite unicritical polynomials defined over the maximal totally real algebraic extension of ${\mathbb Q}$. Two auxiliary results used in the proof of this result may be of some independent interest. The first…
We study the existence and cardinality of normal geodesics of different causal types on H(eisenberg)-type quaternion group equipped with the sub-Lorentzian metric. We present explicit formulas for geodesics and describe reachable sets by…
We give a strongly explicit construction of $\varepsilon$-approximate $k$-designs for the orthogonal group $\mathrm{O}(N)$ and the unitary group $\mathrm{U}(N)$, for $N=2^n$. Our designs are of cardinality $\mathrm{poly}(N^k/\varepsilon)$…
The space $J^k$ of $k$-jets of a real function of one real variable $x$ admits the structure of Carnot group type. As such, $J^k$ admits a submetry (\sR submersion) onto the Euclidean plane. Horizontal lifts of Euclidean lines (which are…
We introduce the first minimal and complete equational theory for quantum circuits. Hence, we show that any true equation on quantum circuits can be derived from simple rules, all of them being standard except a novel but intuitive one…
Three families of exact solutions for 2-dimensional gravity minimally coupled to electrodynamics are obtained in the context of ${\cal R}=T$ theory. It is shown, by supersymmetric formalism of quantum mechanics, that the quantum dynamics of…
Infinite families of multi-indexed orthogonal polynomials are discovered as the solutions of exactly solvable one-dimensional quantum mechanical systems. The simplest examples, the one-indexed orthogonal polynomials, are the infinite…
Qudits with local dimension $d>2$ can have unique structure and uses that qubits ($d=2$) cannot. Qudit Pauli operators provide a very useful basis of the space of qudit states and operators. We study the structure of the qudit Pauli group…
We investigate a graph-theoretic problem motivated by questions in quantum computing concerning the propagation of information in quantum circuits. A graph $G$ is said to be a bounded extension of its subgraph $L$ if they share the same…
We define a one-parameter family of two-sided coideals in U_q(gl(n)) and study the corresponding algebras of infinitesimally right invariant functions on the quantum unitary group U_q(n). The Plancherel decomposition of these algebras with…
We provide an easy approach to the geodesic distance on the general linear group GL(n) for left-invariant Riemannian metrics which are also right-O(n)-invariant. The parametrization of geodesic curves and the global existence of length…
We consider random quantum circuits (RQC) on arbitrary connected graphs whose edges determine the allowed $2$-qudit interactions. Prior work has established that such $n$-qudit circuits with local dimension $q$ on 1D, complete, and…
Let $A$ be an associative algebra graded by a finite group $G$ over a field ${F}$ of characteristic zero. One associates to $A$ the sequence of $G$-graded codimensions $c_n^G(A)$, $n=1,2,\ldots$, which measures the growth of the polynomial…
This work presents an optimization-based scalable quantum neural network framework for approximating $n$-qubit unitaries through generic parametric representation of unitaries, which are obtained as product of exponential of basis elements…
We devise greedy heuristics tailored for synthesizing quantum circuits that implement a specified set of Pauli rotations. Our heuristics are designed to minimize either the count of entangling gates or the depth of entangling gates, and…
We consider the construction of maximal families of polynomials over the finite field $\mathbb{F}_q$, all having the same degree $n$ and a nonzero constant term, where the degree of the GCD of any two polynomials is $d$ with $1 \le d\le n$.…