NP-complete problems with chaotic dynamics

MaRDI QIDQ2735172zbMATH OpenFDO

Authors Masanori Ohya, Igor V. Volovich

Publication date 10 March 2002

zbMATH Keywords

quantum computingpolynomial timequantum gatesHartree-Fock equationsnonlinear gates

Mathematics Subject Classification ID

Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45) Quantum computation (81P68) Quantum chaos (81Q50)

Recommendations

• New quantum algorithm for studying NP-complete problems
• Novel method to solve Hamilton loop problem
• Complexity in dynamics and computation
• New quantum algorithm solving the NP complete problem
• scientific article; zbMATH DE number 4098714

Cited in

(9)

• Dynamical Systems Theory and Algorithms for NP-hard Problems
• New quantum algorithm for studying NP-complete problems
• Polynomial-time solution of prime factorization and NP-complete problems with digital memcomputing machines
• scientific article; zbMATH DE number 4098714 (Why is no real title available?)
• Three ``quantum algorithms to solve 3-SAT
• Novel method to solve Hamilton loop problem
• A Stochastic Limit Approach to the SAT Problem
• Complexity in dynamics and computation
• scientific article; zbMATH DE number 1406125 (Why is no real title available?)

This page was built for publication: NP-complete problems with chaotic dynamics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2735172)