Efficient quantum algorithm for identifying hidden polynomials

MaRDI QIDQ3636245zbMATH OpenFDO

Authors Thomas Decker, Jan Draisma, Pawel Wocjan

Publication date 30 June 2009

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

zbMATH Keywords

hidden polynomial problemshidden subgroup problemsquantum algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Quantum computation (81P68)

Recommendations

• Hidden symmetry subgroup problems
• The quantum query complexity of the hidden subgroup problem is polynomial
• The quantum query complexity of learning multilinear polynomials
• Quantum algorithm for a generalized hidden shift problem
• Quantum algorithm for multivariate polynomial interpolation

Cited in

(15)

• Efficient quantum algorithms of finding the roots of a polynomial function
• Classical and quantum function reconstruction via character evaluation
• Quantum algorithm for the root-finding problem
• Quantum computation of zeta functions of curves
• Quantum algorithm based on the \(\varepsilon\)-random linear disequations for the continuous hidden shift problem
• Quantum interpolation of polynomials
• Quantum Algorithms to Solve the Hidden Shift Problem for Quadratics and for Functions of Large Gowers Norm
• On solving systems of diagonal polynomial equations over finite fields
• The quantum query complexity of learning multilinear polynomials
• Quantum algorithm for multivariate polynomial interpolation
• scientific article; zbMATH DE number 6820205 (Why is no real title available?)
• On learning linear functions from subset and its applications in quantum computing
• Solving systems of diagonal polynomial equations over finite fields
• Quantum query complexity of multilinear identity testing
• Hidden symmetry subgroup problems

This page was built for publication: Efficient quantum algorithm for identifying hidden polynomials

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