Related papers: How many functions can be distinguished with k qua…
Research on quantum computing has recently gained significant momentum since first physical devices became available. Many quantum algorithms make use of so-called oracles that implement Boolean functions and are queried with highly…
A coverage function f over a ground set [m] is associated with a universe U of weighted elements and m subsets A_1,..., A_m of U, and for any subset T of [m], f(T) is defined as the total weight of the elements in the union $\cup_{j\in T}…
This article highlights some of the key operating principles of Grover algorithm. These principles were used to develop a new oracle function, that illustrates the possibility of using Grover algorithm for solving more realistic and…
We study quantum algorithms for the hidden shift problem of complex scalar- and vector-valued functions on finite abelian groups. Given oracle access to a shifted function and the Fourier transform of the unshifted function, the goal is to…
This paper gives a simple proof of why a quantum computer, despite being in all possible states simultaneously, needs at least 0.707 sqrt(N) queries to retrieve a desired item from an unsorted list of items. The proof is refined to show…
The paper presents the first nontrivial upper and lower bounds for (non-oblivious) quantum read-once branching programs. It is shown that the computational power of quantum and classical read-once branching programs is incomparable in the…
The indeterministic outcome of a measurement of an individual quantum is certified by the impossibility of the simultaneous, definite, deterministic pre-existence of all conceivable observables from physical conditions of that quantum…
The counterfeit coin problem requires us to find all false coins from a given bunch of coins using a balance scale. We assume that the balance scale gives us only ``balanced'' or ``tilted'' information and that we know the number k of false…
We show that there exists an oracle relative to which quantum commitments exist but no (efficiently verifiable) one-way state generators exist. Both have been widely considered candidates for replacing one-way functions as the minimal…
We define syntax and semantics of quantum circuits, allowing measurement gates and classical channels. We define circuit-based quantum algorithms and prove that, semantically, any such algorithm is equivalent to a single measurement that…
This paper introduces a novel quantum algorithm that is able to classify a hierarchy of classes of imbalanced Boolean functions. The fundamental characteristic of imbalanced Boolean functions is that the proportion of elements in their…
Given an $n$-ary $k-$valued function $f$, $gap(f)$ denotes the minimal number of essential variables in $f$ which become fictive when identifying any two distinct essential variables in $f$. We particularly solve a problem concerning the…
We enlighten relations between the K\"all\'en function, allowing in a simple way to distinguish between virtual and real processes involving massive particles, and the dilogarithms occurring as results of loop calculations for such kind of…
We propose using quantum computers in conjunction with classical machine learning to discover instances of interesting quantum many-body dynamics. Concretely, an ``interest function'' is defined for a given circuit (family) instance that…
We investigate the connection between interference and computational power within the operationally defined framework of generalised probabilistic theories. To compare the computational abilities of different theories within this framework…
We demonstrate the existence of $K$-multimagic squares of order $N$ consisting of distinct integers whenever $N>2 K(K+1)$. This improves upon our earlier result in which we only required $N+1$ distinct integers. Additionally, we present a…
After an elementary derivation of Bell's inequality, several forms of expectation functions for two-valued observables are discussed. Special emphasis is given to hypothetical stronger-than quantum expectation functions which give rise to a…
Operator $k$-tone functions on an open interval of the real line, which are higher order extensions of operator monotone and convex functions, are characterized via certain inequalities for the real and imaginary parts of analytic…
We prove lower bounds on the error probability of a quantum algorithm for searching through an unordered list of N items, as a function of the number T of queries it makes. In particular, if T=O(sqrt{N}) then the error is lower bounded by a…
The phenomenon of quantum entanglement is fundamental to the implementation of quantum computation, and requires at least two qubits for its demonstration. However, both Deutsch algorithm and Grover's search algorithm for two bits do not…