Quantum algorithms for shifted subset problems

zbMATH Open1170.81017arXiv0806.3362MaRDI QIDQ3633952FDOQ3633952

Authors: Ashley Montanaro 

Publication date: 23 June 2009

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

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

zbMATH Keywords

quantum algorithmsKrawtchouk polynomialsshifted subsets

Mathematics Subject Classification ID

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

Cited In (8)

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

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)