Quantum interpolation of polynomials

MaRDI QIDQ3171628zbMATH OpenFDO

Authors Daniel M. Kane, Samuel Kutin

Publication date 5 October 2011

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Interpolation and approximation (educational aspects) (97N50)

Recommendations

• Quantum algorithm for multivariate polynomial interpolation
• scientific article; zbMATH DE number 6820205
• Efficient quantum algorithm for identifying hidden polynomials
• The quantum query complexity of learning multilinear polynomials
• Quantum lower bounds by polynomials

Cited in

(8)

• Interpolating parametrized quantum circuits using blackbox queries
• On the uselessness of quantum queries
• Polynomial approximation of quantum Lipschitz functions
• Symmetries, graph properties, and quantum speedups
• On interpolating between quantum and classical complexity classes
• scientific article; zbMATH DE number 6820205 (Why is no real title available?)
• Query-Efficient Algorithms for Polynomial Interpolation over Composites
• Quantum algorithm for multivariate polynomial interpolation

This page was built for publication: Quantum interpolation of polynomials

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