This work gives an unconditional exact quantum implementation in a circuit model permitting single-qubit rotations through efficiently computable angles and combines R'onyai's classical structure theory with R'onyai's classical structure theory to yield the radical and the Wedderburn decomposition.
Abstract
For squarefree $f\in\F_q[x]$, Berlekamp's fixed-point algebra is $B\cong\F_q^r$, where $r$ is the number of irreducible factors. We give an exact quantum splitting procedure in a circuit model permitting efficiently computable, input-dependent single-qubit rotations. For a block with $s\ge2$ factors, a quadratic-character test (odd $q$) or absolute-trace test (characteristic $2$) is nonconstant with an exactly known probability $p_{q,s}\ge1/2$. Its value depends only on $q,s$, not on the hidden factors. An auxiliary-qubit reduction to success probability $1/4$ makes one Grover iteration exact. Thus factorization takes exactly $r-1$ splitting rounds and $O(n^3\log q)$ quantum $\F_q$-operations, with deterministic polynomial classical preprocessing and bookkeeping. The method also extracts primitive idempotents of arbitrary finite-dimensional commutative unital algebras given by structure constants in $O(n^4\log q)$ quantum $\F_q$-operations, staying over $\F_q$ throughout. Computing the radical and passing to the center extends it to the decomposition of $A/\Rad(A)$ into simple two-sided ideals, for an arbitrary finite-dimensional associative $\F_q$-algebra $A$.
For every odd prime power $q$ and $D=q+1$, we construct an infinite family of Ramanujan quantum expanders of degree $D$. The construction transfers Morgenstern's Ramanujan Cayley graphs on $\operatorname{PSL}_2(\mathbb{F}_{p})$ for $p$ which is an even power of $q$, through the odd irreducible subrepresentation of the...
Finite free convolution is obtained by averaging characteristic polynomials over Haar unitary conjugation. We ask when two maximal abelian $\ast$-subalgebras of the complex matrix algebra ${\sf M}_n$ can be placed in finite free position: that is, when their relative position realizes this averaging exactly for every p...
Two new approaches to QFT circuit construction are developed, based on Mackey theory and Clifford theory, respectively, and used to show exponential improvement in circuit cost for specific group families.
Carli Bruinsma, P. M. Posta, Joppe Stokvis et al.· 0 citations
We construct an explicit Hermitian polynomial in six selfadjoint variables, $f=-1+\omega+\omega^*+M\sum_{j=1}^{15}(2-u_j-u_j^*)$, with integer coefficients, degree $72$, and exactly $33$ monomials. Here $\omega,u_1,\ldots,u_{15}$ are specified words, $*$ reverses words, and $M$ is a specified positive integer. Its norm...
Let $W_n$ be the Lie algebra of polynomial vector fields in $n$ variables over a field of characteristic zero, and let $s_k$ denote the alternating sum of compositions of $k$ vector fields. The identity $s_{n^2+2n-1}=0$ has been asserted for arbitrary $n$. We give an explicit counterexample in dimension five, verified...
We realize the $\mathrm{SU}(3)$ Verlinde sums $V_n(m)$, up to an explicit factor, as the values at $n$ of the spectral zeta function of a higher-order Laplace operator on the triangular discrete torus on $m^2$ vertices. For fixed $m$, we express their generating function in terms of the logarithmic derivative of an ass...
J. Jorgenson, Anders Karlsson, Lejla Smajlović· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.