scientific article; zbMATH DE number 6820205

DOI10.4230/LIPICS.ICALP.2016.16MaRDI QIDQ4598149zbMATH OpenFDO

Authors Andrew M. Childs, Wim van Dam, Shih-Han Hung, Igor E. Shparlinski

Publication date 19 December 2017

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

zbMATH Keywords

query complexityfinite fieldspolynomial interpolationquantum algorithms

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Number-theoretic algorithms; complexity (11Y16) Quantum cryptography (quantum-theoretic aspects) (81P94)

Recommendations

• Quantum algorithm for multivariate polynomial interpolation
• Quantum interpolation of polynomials
• Efficient quantum algorithms of finding the roots of a polynomial function
• Quantum algorithms and approximating polynomials for composed functions with shared inputs
• A polynomial quantum algorithm for approximating the Jones polynomial
• A polynomial quantum algorithm for approximating the Jones polynomial
• Efficient quantum algorithm for identifying hidden polynomials
• STACS 2005
• Robust polynomials and quantum algorithms
• Almost-everywhere superiority for quantum polynomial time

Cited in

(6)

• Query-Efficient Algorithms for Polynomial Interpolation over Composites
• The quantum query complexity of learning multilinear polynomials
• Quantum interpolation of polynomials
• A polynomial quantum algorithm for approximating the Jones polynomial
• Quantum algorithm for multivariate polynomial interpolation
• Quantum cryptanalysis of Farfalle and (generalised) key-alternating Feistel networks

This page was built for publication:

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