[AblVas2009] Farid Ablayev, Alexander Vasiliev, 2009, Algorithms for Quantum Branching Programs Based on Fingerprinting .
EPTCS 9, 2009, pp. 1-11 http://arxiv.org/abs/0911.2317
[BabLuk1983] László Babai and Eugene M. Luks, 1983, Canonical labeling of graphs.
STOC '83: Proceedings of the fifteenth annual ACM symposium on Theory of computing
[BacChiDam2005] Dave Bacon,
Andrew M. Childs and Wim van Dam, 2005, Optimal measurements for the dihedral hidden subgroup
problem.
Chicago Journal of Theoretical Computer Science (2006), no. 2 http://arxiv.org/abs/quant-ph/0501044
[BacChiDam2005bis] Dave Bacon,
Andrew M. Childs and Wim van Dam, 2005, From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups.
Proc. 46th IEEE Symposium on Foundations of Computer Science (FOCS 2005), pp. 469-478 http://arxiv.org/abs/quant-ph/0504083
[ChiDam2005] Andrew M. Childs, Wim van Dam, 2005, Quantum algorithm for a generalized hidden shift problem.
Proc. 18th ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 1225-1234 http://arxiv.org/abs/quant-ph/0507190
[ChiKimLee2006] Dong Pyo Chi, Jeong San Kim and Soojoon Lee, 2006, Notes on the hidden subgroup problem on some semi-direct product groups.
Phys. Lett. A 359, 114 (2006). http://arxiv.org/abs/quant-ph/0604172
[ChiSchVaz2007] Andrew M. Childs, Leonard J. Schulman, Umesh V. Vazirani, 2007, Quantum algorithms for hidden nonlinear structures.
Proc. 48th IEEE Symposium on Foundations of Computer Science (FOCS 2007), pp. 395-404 http://arxiv.org/abs/0705.2784
[ChiWoc2005] Andrew M. Childs, Pawel Wocjan, 2005, On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems .
Quantum Information and Computation, Vol. 7, No. 5-6 (2007) 504-521 http://arxiv.org/abs/quant-ph/0510185
[CosPor2007] Carlos Magno M. Cosme and Renato Portugal, 2007, Quantum algorithm for the hidden subgroup problem on a class of semidirect product groups. http://arxiv.org/abs/quant-ph/0703223v2
[Dam1988] Ivan Damgård, 1988, On the Randomness of Legendre and Jacobi Sequences.
Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology, pp. 163-172
[DamHalIp2002] Wim van Dam, Sean Hallgren, Lawrence Ip, 2002, Quantum Algorithms for some Hidden Shift Problems.
Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pages 489-498 (2003) http://arxiv.org/abs/quant-ph/0211140
[DecDraWoc2007] Thomas Decker, Jan Draisma, Pawel Wocjan, 2007, Efficient Quantum Algorithm for Identifying Hidden Polynomials. http://arxiv.org/abs/0706.1219
[DecWoc2007] Thomas Decker, Pawel Wocjan, 2007, Efficient Quantum Algorithm for Hidden Quadratic and Cubic Polynomial Function Graphs. http://arxiv.org/abs/quant-ph/0703195
[DenMooRus2008] Aaron Denney, Cristopher Moore and Alexander Russell, 2008 Finding conjugate stabilizer subgroups in PSL(2; q) and related groups. http://arxiv.org/abs/0809.2445
[DeuJoz1992] David Deutsch and
Richard Jozsa, 1992, Rapid Solution of Problems by Quantum
Computation.
Proceedings: Mathematical and Physical Sciences, Volume 439, Issue 1907,
pp. 553-558
[EttHøyKni1999] Mark
Ettinger, Peter Høyer and Emanuel Knill, 1999,
Hidden Subgroup States are Almost Orthogonal. http://arxiv.org/abs/quant-ph/9901034
[FenZha2006] S. A. Fenner, Y. Zhang, 2006, The central nature of the Hidden Subgroup problem. http://arxiv.org/abs/cs/0610086
[FriEtAl2002] Katalin Friedl, Gábor Ivanyos, Frédéric Magniez, Miklos Santha and Pranab Sen, 2002, Hidden Translation and Orbit Coset in Quantum Computing. http://arxiv.org/abs/quant-ph/0211091
[FriEtAl2002bis] Katalin Friedl, Frederic Magniez, Miklos Santha, Pranab Sen, 2002, Quantum testers for hidden group properties. http://arxiv.org/abs/quant-ph/0208184
[Hal2002] Sean Hallgren, 2002, Polynomial-Time Quantum Algorithms for Pell's Equation and the Principal Ideal Problem.
STOC '02: Proceedings of the thirty-fourth annual ACM symposium on Theory of computing
Journal of the ACM, 54(1):1-19, 2007. http://www.cse.psu.edu/~hallgren/pell.pdf
[Hal2005] Sean Hallgren, 2005, Fast Quantum Algorithms for Computing the Unit Group and Class Group of a Number Field.
STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing http://www.cse.psu.edu/~hallgren/unitgroup.pdf
[HalRoeSen2005] Sean Hallgren, Martin Roetteler and Pranab Sen, 2005, Limitations of Quantum Coset States for Graph Isomorphism. http://arxiv.org/abs/quant-ph/0511148
[HalRusTa-2000] Sean
Hallgren, Alexander Russel and Amnon Ta-Shma, 2000 Normal Subgroup Reconstruction and Quantum Computation
Using Group Representations. http://www.cs.tau.ac.il/~amnon/Papers/HRT.stoc00.ps
[InuLeG2004] Yoshifumi Inui and Francois Le Gall, 2004, Efficient Quantum Algorithms for the Hidden Subgroup Problem over a Class of Semi-direct Product Groups.
Quantum Information and Computation, Vol. 7, No. 5&6 (2007), 559-570 http://arxiv.org/abs/quant-ph/0412033
[IvaEtAl2001] Gábor Ivanyos, Frédéric Magniez, Miklos Santha, 2001, Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem. http://arxiv.org/abs/quant-ph/0102014
[IvaSanSan2007] Gábor Ivanyos, Luc Sanselme and Miklos Santha, 2007, An efficient quantum algorithm for the hidden subgroup problem in extraspecial groups.
stacs 2007 http://arxiv.org/abs/quant-ph/0701235
[IvaSanSan2007bis] Gábor Ivanyos, Luc Sanselme and Miklos Santha, 2007, An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups. http://arxiv.org/abs/0707.1260
[KroRöt2008] Hari Krovi and Martin Rötteler, 2008, An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups . http://arxiv.org/abs/0810.3695
[Kup2003] Greg Kuperberg, 2003, A subexponential-time quantum algorithm for the
dihedral hidden subgroup problem. http://arxiv.org/abs/quant-ph/0302112
[Köb1993] Johannes Köbler, 1993, The Graph Isomorphism Problem : Its Structural Complexity.
Progress in Theoretical Computer Science - Boston: Birkhäuser, 1993
[Lom2010] Samuel J. Lomonaco, 2010,
(private communication)
[LomKau2006] Samuel J. Lomonaco and Louis H. Kauffman, 2006, Is Grover's Algorithm a Quantum Hidden Subgroup Algorithm ?. http://arxiv.org/abs/quant-ph/0603140
[MicGol2002] Daniele Micciancio
and Shafi Goldwasser, 2002, Complexity of Lattice Problems: a cryptographic
perspective
[MicReg2008] Daniele Micciancio
and Oded Regev, 2008,
chapter Lattice-based Cryptography,
from Post-Quantum Cryptography,
Springer Berlin Heidelberg. http://www.cs.tau.ac.il/~odedr/papers/pqc.pdf
[Mon2008] Ashley Montanaro, 2008, Quantum algorithms for shifted subset problems.
Quantum Information & Computation vol. 9 no. 5&6, pp. 500-512, 2009 http://arxiv.org/abs/0806.3362
[MooEtAl2005] Cristopher Moore, Daniel Rockmore, Alexander Russell and Leonard J. Schulman, 2005, The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts
. http://arxiv.org/abs/quant-ph/0503095
[MooRusSch2005] Cristopher Moore, Alexander Russell, Leonard J. Schulman, 2005, The Symmetric Group Defies Strong Fourier Sampling: Part I. http://arxiv.org/abs/quant-ph/0501056
[MooRusSni2006] Cristopher Moore, Alexander Russell, Piotr Sniady, 2006, On the impossibility of a quantum sieve algorithm for graph isomorphism: unconditional results.
STOC '07: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pages 536-545, New York, NY, USA, 2007. ACM Press http://arxiv.org/abs/quant-ph/0612089
[MooRusVaz2007] Cristopher Moore, Alexander Russell, Umesh Vazirani, 2007, A classical one-way function to confound quantum adversaries. http://arxiv.org/abs/quant-ph/0701115
[NieChu2007] Michael A. Nielsen
and Isaac L. Chuang 2007, Quantum Computation and Quantum Information
(ninth printing).
[RadRötSen2005] Jaikumar Radhakrishnan, Martin Rötteler and Pranab Sen, 2005, On the Power of Random Bases in Fourier Sampling: Hidden Subgroup Problem in the Heisenberg Group. http://arxiv.org/abs/quant-ph/0501044
[Reg2004] Oded Regev, 2004, A Subexponential Time Algorithm for the Dihedral Hidden
Subgroup Problem with Polynomial Space. http://arxiv.org/abs/quant-ph/0406151
[Röt2008] Martin Rötteler, 2008, Quantum algorithms for highly non-linear Boolean functions.
to appear in Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'10) http://arxiv.org/abs/0811.3208
[Röt2009] Martin Rötteler, 2009, Quantum algorithms to solve the hidden shift problem for quadratics and for functions of large Gowers norm.
Proc. MFCS'09, LNCS vol. 5734, pp. 663-674, 200 http://arxiv.org/abs/0911.4724
[RötBet1998] Martin Rötteler and Thomas Beth, 1998, Polynomial-Time Solution to the Hidden Subgroup Problem for a Class of non-abelian Groups. http://arxiv.org/abs/quant-ph/9812070
[Ser1971] Jean-Pierre Serre,
1971, Représentations linéaires des groupes finis.
[Sho1995] Peter W. Shor, 1995, Polynomial-Time Algorithms for Prime Factorization and
Discrete Logarithms on a Quantum Computer. http://arxiv.org/abs/quant-ph/9508027
[Spi1996] Daniel Spielman, 1996, Faster isomorphism testing of strongly regular graphs.
STOC '96: Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
