131,222 research outputs found
Difference Balanced Functions and Their Generalized Difference Sets
Difference balanced functions from to are closely related
to combinatorial designs and naturally define -ary sequences with the ideal
two-level autocorrelation. In the literature, all existing such functions are
associated with the -homogeneous property, and it was conjectured by Gong
and Song that difference balanced functions must be -homogeneous. First we
characterize difference balanced functions by generalized difference sets with
respect to two exceptional subgroups. We then derive several necessary and
sufficient conditions for -homogeneous difference balanced functions. In
particular, we reveal an unexpected equivalence between the -homogeneous
property and multipliers of generalized difference sets. By determining these
multipliers, we prove the Gong-Song conjecture for prime. Furthermore, we
show that every difference balanced function must be balanced or an affine
shift of a balanced function.Comment: 17 page
Quantum algorithms for highly non-linear Boolean functions
Attempts to separate the power of classical and quantum models of computation
have a long history. The ultimate goal is to find exponential separations for
computational problems. However, such separations do not come a dime a dozen:
while there were some early successes in the form of hidden subgroup problems
for abelian groups--which generalize Shor's factoring algorithm perhaps most
faithfully--only for a handful of non-abelian groups efficient quantum
algorithms were found. Recently, problems have gotten increased attention that
seek to identify hidden sub-structures of other combinatorial and algebraic
objects besides groups. In this paper we provide new examples for exponential
separations by considering hidden shift problems that are defined for several
classes of highly non-linear Boolean functions. These so-called bent functions
arise in cryptography, where their property of having perfectly flat Fourier
spectra on the Boolean hypercube gives them resilience against certain types of
attack. We present new quantum algorithms that solve the hidden shift problems
for several well-known classes of bent functions in polynomial time and with a
constant number of queries, while the classical query complexity is shown to be
exponential. Our approach uses a technique that exploits the duality between
bent functions and their Fourier transforms.Comment: 15 pages, 1 figure, to appear in Proceedings of the 21st Annual
ACM-SIAM Symposium on Discrete Algorithms (SODA'10). This updated version of
the paper contains a new exponential separation between classical and quantum
query complexit
- β¦