A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
Following Forrelation – quantum algorithms in exploring Boolean functions' spectra
Advances in Mathematics of Communications
<p style='text-indent:20px;'>Here we revisit the quantum algorithms for obtaining Forrelation [Aaronson et al., 2015] values to evaluate some of the well-known cryptographically significant spectra of Boolean functions, namely the Walsh spectrum, the cross-correlation spectrum, and the autocorrelation spectrum. We introduce the existing 2-fold Forrelation formulation with bent duality-based promise problems as desirable instantiations. Next, we concentrate on the 3-fold version through twodoi:10.3934/amc.2021067 fatcat:v7fs5y2merhujmxi5fktjcdti4