On the Approximation of the Quantum Gates using Lattices

A central question in Quantum Computing is how matrices in $SU(2)$ can be approximated by products over a small set of "generators". A topology will be defined on $SU(2)$ so as to introduce the notion of a covering exponent \cite{letter}, which compares the length of products required to covering $SU(2)$ with $\varepsilon$ balls against the Haar measure of $\varepsilon$ balls. An efficient universal set over $PSU(2)$ will be constructed using the Pauli matrices, using the metric of the covering exponent. Then, the relationship between $SU(2)$ and $S^3$ will be manipulated to correlate angles between points on $S^3$ and give a conjecture on the maximum of angles between points on a lattice. It will be shown how this conjecture can be used to compute the covering exponent, and how it can be generalized to universal sets in $SU(2)$.Comment: This is an updated version of arxiv.org:1506.0578

On the Whitney distortion extension problem for Cm(Rn)C^m(\mathbb R^n) and C∞(Rn)C^{\infty}(\mathbb R^n) and its applications to interpolation and alignment of data in Rn\mathbb R^n

Let $n,m\geq 1$, $U\subset\mathbb R^n$ open. In this paper we provide a sharp solution to the following Whitney distortion extension problems: (a) Let $\phi:U\to \mathbb R^n$ be a $C^m$ map. If $E\subset U$ is compact (with some geometry) and the restriction of $\phi$ to $E$ is an almost isometry with small distortion, how to decide when there exists a $C^m(\mathbb R^n)$ one-to-one and onto almost isometry $\Phi:\mathbb R^n\to \mathbb R^n$ with small distortion which agrees with $\phi$ in a neighborhood of $E$ and a Euclidean motion $A:\mathbb R^n\to \mathbb R^n$ away from $E$. (b) Let $\phi:U\to \mathbb R^n$ be $C^{\infty}$ map. If $E\subset U$ is compact (with some geometry) and the restriction of $\phi$ to $E$ is an almost isometry with small distortion, how to decide when there exists a $C^{\infty}(\mathbb R^n)$ one-to-one and onto almost isometry $\Phi:\mathbb R^n\to \mathbb R^n$ with small distortion which agrees with $\phi$ in a neighborhood of $E$ and a Euclidean motion $A:\mathbb R^n\to \mathbb R^n$ away from $E$. Our results complement those of [14,15,20] where there, $E$ is a finite set. In this case, the problem above is also a problem of interpolation and alignment of data in $\mathbb R^n$.Comment: This is part three of four papers with C. Fefferman (arXiv:1411.2451, arXiv:1411.2468, involve-v5-n2-p03-s.pdf) dealing with the problem of Whitney type extensions of $\delta>0$ distortions from certain compact sets $E\subset \Bbb R^n$ to $\varepsilon>0$ distorted diffeomorphisms on $\Bbb R^n

On surface completion and image inpainting by biharmonic functions: Numerical aspects

Numerical experiments with smooth surface extension and image inpainting using harmonic and biharmonic functions are carried out. The boundary data used for constructing biharmonic functions are the values of the Laplacian and normal derivatives of the functions on the boundary. Finite difference schemes for solving these harmonic functions are discussed in detail.Comment: Revised 21 July, 2017. Revised 12 January, 2018. To appear in International Journal of Mathematics and Mathematical Science

Isometries and Equivalences Between Point Configurations, Extended To ε\varepsilon-diffeomorphisms

In this paper, we deal with the Orthogonal Procrustes Problem, in which two point configurations are compared in order to construct a map to optimally align the two sets. This extends this to $\varepsilon$-diffeomorphisms, introduced by [1] Damelin and Fefferman. Examples will be given for when complete maps can not be constructed, for if the distributions do match, and finally an algorithm for partitioning the configurations into polygons for convenient construction of the maps.Comment: version: 11.26.1

An Algebraic-Coding Equivalence to the Maximum Distance Separable Conjecture

We formulate an Algebraic-Coding Equivalence to the Maximum Distance Separable Conjecture. Specifically, we present novel proofs of the following equivalent statements. Let $(q,k)$ be a fixed pair of integers satisfying $q$ is a prime power and $2\leq k \leq q$. We denote by $\mathcal{P}_q$ the vector space of functions from a finite field $\mathbb{F}_q$ to itself, which can be represented as the space $\mathcal{P}_q := \mathbb{F}_q[x]/(x^q-x)$ of polynomial functions. We denote by $\mathcal{O}_n \subset \mathcal{P}_q$ the set of polynomials that are either the zero polynomial, or have at most $n$ distinct roots in $\mathbb{F}_q$. Given two subspaces $Y,Z$ of $\mathcal{P}_q$, we denote by $\langle Y,Z \rangle$ their span. We prove that the following are equivalent. [A] Suppose that either: 1. $q$ is odd 2. $q$ is even and $k \not\in \{3, q-1\}$. Then there do not exist distinct subspaces $Y$ and $Z$ of $\mathcal{P}_q$ such that: 3. $dim(\langle Y, Z \rangle) = k$ 4. $dim(Y) = dim(Z) = k-1$. 5. $\langle Y, Z \rangle \subset \mathcal{O}_{k-1}$ 6. $Y, Z \subset \mathcal{O}_{k-2}$ 7. $Y\cap Z \subset \mathcal{O}_{k-3}$. [B] Suppose $q$ is odd, or, if $q$ is even, $k \not\in \{3, q-1\}$. There is no integer $s$ with $q \geq s > k$ such that the Reed-Solomon code $\mathcal{R}$ over $\mathbb{F}_q$ of dimension $s$ can have $s-k+2$ columns $\mathcal{B} = \{b_1,\ldots,b_{s-k+2}\}$ added to it, such that: 8. Any $s \times s$ submatrix of $\mathcal{R} \cup \mathcal{B}$ containing the first $s-k$ columns of $\mathcal{B}$ is independent. 9. $\mathcal{B} \cup \{[0,0,\ldots,0,1]\}$ is independent. [C] The MDS conjecture is true for the given $(q,k)$.Comment: This is version: 5.6.18. arXiv admin note: substantial text overlap with arXiv:1611.0235