An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem

@inproceedings{Gall2010AnEQ,
  title={An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem},
  author={F. Gall},
  booktitle={STACS},
  year={2010}
}
  • F. Gall
  • Published in STACS 2010
  • Mathematics, Computer Science, Physics
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of isomorphism testing for nonabelian groups. Le Gall has constructed an efficient classical algorithm for a class of groups corresponding to one of the most natural ways of constructing nonabelian groups from abelian groups: the groups that are extensions of an… Expand
Classical and Quantum Algorithms for Testing Equivalence of Group Extensions
TLDR
This paper shows that equivalence of central extensions can be computed efficiently on a classical computer when the groups are small enough to be given by their multiplication tables, and demonstrates a new application of the hidden subgroup problem for general abelian groups. Expand
The computational power of normalizer circuits over black-box groups
TLDR
This work presents a precise connection between Clifford circuits, Shor's factoring algorithm and several other famous quantum algorithms with exponential quantum speed-ups for solving Abelian hidden subgroup problems, and finds that normalizer circuits are powerful enough to factorize and solve classically-hard problems in the black-box setting. Expand
Quantum Algorithm Implementations for Beginners
TLDR
This review aims to explain the principles of quantum programming, which are quite different from classical programming, with straightforward algebra that makes understanding of the underlying fascinating quantum mechanical principles optional. Expand
Space Efficient Representations of Finite Groups
TLDR
It is shown that for any $\delta$, $\frac{1}{\log n} \le \delta \le 1$, there is an $\mathcal{O}(\frac{n^{1 +\delta}}{\delta})$ space representation for groups of order $n$ with $o(n^2)$ query-time. Expand
Succinct Representations of Finite Groups
TLDR
It is shown that for any \(\delta \), \(\frac{1}{\log n} \le \ delta \le 1\), there is an O(n^2) space representation for groups of order n with \(\mathcal {O}(\frac{ 1}{\delta })\) query-time. Expand
Normalizer Circuits and Quantum Computation
TLDR
An efficient formalism for simulating families of quantum circuits, that are non-universal but comprise important quantum gates such as QFT or CNOT, is developed and used to design new algorithms that provide quantum speedups. Expand
From Reversible Logic Gates to Universal Quantum Bases
TLDR
This column presents a mathematical tour of the quantum circuit model, beginning with reversible logic circuits and expanding to quantum circuits, gates, and measurement, and highlights quantum mechanical phenomena such as superposition, entanglement, and measurements. Expand
8th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2013, May 21-23, 2013, Guelph, Canada
TLDR
This work extends the model of Ancilla Driven Quantum Computation by considering gates with arbitrary entangling power, and shows that universal QC can still be achieved through a variable length sequence of single qubit gates and probabilistic “repeat-untilsucces” entangling operations. Expand

References

SHOWING 1-10 OF 49 REFERENCES
Efficient Isomorphism Testing for a Class of Group Extensions
  • F. Gall
  • Mathematics, Computer Science
  • STACS
  • 2009
TLDR
This paper presents an efficient algorithm solving the group isomorphism problem for all the groups of this class such that the order of A is coprime with m, and runs in time almost linear in the orders of the input groups. Expand
Linear time algorithms for Abelian group isomorphism and related problems
  • T. Kavitha
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 2007
TLDR
The property that the order finding algorithm works for any group is used to design a simple O(n) algorithm for testing whether a group of size n, described by its multiplication table, is nilpotent and an algorithm for isomorphism testing of Abelian groups is given. Expand
Quantum algorithms for solvable groups
  • J. Watrous
  • Mathematics, Computer Science
  • STOC '01
  • 2001
TLDR
An important byproduct of this polynomial-time quantum 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. Expand
From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups
TLDR
The results show that entangled measurements across multiple copies of hidden subgroup states can be useful for efficiently solving the nonabelian HSP. Expand
Succinct quantum proofs for properties of finite groups
  • J. Watrous
  • Mathematics, Computer Science
  • Proceedings 41st Annual Symposium on Foundations of Computer Science
  • 2000
TLDR
It is proved that for an arbitrary group oracle, there exist succinct (polynomial-length) quantum proofs for the Group Non-Membership problem that can be checked with small error in polynomial time on a quantum computer. Expand
Efficient Quantum Algorithms for the Hidden Subgroup Problem over a Class of Semi-direct Product Groups
TLDR
This paper describes a polynomial-time quantum algorithm solving the hidden subgroup problem (HSP) over the class of semi-direct product groups, for p and q prime, where p is an odd prime. Expand
The Parallel Complexity of Abelian Permutation Group Problems
TLDR
It is proved that $NC^4 $ contains the problem of computing the cyclic decomposition of an Abelian permutation group, which is equivalent to determining solvability of a system of linear equations modulo a product of small prime powers. Expand
Solvable Group Isomorphism
TLDR
A uniform NP machine for solvable group non-isomorphism, that works correctly on all but 2/sup polylog(n)/ inputs of any length n and is always correct when the input groups are nonisomorphic. Expand
Efficient Quantum Algorithms For Some Instances Of The Non-Abelian Hidden Subgroup Problem
In this paper we show that certain special cases of the hidden subgroup problem can be solved in polynomial time by a quantum algorithm. These special cases involve finding hidden normal subgroups ofExpand
An O(n) Algorithm for Abelian p-Group Isomorphism and an O(n log n) Algorithm for Abelian Group Isomorphism
  • N. Vikas
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 1996
TLDR
It is shown that if the groups are Abelianp-groups then isomorphism can be determined in timeO(n) and that the elementary divisor sequence for an Abelian group can been determined inTimeO(nlogn) and for a Abelian p-group it can beetermined in time O(n). Expand
...
1
2
3
4
5
...