Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0512008 · Physics Letters A

A modified quantum adiabatic evolution for the Deutsch–Jozsa problem

Zhaohui Wei, Mingsheng Ying

Published Feb 15, 2006• 36 citations
arXivHTMLPDF
DOI
10.1016/j.physleta.2006.01.098

Related papers

An alternate quantum adiabatic evolution for the Deutsch–Jozsa problem

Jie Sun, Songfeng Lu, Fang Liu +1 more

Quantum Information Processing•Nov 18, 2013•4 citations

Study on Adiabatic Quantum Computation in Deutsch-Jozsa Problem

Shigeru Nakayama, Peng Gang

Studies in computational intelligence•Jan 1, 2013•2 citations

Adiabatic Deutsch-Jozsa Problem Solved by Modifying the Initial Hamiltonian

孙杰, 路松峰, Fang Liu +2 more

Chinese Physics Letters•Jan 1, 2014•0 citations

The Deutsch–Jozsa problem: de-quantisation and entanglement

Alastair A. Abbott

arXiv:0910.1990•Natural Computing•Aug 23, 2011•18 citations

Adiabatic Deutsch—Jozsa Problem Solved by Modifying the Initial Hamiltonian

Jie Sun, Songfeng Lu, Fang Liu +2 more

We present an alternate adiabatic evolution for the Deutsch—Jozsa problem. The biggest difference of our adiabatic evolution constructed here with those appearing before is that an alternate initial Hamiltonian is used for the adiabatic evolution, with which the evolution task can be finished in O(1) time complexity. Our construction mostly resembles the one discussed by Das et al. [ Phys. Rev. A 65 (2002) 062310 ], except for the initial system Hamiltonian of the adiabatic algorithm.

Chinese Physics Letters•Jul 1, 2014•2 citations

Study on Quantum Parallel Processing by Adiabatic Quantum Computation in Simon Problem

Shigeru Nakayama, Peng Gang, Ichiro Iimura

Adiabatic quantum computation has been proposed as quantum parallel processing with adiabatic evolution by using a superposition state to solve combinatorial optimization problem, then it has been applied to many problems like satisfiability problem. Among them, Deutsch and Deutsch-Jozsa problems have been tried to be solved by using adiabatic quantum computation. In this paper, we modify the adiabatic quantum computation and propose to solve Simon problem more efficiently by a method with higher observation probability.

International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)•Dec 1, 2013•0 citations
Adiabatic quantum computation has been proposed as quantum parallel processing with adiabatic evolution by using a superposition state to solve combinatorial optimization problem, then it has been applied to many problems like satisfiability problem. Among them, Deutsch and Deutsch-Jozsa problems have been tried to be solved by using adiabatic quantum computation. In this paper, we modify the adiabatic quantum computation and propose to solve Simon problem more efficiently by a method with higher observation probability.