Quantum algorithms for solvable groups

@inproceedings{Watrous2001QuantumAF,
  title={Quantum algorithms for solvable groups},
  author={John Watrous},
  booktitle={STOC '01},
  year={2001}
}
  • J. Watrous
  • Published in STOC '01 7 November 2000
  • Mathematics, Computer Science
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 have… 
Quantum Algorithms for a Set of Group Theoretic Problems
This work introduces two decision problems, StabilizerDand Orbit CosetD, and gives quantum reductions from them to the problem Orbit Superposition (Friedl et al., 2003), as well as quantum reductions
An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem
TLDR
This paper presents a quantum algorithm solving instances of the nonabelian group isomorphism problem exponentially faster than the best known classical algorithms.
Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups
TLDR
The result shows that computing the order of a solvable group, which is one of the most general problems for which quantum computing exhibits an exponential speed-up with respect to classical computing, can be realized in this model.
Efficient quantum algorithms for the hidden subgroup problem over semi-direct product groups
TLDR
The hidden subgroup problem (HSP) over the class of semidirect product groups Zpr ⋊ Zq, for p and q prime is considered, and a polynomial-time quantum algorithm solving the HSP over all the groups of one of these classes is described.
Quantum Complexity of Testing Group Commutativity
TLDR
A quite optimal quantum algorithm is constructed for the problem of testing the commutativity of a black-box group specified by its k generators, whose complexity is in $\tilde{O}(k^{2/3})$.
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 of
Quantum Property Testing for Solvable Groups
Property testing has been extensively studied and its target is to determine whether a given object satisfies a certain property or it is far from the property. In this paper, we construct an
A ug 2 00 5 Quantum Complexity of Testing Group Commutativity ∗
TLDR
A quite optimal quantum algorithm is constructed for the problem of testing the commutativity of a black-box group specified by its k generators, and it is proved the optimality of the algorithm of Pak for the randomized model.
Quantum Property Testing of Group Solvability
TLDR
This paper constructs an efficient quantum algorithm that tests whether (Γ,⋅) is a solvable group, or is far from any solable group, and the number of queries used by the algorithm is polylogarithmic in the size of the set Γ.
Quantum algorithms for problems in number theory, algebraic geometry, and group theory
TLDR
This article will review the current state of quantum algorithms, focusing on algorithms for problems with an algebraic flavor that achieve an apparent superpolynomial speedup over classical computation.
...
...

References

SHOWING 1-10 OF 64 REFERENCES
Quantum computation of Fourier transforms over symmetric groups
TLDR
A quantum polynomial time algorithm for the Fourier transform for the symmetric groups Sn is given, adapting results obtained by Clausen and Diaconis–Rockmore to the quantum setting.
Hidden Subgroup States are Almost Orthogonal
TLDR
A quantum algorithm is presented which identifies a hidden subgroup of an arbitrary finite group $G$ in only a linear (in $\log |G|$) number of calls to the oracle function, which is exponentially better than the best classical algorithm.
Normal subgroup reconstruction and quantum computation using group representations
TLDR
It is shown that an immediate generalization of the Abelian case solution to the non-Abelian case does not efficiently solve Graph Isomorphism.
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.
The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer
TLDR
It is pointed out how certain instances of Abelian hidden subgroup problems can be solved with only one control qubit, or flying qubits, instead of entire registers of control qubits.
On Quantum Algorithms for Noncommutative Hidden Subgroups
TLDR
A quantum algorithm is presented for the special case of dihedral groups which determines the hidden subgroup in a linear number of calls to the input function.
Computing in solvable matrix groups
  • E. Luks
  • Mathematics
    Proceedings., 33rd Annual Symposium on Foundations of Computer Science
  • 1992
TLDR
The author shows that solvability and nilpotence can be tested in polynomial-time, and announces methods for efficient management of solvable matrix groups over finite fields.
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 of
Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract)
TLDR
It is shown that any cryptosystem based on what is referred to as a ‘hidden linear form’ can be broken in quantum polynomial time and the notion of ‘junk bits’ is introduced which are helpful when performing classical computations that are not injective.
An exact quantum polynomial-time algorithm for Simon's problem
  • G. Brassard, P. Høyer
  • Computer Science, Mathematics
    Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems
  • 1997
TLDR
It is shown that there is a decision problem that can be solved in exact quantum polynomial time, which would require expected exponential time on any classical bounded-error probabilistic computer if the data is supplied as a black box.
...
...