A Stochastic Limit Approach to the SAT Problem

DOI10.1023/B:OPSY.0000047567.88377.74MaRDI QIDQ4666967zbMATH OpenOpenAlexFDO

Authors L. Accardi, Masanori Ohya

Publication date 7 April 2005

Published in Open Systems & Information Dynamics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/quant-ph/0401110

Mathematics Subject Classification ID

Quantum computation (81P68)

Abstract: We propose a new approach to solve an NP complete problem by means of stochastic limit.

Recommendations

• New quantum algorithm solving the NP complete problem
• A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
• Solving NP-Complete Problems with Quantum Search
• NP-complete problems with chaotic dynamics
• scientific article; zbMATH DE number 27687

Cited in

(10)

• Quasiphysical and quasisociological algorithm Solar for solving SAT problem
• New quantum algorithm solving the NP complete problem
• SAT distributions with planted assignments and phase transitions between decision and optimization problems
• GENERIC q-MARKOV SEMIGROUPS AND SPEED OF CONVERGENCE OF q-ALGORITHMS
• scientific article; zbMATH DE number 5139164 (Why is no real title available?)
• On quantum algorithm for binary search and its computational complexity
• Non-Kolmogorovian approach to the context-dependent systems breaking the classical probability law
• scientific article; zbMATH DE number 69384 (Why is no real title available?)
• Quantum Markov model for data from Shafir-Tversky experiments in cognitive psychology
• Quantum algorithm for SAT problem andquantum mutual entropy

This page was built for publication: A Stochastic Limit Approach to the SAT Problem

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