Quantum algorithms for shifted subset problems

MaRDI QIDQ3633952zbMATH OpenFDO

Authors Ashley Montanaro

Publication date 23 June 2009

Full work available at URL https://arxiv.org/abs/0806.3362

zbMATH Keywords

quantum algorithmsKrawtchouk polynomialsshifted subsets

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Quantum computation (81P68)

Recommendations

• A hidden shift quantum algorithm
• scientific article; zbMATH DE number 2079375
• Quantum Algorithms for Some Hidden Shift Problems
• Quantum Algorithm for the Boolean Hidden Shift Problem
• Quantum algorithm for a generalized hidden shift problem

Cited in

(8)

• Quantum Algorithms to Solve the Hidden Shift Problem for Quadratics and for Functions of Large Gowers Norm
• Quantum algorithms for the subset-sum problem
• Quantum Algorithms for Some Hidden Shift Problems
• Quantum algorithm based on the \(\varepsilon\)-random linear disequations for the continuous hidden shift problem
• Quantum Algorithm for the Boolean Hidden Shift Problem
• scientific article; zbMATH DE number 5320343 (Why is no real title available?)
• Quantum Lower Bounds for Tripartite Versions of the Hidden Shift and the Set Equality Problems
• Subset Sum Quantumly in 1.17 n .

This page was built for publication: Quantum algorithms for shifted subset problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3633952)