Related papers: On the connection between Deutsch-Jozsa algorithm …
Uhlmann's theorem is a central result in quantum information theory, which associates the closeness of two quantum states with that of their purifications. The theorem also well characterizes a fundamental task: how close a pure quantum…
We demonstrate experimentally the usefulness of selective pulses in NMR to perform quantum computation. Three different techniques based on selective pulse excitations have been proposed to prepare a spin system in a pseudo-pure state. We…
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…
Semi-bent Boolean functions are interesting from a cryptographic standpoint, since they possess several desirable properties such as having a low and flat Walsh spectrum, which is useful to resist linear cryptanalysis. In this paper, we…
We propose a way to implement a three-qubit refined Deutsh-Jozsa (DJ) algorithm. The present proposal is based on the construction of the 35 $f$-controlled phase gates, which uses single-qubit $\sigma_z$ gates and two-qubit {\it standard}…
The Poisson equation occurs in many areas of science and engineering. Here we focus on its numerical solution for an equation in d dimensions. In particular we present a quantum algorithm and a scalable quantum circuit design which…
This report presents a practical approach to teaching quantum computing to Electrical Engineering & Computer Science (EECS) students through dedicated hands-on programming labs. The labs cover a diverse range of topics, encompassing…
Quantum Computing is a new and exciting field at the intersection of mathematics, computer science and physics. It concerns a utilization of quantum mechanics to improve the efficiency of computation. Here we present a gentle introduction…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
We show that by a suitable choice of a time dependent Hamiltonian, Deutsch's algorithm can be implemented by an adiabatic quantum computer. We extend our analysis to the Deutsch-Jozsa problem and estimate the required running time for both…
The Goldreich-Levin algorithm was originally proposed for a cryptographic purpose and then applied to learning. The algorithm is to find some larger Walsh coefficients of an $n$ variable Boolean function. Roughly speaking, it takes a…
Given a black-box representing an unknown Boolean function $f$ of $n$ variables, in this paper we propose a fast quantum algorithm to test whether or not a certain variable in the function $f$ is a junta variable. The proposed algorithm…
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)…
We introduce a novel tableau-based classical simulation method for quantum computation, formulated within the phase space framework of the extended stabilizer theory of closed non-contextual operators. This method enables the efficient…
We consider the connection between this zeta function and quantum search via quantum walk. First, we give an explicit expression of the zeta function on the one-dimensional torus in the general case of the number and position of marked…
Consider the following generalized hidden shift problem: given a function f on {0,...,M-1} x Z_N satisfying f(b,x)=f(b+1,x+s) for b=0,1,...,M-2, find the unknown shift s in Z_N. For M=N, this problem is an instance of the abelian hidden…
We theoretically study the realization of a multi-qubit refined Deutsch-Jozsa (DJ) algorithm using resonant interaction of many Rydberg atoms with a single-mode microwave cavity, in which the multi-qubit controlled phase gates could be…
We present an original model of paraconsistent Turing machines (PTMs), a generalization of the classical Turing machines model of computation using a paraconsistent logic. Next, we briefl y describe the standard models of quantum…
The quantum Fourier transform (QFT) plays an important role in many known quantum algorithms such as Shor's algorithm for prime factorisation. In this paper we show that the QFT algorithm can, on a restricted set of input states, be…
We discuss Donsker's delta function within the framework of White Noise Analysis, in particular its extension to complex arguments. With a view towards applications to quantum physics we also study sums and products of Donsker's delta…