Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Quantum algorithms for fixed points and invariant subgroups

Quantum algorithms for fixed points and invariant subgroups 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups - Complexity - Cryptology de Gruyter

Quantum algorithms for fixed points and invariant subgroups

Download PDF
20 pages

Loading next page...
 
/lp/de-gruyter/quantum-algorithms-for-fixed-points-and-invariant-subgroups-y0Vx7i05C2

References (12)

Publisher
de Gruyter
Copyright
© de Gruyter 2011
ISSN
1867-1144
eISSN
1869-6104
DOI
10.1515/GCC.2011.013
Publisher site
See Article on Publisher Site

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.

Journal

Groups - Complexity - Cryptology – de Gruyter

Published: Dec 1, 2011

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

There are no references for this article.