The quantum query complexity of learning multilinear polynomials
From MaRDI portal
Publication:436558
DOI10.1016/j.ipl.2012.03.002zbMath1243.68198arXiv1105.3310OpenAlexW2049554200MaRDI QIDQ436558
Publication date: 25 July 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1105.3310
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
Quantum algorithm for multivariate polynomial interpolation ⋮ Quantum learning Boolean linear functions w.r.t. product distributions ⋮ A quantum algorithm for Viterbi decoding of classical convolutional codes ⋮ Identifying Generalized Reed-Muller Codewords by Quantum Queries ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Sharp quantum versus classical query complexity separations
- Quantum Algorithms to Solve the Hidden Shift Problem for Quadratics and for Functions of Large Gowers Norm
- Quantum Algorithms for Some Hidden Shift Problems
- Testing Polynomials over General Fields
- Quantum Complexity Theory
- Elements of Information Theory
This page was built for publication: The quantum query complexity of learning multilinear polynomials
