Related papers: Generalized Deutsch-Jozsa Algorithm for Applicatio…
Hoyer has given a generalisation of the Deutsch--Jozsa algorithm which uses the Fourier transform on a group G which is (in general) non-Abelian. His algorithm distinguishes between functions which are either perfectly balanced (m-to-one)…
That superpositions of states can be useful for performing tasks in quantum systems has been known since the early days of quantum information, but only recently has quantitative theory of quantum coherence been proposed. Here we apply that…
In this paper, we study different cryptographically significant spectra of Boolean functions, including the Walsh-Hadamard, cross-correlation, and autocorrelation. The $2^k$-variation by Stanica [IEEE-IT 2016] is considered here with the…
We present an idealized quantum continuous variable analog of the Deutsch-Jozsa algorithm which can be implemented on a perfect continuous variable quantum computer. Using the Fourier transformation and XOR gate appropriate for continuous…
The present work points out that the Deutsch-Jozsa algorithm was the first formal description of a quantum decider. In particular, it is studied here the class of languages whose indicator functions allow the Deutsch-Jozsa algorithm to…
We consider a family of unstructured problems, for which we propose a method for constructing analog, continuous-time quantum algorithms that are more efficient than their classical counterparts. In this family of problems, which we refer…
The Deutsch-Jozsa algorithm is experimentally demonstrated for three-qubit functions using pure coherent superpositions of Li$_{2}$ rovibrational eigenstates. The function's character, either constant or balanced, is evaluated by first…
We describe the first experimental realization of the Deutsch-Jozsa quantum algorithm to evaluate the properties of a 2-bit boolean function in the framework of one-way quantum computation. For this purpose a novel two-photon six-qubit…
We propose an optical implementation of the Deutsch-Jozsa Algorithm using classical light in a binary decision-tree scheme. Our approach uses a ring cavity and linear optical devices in order to efficiently quarry the oracle functional…
We examine the "Guessing Secrets" problem arising in internet routing, in which the goal is to discover two or more objects from a known finite set. We propose a quantum algorithm using O(1) calls to an O(logN) oracle. This improves upon…
A classical analogue of Deutsch and Jozsa's algorithm is given and its implications on quantum computing is discussed
Quantum computing takes fully advantage of the superposition principle to increase greatly (even exponentially) the speed of calculations, relative to the classical approach. The Deutsch-Jozsa algorithm is the simplest quantum algorithm…
The existence of entangled quantum states gives extra power to quantum computers over their classical counterparts. Quantum entanglement shows up qualitatively at the level of two qubits. We show that if no entanglement is envolved then…
Quantum algorithms are typically understood in terms of the evolution of a multi-qubit quantum system under a prescribed sequence of unitary transformations. The input to the algorithm prescribes some of the unitary transformations in the…
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…
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)…
We demonstrate how a single heat exchange between a probe thermal qubit and multi-qubit thermal machine encoding a Boolean function, can determine whether the function is balanced or constant, thus providing a novel thermodynamic solution…
The well-known Deutsch Algorithm (DA) and Deutsch-Jozsha Algorithm (DJA) both are used as an evidence to the power of quantum computers over classical computation mediums. In these theoretical experiments, it has been shown that a quantum…
We describe the experimental implementation of a recently proposed quantum algorithm involving quantum entanglement at the level of two qubits using NMR. The algorithm solves a generalisation of the Deutsch problem and distinguishes between…
In our previous work, we defined a quantum algorithmic technique known as the Generalised Phase Kick-Back, or $GPK$, and analysed its applications in generalising some classical quantum problems, such as the Deutsch-Jozsa problem or the…