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

Studies in computational intelligence

Study on Adiabatic Quantum Computation in Deutsch-Jozsa Problem

Shigeru Nakayama, Peng Gang

Published Jan 1, 2013• 2 citations
Publisher
DOI
10.1007/978-3-319-00738-0_3

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

A modified quantum adiabatic evolution for the Deutsch–Jozsa problem

Zhaohui Wei, Mingsheng Ying

arXiv:quant-ph/0512008•Physics Letters A•Feb 15, 2006•36 citations

Adiabatic Deutsch-Jozsa Problem Solved by Modifying the Initial Hamiltonian

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

Chinese Physics Letters•Jan 1, 2014•0 citations

Adiabatic quantum computation and Deutsch’s algorithm

Saurya Das, Randy Kobes, G. Kunstatter

We show that by a suitable choice of a time-dependent Hamiltonian, Deutsch's algorithm can be implemented by an adiabatic quantum computer. We extend our analysis to the Deutsch-Jozsa problem and estimate the required running time for both global and local adiabatic evolutions.

arXiv:quant-ph/0111032•Physical Review A•Jun 5, 2002•48 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

Study on Quantum Parallel Processing by Adiabatic Quantum Computation in Bernstein-Vazirani 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 Bernstein-Vazirani problem more efficiently by a method with higher observation probability.

International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)•Dec 1, 2012•3 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.
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 Bernstein-Vazirani problem more efficiently by a method with higher observation probability.