Related papers: An L2-quotient algorithm for finitely presented gr…
A potential approach for demonstrating quantum advantage is using quantum computers to simulate fermionic systems. Quantum algorithms for fermionic system simulation usually involve the Hamiltonian evolution and measurements. However, in…
A polynomial-time algorithm is produced which, given generators for a group of permutations on a finite set, returns a direct product decomposition of the group into directly indecomposable subgroups. The process uses bilinear maps and…
We study the structure of the inverse limit of the graded algebras of local unitary invariant polynomials using its Hilbert series. For k subsystems, we conjecture that the inverse limit is a free algebra and the number of algebraically…
We give an arithmetic criterion which is sufficient to imply the discreteness of various two-generator subgroups of $PSL(2,{\bold C})$. We then examine certain two-generator groups which arise as extremals in various geometric problems in…
Given a set $S=\{x^2+c_1,\dots,x^2+c_s\}$ defined over a field and an infinite sequence $\gamma$ of elements of $S$, one can associate an arboreal representation to $\gamma$, generalizing the case of iterating a single polynomial. We study…
Using evaluation at appropriately chosen points, we propose a Gr\"obner basis free approach for calculating the secondary invariants of a finite permutation group. This approach allows for exploiting the symmetries to confine the…
We introduce a quantum approximate optimization algorithm (QAOA) for continuous optimization. The algorithm is based on the dynamics of a quantum system moving in an energy potential which encodes the objective function. By approximating…
Let $L$ be the infinitesimal generator of an analytic semigroup on $L^2(\mathbb{R}^n)$ with Gaussian kernel bounds, and let $L^{-\alpha/2}$ be the fractional integrals of $L$ for $0<\alpha<n$. Assume that $\vec{b}=(b_1,b_2,\cdots,b_m)$ is a…
An algorithm and its first implementation in C# are presented for assembling arbitrary quantum circuits on the base of Hadamard and Toffoli gates and for constructing multivariate polynomial systems over the finite field Z_2 arising when…
This paper gives a quick overview of the author's recent result that all finitely presented groups are QSF.
This paper presents a quantum algorithm for the solution of prototypical second-order linear elliptic partial differential equations discretized by $d$-linear finite elements on Cartesian grids of a bounded $d$-dimensional domain. An…
The problem of characterizing GKLS-generators and CP-maps with an invariant appeared in different guises in the literature. We prove two unifying results which hold even for weakly closed *-algebras: First, we show how to construct a normal…
It is well known that every finite simple group has a generating pair. Moreover, Guralnick and Kantor proved that every finite simple group has the stronger property, known as $\frac{3}{2}$-generation, that every nontrivial element is…
For fixed compact connected Lie groups H \subseteq G, we provide a polynomial time algorithm to compute the multiplicity of a given irreducible representation of H in the restriction of an irreducible representation of G. Our algorithm is…
We give an new arithmetic algorithm to compute the generalized Discrete Fourier Transform (DFT) over finite groups $G$. The new algorithm uses $O(|G|^{\omega/2 + o(1)})$ operations to compute the generalized DFT over finite groups of Lie…
We construct the finite-dimensional continuous complex representations of $\mathrm{SL}_2$ over compact discrete valuation rings of even residual characteristic. We also prove that the complex group algebras of $\mathrm{SL}_2$ over finite…
We propose a new class of quantum computing algorithms which generalize many standard ones. The goal of our algorithms is to estimate probability distributions. Such estimates are useful in, for example, applications of Decision Theory and…
There has been considerable interest in recent decades in questions of random generation of finite and profinite groups, and finite simple groups in particular. In this paper we study similar notions for finite and profinite associative…
An important problem in computational arithmetic geometry is to find changes of coordinates to simplify a system of polynomial equations with rational coefficients. This is tackled by a combination of two techniques, called minimisation and…
We use variations on Lax type operators to find explicit formulas for certain elements of finite $W$-algebras. These give a complete set of generators for all finite $W$-algebras of types B,C,D for which the Dynkin grading is even.