Quantum algorithms for fixed points and invariant subgroups

Marianna Bonanome; Stephen Majewicz

doi:10.1515/gcc.2011.013

Published by De Gruyter November 3, 2011

Quantum algorithms for fixed points and invariant subgroups

Marianna Bonanome and Stephen Majewicz

From the journal Groups Complexity Cryptology

https://doi.org/10.1515/gcc.2011.013

Showing a limited preview of this publication:

Abstract

In this paper, we apply quantum algorithms to solve problems concerning fixed points and invariant subgroups of automorphisms. These efficient algorithms invoke a quantum algorithm which computes the intersection of multiple unsorted multisets whose elements originate from the same set. This intersection algorithm is an application of the Grover search procedure.

Keywords.: Quantum algorithm; Grover algorithm; quantum computation; fixed-point-free automorphism

Received: 2010-11-19

Published Online: 2011-11-03

Published in Print: 2011-December

Quantum algorithms for fixed points and invariant subgroups

Abstract

Journal and Issue

Articles in the same Issue