New quantum algorithm solving the NP complete problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1583866 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1530002 (Why is no real title available?)
- A Stochastic Limit Approach to the SAT Problem
- Language classes defined by generalized quantum Turing machine
- Mathematical foundations of quantum information and computation and its applications to nano- and bio-systems
- New quantum algorithm for studying NP-complete problems
- Note on a universal quantum Turing machine
- ON COMPUTATIONAL COMPLEXITY OF QUANTUM ALGORITHM FOR FACTORING
- On generalized quantum Turing machine and its applications
- On quantum algorithm for binary search and its computational complexity
- Quantum complexity theory
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Rigorous Estimation of Computational Complexity for OMV SAT Algorithm
- Strengths and Weaknesses of Quantum Computing
Cited in
(11)- scientific article; zbMATH DE number 2012168 (Why is no real title available?)
- New quantum algorithm for studying NP-complete problems
- Quantum advantage in deciding NP-complete problems
- scientific article; zbMATH DE number 1530002 (Why is no real title available?)
- REVIEW ON QUANTUM CHAOS ALGORITHM AND GENERALIZED QUANTUM TURING MACHINE
- Solving NP-Complete Problems with Quantum Search
- Novel method to solve Hamilton loop problem
- A Stochastic Limit Approach to the SAT Problem
- A Quantum Algorithm for Finding a Hamilton Circuit
- Complexity in dynamics and computation
- NP-complete problems with chaotic dynamics
This page was built for publication: New quantum algorithm solving the NP complete problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1760321)
