A continuous variable Shor algorithm
Samuel J. Lomonaco, Louis Hirsch Kauffman · Contemporary mathematics - American Mathematical Society · 2005
Abstract. In this paper, we use the methods found in [21] to create a continuous variable analogue of Shor’s quantum factoring algorithm. By this we mean a quantum hidden subgroup algorithm that finds the period P of a function Φ: R − → R from the reals R to the reals R, where Φ belongs to a very general class of functions, called the class of admissible functions. One objective in creating this continuous variable quantum algorithm was to make the structure of Shor’s factoring algorithm more mathematically transparent, and thereby give some insight into the inner workings of Shor’s original algorithm. This continuous quantum algorithm also gives some insight into the inner workings of Hallgren’s Pell’s equation algorithm. Two key questions remain unanswered. Is this quantum algorithm more efficient than its classical continuous variable counterpart? Is this quantum