Identifying Generalized Reed-Muller Codewords by Quantum Queries

DOI10.1142/S0129054117500125zbMath1368.81061OpenAlexW2604921146MaRDI QIDQ4977894

Stefan Arnold

Publication date: 17 August 2017

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054117500125

zbMATH Keywords

polynomialsquantum query complexityHasse derivativeReed-muller codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Quantum computation (81P68) Bounds on codes (94B65) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites Work

• The quantum query complexity of learning multilinear polynomials
• Improved algorithms for quantum identification of Boolean oracles
• A New Upper Bound on the Query Complexity for Testing Generalized Reed-Muller codes
• Quantum Algorithms for Some Hidden Shift Problems
• Quantum Complexity Theory
• Binomial Coefficients Modulo a Prime
• Locally Decodable Codes

This page was built for publication: Identifying Generalized Reed-Muller Codewords by Quantum Queries