A quantum algorithm to estimate the Gowers U_2 norm and linearity testing of Boolean functions

06/30/2020
by   C. A. Jothishwaran, et al.
0

We propose a quantum algorithm to estimate the Gowers U_2 norm of a Boolean function, and extend it into a second algorithm to distinguish between linear Boolean functions and Boolean functions that are ϵ-far from the set of linear Boolean functions, which seems to perform better than the classical BLR algorithm. Finally, we outline an algorithm to estimate Gowers U_3 norms of Boolean functions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/25/2022

A quantum algorithm to estimate the closeness to the Strict Avalanche criterion in Boolean functions

We propose a quantum algorithm (in the form of a quantum oracle) that es...
research
05/17/2023

Generalized Polymorphisms

We determine all m-ary Boolean functions f_0,…,f_m and n-ary Boolean fun...
research
08/04/2023

Linear isomorphism testing of Boolean functions with small approximate spectral norm

Two Boolean functions f, g : F_2^n →-1, 1 are called linearly isomorphic...
research
12/03/2019

On the connection between Deutsch-Jozsa algorithm and bent functions

It is presently shown that the Deutsch-Jozsa algorithm is connected to t...
research
01/25/2022

Basic Quantum Algorithms

Quantum computing is evolving so quickly that forces us to revisit, rewr...
research
04/25/2019

Dimensionality Distinguishers

The celebrated Clauser, Horne, Shimony and Holt (CHSH) game model helps ...
research
02/23/2019

Quantum Learning Boolean Linear Functions w.r.t. Product Distributions

The problem of learning Boolean linear functions from quantum examples w...

Please sign up or login with your details

Forgot password? Click here to reset