相关论文: Scheme for implementing the Deutsch-Jozsa algorith…

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…

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…

We report an experimental demonstration of quantum Deutsch's algorithm by using linear-optical system. By employing photon's polarization and spatial modes, we implement all balanced and constant functions for quantum computer. The…

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,…

Deutsch-Jozsa (DJ) problem is one of the most important problems demonstrating the power of quantum algorithm. DJ problem can be described as a Boolean function $f$: $\{0,1\}^n\rightarrow \{0,1\}$ with promising it is either constant or…

We present a novel approach to quantum algorithms, by taking advantage of modular values, i.e., complex and unbounded quantities resulting from specific post-selected measurement scenarios. Our focus is on the problem of ascertaining…

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…

Quantum information processing has been one of the pillars of the new information age. In this sense, the control and processing of quantum information plays a fundamental role, and computers capable of manipulating such information have…

The paper introduces an efficient implementation of the Deutsch-Jozsa and Bernstein-Vazirani algorithm using the single-particle discrete-time quantum walk. We also provide a detailed optical framework with specific optical components to…

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…

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.…

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.

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…

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…

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…

The original Deutsch-Jozsa (oDJ) problem is for an oracle (realized here as a database) of size N, where, according to their claim, the deterministic solution of the problem on a classical Turing computer requires O(N) computational…

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…

In these notes we present preliminary results on quantum-like algorithms where tensor product is replaced by geometric product. Such algorithms possess the essential properties typical of quantum computation (entanglement, parallelism) but…

A classical analogue of Deutsch and Jozsa's algorithm is given and its implications on quantum computing is discussed

Deutsch's algorithm is the simplest quantum algorithm which shows the acceleration of quantum computer. In this paper, we theoretically advance a scheme to implement quantum Deutsch's algorithm in spin-orbital angular momentum space. Our…