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

A New Efficient Quantum Algorithm for Solving NP-complete Problems

Dhananjay P. Mehendale

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.2139/ssrn.6898418

Related papers

New quantum algorithm for studying NP-complete problems

Masanori Ohya, Igor V. Volovich

arXiv:quant-ph/0406216•Reports on Mathematical Physics•Aug 1, 2003•34 citations

New quantum algorithm for studying NP-complete problems

Masanori Ohya, Igor Vasil'evich Volovich

Ordinary approach to quantum algorithm is based on quantum Turing machine or quantum circuits. It is known that this approach is not powerful enough to solve NP-complete problems. In this paper we study a new approach to quantum algorithm which is a combination of the ordinary quantum algorithm with a chaotic dynamical system. We consider the satisfiability problem as an example of NP-complete problems and argue that the problem, in principle, can be solved in polynomial time by using our new quantum algorithm. keywords: Quantum Algorithm, NP-complete problem, Chaotic Dynamics 1

•Jan 1, 2003•38 citations

Solving NP-Complete Problems with a Quantum Computer

Colin P. Williams

Texts in computer science•Dec 6, 2010•3 citations

NEW QUANTUM ALGORITHM FOR STUDYING NP-COMPLETE PROBLEMS

Masanori Ohya, Igor Vasil'evich Volovich

ordinary approach to quantum algorithm is based on quantum Turing machine or quantum circuits. It is known that this approach is not powerful enough to solve NP-complete problems. In this paper we study a new approach to quantum algorithm which is a combination of the ordinary quantum algorithm with a chaotic dynamical system. We consider the satisfiability problem as an example of NP-complete problems and argue that the problem, in principle, can be solved in polynomial time by using our new quantum algorithm.

WORLD SCIENTIFIC eBooks•Feb 1, 2008•1 citation

New quantum algorithm solving the NP complete problem

Makoto Ohya

We review the quantum chaos algorithm solving the NP-complete problems in polynomial time. This work has been done in the series of papers with Professor Igor Volovich for nearly ten years.

P-Adic Numbers Ultrametric Analysis and Applications•Feb 1, 2012•0 citations

Solving NP-Complete Problems with Quantum Search

Martin Fürer

Springer eBooks•Apr 3, 2008•23 citations
Ordinary approach to quantum algorithm is based on quantum Turing machine or quantum circuits. It is known that this approach is not powerful enough to solve NP-complete problems. In this paper we study a new approach to quantum algorithm which is a combination of the ordinary quantum algorithm with a chaotic dynamical system. We consider the satisfiability problem as an example of NP-complete problems and argue that the problem, in principle, can be solved in polynomial time by using our new quantum algorithm. keywords: Quantum Algorithm, NP-complete problem, Chaotic Dynamics 1
ordinary approach to quantum algorithm is based on quantum Turing machine or quantum circuits. It is known that this approach is not powerful enough to solve NP-complete problems. In this paper we study a new approach to quantum algorithm which is a combination of the ordinary quantum algorithm with a chaotic dynamical system. We consider the satisfiability problem as an example of NP-complete problems and argue that the problem, in principle, can be solved in polynomial time by using our new quantum algorithm.