Quantum interpolation of polynomials

zbMATH Open1234.81057MaRDI QIDQ3171628FDOQ3171628

Authors: Daniel M. Kane, Samuel Kutin 

Publication date: 5 October 2011

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

Mathematics Subject Classification ID

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

Cited In (8)

• Query-Efficient Algorithms for Polynomial Interpolation over Composites
• On interpolating between quantum and classical complexity classes
• Polynomial approximation of quantum Lipschitz functions
• Interpolating parametrized quantum circuits using blackbox queries
• On the uselessness of quantum queries
• Quantum algorithm for multivariate polynomial interpolation
• Symmetries, graph properties, and quantum speedups
• Title not available (Why is that?)

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)