Identifying generalized Reed-Muller codewords by quantum queries

DOI10.1142/S0129054117500125MaRDI QIDQ4977894zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• The quantum query complexity of learning multilinear polynomials
• Exact quantum query algorithm for error detection code verification
• A new upper bound on the query complexity of testing generalized Reed-Muller codes
• Optimal testing of Reed-Muller codes
• Quantum Reed-Muller codes

Cites work

• A new upper bound on the query complexity for testing generalized Reed-Muller codes
• Binomial Coefficients Modulo a Prime
• Improved algorithms for quantum identification of Boolean oracles
• Locally decodable codes
• Quantum Algorithms for Some Hidden Shift Problems
• Quantum Complexity Theory
• The quantum query complexity of learning multilinear polynomials

Cited in

(2)

• The quantum query complexity of learning multilinear polynomials
• Exact quantum query algorithm for error detection code verification

This page was built for publication: Identifying generalized Reed-Muller codewords by quantum queries

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