相关论文: Quantum computation of zeta functions of curves

We present a deterministic polynomial time algorithm for computing the zeta function of an arbitrary variety of fixed dimension over a finite field of small characteristic. One consequence of this result is an efficient method for computing…

Curves over finite fields are of great importance in cryptography and coding theory. Through studying their zeta-functions, we would be able to find out vital arithmetic and geometric information about them and their Jacobians, including…

We determine the zeta functions of trinomial curves in terms of Gauss sums and Jacobi sums, and we obtain an explicit formula of the genus of a trinomial curve over a finite field, then we study the conditions for a trinomial curve to be a…

We introduce a new algorithm to compute the zeta function of a curve over a finite field. This method extends previous work of ours to all curves for which a good lift to characteristic zero is known. We develop all the necessary bounds,…

We propose a Las Vegas probabilistic algorithm to compute the zeta function of a genus-3 hyperelliptic curve defined over a finite field $\mathbb F_q$, with explicit real multiplication by an order $\mathbb Z[\eta]$ in a totally real cubic…

This paper gives the quantum walks determined by graph zeta functions. The result enables us to obtain the characteristic polynomial of the transition matrix of the quantum walk, and it determines the behavior of the quantum walk. We treat…

In general, the L-polynomial of a curve of genus $g$ is determined by $g$ coefficients. We show that the L-polynomial of a supersingular curve of genus $g$ is determined by fewer than $g$ coefficients.

We give an explicit formula of the coefficients of the Zeta-Function's L-polynomial for algebraic function fields over finite constant fields. Thus, we deduce an expression of the class number of algebraic function fields defined over…

For each $(m+1)$-tuple ${\bf n}_m=(n_0,n_1,\ldots,n_m)$ of positive integers, the ${\bf n}_m$-derived zeta function $\widehat\zeta_{X,\mathbb F_q}^{\,({\bf n}_m)}(s)$ is defined for a curve $X$ over $\mathbb F_q$. This derived zeta function…

A possible connection between quantum computing and Zeta functions of finite field equations is described. Inspired by the 'spectral approach' to the Riemann conjecture, the assumption is that the zeroes of such Zeta functions correspond to…

We compute in a direct (not algorithmic) way the zeta function of all supersingular curves of genus 2 over a finite field k, with many geometric automorphisms. We display these computations in an appendix where we select a family of…

What is the computational power of a quantum computer? We show that determining the output of a quantum computation is equivalent to counting the number of solutions to an easily computed set of polynomials defined over the finite field…

This article concerns the computational complexity of a fundamental problem in number theory: counting points on curves and surfaces over finite fields. There is no subexponential-time algorithm known and it is unclear if it can be…

Let g >= 1 and let Q be a monic, squarefree polynomial of degree 2g + 1 in Z[x]. For an odd prime p not dividing the discriminant of Q, let Z_p(T) denote the zeta function of the hyperelliptic curve of genus g over the finite field F_p…

In this paper we present a p-adic algorithm to compute the zeta function of a nondegenerate curve over a finite field using Monsky-Washnitzer cohomology. The paper vastly generalizes previous work since all known cases, e.g. hyperelliptic,…

We present a new method for computing the zeta function of an algebraic curve over a finite field. The algorithm relies on a trace formula of Harvey to count points on a plane model of the curve. The zeta function of the curve is then…

We define a zeta function of a graph by using the time evolution matrix of a general coined quantum walk on it, and give a determinant expression for the zeta function of a finite graph. Furthermore, we present a determinant expression for…

In this paper, we improve the algorithms of Lauder-Wan \cite{LW} and Harvey \cite{Ha} to compute the zeta function of a system of $m$ polynomial equations in $n$ variables over the finite field $\FF_q$ of $q$ elements, for $m$ large. The…

We present an efficient quantum algorithm for the exact evaluation of either the fully ferromagnetic or anti-ferromagnetic q-state Potts partition function Z for a family of graphs related to irreducible cyclic codes. This problem is…

We present new algorithms for computing zeta functions of algebraic varieties over finite fields. In particular, let X be an arithmetic scheme (scheme of finite type over Z), and for a prime p let zeta_{X_p}(s) be the local factor of its…