Quantum Algorithms to Solve the Hidden Shift Problem for Quadratics and for Functions of Large Gowers Norm

  title={Quantum Algorithms to Solve the Hidden Shift Problem for Quadratics and for Functions of Large Gowers Norm},
  author={Martin R{\"o}tteler},
  • M. Rötteler
  • Published 20 August 2009
  • Computer Science, Mathematics
  • ArXiv
Most quantum algorithms that give an exponential speedup over classical algorithms exploit the Fourier transform in some way. In Shor's algorithm, sampling from the quantum Fourier spectrum is used to discover periodicity of the modular exponentiation function. In a generalization of this idea, quantum Fourier sampling can be used to discover hidden subgroup structures of some functions much more efficiently than it is possible classically. Another problem for which the Fourier transform has… 
Quantum algorithms for searching, resampling, and hidden shift problems
This thesis shows how certain types of random walk search algorithms can be transformed into quantum algorithms that search quadratically faster and builds a quantum algorithm that generalizes the rejection sampling method first formalized by von Neumann in 1951.
Easy and hard functions for the Boolean hidden shift problem
It is demonstrated that the easiest instances of the Boolean hidden shift problem correspond to bent functions, in the sense that an exact one-query algorithm exists if and only if the function is bent.
Quantum Algorithms for Abelian Difference Sets and Applications to Dihedral Hidden Subgroups
This work considers the problem of identifying a shifted version of the characteristic function of a (known) difference set and presents a general algorithm that can be used to tackle any hidden shift problem for any difference set in any abelian group.
Hidden Symmetry Subgroup Problems
A general method for reducing the HSSP to the HSP is presented, which works efficiently in several cases related to symmetries of polynomials, and connects in a rather surprising way certain hidden polynomial problems with the H SP.
Quantum algorithms for testing and learning Boolean functions†
This work discusses quantum algorithms based on the Bernstein–Vazirani algorithm for finding which input variables a Boolean function depends on, and describes quantum algorithms for learning the exact form of certain quadratic and cubic Boolean functions.
Quantum algorithm based on the ε-random linear disequations for the continuous hidden shift problem
By employing the newly defined concepts, it is shown that there exists a quantum computational algorithm which solves the continuous hidden shift problem on Rn with a continuous oracle function in time polynomial in n.
Quantum advantage with shallow circuits
It is shown that parallel quantum algorithms running in a constant time period are strictly more powerful than their classical counterparts; they are provably better at solving certain linear algebra problems associated with binary quadratic forms.
Quantum algorithms for testing Boolean functions
We discuss quantum algorithms, based on the Bernstein-Vazirani algorithm, for finding which variables a Boolean function depends on. There are 2^n possible linear Boolean functions of n variables;
The quantum query complexity of learning multilinear polynomials
The Hidden Subgroup Problem
An overview of the Hidden Subgroup Problem (HSP) as of July 2010, including new results discovered since the survey of arXiv:quant-ph/0411037v1, and analyse Regev's algorithm for the poly(n)-uniqueSVP, proving how the degree of the polynomial is related to the oracle complexity used and suggesting several variants.


Quantum algorithms for highly non-linear Boolean functions
New quantum algorithms are presented that solve the hidden shift problems for several well-known classes of bent functions in polynomial time and with a constant number of queries, while the classical query complexity is shown to be exponential.
Quantum algorithms for some hidden shift problems
The hidden coset problem is defined, which generalizes the hidden shift problem and the hidden subgroup problem and provides a unified way of viewing the ability of the Fourier transform to capture subgroup and shift structure.
A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
A quantum algorithm for the dihedral hidden subgroup problem (DHSP) with time and query complexity $2^{O(\sqrt{\log\ N})}$.
Efficient quantum algorithm for identifying hidden polynomials
A aquantum algorithm is presented that correctly identifies hidden m-variate polynomials for all but a finitenumber of values of d with constant probability and that has a running time that is onlypolylogarithmic in d.
Quantum Algorithms for Learning and Testing Juntas
This article develops quantum algorithms for learning and testing juntas, i.e. Boolean functions which depend only on an unknown set of k out of n input variables, and establishes the following lower bound: any FS-based k-junta testing algorithm requires $$Omega(\sqrt{k})$$ queries.
From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups
The results show that entangled measurements across multiple copies of hidden subgroup states can be useful for efficiently solving the nonabelian HSP.
Limitations of quantum coset states for graph isomorphism
It is shown that entangled quantum measurements on at least Ω(n log n) coset states are necessary to get useful information for the case of graph isomorphism, matching an information theoretic upper bound.
The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer
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.
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
  • P. Shor
  • Computer Science
    SIAM Rev.
  • 1999
Efficient randomized algorithms are given for factoring integers and finding discrete logarithms, two problems that are generally thought to be hard on classical computers and that have been used as the basis of several proposed cryptosystems.