Quantum Algorithms to Solve the Hidden Shift Problem for Quadratics and for Functions of Large Gowers Norm
From MaRDI portal
Publication:3182964
DOI10.1007/978-3-642-03816-7_56zbMath1250.68114arXiv0911.4724OpenAlexW2128762917MaRDI QIDQ3182964
Publication date: 16 October 2009
Published in: Mathematical Foundations of Computer Science 2009 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0911.4724
Related Items (4)
The quantum query complexity of learning multilinear polynomials ⋮ Identification of a reversible quantum gate: assessing the resources ⋮ Quantum pattern matching fast on average ⋮ Quantum algorithms for testing and learning Boolean functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On ``bent functions
- Classical and quantum function reconstruction via character evaluation
- Quantum algorithms for learning and testing juntas
- Gowers uniformity, influence of variables, and PCPs
- Hidden translation and orbit coset in quantum computing
- Quantum computations: algorithms and error correction
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Complexity Theory
- A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- Limitations of quantum coset states for graph isomorphism
- Noise-tolerant learning, the parity problem, and the statistical query model
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
This page was built for publication: Quantum Algorithms to Solve the Hidden Shift Problem for Quadratics and for Functions of Large Gowers Norm
