Related papers: On the tame kernels of imaginary cyclic quartic fi…

Quantum kernel methods have emerged as a promising approach for leveraging high-dimensional feature spaces in machine learning, particularly in domains where classical kernel methods face scalability limitations. In this work, we present…

We apply the Dynamical Mean Field (DMFT) approximation to the real, scalar phi^4 quantum field theory. By comparing to lattice Monte Carlo calculations, perturbation theory and standard mean field theory, we test the quality of the…

Given a square, nonsingular matrix of univariate polynomials $\mathbf{F}\in\mathbb{K}[x]^{n\times n}$ over a field $\mathbb{K}$, we give a deterministic algorithm for finding the determinant of $\mathbf{F}$. The complexity of the algorithm…

In this article we explain how to construct cyclic octic unramfied extensions of the real quadratic number field $k = {\mathbb Q}(\sqrt{2p}\,)$, where $p \equiv 1 \bmod 8$ is a prime number such that $h_2(k) \equiv 0 \bmod 8$. The…

The matroid intersection problem is a fundamental problem that has been extensively studied for half a century. In the classic version of this problem, we are given two matroids $\mathcal{M}_1 = (V, \mathcal{I}_1)$ and $\mathcal{M}_2 = (V,…

The real time evolution of quantum field theory models can be calculated order by order in perturbation theory. For $\lambda \phi^4$ models, the perturbative series have a zero radius of convergence which in part motivated the design of…

We give a quantum-inspired $O(n^4)$ algorithm computing the Tutte polynomial of a lattice path matroid, where $n$ is the size of the ground set of the matroid. Furthermore, this can be improved to $O(n^2)$ arithmetic operations if we…

Algorithms with unitary oracles can be nested, which makes them extremely versatile. An example is the phase estimation algorithm used in many candidate algorithms for quantum speed-up. The search for new quantum algorithms benefits from…

Unit-generated orders of a quadratic field are orders of the form $\mathcal{O} = \mathbb{Z}[\varepsilon]$, where $\varepsilon$ is a unit in the quadratic field. If the order $\mathcal{O}$ is a maximal order of a real quadratic field, then…

A standard formula (1) leads to a proof of HT90, but requires proving the existence of $\theta$ such that $\alpha\ne 0$, so that $\beta=\alpha/\sigma(\alpha)$. We instead impose the condition (M), that taking $\theta=1$ makes $\alpha=0$.…

The standard algebraic decoding algorithm of cyclic codes $[n,k,d]$ up to the BCH bound $t$ is very efficient and practical for relatively small $n$ while it becomes unpractical for large $n$ as its computational complexity is $O(nt)$. Aim…

Quantum support vector machines employ quantum circuits to define the kernel function. It has been shown that this approach offers a provable exponential speedup compared to any known classical algorithm for certain data sets. The training…

We present classical and quantum algorithms based on spectral methods for a problem in tensor principal component analysis. The quantum algorithm achieves a quartic speedup while using exponentially smaller space than the fastest classical…

Kernels are often developed and used as implicit mapping functions that show impressive predictive power due to their high-dimensional feature space representations. In this study, we gradually construct a series of simple feature maps that…

With the current rate of progress in quantum computing technologies, systems with more than 50 qubits will soon become reality. Computing ideal quantum state amplitudes for circuits of such and larger sizes is a fundamental step to assess…

We provide an irreducibility test in the ring K[[x]][y] whose complexity is quasi-linear with respect to the valuation of the discriminant, assuming the input polynomial F square-free and K a perfect field of characteristic zero or greater…

Let (G, V) be a prehomogeneous vector space, let O be any G(F_q)-invariant subset of V(F_q), and let f be the characteristic function of O. In this paper we develop a method for explicitly and efficiently evaluating the Fourier transform of…

In this paper, we compute the unit groups and the $2$-class numbers of the Fr\"ohlich's triquadratic fields $\KK=\mathbb{Q}(\sqrt{2},\sqrt{p},\sqrt{q})$, where $p$ and $q$ are two prime numbers such that ($p\equiv 1 \pmod8$ and $q\equiv 3…

We study the space of the solutions $s$ of any system of partial differential equations $ D(j^ks)=0 $ defined by a linear and homogeneous differential operator $ D:J^kE\to F $ of any order $k\geq 1$, which is ``ordinary" (i.e. which is…

We introduce a zeta function counting imaginary quadratic number fields by their class numbers. It is proved that such a function is rational depending only on the eight roots of unity of degrees $1$ and $2$. As a corollary, one gets a…