相关论文: On the tame kernels of imaginary cyclic quartic fi…
Research of cycles through specific vertices is a central topic in graph theory. In this context, we focus on a well-studied computational problem, \textsc{$T$-Cycle}: given an undirected $n$-vertex graph $G$ and a set of $k$ vertices…
Quantum computers, with parallel computing and entanglement effects, excel in cryptography analysis and big data processing. However, they are not fully developed yet, and their performance needs further evaluation. Traditional computer…
Ordinary binary multiplication of natural numbers can be generalized in a non-trivial way to a ternary operation by considering discrete volumes of lattice hexagons. With this operation, a natural notion of `3-primality' -- primality with…
Let $F\in \mathbb{K}[X, Y ]$ be a polynomial of total degree $D$ defined over a perfect field $\mathbb{K}$ of characteristic zero or greater than $D$. Assuming $F$ separable with respect to $Y$ , we provide an algorithm that computes the…
Inspired by the Odlyzko root discriminant and Golod--Shafarevich $p$-group bounds, Martinet (1978) asked whether an imaginary quadratic number field $K/\mathbb{Q}$ must always have an infinite Hilbert $2$-class field tower when the class…
Kernel-based methods are heavily used in machine learning. However, they suffer from $O(N^2)$ complexity in the number $N$ of considered data points. In this paper, we propose an approximation procedure, which reduces this complexity to…
We investigate the number ${\Cal F}(h)$ of imaginary quadratic fields with class number $h$. We establish an asymptotic formula for the average value of ${\Cal F}(h)$. We also establish a modest non-trivial upper bound for ${\Cal F}(h)$ and…
Perceptrons, which perform binary classification, are the fundamental building blocks of neural networks. Given a data set of size~$N$ and margin~$\gamma$ (how well the given data are separated), the query complexity of the best-known…
We obtain a quantitative version of the classical Chevalley-Weil theorem for curves. Let $\phi : \tilde{C} \to C$ be an unramified morphism of non-singular plane projective curves defined over a number field $K$. We calculate an effective…
We study the L\"{u}roth problem for partial differential fields. The main result is the following partial differential analog of generalized L\"{u}roth's theorem: Let $\mathcal{F}$ be a differential field of characteristic 0 with $m$…
In this paper, we investigate the 2-rank of the class group of some real cyclic quartic number fields. Precisely, we consider the case where the quadratic subfield is Q(\sqrt{l}) with l congruent to 5 modulo 8 is a prime.
In this paper, we determine the 2-rank of the class group of certain classes of real cyclic quartic number fields. Precisely, we consider the case in which the quadratic subfield is Q(\sqrt{l}) with l=2 or a prime congruent to 1 mod 8.
Let $K$ be a number field, let $A$ be a finite-dimensional $K$-algebra, let $\mathrm{J}(A)$ denote the Jacobson radical of $A$, and let $\Lambda$ be an $\mathcal{O}_{K}$-order in $A$. Suppose that each simple component of the semisimple…
The quantum Fourier transform (QFT) has emerged as the primary tool in quantum algorithms which achieve exponential advantage over classical computation and lies at the heart of the solution to the abelian hidden subgroup problem, of which…
Let $F$ be a field of characteristic $p$ and let $E/F$ be a purely inseparable field extension. We study the group $H_p^{n+1}(F)$ of classes of differential forms under the restriction map $H_p^{n+1}(F)\to H_p^{n+1}(E)$ and give a system of…
We investigate quantum algorithms for classification, a fundamental problem in machine learning, with provable guarantees. Given $n$ $d$-dimensional data points, the state-of-the-art (and optimal) classical algorithm for training…
We employ quantum circuit learning to simulate quantum field theories (QFTs). Typically, when simulating QFTs with quantum computers, we encounter significant challenges due to the technical limitations of quantum devices when implementing…
We give new quantum algorithms for evaluating composed functions whose inputs may be shared between bottom-level gates. Let $f$ be an $m$-bit Boolean function and consider an $n$-bit function $F$ obtained by applying $f$ to conjunctions of…
Many graph problems were first shown to be fixed-parameter tractable using the results of Robertson and Seymour on graph minors. We show that the combination of finite, computable, obstruction sets and efficient order tests is not just one…
Using parafermionic field theoretical methods, the fundamentals of 2d fractional supersymmetry ${\bf Q}^{K} =P$ are set up. Known difficulties induced by methods based on the $U_{q}(sl(2))$ quantum group representations and non commutative…