Related papers: Quantum boolean functions
We study Fourier-sparse Boolean functions over general finite Abelian groups. A Boolean function $f : G \to \{-1,+1\}$ is $s$-sparse if it has at most $s$ non-zero Fourier coefficients. We introduce a general notion of granularity of…
In 2015, Lovejoy and Osburn discovered twelve $q$-hypergeometric series and proved that their Fourier coefficients can be understood as counting functions of ideals in certain quadratic fields. In this paper, we study their modular and…
The method of transfer functions is developed as a tool for studying Bell inequalities, alternative quantum theories and the associated physical properties of quantum systems. Non-negative probabilities for transfer functions result in…
Quantum computations promise the ability to solve problems intractable in the classical setting. Restricting the types of computations considered often allows to establish a provable theoretical advantage by quantum computations, and later…
A sequence of functions {f_n(q)}_{n=1}^{\infty} satisfies the functional equation for multiplication of quantum integers if f_{mn}(q) = f_m(q)f_n(q^m) for all positive integers m and n. This paper describes the structure of all sequences of…
One of the key challenges in quantum machine learning is finding relevant machine learning tasks with a provable quantum advantage. A natural candidate for this is learning unknown Hamiltonian dynamics. Here, we tackle the supervised…
It is well known that quantum, randomized and deterministic (sequential) query complexities are polynomially related for total boolean functions. We find that significantly larger separations between the parallel generalizations of these…
Given a prior probability distribution over a set of possible oracle functions, we define a number of queries to be useless for determining some property of the function if the probability that the function has the property is unchanged…
We investigate the influences of variables on a Boolean function $f$ based on the quantum Bernstein-Vazirani algorithm. A previous paper (Floess et al. in Math. Struct. in Comp. Science 23: 386, 2013) has proved that if a $n$-variable…
In this note, we develop a bounded-error quantum algorithm that makes $\tilde O(n^{1/4}\varepsilon^{-1/2})$ queries to a Boolean function $f$, accepts a monotone function, and rejects a function that is $\varepsilon$-far from being…
Several classes of quantum circuits have been shown to provide a quantum computational advantage under certain assumptions. The study of ever more restricted classes of quantum circuits capable of quantum advantage is motivated by possible…
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…
We compute the resolvent of the anti-commutator operator $XP+PX$ and of the quantum harmonic oscillator Hamiltonian operator $\frac{1}{2}(X^2+P^2)$. Using Stone's formula for finding the spectral resolution of an, either bounded or…
Probably the simplest and most frequently used way to illustrate the power of quantum computing is to solve the so-called {\it Deutsch's problem}. Consider a Boolean function $f: \{0,1\} \to \{0,1\}$ and suppose that we have a (classical)…
The notion of generalized quantum monoids is introduced. It is proved that the quantum coordinate ring of the monoid can be lifted to a quantum hyper-algebra, in which the quantum determinant and quantum Pfaffian are sent to the quantum…
We study correlation bounds under pairwise independent distributions for functions with no large Fourier coefficients. Functions in which all Fourier coefficients are bounded by $\delta$ are called $\delta$-{\em uniform}. The search for…
We define and study a new type of quantum oracle, the quantum conditional oracle, which provides oracle access to the conditional probabilities associated with an underlying distribution. Amongst other properties, we (a) obtain speed-ups…
We derive a Bell inequality based on a generalized quasiprobability function which is parameterized by one non-positive real value. Two types of known Bell inequalities formulated in terms of the Wigner and Q functions are included as…
Suppose that a quantum circuit with K elementary gates is known for a unitary matrix U, and assume that U^m is a scalar matrix for some positive integer m. We show that a function of U can be realized on a quantum computer with at most…
The objective of this series of papers is to recover information regarding the behaviour of FQ operations in the case $n=2$, and FQ conform-operations in the case $n=3$. In this first part we study how the basic invariance properties of FQ…