Simple scheme for implementing the Deutsch-Jozsa algorithm in thermal cavity
نویسنده
چکیده
Wen-Xing Yang, 2, ∗ Zhe-Xuan Gong, † Wei-Bin Li, 2 and Xiao-Xue Yang State Key Laboratory of Magnetic Resonance and Atomic and Molecular Physics, Center for Cold Atom Physics, Wuhan Institute of Physics and Mathematics, Chinese Academy of Sciences, Wuhan 430071 China Graduate School, Chinese Academy of Sciences, Beijing 100080, China Department of Physics, Huazhong University of Science and Technology, Wuhan 430074, China (Dated: December 7, 2006)
منابع مشابه
Implementation of the Deutsch-Jozsa algorithm with Josephson charge qubits
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 onequbit Deutsch-Jozsa algorithm we show how the N-qubit version of the Bernstein-Vazirani algorithm can be realized. For the implementation of the three-qubit Deutsch-Jozsa algorithm we study in de...
متن کاملTwo-bit Deutsch-Jozsa algorithm using an atomic ensemble
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 493, 553 (1992)] is presented. The proposal uses Stark shifts in an ensemble of atoms and degenerate sources of photons. The photons interact dispersively with an atomic ensemble, leading to an effective Hamiltonian in atom-field basis, which is u...
متن کاملJ an 2 00 3 Quantum Guessing via Deutsch - Jozsa
We begin with a variation of classical 20 questions and propose a quantum algorithm to solve it efficiently and in time independent of the size of the object set. In the process, we extend the types of questions and function oracles that the Deutsch-Jozsa algorithm can be used to solve.
متن کاملBroken promises and quantum algorithms
In the black-box model, promise problems are the only ones that admit a quantum exponential speedup over the best classical algorithm in terms of query complexity. The most prominent example of this is the Deutsch-Jozsa algorithm. More recently, Wim van Dam put forward an algorithm for unstructured problems (ie, those without a promise). We consider the Deutsch-Jozsa algorithm with a less restr...
متن کاملExtending the Promise of the Deutsch–jozsa–høyer Algorithm for Finite Groups
Høyer has given a generalisation of the Deutsch–Jozsa algorithm which uses the Fourier transform on a group G which is (in general) non-Abelian. His algorithm distinguishes between functions which are either perfectly balanced (m-to-one) or constant, with certainty, and using a single quantum query. Here, we show that this algorithm (which we call the Deutsch–Jozsa–Høyer algorithm) can in fact ...
متن کامل