Quantum algorithms for solvable groups

DOI10.1145/380752.380759MaRDI QIDQ5175953zbMATH OpenOpenAlexWikidataFDO

Authors John Watrous

Publication date 27 February 2015

Published in Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/quant-ph/0011023, http://cds.cern.ch/record/481809

Mathematics Subject Classification ID

Solvable groups, supersolvable groups (20F16) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Abstract: In this paper we give a polynomial-time quantum algorithm for computing orders of solvable groups. Several other problems, such as testing membership in solvable groups, testing equality of subgroups in a given solvable group, and testing normality of a subgroup in a given solvable group, reduce to computing orders of solvable groups and therefore admit polynomial-time quantum algorithms as well. Our algorithm works in the setting of black-box groups, wherein none of these problems can be computed classically in polynomial time. As an important byproduct, our algorithm is able to produce a pure quantum state that is uniform over the elements in any chosen subgroup of a solvable group, which yields a natural way to apply existing quantum algorithms to factor groups of solvable groups.

Recommendations

• Theoretical Computer Science
• Quantum algorithms for a set of group theoretic problems
• Hidden translation and translating coset in quantum computing
• EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM
• An efficient quantum algorithm for some instances of the group isomorphism problem

Cites work

• A constant-factor approximation algorithm for the \(k\)-median problem (extended abstract)

Cited in

(16)

• A quantum computing primer for operator theorists
• Semantic security and indistinguishability in the quantum world
• Quantum algorithms for fixed points and invariant subgroups
• Classical and quantum algorithms for testing equivalence of group extensions
• An efficient quantum algorithm for some instances of the group isomorphism problem
• Algebraic Methods in Quantum Informatics
• Decomposing finite Abelian groups
• Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
• scientific article; zbMATH DE number 7378343 (Why is no real title available?)
• Quantum algorithms for a set of group theoretic problems
• Theoretical Computer Science
• A polynomial quantum algorithm for approximating the Jones polynomial
• Homomorphic encryption: a mathematical survey
• scientific article; zbMATH DE number 7716603 (Why is no real title available?)
• Zero sum subsequences and hidden subgroups
• Quantum catalytic space

This page was built for publication: Quantum algorithms for solvable groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5175953)