相关论文: An Improvement of the Cipolla-Lehmer Type Algorith…

We present a quantum algorithm for systems of (possibly inhomogeneous) linear ordinary differential equations with constant coefficients. The algorithm produces a quantum state that is proportional to the solution at a desired final time.…

Finite-sum optimization has wide applications in machine learning, covering important problems such as support vector machines, regression, etc. In this paper, we initiate the study of solving finite-sum optimization problems by quantum…

In our preceding paper, we have proposed an algorithm for obtaining finite-norm solutions of higher-order linear ordinary differential equations of the Fuchsian type [\sum_m p_m (x) (d/dx)^m] f(x) = 0 (where p_m is a polynomial with…

Given a prime number $q$ and a squarefree integer $C_1$, we develop a method to explicitly determine the tuples $(y, n, \alpha)$ for which the difference $y^n-q^\alpha$ has squarefree part equal to $C_1$. Our techniques include the…

This paper can be seen as an attempt of rethinking the {\em Extra-Gradient Philosophy} for solving Variational Inequality Problems. We show that the properly defined {\em Reduced Gradients} can be used instead for finding approximate…

We consider the equation $$ ab + cd = \lambda, \qquad a\in A, b \in B, c\in C, d \in D, $$ over a finite field $F_q$ of $q$ elements, with variables from arbitrary sets $ A, B, C, D \subseteq F_q$. The question of solvability of such and…

This paper proposes a finite element method for solving the periodic steady-state problem for the scalar-valued and vector-valued Poisson equations, a simple reduction model of the Maxwell equations under the Coulomb gauge. Introducing a…

Grover's quantum search and its generalization, quantum amplitude amplification, provide quadratic advantage over classical algorithms for a diverse set of tasks, but are tricky to use without knowing beforehand what fraction $\lambda$ of…

Post-training quantization (PTQ) of large language models (LLMs) holds the promise in reducing the prohibitive computational cost at inference time. Quantization of all weight, activation and key-value (KV) cache tensors to 4-bit without…

Let $P_{r}$ denote an integer with at most $r$ prime factors counted with multiplicity. In this paper we prove that for some $\lambda < \frac{1}{12}$, the inequality $\{\sqrt{p}\}<p^{-\lambda}$ has infinitely many solutions in primes $p$…

The computation of the cohomology for finite groups of Lie type in the describing characteristic is a challenging and difficult problem. In earlier work, the authors constructed an induction functor which takes modules over the finite group…

In this paper, we propose a new method to obtain new permutation polynomials over $\mathbb{F}_{q^2}$. Using this method, we extend many known permutation polynomials, which take the form $\sum_i(x^q-x+\delta)^{s_i}+L(x)$, where $L(x)$ is a…

It has been well established that first order optimization methods can converge to the maximal objective value of concave functions and provide constant factor approximation guarantees for (non-convex/non-concave) continuous submodular…

Given a prime q and a negative discriminant D, the CM method constructs an elliptic curve E/\Fq by obtaining a root of the Hilbert class polynomial H_D(X) modulo q. We consider an approach based on a decomposition of the ring class field…

A simple third order compact finite element method is proposed for one-dimensional Sturm-Liouville boundary value problems. The key idea is based on the interpolation error estimate, which can be related to the source term. Thus, a simple…

We study tight bounds and fast algorithms for LCLMs of several linear differential operators with polynomial coefficients. We analyze the arithmetic complexity of existing algorithms for LCLMs, as well as the size of their outputs. We…

Let $q$ be a prime power and $m>1$ be any integer. Let $\mathbb F_{q^m}$ be the finite field of order $q^m$ and $\theta\in\mathbb F_{q^m}$ be such that $\mathbb F_{q^m} = \mathbb F(\theta)$. We obtain a nontrivial bound for the mixed…

The problem of computing $\alpha$-capacity for $\alpha>1$ is equivalent to that of computing the correct decoding exponent. Various algorithms for computing them have been proposed, such as Arimoto and Jitsumatsu--Oohama algorithm. In this…

In this paper, some issues concerning the Chinese remaindering representation are discussed. Some new converting methods, including an efficient probabilistic algorithm based on a recent result of von zur Gathen and Shparlinski…

Let $k\ge 1$ be an integer, and let $P= (f_1(x), \ldots, f_k(x) )$ be $k$ admissible linear polynomials over the integers, or \textit{the pattern}. We present two algorithms that find all integers $x$ where $\max{ \{f_i(x) \} } \le n$ and…