Related papers: Quantum boolean functions
The quantum query models is one of the most important models in quantum computing. Several well-known quantum algorithms are captured by this model, including the Deutsch-Jozsa algorithm, the Simon algorithm, the Grover algorithm and…
The Friedgut--Kalai--Naor theorem states that if a Boolean function $f\colon \{0,1\}^n \to \{0,1\}$ is close (in $L^2$-distance) to an affine function $\ell(x_1,...,x_n) = c_0 + \sum_i c_i x_i$, then $f$ is close to a Boolean affine…
We introduce quantum Boolean algebras which are the analogue of the Weyl algebras for Boolean affine spaces. We study quantum Boolean algebras from the logical and set theoretical viewpoints.
We construct a category of quantum polynomial functors which deforms Friedlander and Suslin's category of strict polynomial functors. The main aim of this paper is to develop from first principles the basic structural properties of this…
In recent years, various quantum inequalities have been established on quantum symmetries in the framework of quantum Fourier analysis. We provide a detailed introduction to quantum inequalities including Hausdorff-Young inequality, Young's…
It is a well-known fact that Riemann Hypothesis will follows if the function identically equal to -1 can be arbitrarily approximated in the norm $\norma{.}$ of $L^{2}([0,1],dx)$ by functions of the form $f(x)=\sum_{k=1}^{n}a_{k}…
Quantum computing is evolving so rapidly that it forces us to revisit, rewrite, and update the foundations of the theory. \emph{Basic Quantum Algorithms} revisits the earliest quantum algorithms. The journey began in 1985 with Deutsch…
We study the quantum query complexity of the Boolean hidden shift problem. Given oracle access to f(x+s) for a known Boolean function f, the task is to determine the n-bit string s. The quantum query complexity of this problem depends…
Quantum computing is a promising new area of computing with quantum algorithms offering a potential speedup over classical algorithms if fault tolerant quantum computers can be built. One of the first applications of the classical computer…
In this paper, we consider the characterization of the bentness of quadratic Boolean functions of the form $f(x)=\sum_{i=1}^{\frac{m}{2}-1} Tr^n_1(c_ix^{1+2^{ei}})+ Tr_1^{n/2}(c_{m/2}x^{1+2^{n/2}}) ,$ where $n=me$, $m$ is even and $c_i\in…
We define tests of boolean functions which distinguish between linear (or quadratic) polynomials, and functions which are very far, in an appropriate sense, from these polynomials. The tests have optimal or nearly optimal trade-offs between…
Let F(R^n) be the algebra of Fourier transforms of functions from L_1(R^n), K(R^n) be the algebra of Fourier transforms of bounded complex Borel measures in R^n and W be Wiener algebra of continuous 2pi-periodic functions with absolutely…
The total influence of a function is a central notion in analysis of Boolean functions, and characterizing functions that have small total influence is one of the most fundamental questions associated with it. The KKL theorem and the…
This paper generalizes both the binary Deutsch-Jozsa and Grover algorithms to $n$-valued logic using the quantum Fourier transform. Our extended Deutsch-Jozsa algorithm is not only able to distinguish between constant and balanced Boolean…
Bernstein-Vazirani algorithm (the one-query algorithm) can identify a completely specified linear Boolean function using a single query to the oracle with certainty. The first aim of the paper is to show that if the provided Boolean…
Let a Boolean function be available as a black-box (oracle) and one likes to devise an algorithm to test whether it has certain property or it is $\epsilon$-far from having that property. The efficiency of the algorithm is judged by the…
In this work, we consider a new type of Fourier-like representation of Boolean function $f\colon\{+1,-1\}^n\to\{+1,-1\}$ \[ f(x) = \cos\left(\pi\sum_{S\subseteq[n]}\phi_S \prod_{i\in S} x_i\right). \] This representation, which we call the…
This paper initiates a systematic study of quantum functions, which are (partial) functions defined in terms of quantum mechanical computations. Of all quantum functions, we focus on resource-bounded quantum functions whose inputs are…
We show how Cauchy's Integral Formula and the ideas of Dunford's Holomorphic Functional Calculus (for unbounded operators) can be used to compute the Vacuum Characteristic Function (Quantum Fourier Transform) of quantum random variables…
We present two new results about exact learning by quantum computers. First, we show how to exactly learn a $k$-Fourier-sparse $n$-bit Boolean function from $O(k^{1.5}(\log k)^2)$ uniform quantum examples for that function. This improves…