DEPARTAMENTO DE CIENCIAS DE LA COMPUTACIÓN

INGENIERÍA EN TECNOLOGÍAS DE LA INFORMACIÓN (ITIN)

DISEÑO Y EVALUACIÓN DE PROYECTOS

TEMA: Study of P vs NP mathematical problem in quantum application of

computability, for NA of infinite solutions in stochastic continuous systems.

CARLOS ANDRÉS ESTRADA VÁSQUEZ

SAHIAN ALEJANDRA ABADIANO GUAMANTICA

JOYCE DENISSE CASTRO ZAMBRANO

NRC: 7395

PROFESOR: PhD(C). FREDDY MAURICIO TAPIA LEON

SANGOLQUÍ – ECUADOR

NOVIEMBRE – 2021
 Study of P vs NP mathematical problem in quantum application of
computability, for NA of infinite solutions in stochastic continuous systems.

2. DEFINITION AND JUSTIFICATION OF THE PROBLEM

Study of P vs NP mathematical problem in quantum application of computability, for NA of
infinite solutions in stochastic continuous systems (Meng & Xu, 2021). This research work aims
to solve this main problem and also provide an explanation through data collection and artificial
intelligence. P versus NP is considerate as a major unsolved problematic in computer science
(Pandey et al., 2018). It asks whether every problem which solution can be quickly verified can
also be quickly solved. An answer to the P vs NP question would determine if problems that can
be verified in polynomial time can also be solved in polynomial time.(Mize, 2021). It also can
determine whether every language accepted by some nondeterministic algorithm is also accepted
by some (deterministic) algorithm (Kubíčková et al., 2020).

To define the problem precisely, it is necessary to give a formal model of a computer. The standard
computer model in computability theory is the Turing machine, introduced by Alan Turing in
1936. Although the model was introduced before physical computers were built(Xiao et al., 2021),
it nevertheless continues to be accepted as the proper computer model for the purpose of defining
the notion of computable function. Informally the class P is the class of decision problems solvable
by some algorithm within several steps bounded by some fixed polynomial in the length of the
input (Kyritsis, 2021). Turing was not concerned with the efficiency of his machines, rather his
concern was whether they can simulate arbitrary algorithms given sufficient time. It turns out;
however, Turing machines can generally simulate more efficient computer models (for example,
machines equipped with many tapes or an unbounded random access memory) by at most squaring
or cubing the computation time. (Ruiz-Vanoye et al., 2021)

3. TARGET SYSTEM

3.1 General Objective: Find an optimal solution for the P vs NP problem that includes modern
mathematics and generates a solution for continuous stochastic systems through quantum
application models.
3.2 Specific Objectives:

• Design an algorithm that is recurrent when generating polynomials.

• Demonstrate its operation using algorithms and numerical methods.
• Finding the solution for quantum mechanical problems.
• Use low-level programming languages in a binary scenario.
• Use data science to evaluate the data generated by testing the mathematical model.

4. SCOPE OF THE WORK

This statement defines the work that will be done and the steps to completing it, as well as the
deliverables.

The study of the problem P vs NP is considered one of the biggest problems of the millennium
which includes the study of infinite polynomials of order N, in computability, Turing theory for
programmable machines can be accessed and it also can define whether it is programmable or
computable according to Godel.

This project needs to be accessible to the computational mathematics field by making some
investment applying data analysis, business intelligence and artificial intelligence. Solving these
problems can leads us to improve topics in physics such as fluid mechanics.

Deliverables will be: theoretical framework, study of formulas, study of mathematical modeling.

5. MOTIVATION

The work motivates the study of the field of computational mathematics to contribute to the world
of computing and quantum computing today, describing one of the problems of the millennium,
coupling new forms of application in physics, computing and above all in computer security
through the numerical algorithms generated by this function.
6. THEORETICAL FRAMEWORK

The problem P NP continues in search of a solution, for which several articles propose possible
solutions for this mathematical question. Among them we have the work of Constantine Kyritsis,
Review of the solutions to the P versus NP Problem, in which he proposes two solutions, one
complex and one very simple; then he proposes the complexity theory of Turing machines, which
requires infinite sets of words, which leads us to an axiomatic system from which the axioms that
give the existence of infinite subsets of natural numbers must be defined, also with the idea of a
Turing machine being a man-machine interactive software, proposes to solve it in exponential
time. On the other hand, Yinqiang Zheng in Revisiting the PnP Problem: A Fast, General and
Optimal Solution, proposes an optimal and global solution, adapting the P NP problem to a
functional minimization problem, in which the Groober base will be applied, which It will allow
us to represent non-unit quarters in the parameterization of the P NP problem, which can provide
us with greater precision than the solutions with O (n) methods.

