Fetching the paper…
Reading the bibliography…
We study the quantum query complexity of the Boolean hidden shift problem.
A survey of bent functions
John F. Dillon · 1972
Earlier work this paper cites.
Elementary Hadamard difference sets
John F. Dillon · 1975
Earlier work this paper cites.
The theory of error-correcting codes: Part 2
Jessie F. MacWilliams and Neil J.A. Sloane · 1977
Earlier work this paper cites.
On the randomness of Legendre and Jacobi sequences
Ivan B. Damgård · 1990
Earlier work this paper cites.
Rapid solution of problems by quantum computation
David Deutsch and Richard Jozsa · 1992
Earlier work this paper cites.
Quantum complexity theory
Ethan Bernstein and Umesh Vazirani · 1993
Earlier work this paper cites.
On the power of quantum computation
Daniel R. Simon · 1994
Earlier work this paper cites.
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Peter W. Shor · 1994
Earlier work this paper cites.
A ‘pretty good’ measurement for distinguishing quantum states
Paul Hausladen and William K. Wootters · 1994
Earlier work this paper cites.
Quantum measurements and the Abelian Stabilizer Problem
Alexei Kitaev · 1995
Earlier work this paper cites.
Quantum cryptanalysis of hidden linear functions
Dan Boneh and Richard Lipton · 1995
Earlier work this paper cites.
Construction of bent functions and balanced Boolean functions with high nonlinearity
Hans Dobbertin · 1995
Earlier work this paper cites.
A fast quantum mechanical algorithm for database search
Lov K. Grover · 1996
Earlier work this paper cites.
Quantum computation of Fourier transforms over symmetric groups
Robert Beals · 1997
Earlier work this paper cites.
Efficient quantum transforms
Peter Høyer · 1997
Earlier work this paper cites.
Strengths and weaknesses of quantum computing
Charles H. Bennett, Ethan Bernstein, Gilles Brassard, and Umesh Vazirani · 1997
Earlier work this paper cites.
Quantum algorithms and the Fourier transform
Richard Jozsa · 1998
Earlier work this paper cites.
Tight bounds on quantum searching
Michel Boyer, Gilles Brassard, Peter Høyer, and Alain Tapp · 1998
Cited alongside, same era.
The hidden subgroup problem and eigenvalue estimation on a quantum computer
Michele Mosca and Artur Ekert · 1999
Cited alongside, same era.
A quantum observable for the graph isomorphism problem
Mark Ettinger and Peter Høyer · 1999
Cited alongside, same era.
Grover’s quantum searching algorithm is optimal
Christof Zalka · 1999
Cited alongside, same era.
On quantum algorithms for noncommutative hidden subgroups
Mark Ettinger and Peter Høyer · 2000
Cited alongside, same era.
Quantum factoring, discrete logarithms, and the hidden subgroup problem
Richard Jozsa · 2001
Cited alongside, same era.
On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems
Andrew M. Childs and Pawel Wocjan · 2007
Later among the works it cites.
Quantum algorithm for a generalized hidden shift problem
Andrew M. Childs and Wim van Dam · 2007
Later among the works it cites.
On solving systems of random linear disequations
Gábor Ivanyos · 2008
Later among the works it cites.
Quantum algorithms for weighing matrices and quadratic residues
Wim van Dam · 2008
Later among the works it cites.
A brief introduction to Fourier analysis on the Boolean cube
Ronald de Wolf · 2008
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Hidden translation and orbit coset in quantum computing
Katalin Friedl, Gábor Ivanyos, Frédéric Magniez, Miklos Santha, and Pranab Sen · 2002
Cited alongside, same era.
Quantum computation and lattice problems
Oded Regev · 2004
Cited alongside, same era.
A subexponential time algorithm for the dihedral hidden subgroup problem with polynomial space
Oded Regev · 2004
Cited alongside, same era.
Equivalences and separations between quantum and classical learnability
Rocco A. Servedio and Steven J. Gortler · 2004
Cited alongside, same era.
Quantum identification of Boolean oracles
Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Hiroyuki Masuda, Raymond H. Putra, and Shigeru Yamashita · 2004
Cited alongside, same era.
A subexponential-time quantum algorithm for the dihedral hidden subgroup problem
Greg Kuperberg · 2005
Cited alongside, same era.
Thomas Koshy · 2008
Later among the works it cites.
Martin Rötteler · 2009
Later among the works it cites.
Cryptographic Boolean Functions and Applications
Thomas W. Cusick and Pantelimon Stănică · 2009
Later among the works it cites.
Efficient quantum algorithm for identifying hidden polynomials
Thomas Decker, Jan Draisma, and Pawel Wocjan · 2009
Later among the works it cites.
Quantum algorithms for algebraic problems
Andrew M. Childs and Wim van Dam · 2010
Later among the works it cites.
Constructing elliptic curve isogenies in quantum subexponential time
Andrew M. Childs, David Jao, and Vladimir Soukharev · 2010
Later among the works it cites.
Quantum algorithms for highly non-linear Boolean functions
Martin Rötteler · 2010
Later among the works it cites.
Another subexponential-time quantum algorithm for the dihedral hidden subgroup problem
Greg Kuperberg · 2011
Later among the works it cites.
Quantum algorithm for the Boolean hidden shift problem
Dmitry Gavinsky, Martin Roetteler, and Jérémie Roland · 2011
Later among the works it cites.
The non-injective hidden shift problem
Mirmojtaba Gharibi · 2011
Later among the works it cites.
Maris Ozols, Martin Roetteler, and Jérémie Roland · 2012
Later among the works it cites.