Explicit Multiplicative Relations Between Gauss Sums Brian J
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Classical Simulation of Quantum Circuits by Half Gauss Sums
CLASSICAL SIMULATION OF QUANTUM CIRCUITS BY HALF GAUSS SUMS † ‡ KAIFENG BU ∗ AND DAX ENSHAN KOH ABSTRACT. We give an efficient algorithm to evaluate a certain class of expo- nential sums, namely the periodic, quadratic, multivariate half Gauss sums. We show that these exponential sums become #P-hard to compute when we omit either the periodic or quadratic condition. We apply our results about these exponential sums to the classical simulation of quantum circuits, and give an alternative proof of the Gottesman-Knill theorem. We also explore a connection between these exponential sums and the Holant framework. In particular, we generalize the existing definition of affine signatures to arbitrary dimensions, and use our results about half Gauss sums to show that the Holant problem for the set of affine signatures is tractable. CONTENTS 1. Introduction 1 2. Half Gausssums 5 3. m-qudit Clifford circuits 11 4. Hardness results and complexity dichotomy theorems 15 5. Tractable signature in Holant problem 18 6. Concluding remarks 20 Acknowledgments 20 Appendix A. Exponential sum terminology 20 Appendix B. Properties of Gauss sum 21 Appendix C. Half Gauss sum for ξd = ω2d with even d 21 Appendix D. Relationship between half− Gauss sums and zeros of a polynomial 22 References 23 arXiv:1812.00224v1 [quant-ph] 1 Dec 2018 1. INTRODUCTION Exponential sums have been extensively studied in number theory [1] and have a rich history that dates back to the time of Gauss [2]. They have found numerous (†) SCHOOL OF MATHEMATICAL SCIENCES, ZHEJIANG UNIVERSITY, HANGZHOU, ZHE- JIANG 310027, CHINA (*) DEPARTMENT OF PHYSICS, HARVARD UNIVERSITY, CAMBRIDGE, MASSACHUSETTS 02138, USA (‡) DEPARTMENT OF MATHEMATICS, MASSACHUSETTS INSTITUTE OF TECHNOLOGY, CAMBRIDGE, MASSACHUSETTS 02139, USA E-mail addresses: [email protected] (K.Bu), [email protected] (D.E.Koh). -
Appendices A. Quadratic Reciprocity Via Gauss Sums
1 Appendices We collect some results that might be covered in a first course in algebraic number theory. A. Quadratic Reciprocity Via Gauss Sums A1. Introduction In this appendix, p is an odd prime unless otherwise specified. A quadratic equation 2 modulo p looks like ax + bx + c =0inFp. Multiplying by 4a, we have 2 2ax + b ≡ b2 − 4ac mod p Thus in studying quadratic equations mod p, it suffices to consider equations of the form x2 ≡ a mod p. If p|a we have the uninteresting equation x2 ≡ 0, hence x ≡ 0, mod p. Thus assume that p does not divide a. A2. Definition The Legendre symbol a χ(a)= p is given by 1ifa(p−1)/2 ≡ 1modp χ(a)= −1ifa(p−1)/2 ≡−1modp. If b = a(p−1)/2 then b2 = ap−1 ≡ 1modp,sob ≡±1modp and χ is well-defined. Thus χ(a) ≡ a(p−1)/2 mod p. A3. Theorem a The Legendre symbol ( p ) is 1 if and only if a is a quadratic residue (from now on abbre- viated QR) mod p. Proof.Ifa ≡ x2 mod p then a(p−1)/2 ≡ xp−1 ≡ 1modp. (Note that if p divides x then p divides a, a contradiction.) Conversely, suppose a(p−1)/2 ≡ 1modp.Ifg is a primitive root mod p, then a ≡ gr mod p for some r. Therefore a(p−1)/2 ≡ gr(p−1)/2 ≡ 1modp, so p − 1 divides r(p − 1)/2, hence r/2 is an integer. But then (gr/2)2 = gr ≡ a mod p, and a isaQRmodp. -
Contents 1 Root Systems
Stefan Dawydiak February 19, 2021 Marginalia about roots These notes are an attempt to maintain a overview collection of facts about and relationships between some situations in which root systems and root data appear. They also serve to track some common identifications and choices. The references include some helpful lecture notes with more examples. The author of these notes learned this material from courses taught by Zinovy Reichstein, Joel Kam- nitzer, James Arthur, and Florian Herzig, as well as many student talks, and lecture notes by Ivan Loseu. These notes are simply collected marginalia for those references. Any errors introduced, especially of viewpoint, are the author's own. The author of these notes would be grateful for their communication to [email protected]. Contents 1 Root systems 1 1.1 Root space decomposition . .2 1.2 Roots, coroots, and reflections . .3 1.2.1 Abstract root systems . .7 1.2.2 Coroots, fundamental weights and Cartan matrices . .7 1.2.3 Roots vs weights . .9 1.2.4 Roots at the group level . .9 1.3 The Weyl group . 10 1.3.1 Weyl Chambers . 11 1.3.2 The Weyl group as a subquotient for compact Lie groups . 13 1.3.3 The Weyl group as a subquotient for noncompact Lie groups . 13 2 Root data 16 2.1 Root data . 16 2.2 The Langlands dual group . 17 2.3 The flag variety . 18 2.3.1 Bruhat decomposition revisited . 18 2.3.2 Schubert cells . 19 3 Adelic groups 20 3.1 Weyl sets . 20 References 21 1 Root systems The following examples are taken mostly from [8] where they are stated without most of the calculations. -
Sums of Multiplicative Characters with Additive Convolutions
Sums of multiplicative characters with additive convolutions ∗ I. D. Shkredov, A. S. Volostnov Annotation. In the paper we obtain new estimates for binary and ternary sums of multiplica- tive characters with additive convolutions of characteristic functions of sets, having small additive doubling. In particular, we improve a result of M.–C. Chang. The proof uses Croot–Sisask almost periodicity lemma. 1 Introduction Let p be a prime number, Fp be the prime field and χ be a nontrivial multi- plicative character modulo p. In the paper we consider a problem of obtaining good upper bounds for the exponential sum χ(a + b) , (1) a∈XA, b∈B arXiv:1606.00358v1 [math.NT] 1 Jun 2016 where A, B are arbitrary subsets of the field Fp. Exponential sums of such a type were studied by various authors, see e.g. [2], [4], [8]–[10]. There is a well– known hypothesis on sums (1) which is called the graph Paley conjecture, see the history of the question in [2] or [13], for example. Conjecture (Paley graph). Let δ > 0 be a real number, A, B F be ⊂ p arbitrary sets with A > pδ and B > pδ. Then there exists a number | | | | ∗This work is supported by grant Russian Scientific Foundation RSF 14–11–00433. 1 I. D. Shkredov, A. S. Volostnov 2 τ = τ(δ) such that for any sufficiently large prime number p and all nontrivial characters χ the following holds χ(a + b) <p−τ A B . (2) | || | a∈A, b∈B X Let us say a few words about the name of the hypothesis. -
NOTES for NUMBER THEORY COURSE 1. Unique Factorization
NOTES FOR NUMBER THEORY COURSE 1. Unique factorization 1.1. All the rings we consider are assumed to have multiplicative unit 1 and almost always they will be commutative. N, Z, Q, R, C will denote the natural numbers, integers, rational numbers, real numbers and complex numbers respectively. A number α 2 C is called an algebraic number, if there exists a polynomial p(x) 2 Q[x] with p(α) = 0. We shall let Q¯ be the set of all algebraic numbers. Fact: \C and Q¯ are algebraically closed". IF R is a ring R[x1; ··· ; xn] will denote the ring of polynomials in n variables with coeffi- cients in R. The letter k will usually denote a field. If R ⊆ S are rings, and α1; ··· ; αk are elements of S, we shall let R[α1; ··· ; αn] be the subring of S generated by R and α1; ··· ; αn. Here are somep examples of rings R of the type we willp be interested in: R = Z, R = k[x], R = Z[i]( i = −1), R = Z[!](! = e2πi=3), R = Z[ 3], or more generally let R = Z[α], where α is an algebraic number. 1.2. First definitions: principal ideals, prime ideals... An element u 2 R is called an unit if there exists v 2 R such that uv = 1. Such a v is necessarily unique (Why?) and is called the inverse of u. The set of units in R will be denoted by U(R). The units in Z are 1 and −1. There are six units in Z[!] (the sixth roots of unity). -
Arxiv:0804.2233V4 [Math.NT]
October 26, 2018 MEAN VALUES WITH CUBIC CHARACTERS STEPHAN BAIER AND MATTHEW P. YOUNG Abstract. We investigate various mean value problems involving order three primitive Dirichlet characters. In particular, we obtain an asymptotic formula for the first moment of central values of the Dirichlet L-functions associated to this family, with a power saving in the error term. We also obtain a large-sieve type result for order three (and six) Dirichlet characters. 1. Introduction and Main results Dirichlet characters of a given order appear naturally in many applications in number theory. The quadratic characters have seen a lot of attention due to attractive questions to ranks of elliptic curves, class numbers, etc., yet the cubic characters have been relatively neglected. In this article we are interested in mean values of L-functions twisted by characters of order three, and also large sieve-type inequalities for these characters. Our first result on such L-functions is the following Theorem 1.1. Let w : (0, ) R be a smooth, compactly supported function. Then ∞ → q (1) ∗ L( 1 , χ)w = cQw(0) + O(Q37/38+ε), 2 Q (q,3)=1 χ (mod q) X χX3=χ 0 b where c> 0 is a constant that can be given explicitly in terms of an Euler product (see (23) below), and w is the Fourier transform of w. Here the on the sum over χ restricts the sum ∗ to primitive characters, and χ0 denotes the principal character. This resultb is most similar (in terms of method of proof) to the main result of [L], who considered the analogous mean value but for the case of cubic Hecke L-functions on Q(ω), ω = e2πi/3. -
Complex Numbers
APPENDIX Complex Numbers The complex Bumbers are a set of objects which can be added and multiplied, the sum and product of two complex numbers being also a complex number, and satisfy the following conditions. (1) Every real number is a complex number, and if a, ß are real numbers, then their sum and product as complex numbers are the same as their sum and product as real numbers. (2) There is a complex number denoted by i such that i2 = - 1. (3) Every complex number can be written uniquely in the form a + bi where a, b are real numbers. (4) The ordinary laws of arithmetic concerning addition and multipli cation are satisfied. We list these laws: If a, ß, y are complex numbers, then (aß)y = a(ßy) and (a + ß) + Y = a + (ß + y). We have a(ß + y) = aß + ay, and (ß + y)a = ßa + ya. We have aß = ßa, and a + ß = ß + a. If 1 is the real number one, then 1a = a. If 0 is the real number zero, then Oa = o. We have a + (-l)a = o. We shall now draw consequences of these properties. With each complex number a + bi, we associate the vector (a, b) in the plane. Let a = a 1 + a2 i and ß = b1 + b2 i be two complex numbers. Then 278 COMPLEX NUMBERS [APP. I] Hence addition of complex numbers is carried out "componentwise" and corresponds to addition of vectors in the plane. For example, (2 + 3i) + ( - 1 + 5i) = 1 + 8i. In multiplying complex numbers, we use the rule i2 = - 1 to simplify a product and to put it in the form a + bio For instance, let a = 2 + 3i and ß = 1 - i. -
Quadratic Reciprocity Via Linear Algebra
QUADRATIC RECIPROCITY VIA LINEAR ALGEBRA M. RAM MURTY Abstract. We adapt a method of Schur to determine the sign in the quadratic Gauss sum and derive from this, the law of quadratic reciprocity. 1. Introduction Let p and q be odd primes, with p = q. We define the Legendre symbol (p/q) to be 1 if p is a square modulo q and 16 otherwise. The law of quadratic reciprocity, first proved by Gauss in 1801, states− that (p/q)(q/p) = ( 1)(p−1)(q−1)/4. − It reveals the amazing fact that the solvability of the congruence x2 p(mod q) is equivalent to the solvability of x2 q(mod p). ≡ There are many proofs of this law≡ in the literature. Gauss himself published five in his lifetime. But all of them hinge on properties of certain trigonometric sums, now called Gauss sums, and this usually requires substantial background on the part of the reader. We present below a proof, essentially due to Schur [2] that uses only basic notions from linear algebra. We say “essentially” because Schur’s goal was to deduce the sign in the quadratic Gauss sum by studying the matrix A = (ζrs) 0 r n 1, 0 s n 1 ≤ ≤ − ≤ ≤ − where ζ = e2πi/n. For the case of n = p a prime, Schur’s proof is reproduced in [1] and a ‘slicker’ proof was later supplied by Waterhouse [3]. Our point is to show that Schur’s proof can be modified to determine tr A when n is an odd number and this allows us to deduce the law of quadratic reciprocity. -
The Fourth Moment of Dirichlet L-Functions
Annals of Mathematics 173 (2011), 1{50 doi: 10.4007/annals.2011.173.1.1 The fourth moment of Dirichlet L-functions By Matthew P. Young Abstract We compute the fourth moment of Dirichlet L-functions at the central point for prime moduli, with a power savings in the error term. 1. Introduction Estimating moments of families of L-functions is a central problem in number theory due in large part to extensive applications. Yet, these moments are seen to be natural objects to study in their own right as they illuminate structure of the family and display beautiful symmetries. The Riemann zeta function has by far garnered the most attention from researchers. Ingham [Ing26] proved the asymptotic formula Z T 1 1 4 4 3 jζ( 2 + it)j dt = a4(log T ) + O((log T ) ) T 0 2 −1 where a4 = (2π ) . Heath-Brown [HB79] improved this result by obtaining Z T 4 1 1 4 X i − 1 +" (1.1) jζ( + it)j dt = a (log T ) + O(T 8 ) T 2 i 0 i=0 for certain explicitly computable constants ai (see (5.1.4) of [CFK+05]). Ob- taining a power savings in the error term was a significant challenge because it requires a difficult analysis of off-diagonal terms which contribute to the lower-order terms in the asymptotic formula. The fourth moment problem is related to the problem of estimating (1.2) X d(n)d(n + f) n≤x uniformly for f as large as possible with respect to x. Extensive discussion of this binary divisor problem can be found in [Mot94]. -
As an Entire Function; Gauss Sums We First Give, As Promised, the Anal
Math 259: Introduction to Analytic Number Theory L(s; χ) as an entire function; Gauss sums We first give, as promised, the analytic proof of the nonvanishing of L(1; χ) for a Dirichlet character χ mod q; this will complete our proof of Dirichlet's theorem that there are infinitely primes in the arithmetic progression mq+a : m Z>0 whenever (a; q) = 1, and that the logarithmic density of suchf primes is 12='(q).g1 We follow [Serre 1973, Ch. VI 2]. Functions such as ζ(s), L(s; χ) and their products are special cases of whatx Serre calls \Dirichlet series": functions 1 f(s) := a e λns (1) X n − n=1 with an C and 0 λn < λn+1 . [For instance, L(s; χ) is of this form with 2 ≤ !1 λn = log n and an = χ(n).] We assume that the an are small enough that the sum in (1) converges for some s C. We are particularly interested in series such as 2 ζ (s) := L(s; χ) q Y χ mod q whose coefficients an are nonnegative. Then if (1) converges at some real σ0, it converges uniformly on σ σ0, and f(s) is analytic on σ > σ0. Thus a series (1) has a maximal open half-plane≥ of convergence (if we agree to regard C itself as an open half-plane for this purpose), namely σ > σ0 where σ0 is the infimum of the real parts of s C at which (1) converges. This σ0 is then called the \abscissa of convergence"2 2 of (1). -
Sign Ambiguities of Gaussian Sums Heon Kim Louisiana State University and Agricultural and Mechanical College, [email protected]
Louisiana State University LSU Digital Commons LSU Doctoral Dissertations Graduate School 2007 Sign Ambiguities of Gaussian Sums Heon Kim Louisiana State University and Agricultural and Mechanical College, [email protected] Follow this and additional works at: https://digitalcommons.lsu.edu/gradschool_dissertations Part of the Applied Mathematics Commons Recommended Citation Kim, Heon, "Sign Ambiguities of Gaussian Sums" (2007). LSU Doctoral Dissertations. 633. https://digitalcommons.lsu.edu/gradschool_dissertations/633 This Dissertation is brought to you for free and open access by the Graduate School at LSU Digital Commons. It has been accepted for inclusion in LSU Doctoral Dissertations by an authorized graduate school editor of LSU Digital Commons. For more information, please [email protected]. SIGN AMBIGUITIES OF GAUSSIAN SUMS A Dissertation Submitted to the Graduate Faculty of the Louisiana State University and Agricultural and Mechanical College in partial fulfillment of the requirements for the degree of Doctor of Philosophy in The Department of Mathematics by Heon Kim B.S. in Math., Chonbuk National University, 1995 M.S. in Math., Chonbuk National University, 1997 M.A. in Math., University of Georgia, 2002 December 2007 Acknowledgments This dissertation would not be possible without several contributions. The love of family and friends provided my inspiration and was my driving force. It has been a long journey and completing this work is definitely a high point in my academic career. I could not have come this far without the assistance of many individuals and I want to express my deepest appreciation to them. It is a pleasure to thank my dissertation advisor, Dr. Helena Verrill, and coad- visor Dr. -
The Voronoi Formula and Double Dirichlet Series
The Voronoi formula and double Dirichlet series Eren Mehmet Kıral and Fan Zhou May 10, 2016 Abstract We prove a Voronoi formula for coefficients of a large class of L-functions including Maass cusp forms, Rankin-Selberg convolutions, and certain non-cuspidal forms. Our proof is based on the functional equations of L-functions twisted by Dirichlet characters and does not directly depend on automorphy. Hence it has wider application than previous proofs. The key ingredient is the construction of a double Dirichlet series. MSC: 11F30 (Primary), 11F68, 11L05 Keywords: Voronoi formula, automorphic form, Maass form, multiple Dirichlet series, Gauss sum, Kloosterman sum, Rankin-Selberg L-function 1 Introduction A Voronoi formula is an identity involving Fourier coefficients of automorphic forms, with the coefficients twisted by additive characters on either side. A history of the Voronoi formula can be found in [MS04]. Since its introduction in [MS06], the Voronoi formula on GL(3) of Miller and Schmid has become a standard tool in the study of L-functions arising from GL(3), and has found important applications such as [BB], [BKY13], [Kha12], [Li09], [Li11], [LY12], [Mil06], [Mun13] and [Mun15]. As of yet the general GL(N) formula has had fewer applications, a notable one being [KR14]. The first proof of a Voronoi formula on GL(3) was found by Miller and Schmid in [MS06] using the theory of automorphic distributions. Later, a Voronoi formula was established for GL(N) with N ≥ 4 in [GL06], [GL08], and [MS11], with [MS11] being more general and earlier than [GL08] (see the addendum, loc.