相关论文: Generalization of the Deutsch algorithm using two …

Quantum computing with qudits, quantum systems with $d > 2$ levels, offers a powerful extension beyond qubits, expanding the computational possibilities of quantum systems, allowing the simplification of the implementation of several…

This work demonstrates that the Deutsch algorithm can be effectively modelled using a two-level harmonic oscillator within the second quantization formalism. By adopting this framework, evolution operators are derived. We present a…

Robust quantum computation with d-level quantum systems (qudits) poses two requirements: fast, parallel quantum gates and high fidelity two-qudit gates. We first describe how to implement parallel single qudit operations. It is by now well…

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…

The paradigm behind digital quantum computing inherits the idea of using binary information processing. Nature in fact gives much more rich structures of physical objects that can be used for encoding information, which is especially…

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…

Quantum algorithms theoretically outperform classical algorithms in solving problems of increasing size, but computational errors must be kept to a minimum to realize this potential. Despite the development of increasingly capable quantum…

We propose a genetic-algorithm-based method to find the unitary transformations for any desired quantum computation. We formulate a simple genetic algorithm by introducing the "genetic parameter vector" of the unitary transformations to be…

ROM-based quantum computation (QC) is an alternative to oracle-based QC. It has the advantages of being less ``magical'', and being more suited to implementing space-efficient computation (i.e. computation using the minimum number of…

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…

Bernstein-Vazirani algorithm (the one-query algorithm) can identify a completely specified linear Boolean function using a single query to the oracle with certainty. The first aim of the paper is to show that if the provided Boolean…

Early in 1992, Deutsch-Jozsa algorithm computed a symmetric partial Boolean function with a single quantum query, and thus achieved the best separation between classical deterministic and exact quantum query complexity. Until recent years,…

Recently, [{arXiv:0810.3134}] is accepted and published. We show that the Bell inequalities lead to a new type of linear-optical Deutsch algorithms. We have considered a use of entangled photon pairs to determine simultaneously and…

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…

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

Quantum search is among the most important algorithms in quantum computing. At its core is quantum amplitude amplification, a technique that achieves a quadratic speedup over classical search by combining two global reflections: the oracle,…

We discuss a new approach to simulate quantum algorithms using classical probabilistic bits and circuits. Each qubit (a two-level quantum system) is initially mapped to a vector in an eight dimensional probability space (equivalently, to a…

A quantum algorithm for an oracle problem can be understood as a quantum strategy for a player in a two-player zero-sum game in which the other player is constrained to play classically. I formalize this correspondence and give examples of…

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…