Following forrelation -- quantum algorithms in exploring Boolean functions' spectra

DOI10.3934/amc.2021067arXiv2104.12212MaRDI QIDQ6067842

Suman Dutta, Subhamoy Maitra, Chandra Sekhar Mukherjee

Publication date: 14 December 2023

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

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

zbMATH Keywords

Walsh spectrumBoolean functionsquantum algorithmforrelationcross-correlation spectrum

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12) Boolean functions (94D10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Application of Grover's algorithm to check non-resiliency of a Boolean function
• Cross-correlation analysis of cryptographically useful boolean functions and s-boxes
• Efficient quantum algorithms related to autocorrelation spectrum
• The connection between quadratic bent-negabent functions and the Kerdock code
• BQP and the polynomial hierarchy
• Forrelation
• Construction of Nonlinear Resilient Boolean Functions Using “Small” Affine Functions
• A spectral characterization of correlation-immune combining functions
• Rapid solution of problems by quantum computation
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• On the Power of Quantum Computation
• Two New Classes of Bent Functions
• k-forrelation optimally separates Quantum and classical query complexity

This page was built for publication: Following forrelation -- quantum algorithms in exploring Boolean functions' spectra