Related papers: Deutsch-Jozsa algorithm as a test of quantum compu…
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…
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…
Distributed quantum computing can give substantial noise reduction due to shallower circuits. An experiment illustrates the advantages in the case of Grover search. This motivates studying the quantum advantage of the distributed version of…
A new approach to the implementation of a quantum computer by high-resolution nuclear magnetic resonance (NMR) is described. The key feature is that two or more line-selective radio-frequency pulses are applied simultaneously. A three-qubit…
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…
Measurement-based quantum computing (MBQC), an alternate paradigm for formulating quantum algorithms, can lead to potentially more flexible and efficient implementations as well as to theoretical insights on the role of entanglement in a…
We perform quantum interference experiments on a single self-assembled semiconductor quantum dot. The presence or absence of a single exciton in the dot provides a qubit that we control with femtosecond time resolution. We combine a set of…
The Deutsch-Jozsa algorithm is a generalization of the Deutsch algorithm which was the first algorithm written. We present schemes to implement the Deutsch algorithm and the Deutsch-Jozsa algorithm via cavity QED.
In 1985, David Deutsch challenged the Church-Turing thesis by stating that his quantum model of computation "could, in principle, be built and would have many remarkable properties not reproducible by any Turing machine". While this is…
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…
Using the Deutsch-Jozsa algorithm, we will develop a method for solving a class of problems in which we need to determine parts of an array and then apply a specified function to each independent part. Since present quantum computers are…
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…
One-way quantum computing is an important and novel approach to quantum computation. By exploiting the existing particle-particle interactions, we report the first experimental realization of the complete process of deterministic one-way…
A detailed description of the development of a three qubit NMR realization of the Deutsch-Jozsa algorithm [Collins et.al., Phys. Rev. A 62, 022304 (2000)] is provided. The theoretical and experimental techniques used for the reduction of…
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…
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…
We want in this article to show the usefulness of Quantum Turing Machine (QTM) in a high-level didactic context as well as in theoretical studies. We use QTM to show its equivalence with quantum circuit model for Deutsch and Deutsch-Jozsa…
We propose a physical scheme for implementing the Deutsch-Jozsa algorithm using atomic ensembles and optical devices. The scheme has inherent fault tolerance to the realistic noise and efficient scaling with the number of ensembles for some…
The goal of this paper is to study the effect of entanglement on the running time of a quantum computation. Adiabatic quantum computation is suited to this kind of study, since it allows us to explicitly calculate the time evolution of the…
A long-standing aim of quantum information research is to understand what gives quantum computers their advantage. This requires separating problems that need genuinely quantum resources from those for which classical resources are enough.…