Related papers: Evaluation of exponential sums and Riemann zeta fu…
We combine our version of the resonance method with certain convolution formulas for $\zeta(s)$ and $\log\, \zeta(s)$. This leads to a new $\Omega$ result for $|\zeta(1/2+it)|$: The maximum of $|\zeta(1/2+it)|$ on the interval $1 \le t \le…
We investigate the extreme values of the Riemann zeta function $\zeta(s)$. On the 1-line, we obtain a lower bound evaluation $$\max_{t\in[1,T]}|\zeta(1+\i t)|\ge {\rm e}^\gamma(\log_2T+\log_3T+c),$$ with an effective constant $c$ which…
Let $\mathbb{F}_q[t]$ denote the ring of polynomials over the finite field $\mathbb{F}_q$. Building off of techniques of Balog and Ruzsa and of Keil in the integer setting, we determine the precise order of magnitude of $k$th moments of…
The Dirichlet eta function can be divided into $n$-th partial sum $\eta_{n}(s)$ and remainder term $R_{n}(s)$. We focus on the remainder term which can be approximated by the expression for $n$. And then, to increase reliability, we make…
We introduce an efficient and numerically stable method for calculating linear response functions $\chi(\vec{q},\omega)$ of quantum systems at finite temperatures. The method is a combination of numerical solution of the time-dependent…
We define certain higher-dimensional Dedekind sums that generalize the classical Dedekind-Rademacher sums, and show how to compute them effectively using a generalization of the continued-fraction algorithm. We present two applications.…
Quantum state tomography (QST) for reconstructing pure states requires exponentially increasing resources and measurements with the number of qubits by using state-of-the-art quantum compressive sensing (CS) methods. In this article, QST…
For a non-negative integer $N$, let $\mathcal{Z}_{N}:=\sum^N_{c = 0} \mathbb{Q} \cdot \zeta(-c,s+c)$, where the right-hand side is the vector space spanned by the Euler-Zagier double zeta functions over $\mathbb{Q}$. In this paper, we show…
A quantum algorithm for approximating efficiently 3--manifold topological invariants in the framework of SU(2) Chern-Simons-Witten (CSW) topological quantum field theory at finite values of the coupling constant k is provided. The model of…
We demonstrate that certain class of infinite sums can be calculated analytically starting from a specific quantum mechanical problem and using principles of quantum mechanics. For simplicity we illustrate the method by exploring the…
In this paper we derive uniform asymptotic expansions for the partial sums of the exponential series. We indicate how this information will be used in a later publication to obtain full and explicitly computable asymptotic expansions with…
Quantum computing is a promising new area of computing with quantum algorithms offering a potential speedup over classical algorithms if fault tolerant quantum computers can be built. One of the first applications of the classical computer…
We develop a method for approximate synthesis of single--qubit rotations of the form $e^{-i f(\phi_1,\ldots,\phi_k)X}$ that is based on the Repeat-Until-Success (RUS) framework for quantum circuit synthesis. We demonstrate how smooth…
The partition function of the random energy model at inverse temperature $\beta$ is a sum of random exponentials $Z_N(\beta)=\sum_{k=1}^N \exp(\beta \sqrt{n} X_k)$, where $X_1,X_2,...$ are independent real standard normal random variables…
This paper is a continuation of our recent papers with the same title, arXiv:0806.1596v1 [math.NT], arXiv:0904.1277v1 where a number of integral equalities involving integrals of the logarithm of the Riemann zeta-function were introduced…
We study the entire function zeta(n,s) which is the sum of l to the power -s, where l runs over the positive eigenvalues of the Laplacian of the circular graph C(n) with n vertices. We prove that the roots of zeta(n,s) converge for n to…
This paper describes a practical methodology for computing the Hardy function Z(t), using just O(((t/epsilon)^(1/3))*(log(t))^(2+o(1)))) standard computational operations, to a tolerance of epsilon in the relative error. The methodology is…
The Euler--Maclaurin (EM) summation formula is used in many theoretical studies and numerical calculations. It approximates the sum $\sum_{k=0}^{n-1} f(k)$ of values of a function $f$ by a linear combination of a corresponding integral of…
The $\Sigma$-QMAC problem is introduced, involving $S$ servers, $K$ classical ($\mathbb{F}_d$) data streams, and $T$ independent quantum systems. Data stream ${\sf W}_k, k\in[K]$ is replicated at a subset of servers…
We derive the large $n$ asymptotics of zeros of sections of a generic exponential sum. We divide all the zeros of the $n$-th section of the exponential sum into ``genuine zeros'', which approach, as $n\to\infty$, the zeros of the…