To obtain access to full text of journal and articles you must register!
- Article name
- QUANTUM SOLUTION OF BOOLEAN EQUATIONS AND THE PROBLEM P =? NP
- Authors
- Pravilshchikov P. A., , pavelp@ipu.ru, Federal State Government-financed Scientific Establishment "Institute of Control Sciences named after V. A. Trapeznikov of RAS, Moscow, Russia
- Keywords
- quantum computers / quantum processors-accelerators / quantum algorithms / matrix D-calculus / qubits / qutrits / ququadrites / qudits / SAT-problem / problem P = ? NP
- Year
- 2018 Issue 1 Pages 50 - 64
- Code EDN
- Code DOI
- Abstract
- The solution of Boolean equations is described with the use of quantum D-algorithms , functioning on the platform of the quantum processor-accelerator (QA) with a new mechanism of quantum parallelism. It is assumed that the QD-algorithm operates on the platform of a quantum processor-accelerator (QA) with a new mechanism of quantum parallelism . To avoid cumbersome and unnecessary details, instead of the real processor-accelerator, its computational model in the form of a quantum generator of tests (QGT) is considered. For this case author adduced the estimations of the time and spatial complexity of solutions of Boolean equations (in particular, Boolean satisfiability problem). It is shown that when using QD-algorithm and using a new computing model with a new mechanism of quantum parallelism to solve the Boolean satisfiability problem (SAT- problem ) is required polynomial computing resources.
- Text
- To obtain access to full text of journal and articles you must register!
- Buy