Also, Jonathan J. Mize in Machines as Programs P 6 = NP, once again proposes a solution through
two new similar Turing machines, but with specific differences that allow, through graphics, to
highlight that a solution in polynomial time would not be the best option to find an accurate result.
Yao Xiao in A stochastic quantum program synthesis framework based on Bayesian optimization,
proposes an improvement in the exponential performance of NP programs, through quantum
algorithms and computers, adding Bayesian optimization for the adjustment of synthesis
parameters. stochastics and the creation of optimal quantum programs. Chengzhe Meng &
WeiweiXu in ScPnP: a non-iterative scale compensation solution for PnP problems, propose a
non-iterative method for the PnP problem, where their main objective is the operation of depth
variables with the object space error obtaining a polynomial system, and then by means of the
Dixon method, calculate all the existing roots, thereby demonstrating the reliability and precision
of this method compared to other algorithms.

Josep Díaz & Carme Torras in Turing's algorithmic lens: from computability to complexity theory,
propose a description of the P = NP problem, analyzing the computational complexity of decidable
problems, a question addressed by Turing through the so-called algorithmic magnifying glass. ,
focusing on the consequences that the fact that P is equal to NP would bring. Hana Kubíčková in
Indoor positioning with PnP problems in mobile phone images, shows us one of the applications
of the so-called PnP problem, in the case of indoor location, a requirement of navigation, for which
as a solution, she proposes the use of a single image, which is possible when using an image
database, in which a pair of images will be taken to find coordinates of another image database
using the PnP problem, projection and matrices. Another article in which we can also find
applications of the NP problem belongs to Sebastián Goderbauer, whose contribution, The
synthesis problem of decentralized energy systems is strongly NP-difficult, proposes the analysis
of computational complexity in a problem of synthesis of decentralized energy systems, showing
that it is strongly NP-difficult, and that the development of algorithms with exponential execution
time is a possible solution as a result of this analysis.

7. INVESTIGATIVE METHODOLOGY
For the solution of the proposed problem, the experimental research methodology is used among
them, according to data and different case studies to define a mathematical model, which allows
us to solve the problem P vs NP.

8. DEVELOPMENT MODEL TO BE USED

The development model to follow is based on quantitative, applied, descriptive, explorative and
explanatory research.

9. AREAS OF KNOWLEDGE INVOLVED

The areas of knowledge involved in this research are:

• Artificial Intelligence (AI)

• Computational mathematics
• Numerical methods
• Turing machines
• Godel's completeness.
10. VIABILITY

Human
Tutors:
Ing. Freddy Mauricio Tapia León
Dr. Walter Marcelo Fuertes Díaz
Students:
Carlos Andrés Estrada Vásquez
Sahian Alejandra Abadiano Guamantica
Joyce Denisse Castro Zambrano

Technological
Hardware:
ESPE supercomputer
Software:
Ubuntu
Matlab, Python, C, Fortran

Economical
Access to databases
Matlab software licenses

11. EXPECTED RESULTS

What is sought in this research is to define and solve the problem of polynomials based on a
mathematical model that is capable of predicting the infinite solutions in memory and at runtime,
given their computational floating-point value.
13. BIBLIOGRAPHY

Kubíčková, H., Jedlička, K., Fiala, R., & Beran, D. (2020). Indoor positioning using PnP
problem on mobile phone images. ISPRS International Journal of Geo-Information, 9(6), 368.
Kyritsis, C. E. (2021). REVIEW OF THE SOLUTION OF THE 3RD CLAY MILLENNIUM
PROBLEM P≠ NP (= EXPTIME).

Meng, C., & Xu, W. (2021). ScPnP: a non-iterative scale compensation solution for PnP
problems. Image and Vision Computing, 106, 104085.

Mize, J. J. (2021). Machines as Programs: P $\neq $ NP. ArXiv Preprint ArXiv:2109.10670.

Pandey, A. K., Basu, R., Kumar, H., & Chang, G.-E. (2018). Comprehensive analysis and
optimal design of Ge/GeSn/Ge pnp infrared heterojunction phototransistors. IEEE Journal
of the Electron Devices Society, 7, 118–126.

Ruiz-Vanoye, J. A., Díaz-Parra, O., Trejo-Macotela, F. R., & Fernández, J. C. R. (2021). P

versus NP problem from Formal Languages Theory View. Int. J. Comb. Optim. Probl.
Informatics, 12(1), 1–8.

Xiao, Y., Nazarian, S., & Bogdan, P. (2021). A stochastic quantum program synthesis
framework based on Bayesian optimization. Scientific Reports, 11(1), 1–9.