Related papers: Scheme for implementing the Deutsch-Jozsa algorith…
The first optical proposal for the realization of the two-bit version of the Deutsch-Jozsa algorithm [D. Deutsch and R. Jozsa, Proc. R. Soc. London A {\bf 493}, 553 (1992)] is presented. The proposal uses Stark shifts in an ensemble of…
Quantum computing implementations under consideration today typically deal with systems with microscopic degrees of freedom such as photons, ions, cold atoms, and superconducting circuits. The quantum information is stored typically in…
We discuss the ensemble version of the Deutsch-Jozsa (DJ) algorithm which attempts to provide a "scalable" implementation on an expectation-value NMR quantum computer. We show that this ensemble implementation of the DJ algorithm is at best…
A scheme for generating the cluster states via atomic ensembles is proposed. The scheme has inherent fault tolerance function and is robust to realistic noise and imperfections. All the facilities used in our scheme are well within the…
We present a simple scheme to implement the Deutsch-Jozsa algorithm based on two-atom interaction in a thermal cavity. The photon-number-dependent parts in the evolution operator are canceled with the strong resonant classical field added.…
For a practical quantum computer to operate, it will be essential to properly manage decoherence. One important technique for doing this is the use of "decoherence-free subspaces" (DFSs), which have recently been demonstrated. Here we…
A redundancy in the existing Deutsch-Jozsa quantum algorithm is removed and a refined algorithm, which reduces the size of the register and simplifies the function evaluation, is proposed. The refined version allows a simpler analysis of…
We show that one can implement the Deutsch-Josza algorithm, one of the first and simplest quantum algorithms, in a fault-tolerant manner using the smallest quantum error-detecting code -- the $[[4,2,2]]$ code -- without any ancillae. We…
Quantum machine learning seeks to exploit the underlying nature of a quantum computer to enhance machine learning techniques. A particular framework uses the quantum property of superposition to store sets of parameters, thereby creating an…
We reveal a close relationship between quantum metrology and the Deutsch-Jozsa algorithm on continuous variable quantum systems. We develop a general procedure, characterized by two parameters, that unifies parameter estimation and the…
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 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…
Atomic ensembles, comprising clouds of atoms addressed by laser fields, provide an attractive system for both the storage of quantum information, and the coherent conversion of quantum information between atomic and optical degrees of…
We investigate the realization of a simple solid-state quantum computer by implementing the Deutsch-Jozsa algorithm in a system of Josephson charge qubits. Starting from a procedure to carry out the one-qubit Deutsch-Jozsa algorithm we show…
We generalize the Deutsch-Jozsa problem and present a quantum algorithm that can solve the generalized Deutsch-Jozsa problem by a single evaluation of a given function. We discuss the initialization of an auxiliary register and present a…
We describe a general framework for regarding oracle-assisted quantum algorithms as tools for discriminating between unitary transformations. We apply this to the Deutsch-Jozsa problem and derive all possible quantum algorithms which solve…
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…
Realistic physical implementations of quantum computers can entail tradeoffs which depart from the ideal model of quantum computation. Although these tradeoffs have allowed successful demonstration of certain quantum algorithms, a crucial…
We propose an experimentally feasible scheme to generate Greenberger-Horne-Zeilinger (GHZ) type of maximal entanglement between many atomic ensembles based on laser manipulation and single-photon detection. The scheme, with inherent fault…
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…