Quantum algorithms for the Goldreich-Levin learning problem

DOI10.1007/s11128-020-02839-7OpenAlexW3095165508MaRDI QIDQ2684273

Hong-Wei Li

Publication date: 16 February 2023

Published in: Quantum Information Processing (Search for Journal in Brave)

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

zbMATH Keywords

Walsh spectrumquantum algorithmBoolean functionDeutsch-jozsa algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Quantum computation (81P68) Cryptography (94A60) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum cryptography (quantum-theoretic aspects) (81P94) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items

Quantum search-to-decision reduction for the LWE problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum lower bounds for the Goldreich-Levin problem
• Modern cryptography, probabilistic proofs and pseudo-randomness
• Quantum algorithms for learning Walsh spectra of multi-output Boolean functions
• Implementing Grover oracles for quantum key search on AES and LowMC
• Breaking Symmetric Cryptosystems Using Quantum Period Finding
• Quantum Computation and Quantum Information
• Rapid solution of problems by quantum computation
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Quantum algorithms revisited
• On the Power of Quantum Computation
• Analysis of Boolean Functions
• Quantum complexity theory
• Probability Inequalities for Sums of Bounded Random Variables