A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Efficient Quantum Algorithms related to Autocorrelation Spectrum
[article]
2019
arXiv
pre-print
In this paper, we propose efficient probabilistic algorithms for several problems regarding the autocorrelation spectrum. First, we present a quantum algorithm that samples from the Walsh spectrum of any derivative of f(). Informally, the autocorrelation coefficient of a Boolean function f() at some point a measures the average correlation among the values f(x) and f(x ⊕ a). The derivative of a Boolean function is an extension of autocorrelation to correlation among multiple values of f(). The
arXiv:1808.04448v2
fatcat:vnsy35j3mvhrrbntdjkbfiib7u