## Quantum hidden subgroup algorithms on free groups, (in preparation

Citations: | 7 - 2 self |

### BibTeX

@MISC{Lomonaco_quantumhidden,

author = {Samuel J. Lomonaco and Jr. and Louis H. Kauffman},

title = {Quantum hidden subgroup algorithms on free groups, (in preparation},

year = {}

}

### OpenURL

### Abstract

Abstract. One of the most promising and versatile approaches to creating new quantum algorithms is based on the quantum hidden subgroup (QHS) paradigm, originally suggested by Alexei Kitaev. This class of quantum algorithms encompasses the Deutsch-Jozsa, Simon, Shor algorithms, and many more. In this paper, our strategy for finding new quantum algorithms is to decompose Shor’s quantum factoring algorithm into its basic primitives, then to generalize these primitives, and finally to show how to reassemble them into new QHS algorithms. Taking an ”alphabetic building blocks approach, ” we use these primitives to form an ”algorithmic toolkit ” for the creation of new quantum algorithms, such as wandering Shor algorithms, continuous Shor algorithms, the quantum circle algorithm, the dual Shor algorithm, a QHS algorithm for Feynman integrals, free QHS algorithms, and more. Toward the end of this paper, we show how Grover’s algorithm is most surprisingly “almost ” a QHS algorithm, and how this result suggests the possibility of an even more complete ”algorithmic tookit ” beyond the QHS algorithms. Contents

### Citations

9061 | Introduction to Algorithms
- Cormen, Leiserson, et al.
- 2001
(Show Context)
Citation Context ...y of steps 1 through 4 is ( O n (lg Q) 3) . Remark 8. The above asymptotic upper bound is not ( the tightest possible. A tighter bound for the Euclidean algorithm is O (lg Q) 2) which can be found in =-=[10]-=-. ( Thus, the bound in the above theorem could be tightened to at least O n (lg Q) 2) . 15. Maximal Shor transversals Unfortunately, the definition of a Shor transversal is in some instances not stron... |

988 |
Intersection Theory
- Fulton
- 1984
(Show Context)
Citation Context ...ndard character identity8 , we have ⎧ ∑ ⎨ |Kϕ| = |A|/|Hϕ| if χ ∈ χ(k) = ⎩ ̂ Hϕ 0 otherwise k∈Kϕ Hence, it follows that Probϕ (χ) = ‖ϕ(χ• )‖ 2 |A| 2 ⎧ ⎨ = ⎩ 1 |Hϕ| if χ ∈ ̂ Hϕ 0 otherwise 2 |Hϕ| 8 See =-=[15]-=-.24 SAMUEL J. LOMONACO, JR. AND LOUIS H. KAUFFMAN 9. A Markov process Mϕ induced by Probϕ Before we can discuss the class of vintage Simon quantum hidden subgroup algorithms, we need to develop the m... |

960 |
An Introduction to the Theory of Numbers
- Hardy, Wright
- 1979
(Show Context)
Citation Context ...addition, Q ≥ P 2 , then the the character χ y Q of ZQ is said to be sufficiently close to a character of the maximal cyclic subgroup ZP. It immediately follows from the theory of continued fractions =-=[19, 30]-=- that Proposition 13. If a character χ y Q of ZQ is sufficiently close to a character of ZP, then d y P is a convergent of the continued fraction expansion of Q . However, to determine the sought inte... |

553 |
Homological Algebra
- Cartan, Eilenberg
- 1956
(Show Context)
Citation Context ...group Hϕ = A/Kϕ to the set S such that the diagram A ϕ −→ S ν ↓ ր ιϕ Hϕ is commutative, where ν : A −→ Hϕ denotes the hidden natural epimorphism of A onto the quotient group Hϕ = A/Kϕ. Next let 7 See =-=[7]-=-. ιν : Hϕ −→ AQUANTUM HIDDEN SUBGROUP ALGORITHMS 23 be a transversal map of the subgroup Kϕ in A, i.e., a map such that ν ◦ ιν = idHϕ . In other words, ιν sends each element h of Hϕ to a unique eleme... |

497 | Probability Theory - Bernstein - 1946 |

375 | Using Algebraic Geometry - Cox, Little, et al. - 1998 |

367 | On the Power of Quantum Computation - Simon - 1997 |

344 |
Theory of Groups
- Hall
(Show Context)
Citation Context ...oncatenation followed by full reduction. We can now use this constructive approach to create a special kind of transversal τ : G −→ F of an epimorphism ν : F −→ G, called a 2-sided Scheier transversal=-=[14]-=-: Definition 10. A set W of reduced words in a free group F = F (x1, x2, . . . , xn) is said to be a 2-sided Schreier system provided • The empty word 1 lies in W. • w = a1a2 · · ·aℓ−1aℓ ∈ W ⇒ wLeft =... |

323 | Quantum mechanics helps in searching for a needle in a haystack
- Grover
- 1997
(Show Context)
Citation Context ...QHS algorithm for this HSP cannot possibly find a solution. We begin with a question: Does Grover’s algorithm have symmetries that we can exploit? The problem solved by Grover’s algorithm [24], [11], =-=[12]-=-, [13] is that of finding an unknown integer label j0 in an unstructured database with items labeled by the integers: given the oracle 0, 1, 2, . . ., j0, . . . , N − 1 = 2 n − 1 , f (j) = { 1 if j = ... |

318 |
ld, Approximate formulas for some functions of prime numbers
- Rosser, Schoenfe
- 1962
(Show Context)
Citation Context ...⌋ since µ (k) = 0 for all integers k that are not squarefree. The last part of this theorem follows immediately from the fact that Q∑ ( ) n ∞∑ ⌊Q/k⌋ lim µ (k) = µ (k) Q−→∞ Q 1 kn = ζ (n)−1 . k=1 (See =-=[33]-=-, [34], or [19].) k=1 Q n . n ) n + ... , Corollary 7. Let n be an integer greater than 1, and let λ ′ 1 ,λ′ 2 ,... ,λ′ n be n integers randomly and independently selected with replacement from the se... |

259 | Algorithms for computer algebra - Geddes, Czapor, et al. - 1992 |

148 | Quantum algorithms revisited - Cleve, Ekert, et al. - 1998 |

119 | Algorithms. An Introduction to Computational Algebraic Geometry and Commutative Algebra, Undergraduate Texts in Mathematics - Cox, Little, et al. - 1992 |

97 | Grover’s quantum searching algorithm is optimal
- Zalka
- 1999
(Show Context)
Citation Context ...e subgroups Stab0, Stab1, . . .,StabN−1 are mutually conjugate subgroups of SN. Moreover, one can not hope to use this QHS approach to Grover’s algorithm to find a faster quantum algorithm. For Zalka =-=[40]-=- has shown that Grover’s algorithm is optimal.32 SAMUEL J. LOMONACO, JR. AND LOUIS H. KAUFFMAN The arguments given above suggest that Grover’s and Shor’s algorithms are more closely related that one ... |

90 | A Framework For Fast Quantum Mechanical Algorithms
- Grover
- 1998
(Show Context)
Citation Context ...gorithm for this HSP cannot possibly find a solution. We begin with a question: Does Grover’s algorithm have symmetries that we can exploit? The problem solved by Grover’s algorithm [24], [11], [12], =-=[13]-=- is that of finding an unknown integer label j0 in an unstructured database with items labeled by the integers: given the oracle 0, 1, 2, . . ., j0, . . . , N − 1 = 2 n − 1 , f (j) = { 1 if j = j0 0 o... |

88 | Quantum computation and Shor's factoring algorithm - Ekert, Jozsa - 1996 |

86 | An exact quantum polynomial-time algorithm for Simon’s problem - Brassard, Høyer - 1997 |

75 | On quantum algorithms for noncommutative hidden subgroups
- Ettinger, Hoyer
(Show Context)
Citation Context ...complexity of the non-abelian Fourier transform.4. THE NON-ABELIAN FOURIER TRANSFORM The Fourier transform on non-abelian groups is defined as follows: Let G be a finite non-abelian group, and let π =-=(1)-=- , π (2) , . . . , π (k) be a complete set of distinct irreducible representations of the group G. Each irreducible representation is a morphism π (i) : G −→ Aut (Wi) from G to the group of automophis... |

70 |
Polynomial _ time algorithms for prime factorization and discrete logarithms on a quantum computer
- Shor
- 1997
(Show Context)
Citation Context ...SN/Stabj0onto the set S. Find the hidden subgroup Stabj0with bounded probability of error. Now let us compare Shor’s algorithm with Grover’s. From section 6, we know that Shor’s algorithm [21], [25], =-=[35]-=-, [36] solves the hidden subgroup problem ϕ : Z −→ ZN with hidden subgroup structure Z −→ ZN ν ց ր ι Z/PZ Moreover, as stated in section 6, Shor has created his algorithm by pushing 15 the above hidde... |

63 | Quantum cryptanalysis of hidden linear functions - Boneh, Lipton - 1995 |

60 | Quantum Algorithms and the Fourier Transform
- Jozsa
- 1998
(Show Context)
Citation Context ...This manuscript assumes that the reader is familiar with the class of quantum hidden subgroup algorithms. For an introductions to this subject, please refer, for example, to any one of the references =-=[22]-=-, [23], [26], [30], [35], [36]. 2. An example of Shor’s quantum factoring algorithm As an example of what we would like to make mathematically transparent, consider the following instance of Peter Sho... |

59 | The hidden subgroup problem and eigenvalue estimation on a quantum computer - Mosca, Ekert - 1998 |

49 | Efficient quantum algorithms for some instances of the non-abelian hidden subgroup problem - Ivanyos, Magniez, et al. |

44 | Polynomial-time solution to the hidden subgroup problem for a class of non-Abelian groups. Technical report, Quantum Physics e-Print archive - Rötteler, Beth - 1998 |

39 | Group-theoretic algorithms and graph isomorphism, volume 136 - Hoffmann - 1982 |

38 | Quantum Computing - Hirvensalo - 2001 |

37 | Quantum algorithms for solvable groups - Watrous - 2001 |

36 | Efficient quantum transforms - Høyer |

29 | Efcient quantum algorithms for shifted quadratic character problems, Nov. 2000, LANL e-preprint quant-ph/0011067 - Dam, Hallgren |

25 | Quantum factoring and discrete logarithms and the hidden subgroup problem - Jozsa - 2001 |

25 | Algorithmic Number Theory, Volume I: Efficient Algorithms - Bach, Shallit - 1996 |

22 |
Quantum measurement and the abelian stabiliser problem
- Kitaev
- 1995
(Show Context)
Citation Context ... quantum computing. One of the most promising and versatile approaches to creating new quantum algorithms is based on the quantum hidden subgroup (QHS) paradigm, originally suggested by Alexei Kitaev =-=[20]-=-. This class of quantum algorithms encompasses the Deutsch-Jozsa, Simon, Shor algorithms, and many more. In this paper, our strategy for finding new quantum algorithms is to decompose Shor’s quantum f... |

22 | A Rosetta Stone for Quantum Mechanics with an Introduction to Quantum Computation, chapter I of [18
- Lomonaco
- 2002
(Show Context)
Citation Context ... We will, on occasion, refer to the probability distribution Probϕ : Â −→ [0,1] on the character group Â as the stochastic source Sϕ (χ) which produces a symbol χ ∈ Â with probability Probϕ (χ). (See =-=[29]-=-.) Thus, QRandϕ (χ) is an algorithmic implementation of the stochastic source Sϕ (χ). Part 4. Vintage Simon Algorithms We now begin the development of the class of vintage Simon QHSAs. These are QHSAs... |

22 |
Quantum Information: An Introduction to Basic Theoretical Concepts and Experiments
- Alber, Rottel, et al.
- 2001
(Show Context)
Citation Context ...ion Uϕ defined by HA ⊗ HS Uϕ −→ HA ⊗ HS |a〉 |s0〉 ↦−→ |a〉 |ϕ(a)〉 We will use the above implementation to construct a quantum subroutine QRandϕ () which produces a probability distribution Probϕ : Â −→ =-=[0,1]-=- on the character group Â of the group A. Before doing so, we will, as explained in the previous section, make use of various identifications, such as respectively identifying the Fourier and inverse ... |

21 | Decomposing finite Abelian groups - Cheung, Mosca |

20 | Introduction to quantum algorithms
- Shor
(Show Context)
Citation Context ...bj0onto the set S. Find the hidden subgroup Stabj0with bounded probability of error. Now let us compare Shor’s algorithm with Grover’s. From section 6, we know that Shor’s algorithm [21], [25], [35], =-=[36]-=- solves the hidden subgroup problem ϕ : Z −→ ZN with hidden subgroup structure Z −→ ZN ν ց ր ι Z/PZ Moreover, as stated in section 6, Shor has created his algorithm by pushing 15 the above hidden subg... |

19 | Grover’s quantum search algorithm for an arbitrary initial mixed state - Biham, Kenigsberg - 2002 |

17 |
The Rigged Hilbert Space and Quantum Mechanics
- Bohm
- 1978
(Show Context)
Citation Context ...s, each successively more general than the previous. For the first algorithm, we assume that the unknown hidden period P is an integer. The algorithm is then constructed by using rigged Hilbert spaces=-=[4]-=-, [10], linear combinations of Dirac delta functions, and a subtle extension of the Fourier transform found in the generic QHS subroutine QRand(ϕ), which has been described previously in section 4 of ... |

17 | On the power of quantum computation - Vazirani - 1998 |

12 |
The Art of Computer Programming, Second Edition
- Knuth
(Show Context)
Citation Context ... produce a character sufficiently close to a primitive character of the maximal cyclic group ZP is Ω ( 1 lg lg Q ) . ( Step 5 This step is of algorithmic complexity O n (lg Q) 3) . (See, for example, =-=[27]-=-.) Step 6 For Step 5 to branch to this step, both Steps 2 and 4 must be successful. Thus the probability of branching to step 6 is ProbSuccess (Step 2) · ) ) n+1 ProbSuccess (Step 2) = Ω ( ( 1 lg lg Q... |

8 | The Quantum Fourier Transform and Extensions of the Abelian Hidden Subgroup Problem - Hales - 2002 |

7 |
A unified mathematical formalism for the Dirac formulation of quantum mechanics
- Gadella, Gomez
(Show Context)
Citation Context ...ch successively more general than the previous. For the first algorithm, we assume that the unknown hidden period P is an integer. The algorithm is then constructed by using rigged Hilbert spaces[4], =-=[10]-=-, linear combinations of Dirac delta functions, and a subtle extension of the Fourier transform found in the generic QHS subroutine QRand(ϕ), which has been described previously in section 4 of this p... |

6 | Quantum algorithms for hidden coset problems - Dam, Hallgren, et al. - 2003 |

5 |
Amnon Ta-Shma. The hidden subgroup problem and quantum computation using group representations
- Hallgren, Russell
(Show Context)
Citation Context ...n QHS algorithm for SN cannot find the hidden subgroup Stabj0 for each of following two reasons: • Since the subgroups Stabj are not normal subgroups of SN, it follows from the work of Hallgren et al =-=[16]-=-, [17] that the standard non-abelian hidden subgroup algorithm will find the largest normal subgroup of SN lying in Stabj0. But unfortunately, the largest normal subgroup of SN lying in Stabj is the t... |

5 |
Shor’s quantum factoring algorithm
- Lomonaco
(Show Context)
Citation Context ... with Probability Prob˜ϕ (y) = 〈 Υ (y) | Υ (y) 〉 (512) 2 the state will “collapse” to |y〉 with the value measured being the integer y, where 0 ≤ y < Q. A plot of Prob˜ϕ (y) is shown in Figure 1. (See =-=[21]-=- and [25] for details.) Figure 1. A plot of Prob˜ϕ(y).QHS ALGORITHMS 5 The peaks in the above plot of Prob˜ϕ (y) occur at the integers y = 0, 85, 171, 256, 341, 427. The probability that at least one... |

4 | Continuous quantum hidden subgroup algorithms
- Lomonaco, Kauman
- 2003
(Show Context)
Citation Context ...sentation γ. Obviously, much more can be said about pushing. But unfortunately that would take us far afield from the objectives of this paper. For more information on pushing, we refer the reader to =-=[27]-=-. It would be amiss not to mention that the above algorithmic primitive of pushing suggests the definition of a second primitive which we will call lifting. Definition 3. Let ϕ : G −→ S be a map from ... |

4 |
Introduction to quantum algorithms, in “Quantum Computation: A Grand Mathematical Challenge for the Twenty-First
- Shor
(Show Context)
Citation Context ...he reader is familiar with the class of quantum hidden subgroup algorithms. For an introductions to this subject, please refer, for example, to any one of the references [22], [23], [26], [30], [35], =-=[36]-=-. 2. An example of Shor’s quantum factoring algorithm As an example of what we would like to make mathematically transparent, consider the following instance of Peter Shor’s quantum factoring algorith... |

4 | Quantum State Detection Via Elimination - Ettinger, Hoyer |

3 | The non-abelian Fourier transform and quantum computation, MSRI Streaming Video - Lomonaco - 2000 |

3 |
bounds for the Chebyshev functions θ (x) and ψ (x
- Schoenfeld, Sharper
- 1976
(Show Context)
Citation Context ...e µ (k) = 0 for all integers k that are not squarefree. The last part of this theorem follows immediately from the fact that Q∑ ( ) n ∞∑ ⌊Q/k⌋ lim µ (k) = µ (k) Q−→∞ Q 1 kn = ζ (n)−1 . k=1 (See [33], =-=[34]-=-, or [19].) k=1 Q n . n ) n + ... , Corollary 7. Let n be an integer greater than 1, and let λ ′ 1 ,λ′ 2 ,... ,λ′ n be n integers randomly and independently selected with replacement from the set {1,2... |