Article
Licensed
Unlicensed
Requires Authentication
Quantum algorithms for fixed points and invariant subgroups
-
Marianna Bonanome
and
Stephen Majewicz
Published/Copyright:
November 3, 2011
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.
Received: 2010-11-19
Published Online: 2011-11-03
Published in Print: 2011-December
© de Gruyter 2011
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- The Zieschang–McCool method for generating algebraic mapping-class groups
- A new generic digital signature algorithm
- Subgroups of R. Thompson's group F that are isomorphic to F
- Random equations in free groups
- Growth rate of an endomorphism of a group
- On Cayley graphs of virtually free groups
- Quantum algorithms for fixed points and invariant subgroups
- A note on faithful representations of limit groups
Keywords for this article
Quantum algorithm;
Grover algorithm;
quantum computation;
fixed-point-free automorphism
Articles in the same Issue
- The Zieschang–McCool method for generating algebraic mapping-class groups
- A new generic digital signature algorithm
- Subgroups of R. Thompson's group F that are isomorphic to F
- Random equations in free groups
- Growth rate of an endomorphism of a group
- On Cayley graphs of virtually free groups
- Quantum algorithms for fixed points and invariant subgroups
- A note on faithful representations of limit groups
