Hallgren s Quantum Algorithm for Pell s Equation
|
|
- Nancy Garrett
- 6 years ago
- Views:
Transcription
1 Hallgren s Quantum Algorithm for Pell s Equation Pradeep Sarvepalli pradeep@cs.tamu.edu Department of Computer Science, Texas A&M University Quantum Algorithm for Pell s Equation p. /6
2 Outline Pell s equation Classical method for solving Pell s equation Reformulating the Pell s equation in number theoretic terms Overview of Hallgren s quantum algorithm Hallgren s algorithm Algebraic background Quantum period finding algorithm Classical post processing Putting all the pieces together Quantum Algorithm for Pell s Equation p. 2/6
3 Outline - cont d Applications Class group of a quadratic field Principal ideal problem Generalizations Unit group of a finite extension of Q Class group of a finite extension of Q Principal ideal problem References "Notes on Hallgren s efficient quantum algorithm for solving Pell s equation" by Richard Jozsa "Polynomial time quantum algorithms for Pell s equation and principal ideal problem" by Sean Hallgren Quantum Algorithm for Pell s Equation p. 3/6
4 Pell s Equation Goal is to find finding integral and positive solutions to the following equation x 2 dy 2 = x 2 2y 2 =, Solutions (3, 2); (7, 2);... Has infinite number of solutions Harder than factoring Quantum Algorithm for Pell s Equation p. 4/6
5 Classical Method for Pell s equation Based on continued fractions Approximations of the continued fraction of d give the solution Example x 2 2y 2 =, 2 = = 3 2 = x y Observe that = 9 8 = Quantum Algorithm for Pell s Equation p. 5/6
6 Continued Fraction Method Why does this work? Is every approximation a solution? What is the complexity of the algorithm? Quantum Algorithm for Pell s Equation p. 6/6
7 Continued Fraction Method - cont d Example - cont d = = 7 5 = x y = = = 7 2 = x y = 49 5 = = = Quantum Algorithm for Pell s Equation p. 7/6
8 Continued Fraction Method - cont d Not every approximation gives a solution to the Pell s equation We might have to take many terms in the continued fraction before we get the solution Typically if we use the input size as log d, size of the solution will be O( d) O(e log d ) Quantum Algorithm for Pell s Equation p. 8/6
9 A Close Look at the Solutions Every solution can be uniquely identified with x + y d, x,y > Smallest solution with x + y d is called the Fundamental solution x + y d Every other solution can be obtained as power of the fundamental solution x + y d = (x + y d) n It suffices to compute the fundamental solution Quantum Algorithm for Pell s Equation p. 9/6
10 A Closer Look at the Solutions d x Quantum Algorithm for Pell s Equation p. /6
11 Regulator O(x + y d) = O(e d ) Just to write down the solution will take exponential amount of write operations We will rather compute a representation of the solution Regulator R d = ln(x + y d), and x + y d is the smallest in magnitude of all solutions R d being irrational is computed to n digit accuracy Even for this reduced problem the best classical algorithm has a running time O(e log d poly(n)) Quantum Algorithm for Pell s Equation p. /6
12 Overview of Hallgren s Algorithm Reformulate the Pell s equation as a period finding problem Form a function h(x) with period R d Modify the quantum period finding algorithm to find irrational period The quantum part of the algorithm Computes only the integral part of R d Perform classical post processing given the integral part of R d Compute the fractional part of R d making use of the integral part of R d provided by the previous step Quantum Algorithm for Pell s Equation p. 2/6
13 Some Algebraic Number Theory Let Q( d) = {a + b d a,b Q} The solutions of Pell s equation are elements in Q( d) O is called the ring of algebraic integers O = {a Q( d) f(a) =,f(x) Z[x]} Z[x] consists of polynomials with integral coefficients Units of O are elements in O that they have multiplicative inverses O = { Units of O} = {u O u exists } Quantum Algorithm for Pell s Equation p. 3/6
14 Algebraic Number Theory - cont d x + y d is a solution of x 2 dy 2 = if and only if x + y d is a unit of O ǫ o smallest unit in O, with ǫ o > O = {±ǫ k o k Z} R d = lnǫ o All the solutions of x 2 dy 2 can be obtained from the fundamental unit ǫ o Quantum Algorithm for Pell s Equation p. 4/6
15 Algebraic Number Theory - cont d Product of sets A,B Q( d), then A B = { n i= a i b i n >,a i A,b i B} Ideal I Q( d) such that I O = I Integral Ideal I O Fractional Ideal I Q( d) Principal Ideal I = γo If ǫ O, then ǫo = O Equality of ideals αo = βo if and only if α = βǫ, where ǫ is a unit in O Quantum Algorithm for Pell s Equation p. 5/6
16 Reformulating Pell s equation Let P = {γo γ Q( d)} Consider g : R P g(x) = e x O = I x g(x) is periodic with R d g(x + kr d ) = e x+kr d O, = e x ǫ k oo = e x O = g(x) Quantum Algorithm for Pell s Equation p. 6/6
17 Using a periodic function to find R d Naive algorithm to compute R d Find g(x) = I x Find y > x such that g(y) = I x y x = kr d Another naive algorithm Assume that the ideals could be ordered somehow Given I x find g (I x ) Find an ideal I y next to I x such that I y = I x g (I y ) g (I x ) = kr d Quantum Algorithm for Pell s Equation p. 7/6
18 Problems with the Naive Algorithms y > e R d is exponentially large in log d I x is an infinite set, comparing two ideals poses problem There are infinitely many ideals between x,x + δ for which I x = I x+δ, Q( d) and P are both dense We need to somehow order the ideals We need to move from one ideal to another Finite precision arithmetic Quantum Algorithm for Pell s Equation p. 8/6
19 More Algebraic Number Theory O is a Z-module, so it behaves like a vector space O = m + n D + { D d, d mod 4,D = 2 4d, d 2, 3 mod 4, O = Z + D + D 2 Z For any principal ideal I = γo I = γz + γ D + D 2 Z Quantum Algorithm for Pell s Equation p. 9/6
20 Comparing Principal Ideals The basis is not unique, we can rewrite I as ( I = k az + b + ) D Z 2 a < b a, a > D D a < b D, a < D Presentation of an ideal is the triplet (a,b,k) which is computable in polynomial time given γ. Addresses the problem of comparing infinite sets. Equality of ideals is equivalent to having the same presentation Quantum Algorithm for Pell s Equation p. 2/6
21 Discretizing Ideals Reduced principal ideals have the form I = Z + b + D 2 Reduced principal ideals are finite in number Addresses the problem of density of sets Q( d) and P Cycle of Reduced Principal Ideals Z J = {O = J,J,...,J m } Quantum Algorithm for Pell s Equation p. 2/6
22 Moving Among Ideals I = Z + γz, then define ρ(i) = γ I Gives another principal ideal If I J then ρ(i) J If repeated then finally it gives a reduced principal ideal If I was reduced principal ideal ρ(i)is another reduced principal ideal Since there are a finite number of reduced principal ideals it cycles Quantum Algorithm for Pell s Equation p. 22/6
23 Moving Among Ideals - cont d σ(i) : d d Inverse operation of moving back is given by ρ = σρσ This addresses the problem of moving between the ideals back and forth Quantum Algorithm for Pell s Equation p. 23/6
24 Ordering Ideals Let I y = γi x. Then the distance between I y and I x is δ(i x,i y ) = lnγ Distance from O: δ(e x O) = δ(o,e x O) = lne x = x Distance allows us to order the ideals along the number line in the same form as the input x Addresses the problems of invertibility and ordering If I x = I y, then δ(i x,i y ) = y x = kr d δ(i, ρ(i)) can be computed in polynomial time Quantum Algorithm for Pell s Equation p. 24/6
25 Spacing of Ideals δ(j i,j i+ ) 3 32D δ(j i,j i+2 ) ln 2 δ(j i,j i+ ) 2 ln D If we succesively apply ρ to a non reduced ideal I, until we just get a reduced principal ideal I red, then and I red {J k,j k,j k+ } δ(i,i red ) ln D Quantum Algorithm for Pell s Equation p. 25/6
26 Jumping Across Ideals We note that the ideals are exponential in number so moving across efficiently requires more than use of reduction operator ρ Use the product of ideals to move faster than ρ I I 2 is much farther from O than either of I,I 2 δ(i I 2 ) = δ(i ) + δ(i 2 ) Product of ideals is not necessarily reduced so we reduce it to bring it back to the principal cycle of reduced ideals We denote this operation by Quantum Algorithm for Pell s Equation p. 26/6
27 Review We need positive, intgeral solutions for x 2 dy 2 = Each solution can be encoded as x + y d an element in Q( d) All solutions can be obtained from the smallest solution x + y d We introduced the Regulator R d = ln(x + y d) Quantum Algorithm for Pell s Equation p. 27/6
28 Review - cont d Every solution is an element of Q( d) More specifically every solution is also an element of the ring of algebraic integers in Q( d) A solution of Pell s equation is precisely the set elements in O which have multiplicative inverses Our goal is to compute the generator of this subgroup which is precisely the regulator R d Quantum Algorithm for Pell s Equation p. 28/6
29 Review - cont d Quadratic Number Field Solutions Pell s Eqn Quantum Algorithm for Pell s Equation p. 29/6
30 Review - cont d Quadratic Number Field Algebraic Integes, O Solutions Pell s Eqn Quantum Algorithm for Pell s Equation p. 3/6
31 Review - cont d Quadratic Number Field Algebraic Integes, O Solutions Pell s Eqn Unit group of O Quantum Algorithm for Pell s Equation p. 3/6
32 Review - cont d Quadratic Number Field Algebraic Integes, O Solutions Pell s Eqn Unit group of O Quantum Algorithm for Pell s Equation p. 32/6
33 Review - cont d We then defined the ideals as special sets in Q( d) which are loosely speaking closed under addition and multiplication A special type of ideals are the principal ideals which take the form I = γo We defined a periodic function that is periodic with R d from R to the set of principal reduced ideals They can all be ordered with respect to their distance from O We can move among the ideals using ρ and ρ We have a means of moving from one ideal to another exponentially large steps Quantum Algorithm for Pell s Equation p. 33/6
34 Review - cont d Quadratic Number Field Algebraic Integes, O Principal Ideals Ideals closed under +,x Reduced Principal Ideals Quantum Algorithm for Pell s Equation p. 34/6
35 Review - cont d Quadratic Number Field Algebraic Integes, O Principal Ideals Ideals closed under +,x Reduced Principal Ideals I ρ(ι) ρ (Ι) Quantum Algorithm for Pell s Equation p. 35/6
36 Hallgren s Periodic Function q 2 /N NR J J2 O O=J =J J J2 J (O,x) (O,,x2) (O,x) (J,x3) h(x) = (g(x),x δ(g(x))) = (I x,x δ(i x )) I x is the nearest reduced principal ideal to the left of x i.e, δ(i x ) < x h(x) is periodic with R d h(x) is one to one Quantum Algorithm for Pell s Equation p. 36/6
37 Hallgren s Periodic Function 2 3 NR X J J J2 J Principal Ideals I_x δ(ι) h(x)=(i,,δ(ι)) h(x) = (g(x),x δ(g(x))) = (I x,x δ(i x )) Quantum Algorithm for Pell s Equation p. 37/6
38 Discretizing h(x) For practical implementation we would like to discretize h(x) Assuming that x is discretized with a step of /N the discretized function h N (k) = h(k/n) N h N (k) is weakly periodic with P = NR d h N (k + lnr d ) = h N (k) or h N (k + lnr d ) = h N (k) Quantum Algorithm for Pell s Equation p. 38/6
39 Hallgren s Periodic Function 2 3 NR X J J J2 J Principal Ideals I_x δ(ι) h(x)=(i,,δ(ι)) After discretization h(x) is weakly periodic not periodic Quantum Algorithm for Pell s Equation p. 39/6
40 Quantum Period Finding Algorithms A state in superposition Transformation to a state with a suitable function Partial measurement Fourier transform to get rid of offset Measurement Classical post processing Quantum Algorithm for Pell s Equation p. 4/6
41 Hallgren s Period Finding Algorithm Form is an uniform superpostion of q states where q = pnr d + r ψ = q q j= j Compute h N ( ψ ) q 2 /N NR J J2 O O=J =J J J2 J Quantum Algorithm for Pell s Equation p. 4/6
42 Superposition h N ψ = q q j= j h N (j) q 2 /N NR J J2 O O=J =J J J2 J (O,x) (O,,x2) (O,x) (J,x3) Quantum Algorithm for Pell s Equation p. 42/6
43 Partial Measurement h() h() h(2) h(3) h() h() h(2) h(3) h() h() h(2) h(3) h() h() h(2) h(3) h() h() h N ψ = NR d q j= ( p l= j + [lnr d ] ) h N (j) Measure the second register, say we measure h N (k) h() h() h(2) h(3) h() h() h(2) h(3) h() h() h(2) h(3) h() h() h(2) h(3) h() h() h(2) h(2) h(2) h(2) Quantum Algorithm for Pell s Equation p. 43/6
44 Partial Measurement - cont d After Measurement First Register (2) Second Register (2+NR) (2+2NR) (2+3NR) h(2) h(2) h(2) h(2) On measurement the state will collapse to ψ = p p n= k + [nnr d ] h N (k) Quantum Algorithm for Pell s Equation p. 44/6
45 QFT to Remove Offset Take the Quantum Fourier transform F ψ = = p pq q j= n= a j j q j= e 2πi(k+[nNR d]) j, Register after Quantum Fourier Transform Assumes q=pnr Probability /p=nr/q q/nr 2q/NR 3q/NR 4q/NR 5q/NR Quantum Algorithm for Pell s Equation p. 45/6
46 QFT - cont d Register after Quantum Fourier Transform Assumes q=nr Probability /p=nr/q q/nr 2q/NR 3q/NR 4q/NR 5q/NR Assumes q=nr+r Probability Prob(lq/NR) < /p q/nr 2q/NR 3q/NR 4q/NR 5q/NR Quantum Algorithm for Pell s Equation p. 46/6
47 Identifying Periodicity Register after Quantum Fourier Transform Assumes q=nr+r Probability Prob(lq/NR) < /p q/nr 2q/NR 3q/NR 4q/NR 5q/NR We are interested in j = lq/nr j is small, more precisely, j < Prob(j) must be large q log NR d Quantum Algorithm for Pell s Equation p. 47/6
48 Identifying Periodicity - cont d For sufficiently large q 3(NR d ) 2, many j such that j is a multiple of q/nr d j < q log NR d Probability of such j is highly likely, α a constant Prob(j) > α log NR d, Quantum Algorithm for Pell s Equation p. 48/6
49 Extracting Periodicity But how do we extract the periodicity from the state? Measure and repeat to get another measurement such that c = [kq/nr d ] d = [lq/nr d ] We do not know k,l,r d Compute the convergents of c d c d a b < 2b 2 Quantum Algorithm for Pell s Equation p. 49/6
50 Extracting Periodicity - cont d Compute the convergents of c/d then for some n c = [ kq NR d ] = kq NR d Estimate the period as k l = c n d n and k = c n, NR d = [ kq c ] Check if NR d = c n q/c satisfies lr d NR d < Quantum Algorithm for Pell s Equation p. 5/6
51 Extracting Periodicity - cont d NR 2 NR NR NR+ NR+2 4 ρ (Ο) 3 ρ (Ο) 2 ρ (Ο) ρ (Ο) Ο ρ(ο) 2 ρ (Ο) 3 ρ (Ο) 4 ρ (Ο) If NR d jr d <, then h(nr d ) is an ideal among {ρ 4 (O),ρ 3 (O),...,O,...,ρ 3 (O),ρ 4 (O)} Because δ(i,ρ 2 (I)) > ln 2 >.693 Quantum Algorithm for Pell s Equation p. 5/6
52 Integral Part of R d Integral part of R d R d = NRd N We know R d to a precision /N With probability / poly(log NR d ) this algorithm will return NR d such that NR d NR d < Quantum Algorithm for Pell s Equation p. 52/6
53 Computing the Fractional part of R d Given R d Compute h( R d ) = (I x,x δ(i x )) NR 2 NR NR 4 ρ (Ο) 3 ρ (Ο) 2 ρ (Ο) ρ (Ο) Ο >.693 >.693 We know that δ(i,ρ 2 (I)) > ln 2 =.693 Quantum Algorithm for Pell s Equation p. 53/6
54 Computing the Fractional part of R d - c NR 2 NR NR 4 ρ (Ο) 3 ρ (Ο) 2 ρ (Ο) ρ (Ο) Ο >.693 >.693 Therefore δ(i,ρ 4 (I)) > 2 ln 2 > R d This implies that O must be one of the ideals {ρ 3 (O),ρ 2 (O),ρ (O), O} δ(i, O)) can be computed in polynomial and this gives the fractional part of R d Quantum Algorithm for Pell s Equation p. 54/6
55 Summary of the Algorithm Start with a superpostion of inputs Compute Hallgren s periodic fucntion for all these inputs Perform partial measurement Perform QFT to get rid of offset Perform a measurement to get c Repeat to get another value d Extract the Integral part of R d Compute the fractional part of R d Quantum Algorithm for Pell s Equation p. 55/6
56 Applications Principal Ideal Problem Given an ideal determine if it is a principal ideal Class Group structure Determine the structure of the group I inv /P Quantum Algorithm for Pell s Equation p. 56/6
57 Principal Ideal Problem Recall an ideal I Q( d) such that I O = I Principal ideal I = γo All ideals of the form I = αz + βz Given an ideal, decide if there exists a γ such that I = γo Quantum Algorithm for Pell s Equation p. 57/6
58 Computing the Class Group Invertible ideals An ideal I is called invertible if there exists another ideal J such that I J = O Let I = {I I exists } P = {I I = γo} Let C = I/P C is a finite abelian group and called the class group Class group problem is to determine the structure of C Quantum Algorithm for Pell s Equation p. 58/6
59 Generalizations A general problem is to compute the unit group of a O Q(θ) where [Q(θ) : Q] = n For Pell s equation n = 2 Similarly the class group and the principal ideal problem also can be generalized Two algorithms for the same have appeared recently by Hallgren and Vollmer, Schmidt independetly this year Quantum Algorithm for Pell s Equation p. 59/6
60 Questions? Quantum Algorithm for Pell s Equation p. 6/6
61 Questions? Thank You Quantum Algorithm for Pell s Equation p. 6/6
arxiv:quant-ph/ v1 18 Feb 2003
Notes on Hallgren s efficient quantum algorithm for solving Pell s equation Richard Jozsa Department of Computer Science, University of Bristol, Merchant Venturers Building, Bristol BS8 1UB U.K. arxiv:quant-ph/030134v1
More informationAlgorithms for ray class groups and Hilbert class fields
(Quantum) Algorithms for ray class groups and Hilbert class fields Sean Hallgren joint with Kirsten Eisentraeger Penn State 1 Quantum Algorithms Quantum algorithms for number theoretic problems: Factoring
More informationFactoring integers with a quantum computer
Factoring integers with a quantum computer Andrew Childs Department of Combinatorics and Optimization and Institute for Quantum Computing University of Waterloo Eighth Canadian Summer School on Quantum
More informationShor s Algorithm. Elisa Bäumer, Jan-Grimo Sobez, Stefan Tessarini May 15, 2015
Shor s Algorithm Elisa Bäumer, Jan-Grimo Sobez, Stefan Tessarini May 15, 2015 Integer factorization n = p q (where p, q are prime numbers) is a cryptographic one-way function Classical algorithm with best
More informationPh 219b/CS 219b. Exercises Due: Wednesday 11 February 2009
1 Ph 219b/CS 219b Exercises Due: Wednesday 11 February 2009 5.1 The peak in the Fourier transform In the period finding algorithm we prepared the periodic state A 1 1 x 0 + jr, (1) A j=0 where A is the
More information5.6 Logarithmic and Exponential Equations
SECTION 5.6 Logarithmic and Exponential Equations 305 5.6 Logarithmic and Exponential Equations PREPARING FOR THIS SECTION Before getting started, review the following: Solving Equations Using a Graphing
More informationShor s Algorithm. Polynomial-time Prime Factorization with Quantum Computing. Sourabh Kulkarni October 13th, 2017
Shor s Algorithm Polynomial-time Prime Factorization with Quantum Computing Sourabh Kulkarni October 13th, 2017 Content Church Thesis Prime Numbers and Cryptography Overview of Shor s Algorithm Implementation
More informationSkill 6 Exponential and Logarithmic Functions
Skill 6 Exponential and Logarithmic Functions Skill 6a: Graphs of Exponential Functions Skill 6b: Solving Exponential Equations (not requiring logarithms) Skill 6c: Definition of Logarithms Skill 6d: Graphs
More informationTeacher: Mr. Chafayay. Name: Class & Block : Date: ID: A. 3 Which function is represented by the graph?
Teacher: Mr hafayay Name: lass & lock : ate: I: Midterm Exam Math III H Multiple hoice Identify the choice that best completes the statement or answers the question Which function is represented by the
More informationQuantum Computing Lecture Notes, Extra Chapter. Hidden Subgroup Problem
Quantum Computing Lecture Notes, Extra Chapter Hidden Subgroup Problem Ronald de Wolf 1 Hidden Subgroup Problem 1.1 Group theory reminder A group G consists of a set of elements (which is usually denoted
More information1. Group Theory Permutations.
1.1. Permutations. 1. Group Theory Problem 1.1. Let G be a subgroup of S n of index 2. Show that G = A n. Problem 1.2. Find two elements of S 7 that have the same order but are not conjugate. Let π S 7
More informationChapter 7: Exponents
Chapter : Exponents Algebra Chapter Notes Name: Notes #: Sections.. Section.: Review Simplify; leave all answers in positive exponents:.) m -.) y -.) m 0.) -.) -.) - -.) (m ) 0.) 0 x y Evaluate if a =
More informationPhase estimation. p. 1/24
p. 1/24 Phase estimation Last time we saw how the quantum Fourier transform made it possible to find the period of a function by repeated measurements and the greatest common divisor (GCD) algorithm. We
More information4.1 Exponential Functions
Graduate T.A. Department of Mathematics Dynamical Systems and Chaos San Diego State University April 9, 211 Definitions The functions that involve some combinations of basic arithmetic operations, powers,
More informationFoundations of Cryptography
Foundations of Cryptography Ville Junnila viljun@utu.fi Department of Mathematics and Statistics University of Turku 2015 Ville Junnila viljun@utu.fi Lecture 7 1 of 18 Cosets Definition 2.12 Let G be a
More information7.1 Exponential Functions
7.1 Exponential Functions 1. What is 16 3/2? Definition of Exponential Functions Question. What is 2 2? Theorem. To evaluate a b, when b is irrational (so b is not a fraction of integers), we approximate
More informationPublic-key Cryptography: Theory and Practice
Public-key Cryptography Theory and Practice Department of Computer Science and Engineering Indian Institute of Technology Kharagpur Chapter 2: Mathematical Concepts Divisibility Congruence Quadratic Residues
More informationShor s Prime Factorization Algorithm
Shor s Prime Factorization Algorithm Bay Area Quantum Computing Meetup - 08/17/2017 Harley Patton Outline Why is factorization important? Shor s Algorithm Reduction to Order Finding Order Finding Algorithm
More informationAlgebraic structures I
MTH5100 Assignment 1-10 Algebraic structures I For handing in on various dates January March 2011 1 FUNCTIONS. Say which of the following rules successfully define functions, giving reasons. For each one
More informationSkill 6 Exponential and Logarithmic Functions
Skill 6 Exponential and Logarithmic Functions Skill 6a: Graphs of Exponential Functions Skill 6b: Solving Exponential Equations (not requiring logarithms) Skill 6c: Definition of Logarithms Skill 6d: Graphs
More information4 Exponential and Logarithmic Functions
4 Exponential and Logarithmic Functions 4.1 Exponential Functions Definition 4.1 If a > 0 and a 1, then the exponential function with base a is given by fx) = a x. Examples: fx) = x, gx) = 10 x, hx) =
More informationOutline of the Seminar Topics on elliptic curves Saarbrücken,
Outline of the Seminar Topics on elliptic curves Saarbrücken, 11.09.2017 Contents A Number theory and algebraic geometry 2 B Elliptic curves 2 1 Rational points on elliptic curves (Mordell s Theorem) 5
More informationComputations/Applications
Computations/Applications 1. Find the inverse of x + 1 in the ring F 5 [x]/(x 3 1). Solution: We use the Euclidean Algorithm: x 3 1 (x + 1)(x + 4x + 1) + 3 (x + 1) 3(x + ) + 0. Thus 3 (x 3 1) + (x + 1)(4x
More informationPh 219b/CS 219b. Exercises Due: Wednesday 4 December 2013
1 Ph 219b/CS 219b Exercises Due: Wednesday 4 December 2013 4.1 The peak in the Fourier transform In the period finding algorithm we prepared the periodic state A 1 1 x 0 + jr, (1) A j=0 where A is the
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include
PUTNAM TRAINING POLYNOMIALS (Last updated: December 11, 2017) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
More informationExamples 2: Composite Functions, Piecewise Functions, Partial Fractions
Examples 2: Composite Functions, Piecewise Functions, Partial Fractions September 26, 206 The following are a set of examples to designed to complement a first-year calculus course. objectives are listed
More informationx x 1 x 2 + x 2 1 > 0. HW5. Text defines:
Lecture 15: Last time: MVT. Special case: Rolle s Theorem (when f(a) = f(b)). Recall: Defn: Let f be defined on an interval I. f is increasing (or strictly increasing) if whenever x 1, x 2 I and x 2 >
More informationPage Points Possible Points. Total 200
Instructions: 1. The point value of each exercise occurs adjacent to the problem. 2. No books or notes or calculators are allowed. Page Points Possible Points 2 20 3 20 4 18 5 18 6 24 7 18 8 24 9 20 10
More informationMINKOWSKI THEORY AND THE CLASS NUMBER
MINKOWSKI THEORY AND THE CLASS NUMBER BROOKE ULLERY Abstract. This paper gives a basic introduction to Minkowski Theory and the class group, leading up to a proof that the class number (the order of the
More informationTHE JOHNS HOPKINS UNIVERSITY Faculty of Arts and Sciences FINAL EXAM - SPRING SESSION ADVANCED ALGEBRA II.
THE JOHNS HOPKINS UNIVERSITY Faculty of Arts and Sciences FINAL EXAM - SPRING SESSION 2006 110.402 - ADVANCED ALGEBRA II. Examiner: Professor C. Consani Duration: 3 HOURS (9am-12:00pm), May 15, 2006. No
More informationThe 70th William Lowell Putnam Mathematical Competition Saturday, December 5, 2009
The 7th William Lowell Putnam Mathematical Competition Saturday, December 5, 9 A1 Let f be a real-valued function on the plane such that for every square ABCD in the plane, f(a) + f(b) + f(c) + f(d) =.
More informationCompute the Fourier transform on the first register to get x {0,1} n x 0.
CS 94 Recursive Fourier Sampling, Simon s Algorithm /5/009 Spring 009 Lecture 3 1 Review Recall that we can write any classical circuit x f(x) as a reversible circuit R f. We can view R f as a unitary
More informationElliptic Curves and Public Key Cryptography
Elliptic Curves and Public Key Cryptography Jeff Achter January 7, 2011 1 Introduction to Elliptic Curves 1.1 Diophantine equations Many classical problems in number theory have the following form: Let
More informationControlling the Population
Lesson.1 Skills Practice Name Date Controlling the Population Adding and Subtracting Polynomials Vocabulary Match each definition with its corresponding term. 1. polynomial a. a polynomial with only 1
More informationMS 3011 Exercises. December 11, 2013
MS 3011 Exercises December 11, 2013 The exercises are divided into (A) easy (B) medium and (C) hard. If you are particularly interested I also have some projects at the end which will deepen your understanding
More informationUSING SHANKS BABY-STEP GIANT-STEP METHOD TO SOLVE THE GENERALIZED PELL EQUATION x 2 Dy 2 = N. Copyright 2009 by John P. Robertson. 1.
USING SHANKS BABY-STEP GIANT-STEP METHOD TO SOLVE THE GENERALIZED PELL EQUATION x 2 Dy 2 = N Abstract. For D > 0 not a square, and N 0, the continued fraction algorithm can be used to solve the generalized
More informationGeorgia Department of Education Common Core Georgia Performance Standards Framework CCGPS Advanced Algebra Unit 2
Polynomials Patterns Task 1. To get an idea of what polynomial functions look like, we can graph the first through fifth degree polynomials with leading coefficients of 1. For each polynomial function,
More informationa factors The exponential 0 is a special case. If b is any nonzero real number, then
0.1 Exponents The expression x a is an exponential expression with base x and exponent a. If the exponent a is a positive integer, then the expression is simply notation that counts how many times the
More informationf(x) = 2x + 5 3x 1. f 1 (x) = x + 5 3x 2. f(x) = 102x x
1. Let f(x) = x 3 + 7x 2 x 2. Use the fact that f( 1) = 0 to factor f completely. (2x-1)(3x+2)(x+1). 2. Find x if log 2 x = 5. x = 1/32 3. Find the vertex of the parabola given by f(x) = 2x 2 + 3x 4. (Give
More informationLecture 5 - Logarithms, Slope of a Function, Derivatives
Lecture 5 - Logarithms, Slope of a Function, Derivatives 5. Logarithms Note the graph of e x This graph passes the horizontal line test, so f(x) = e x is one-to-one and therefore has an inverse function.
More informationA Local-Global Principle for Diophantine Equations
A Local-Global Principle for Diophantine Equations (Extended Abstract) Richard J. Lipton and Nisheeth Vishnoi {rjl,nkv}@cc.gatech.edu Georgia Institute of Technology, Atlanta, GA 30332, USA. Abstract.
More informationExplicit Methods in Algebraic Number Theory
Explicit Methods in Algebraic Number Theory Amalia Pizarro Madariaga Instituto de Matemáticas Universidad de Valparaíso, Chile amaliapizarro@uvcl 1 Lecture 1 11 Number fields and ring of integers Algebraic
More informationSection Properties of Rational Expressions
88 Section. - Properties of Rational Expressions Recall that a rational number is any number that can be written as the ratio of two integers where the integer in the denominator cannot be. Rational Numbers:
More informationUnit 3: HW3.5 Sum and Product
Unit 3: HW3.5 Sum and Product Without solving, find the sum and product of the roots of each equation. 1. x 2 8x + 7 = 0 2. 2x + 5 = x 2 3. -7x + 4 = -3x 2 4. -10x 2 = 5x - 2 5. 5x 2 2x 3 4 6. 1 3 x2 3x
More informationSCORE BOOSTER JAMB PREPARATION SERIES II
BOOST YOUR JAMB SCORE WITH PAST Polynomials QUESTIONS Part II ALGEBRA by H. O. Aliu J. K. Adewole, PhD (Editor) 1) If 9x 2 + 6xy + 4y 2 is a factor of 27x 3 8y 3, find the other factor. (UTME 2014) 3x
More informationMarch Algebra 2 Question 1. March Algebra 2 Question 1
March Algebra 2 Question 1 If the statement is always true for the domain, assign that part a 3. If it is sometimes true, assign it a 2. If it is never true, assign it a 1. Your answer for this question
More informationMath 40510, Algebraic Geometry
Math 40510, Algebraic Geometry Problem Set 1, due February 10, 2016 1. Let k = Z p, the field with p elements, where p is a prime. Find a polynomial f k[x, y] that vanishes at every point of k 2. [Hint:
More informationELG 5372 Error Control Coding. Lecture 12: Ideals in Rings and Algebraic Description of Cyclic Codes
ELG 5372 Error Control Coding Lecture 12: Ideals in Rings and Algebraic Description of Cyclic Codes Quotient Ring Example + Quotient Ring Example Quotient Ring Recall the quotient ring R={,,, }, where
More information1 Functions, Graphs and Limits
1 Functions, Graphs and Limits 1.1 The Cartesian Plane In this course we will be dealing a lot with the Cartesian plane (also called the xy-plane), so this section should serve as a review of it and its
More informationLecture 13: Series Solutions near Singular Points
Lecture 13: Series Solutions near Singular Points March 28, 2007 Here we consider solutions to second-order ODE s using series when the coefficients are not necessarily analytic. A first-order analogy
More informationAlgebra Homework, Edition 2 9 September 2010
Algebra Homework, Edition 2 9 September 2010 Problem 6. (1) Let I and J be ideals of a commutative ring R with I + J = R. Prove that IJ = I J. (2) Let I, J, and K be ideals of a principal ideal domain.
More informationPractice problems for first midterm, Spring 98
Practice problems for first midterm, Spring 98 midterm to be held Wednesday, February 25, 1998, in class Dave Bayer, Modern Algebra All rings are assumed to be commutative with identity, as in our text.
More informationFactoring on a Quantum Computer
Factoring on a Quantum Computer The Essence Shor s Algorithm Wolfgang Polak wp@pocs.com Thanks to: Eleanor Rieffel Fuji Xerox Palo Alto Laboratory Wolfgang Polak San Jose State University, 4-14-010 - p.
More informationLESSON RELATIONS & FUNCTION THEORY
2 Definitions LESSON RELATIONS & FUNCTION THEORY Ordered Pair Ordered pair of elements taken from any two sets P and Q is a pair of elements written in small brackets and grouped together in a particular
More informationUNIT 1 EQUATIONS, INEQUALITIES, FUNCTIONS
UNIT 1 EQUATIONS, INEQUALITIES, FUNCTIONS Act 1 Act 2 A rental car company charges $50.00 per day, plus $0.05 per mile driven. Write a function to model the story. How far did Angie drive if she rented
More informationCourse 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra
Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................
More informationCalculus I Exam 1 Review Fall 2016
Problem 1: Decide whether the following statements are true or false: (a) If f, g are differentiable, then d d x (f g) = f g. (b) If a function is continuous, then it is differentiable. (c) If a function
More informationQuantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 6: Quantum query complexity of the HSP
Quantum algorithms (CO 78, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 6: Quantum query complexity of the HSP So far, we have considered the hidden subgroup problem in abelian groups.
More information14 Increasing and decreasing functions
14 Increasing and decreasing functions 14.1 Sketching derivatives READING Read Section 3.2 of Rogawski Reading Recall, f (a) is the gradient of the tangent line of f(x) at x = a. We can use this fact to
More informationTHE GROUP OF UNITS OF SOME FINITE LOCAL RINGS I
J Korean Math Soc 46 (009), No, pp 95 311 THE GROUP OF UNITS OF SOME FINITE LOCAL RINGS I Sung Sik Woo Abstract The purpose of this paper is to identify the group of units of finite local rings of the
More informationfor every x in the gomain of g
Section.7 Definition of Inverse Function Let f and g be two functions such that f(g(x)) = x for every x in the gomain of g and g(f(x)) = x for every x in the gomain of f Under these conditions, the function
More informationAMBIGUOUS FORMS AND IDEALS IN QUADRATIC ORDERS. Copyright 2009 Please direct comments, corrections, or questions to
AMBIGUOUS FORMS AND IDEALS IN QUADRATIC ORDERS JOHN ROBERTSON Copyright 2009 Please direct comments, corrections, or questions to jpr2718@gmail.com This note discusses the possible numbers of ambiguous
More informationObjectives. Use the number e to write and graph exponential functions representing realworld
Objectives Use the number e to write and graph exponential functions representing realworld situations. Solve equations and problems involving e or natural logarithms. natural logarithm Vocabulary natural
More informationShor Factorization Algorithm
qitd52 Shor Factorization Algorithm Robert B. Griffiths Version of 7 March 202 References: Mermin = N. D. Mermin, Quantum Computer Science (Cambridge University Press, 2007), Ch. 3 QCQI = M. A. Nielsen
More informationChapter 3. Rings. The basic commutative rings in mathematics are the integers Z, the. Examples
Chapter 3 Rings Rings are additive abelian groups with a second operation called multiplication. The connection between the two operations is provided by the distributive law. Assuming the results of Chapter
More informationLINEAR ALGEBRA (PMTH213) Tutorial Questions
Tutorial Questions The tutorial exercises range from revision and routine practice, through lling in details in the notes, to applications of the theory. While the tutorial problems are not compulsory,
More informationComposition of Functions
Math 120 Intermediate Algebra Sec 9.1: Composite and Inverse Functions Composition of Functions The composite function f g, the composition of f and g, is defined as (f g)(x) = f(g(x)). Recall that a function
More informationA Generalization of Wilson s Theorem
A Generalization of Wilson s Theorem R. Andrew Ohana June 3, 2009 Contents 1 Introduction 2 2 Background Algebra 2 2.1 Groups................................. 2 2.2 Rings.................................
More informationFrom the Shortest Vector Problem to the Dihedral Hidden Subgroup Problem
From the Shortest Vector Problem to the Dihedral Hidden Subgroup Problem Curtis Bright December 9, 011 Abstract In Quantum Computation and Lattice Problems [11] Oded Regev presented the first known connection
More informationIntroduction to Quantum Computing
Introduction to Quantum Computing Part II Emma Strubell http://cs.umaine.edu/~ema/quantum_tutorial.pdf April 13, 2011 Overview Outline Grover s Algorithm Quantum search A worked example Simon s algorithm
More informationAbstract Algebra: Chapters 16 and 17
Study polynomials, their factorization, and the construction of fields. Chapter 16 Polynomial Rings Notation Let R be a commutative ring. The ring of polynomials over R in the indeterminate x is the set
More informationChapter 8. Exploring Polynomial Functions. Jennifer Huss
Chapter 8 Exploring Polynomial Functions Jennifer Huss 8-1 Polynomial Functions The degree of a polynomial is determined by the greatest exponent when there is only one variable (x) in the polynomial Polynomial
More informationLattices. A Lattice is a discrete subgroup of the additive group of n-dimensional space R n.
Lattices A Lattice is a discrete subgroup of the additive group of n-dimensional space R n. Lattices have many uses in cryptography. They may be used to define cryptosystems and to break other ciphers.
More information(IV.C) UNITS IN QUADRATIC NUMBER RINGS
(IV.C) UNITS IN QUADRATIC NUMBER RINGS Let d Z be non-square, K = Q( d). (That is, d = e f with f squarefree, and K = Q( f ).) For α = a + b d K, N K (α) = α α = a b d Q. If d, take S := Z[ [ ] d] or Z
More informationOn the Complexity of Computing Units in a Number Field
On the Complexity of Computing Units in a Number Field V. Arvind and Piyush P Kurur Institute of Mathematical Sciences C.I.T Campus,Chennai, India 600 113 {arvind,ppk}@imsc.res.in August 2, 2008 Abstract
More informationReview questions for Math 111 final. Please SHOW your WORK to receive full credit Final Test is based on 150 points
Please SHOW your WORK to receive full credit Final Test is based on 150 points 1. True or False questions (17 pts) a. Common Logarithmic functions cross the y axis at (0,1) b. A square matrix has as many
More informationAlgebra I CP Final Exam Review
Class: Date: Algebra I CP Final Exam Review Multiple Choice Identify the choice that best completes the statement or answers the question. 1. Identify the graph that displays the height of a ping pong
More informationThe p-adic Numbers. Akhil Mathew
The p-adic Numbers Akhil Mathew ABSTRACT These are notes for the presentation I am giving today, which itself is intended to conclude the independent study on algebraic number theory I took with Professor
More informationMATH 31B: MIDTERM 2 REVIEW. sin 2 x = 1 cos(2x) dx = x 2 sin(2x) 4. + C = x 2. dx = x sin(2x) + C = x sin x cos x
MATH 3B: MIDTERM REVIEW JOE HUGHES. Evaluate sin x and cos x. Solution: Recall the identities cos x = + cos(x) Using these formulas gives cos(x) sin x =. Trigonometric Integrals = x sin(x) sin x = cos(x)
More informationA Motivated Introduction to Modular Forms
May 3, 2006 Outline of talk: I. Motivating questions II. Ramanujan s τ function III. Theta Series IV. Congruent Number Problem V. My Research Old Questions... What can you say about the coefficients of
More informationMath 429/581 (Advanced) Group Theory. Summary of Definitions, Examples, and Theorems by Stefan Gille
Math 429/581 (Advanced) Group Theory Summary of Definitions, Examples, and Theorems by Stefan Gille 1 2 0. Group Operations 0.1. Definition. Let G be a group and X a set. A (left) operation of G on X is
More informationTHE UNIT GROUP OF A REAL QUADRATIC FIELD
THE UNIT GROUP OF A REAL QUADRATIC FIELD While the unit group of an imaginary quadratic field is very simple the unit group of a real quadratic field has nontrivial structure Its study involves some geometry
More information2MA105 Algebraic Structures I
2MA105 Algebraic Structures I Per-Anders Svensson http://homepage.lnu.se/staff/psvmsi/2ma105.html Lecture 7 Cosets once again Factor Groups Some Properties of Factor Groups Homomorphisms November 28, 2011
More informationFinal Exam C Name i D) 2. Solve the equation by factoring. 4) x2 = x + 72 A) {1, 72} B) {-8, 9} C) {-8, -9} D) {8, 9} 9 ± i
Final Exam C Name First, write the value(s) that make the denominator(s) zero. Then solve the equation. 7 ) x + + 3 x - = 6 (x + )(x - ) ) A) No restrictions; {} B) x -, ; C) x -; {} D) x -, ; {2} Add
More informationCSIR - Algebra Problems
CSIR - Algebra Problems N. Annamalai DST - INSPIRE Fellow (SRF) Department of Mathematics Bharathidasan University Tiruchirappalli -620024 E-mail: algebra.annamalai@gmail.com Website: https://annamalaimaths.wordpress.com
More informationQuantum algorithms for computing short discrete logarithms and factoring RSA integers
Quantum algorithms for computing short discrete logarithms and factoring RSA integers Martin Ekerå, Johan Håstad February, 07 Abstract In this paper we generalize the quantum algorithm for computing short
More informationSerge Ballif January 18, 2008
ballif@math.psu.edu The Pennsylvania State University January 18, 2008 Outline Rings Division Rings Noncommutative Rings s Roots of Rings Definition A ring R is a set toger with two binary operations +
More informationB553 Lecture 1: Calculus Review
B553 Lecture 1: Calculus Review Kris Hauser January 10, 2012 This course requires a familiarity with basic calculus, some multivariate calculus, linear algebra, and some basic notions of metric topology.
More informationp-adic fields Chapter 7
Chapter 7 p-adic fields In this chapter, we study completions of number fields, and their ramification (in particular in the Galois case). We then look at extensions of the p-adic numbers Q p and classify
More informationln(9 4x 5 = ln(75) (4x 5) ln(9) = ln(75) 4x 5 = ln(75) ln(9) ln(75) ln(9) = 1. You don t have to simplify the exact e x + 4e x
Math 11. Exponential and Logarithmic Equations Fall 016 Instructions. Work in groups of 3 to solve the following problems. Turn them in at the end of class for credit. Names. 1. Find the (a) exact solution
More informationLinear Codes, Target Function Classes, and Network Computing Capacity
Linear Codes, Target Function Classes, and Network Computing Capacity Rathinakumar Appuswamy, Massimo Franceschetti, Nikhil Karamchandani, and Kenneth Zeger IEEE Transactions on Information Theory Submitted:
More informationFrom the shortest vector problem to the dihedral hidden subgroup problem
From the shortest vector problem to the dihedral hidden subgroup problem Curtis Bright University of Waterloo December 8, 2011 1 / 19 Reduction Roughly, problem A reduces to problem B means there is a
More informationExponential algorithmic speedup by quantum walk
Exponential algorithmic speedup by quantum walk Andrew Childs MIT Center for Theoretical Physics joint work with Richard Cleve Enrico Deotto Eddie Farhi Sam Gutmann Dan Spielman quant-ph/0209131 Motivation
More informationPh 219b/CS 219b. Exercises Due: Wednesday 22 February 2006
1 Ph 219b/CS 219b Exercises Due: Wednesday 22 February 2006 6.1 Estimating the trace of a unitary matrix Recall that using an oracle that applies the conditional unitary Λ(U), Λ(U): 0 ψ 0 ψ, 1 ψ 1 U ψ
More informationHomework 9 Solutions to Selected Problems
Homework 9 Solutions to Selected Problems June 11, 2012 1 Chapter 17, Problem 12 Since x 2 + x + 4 has degree 2 and Z 11 is a eld, we may use Theorem 17.1 and show that f(x) is irreducible because it has
More informationMany of the groups with which we are familiar are arithmetical in nature, and they tend to share key structures that combine more than one operation.
12. Rings 1 Rings Many of the groups with which we are familiar are arithmetical in nature, and they tend to share key structures that combine more than one operation. Example: Z, Q, R, and C are an Abelian
More informationQuantum Algorithms Lecture #2. Stephen Jordan
Quantum Algorithms Lecture #2 Stephen Jordan Last Time Defined quantum circuit model. Argued it captures all of quantum computation. Developed some building blocks: Gate universality Controlled-unitaries
More informationIntroduction to Information Security
Introduction to Information Security Lecture 5: Number Theory 007. 6. Prof. Byoungcheon Lee sultan (at) joongbu. ac. kr Information and Communications University Contents 1. Number Theory Divisibility
More informationPade Approximations and the Transcendence
Pade Approximations and the Transcendence of π Ernie Croot March 9, 27 1 Introduction Lindemann proved the following theorem, which implies that π is transcendental: Theorem 1 Suppose that α 1,..., α k
More information6]. (10) (i) Determine the units in the rings Z[i] and Z[ 10]. If n is a squarefree
Quadratic extensions Definition: Let R, S be commutative rings, R S. An extension of rings R S is said to be quadratic there is α S \R and monic polynomial f(x) R[x] of degree such that f(α) = 0 and S
More information