Related papers: A Nuclear Magnetic Resonance Implementation of a C…
The Deutsch-Jozsa algorithm distinguishes constant functions from balanced functions with a single evaluation. In the first part of this work, we present simulations of the nuclear magnetic resonance (NMR) application of the Deutsch-Jozsa…
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…
We offer an improved method for using a nuclear-magnetic-resonance quantum computer (NMRQC) to solve the Deutsch-Jozsa problem. Two known obstacles to the application of the NMRQC are exponential diminishment of density-matrix elements with…
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…
The simulation of the spectra measured in nuclear magnetic resonance (NMR) spectroscopy experiments is a computationally non-trivial problem which, due to its natural interpretation as a quantum spin problem, maps in a straightforward way…
We implemented the refined Deutsch-Jozsa algorithm on a 3-bit nuclear magnetic resonance quantum computer, which is the meaningful test of quantum parallelism because qubits are entangled. All of the balanced and constant functions were…
We present a method of using a nuclear magnetic resonance computer to solve the Deutsch-Jozsa problem in which: (1) the number of molecules in the NMR sample is irrelevant to the number of qubits available to an NMR quantum computer, and…
An NMR realization of a two-qubit quantum gate which processes quantum information indirectly via couplings to a spectator qubit is presented in the context of the Deutsch-Jozsa algorithm. This enables a successful comprehensive NMR…
A scheme to execute an n-bit Deutsch-Jozsa (D-J) algorithm using n qubits has been implemented for up to three qubits on an NMR quantum computer. For the one and two bit Deutsch problem, the qubits do not get entangled, hence the NMR…
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…
Experimental NMR implementations of the Deutsch-Josza quantum algorithm based on pesudo-pure spin states exhibit an exponential sensitivity scaling with the number of qubits. By employing truly mixed spin states in spin Liouville space,…
Nuclear magnetic resonance techniques are used to realize a quantum algorithm experimentally. The algorithm allows a simple NMR quantum computer to determine global properties of an unknown function requiring fewer function ``calls'' than…
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…
Recent technological advances may lead to the development of small scale quantum computers capable of solving problems that cannot be tackled with classical computers. A limited number of algorithms has been proposed and their relevance to…
Nuclear Magnetic Resonance (NMR) was successfully employed to test several protocols and ideas in Quantum Information Science. In most of these implementations the existence of entanglement was ruled out. This fact introduced concerns and…
Schemes of experimental realization of the main two qubit processors for quantum computers and Deutsch-Jozsa algorithm are derived in virtual spin representation. The results are applicable for every four quantum states allowing the…
The existence of quantum correlation (as revealed by quantum discord), other than entanglement and its role in quantum-information processing (QIP), is a current subject for discussion. In particular, it has been suggested that this…
The Deustch-Jozsa problem is one of the most basic ways to demonstrate the power of quantum computation. Consider a Boolean function f : {0,1}^n to {0,1} and suppose we have a black-box to compute f. The Deutsch-Jozsa problem is to…
We propose a method for quantum algorithm design assisted by machine learning. The method uses a quantum-classical hybrid simulator, where a "quantum student" is being taught by a "classical teacher." In other words, in our method, 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…