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

International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)

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

Shigeru Nakayama, Peng Gang, Ichiro Iimura

Published Dec 1, 2013• 0 citations
Publisher

Abstract

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.

DOI
10.1109/pdcat.2013.20

Related papers

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 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•50 citations

NMR realization of adiabatic quantum algorithms for the modified Simon problem

Long Yu, Guanru Feng, Yongchao Tang +2 more

Having the advantages of inherent robustness and fault tolerance, adiabatic quantum algorithms have attracted much attention in recent years. In this paper, we report the NMR experimental realization of adiabatic algorithms for the modified Simon's problem in a NMR quantum information processor. We first realized an adiabatic quantum algorithm by Rao [Phys. Rev. A 67, 052306 (2003)] and then proposed a quantum algorithm by using the method of enhanced symmetry of the Hamiltonian given in Schaller and Schtzhold [Quantum Inf. Comput. 10, 109 (2010)]. We demonstrated this symmetry-enhanced algorithm in experiment. We studied the effects of the number of Trotter evolution steps on the validity of adiabatic evolution and decoherence. In practical applications, a trade-off between pulse imperfection and adiabatic requirement must be made in the Trotter evolution step number. An optimal evolution step number and run time were indicated by our results. The experimental demonstration also showed that the symmetry-enhanced algorithm gave a better performance.

Physical Review A•Jul 9, 2013•11 citations

Study on discrete quantum adiabatic computation in combinatorial search problems

Mohamed El-fiky

The model of adiabatic quantum computation is a new paradigm for designing quantum algorithms. This model is based on the quantum adiabatic theorem, where a quantum computer evolves the quantum system slowly to switch gradually from an initial Hamiltonian with a ground state which is easy to construct, to a final Hamiltonian whose ground state encodes the solution of the problem to be solved. This dissertation presents an experimental study on the discrete quantum adiabatic computation in combinatorial search problems, we take k-Satisfiability problem as target problem to be examined. For k ? 3, k-SAT is NP-complete, i.e., among the most difficult NP problems in the worst case. Here we proposes a new monotonic variation method for the phase shift and mixing functions in the adiabatic quantum algorithm called the Quadric variation method, in order to speed up the algorithm search and decrease the overall resulting search cost. In addition, we present a better parameter configuration for the algorithm to be used with quadric variation as well as the previously proposed methods. The experiment are carried out in solving random instances of 3-SAT problems. The results indicate that the proposed method of using monotonic quadric variation in the phase functions of the adiabatic algorithm greatly improve the search behavior of the adiabatic algorithm and reduces the resulting search cost, also the results indicate that the better configuration of the algorithm parameters could greatly enhance the search behavior for the proposed method as well as the previously proposed methods.

•Jan 1, 2012•0 citations

Walsh transforms and efficient quantum algorithms

Takashi Mihara

In this paper, we show structures of efficient quantum algorithms on a quantum Turing machine. First, we denote a relationship between Simon's algorithm and Walsh transforms. Next, we also show that a quantum Turing machine can efficiently solve the Deutsch–Jozsa problem by using interference among configurations instead of observation. Moreover, based on these results, we are led to structures of more general quantum algorithms. Finally, we show a problem that can be efficiently solved by using this type of algorithm and a Walsh transform. © 2000 Scripta Technica, Electron Comm Jpn Pt 3, 83(8): 71–80, 2000

Electronics and Communications in Japan (Part III Fundamental Electronic Science)•Aug 1, 2000•1 citation

Efficiency of structured adiabatic quantum computation

Juan José García‐Ripoll, Mari Carmen Bañuls

We show enough evidence that a structured version of Adiabatic Quantum Computation (AQC) is efficient for most satisfiability problems. More precisely, when the success probability is fixed beforehand, the computational resources grow subexponentially in the number of qubits. Our study focuses on random satisfiability and exact cover problems, developing a multi-step algorithm that solves clauses one by one. Relating the computational cost to classical properties of the problem, we collect significant statistics with up to N=140 qubits, around the phase transitions, which is where the hardest problems appear.

arXiv:0812.1760•Dec 9, 2008•2 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.
Having the advantages of inherent robustness and fault tolerance, adiabatic quantum algorithms have attracted much attention in recent years. In this paper, we report the NMR experimental realization of adiabatic algorithms for the modified Simon's problem in a NMR quantum information processor. We first realized an adiabatic quantum algorithm by Rao [Phys. Rev. A 67, 052306 (2003)] and then proposed a quantum algorithm by using the method of enhanced symmetry of the Hamiltonian given in Schaller and Schtzhold [Quantum Inf. Comput. 10, 109 (2010)]. We demonstrated this symmetry-enhanced algorithm in experiment. We studied the effects of the number of Trotter evolution steps on the validity of adiabatic evolution and decoherence. In practical applications, a trade-off between pulse imperfection and adiabatic requirement must be made in the Trotter evolution step number. An optimal evolution step number and run time were indicated by our results. The experimental demonstration also showed that the symmetry-enhanced algorithm gave a better performance.
The model of adiabatic quantum computation is a new paradigm for designing quantum algorithms. This model is based on the quantum adiabatic theorem, where a quantum computer evolves the quantum system slowly to switch gradually from an initial Hamiltonian with a ground state which is easy to construct, to a final Hamiltonian whose ground state encodes the solution of the problem to be solved. This dissertation presents an experimental study on the discrete quantum adiabatic computation in combinatorial search problems, we take k-Satisfiability problem as target problem to be examined. For k ? 3, k-SAT is NP-complete, i.e., among the most difficult NP problems in the worst case. Here we proposes a new monotonic variation method for the phase shift and mixing functions in the adiabatic quantum algorithm called the Quadric variation method, in order to speed up the algorithm search and decrease the overall resulting search cost. In addition, we present a better parameter configuration for the algorithm to be used with quadric variation as well as the previously proposed methods. The experiment are carried out in solving random instances of 3-SAT problems. The results indicate that the proposed method of using monotonic quadric variation in the phase functions of the adiabatic algorithm greatly improve the search behavior of the adiabatic algorithm and reduces the resulting search cost, also the results indicate that the better configuration of the algorithm parameters could greatly enhance the search behavior for the proposed method as well as the previously proposed methods.
In this paper, we show structures of efficient quantum algorithms on a quantum Turing machine. First, we denote a relationship between Simon's algorithm and Walsh transforms. Next, we also show that a quantum Turing machine can efficiently solve the Deutsch–Jozsa problem by using interference among configurations instead of observation. Moreover, based on these results, we are led to structures of more general quantum algorithms. Finally, we show a problem that can be efficiently solved by using this type of algorithm and a Walsh transform. © 2000 Scripta Technica, Electron Comm Jpn Pt 3, 83(8): 71–80, 2000
We show enough evidence that a structured version of Adiabatic Quantum Computation (AQC) is efficient for most satisfiability problems. More precisely, when the success probability is fixed beforehand, the computational resources grow subexponentially in the number of qubits. Our study focuses on random satisfiability and exact cover problems, developing a multi-step algorithm that solves clauses one by one. Relating the computational cost to classical properties of the problem, we collect significant statistics with up to N=140 qubits, around the phase transitions, which is where the hardest problems appear.