确定型量子态计算机概念与P！＝NP (1)

(Ascertaining type quantum state computer concepts and P! = NP)

＝量子态计算机原创性理论＝

司马阳春

【Content the】

★We see that the 2012 Nobel physics prize winners, SaiErRi our assorted and Dewey d for landry in the control particle individuals, Chinese academy of sciences, information science division GuoGuangCan academician in probability quantum cloning, academician of the Chinese academy of sciences information science division PanJianWei in quantum state contact transmission has made a contribution respectively from the uncertainty principle of quantum mechanics set by the ultimate closer.

This makes us believe that human beings can get deterministic strong quantum state. Thus, led to quantum state the advent of the computer. In proof P! = NP process, we in the controllable mathematical principle, it is discovered that the quantum state within limited period wave/particle position and speed are sure. Although continuum quantum state limited period of probability each are not identical, but every quantum state limited period of probability are sure. Quantum state continuum probability is the uncertainty of the quantum state limited period of probability of inconsistency.

However, the increasing number of subsequent probability with regularity, are present multiple increasing state. We can accurately know a prime Numbers appearing, the next following a prime number is? Can accurately know quantum state continuum system in any one prime is what? Can accurately control each quantum state Turing's position. Can accurately know in computer complexity class P and NP class identity determine treatment is or not, each P! = NP and NP! = P of polynomial P class algorithm or non polynomial NP algorithm class the only sure true solution.

★Not sure polynomial problem, or NP complete problems, is known in mathematics trap most, the most complicated problems, the most tangled problems. For it, we see with the decisive battle, in a and a trap in the life and death struggle, as directly Normandy landing, with a bunch of new concept, all this trap, directly facing the P = NP problem.

Because, in the known in mathematics, no one will be able to put forward a equation, can be directly calculated prime Numbers, large prime Numbers, sum Numbers and sum Numbers each factor a definite value.

When a prime Numbers appearing, the next prime? No one can answer! And P = NP theory but can directly answer when a prime Numbers appearing, the next prime Numbers to determine how much is the value.

★In the P = NP theory, when a prime Numbers appearing, the next following prime Numbers are its multiple!

Therefore, P = NP of prime Numbers, large prime Numbers, subset, sets, sum Numbers, sum Numbers of each factor value are the only can directly calculates.

★P = NP theory task is, change numerous for brief, not rely on speed, but rather on increases each quantum state structure (N ^ N) ^ N times capacity, make the quantum state computer and mathematics, physics, through the amplification or contraction time scale and space scale, limited quantum state the restrictive infinite quantum state movement.

★P = NP theory is that, P = NP? The P, NP, N three completely should be preferred.

But this kind of approximate crazy ideas, known to man in philosophy, mathematics, physics and computer science, cosmology concept, it is absolutely impossible.

However, P = NP theory it with a variety of absolute impossible philosophy, mathematics, physics and computer science, a new concept cosmology, even absolutely impossible to basic arithmetic skills from two aspects of natural and mathematics proved P! = NP. And in the mathematical theory has made substantial progress. And is likely to promote physics in the quantum state magnetic world unity in unified field.

• ★ Stem on quantum state computer is no longer limited to "two carry system", but has a wide range of N "N scale" or "N... NN carry system", "N... NNN... N scale". A quantum state processor will replace 10-200000 "2 carry system" processor, "N... NN carry system" processor.
• ★ P = NP quantum state computer operation speed identity in "two carry system" processor speed of 1... N ^ N times.

1 P = NP quantum state computer processor identity in 1... N ^ N times a "two carry system" processor.

★1 and O is also polynomial. O has the characteristics of negative infinity, or have a complete absorption characteristic, it is likely to completely absorbed NP or P, and destroy P = NP equation identical structure. It's too dangerous, do not use.

"1" is different, it is can be fully absorbed, and can be completely radiation.

10000 x 1 = 10000, fully absorbed.

10000÷ 1 = 10000, completely radiation.

• ★ Quantum state is the trend of the development of the computer, not the operation frequency increases, but the number of operations to reduce. Not the increase of computation, but the operation speed slow. Not operation frequency increases, but the increase of operation capacity. Operation speed to the quantum state computer is no longer important.
• ★ When 1 = O, 1 has the same O the same infinite capacity, with infinity and infinitesimal double feature. Has the absolute and relative double feature.

The 1 not only have the complete invariance, and not only has a negative infinity sex, but also has the absolute lead to relative P in the absolute class P completeness characteristics.

That is the absolute class P 1 equal to relativity class P (1) of all; Relativity class P (1) all the, equal to the absolute class P of 1 N times.

This P = NP structure, and lead to "O" perimeter, radius, time, space, disappear, cause O the perimeter and radius mathematical relationship identity.

★Whether in the physical or in the mathematical, O shaped object all have negative infinity trend.

Each wave structure O shaped objects, has its black holes, any wave structure of O shaped object will be fully absorbed, become a discrete state, not be a continuum.

• ★ When absolute P is arbitrary perfect number, N is arbitrary perfect number, can form of any arbitrary co., LTD., encryption method. Namely 1 = 1, 1 = 9, 9 = 12345,... 12345 = 1, etc. Since then, the computer encryption security is no longer a problem.
• ★ About stop problems in quantum state computer Turing case not sure Turing lattice quantum information in the determination of self-discipline mechanism, will be in a fully controlled state. Stop problems, will not affect 1 > 1, 1 < 1, 1 indicates 1, 1 = 1, 1 = 1 ^ 2, 1 = 1 ^ n, 1 = n, n = n ^ 2, n = n ^ n... Equal value given axiom invariance!
• ★ In the high speed movement, what we need is to improve the wave motion speed, and the object did not move speed, rather than increasing power.
• ★ Although one not existing in the polynomial N relative variables, but is still limited consisting of the infinite variable. Here it is not exist flux, P value is different, N value inevitably different. N value is different, NP value inevitably different. Every N value equal to the P value, NP value. Namely P = N = NP. Every N value is variable, but also flux. Besides, every P = NP N value has strong pertinence, are not allowed to flux exist.
• ★ P = NP theory of absolute time, namely physical space of absolute time, different from known rules of non physical space of absolute time. P = NP theory will time are divided into two kinds, namely entity absolute time and space relative time.
• ★ In this article, we put forward and P = NP theory related 37 math problems.
• ★ Americans have been from the basic theory and experiment technology all can't handle F - 22 pilot anaerobic problem, F - 35 existing problems, the Russian T - 50 problems, all is P = NP problem.

【内容摘要】

• ★我们看到,2012年度诺贝尔物理学奖获奖者塞尔日阿罗什和戴维维因兰德在控制粒子个体, 中国科学院信息科学学部院士郭光灿在概率量子克隆,中国科学院信息科学学部院士潘建伟在量子态隐形传输方面已分别作出了贡献. 距离量子力学不确定性原理所设定的极限更加接近.

 这使我们相信人类能够得到确定性强大的量子态. 从而, 导致量子态计算机的出现. 在证明P！=NP过程中, 我们在可控数学原理中发现, 各量子态有限段之内的波/粒位置和速度均是确定的. 尽管连续统量子态有限段概率各不相同, 但每一个量子态有限段概率都是确定的.量子态连续统概率的不确定性在于各量子态有限段概率的不一致性.

 但是，其递增后继数概率具有规律性，均是呈现倍数递增状态. 我们可以准确地知道一个质数出现后，下一个后继质数是什么？可以准确地知道量子态连续统系统中任何一个质数是什么？可以准确地控制每一个量子态图灵格的位置。可以准确地知道在计算机复杂度类P和NP类恒等确定处理是与否问题上,每一个P！=NP及NP！=P中多项式P类算法或非多项式NP类算法的惟一肯定的真解。

★P＝NP理论认为，P＝NP？中的P、NP、N三完全应当是首选。

但这种近似疯狂的思路，在人类已知哲学、数学、物理学、计算机科学、宇宙学观念中，是绝对不可能的。

然而，P＝NP理论却用一簇绝对不可能的哲学、数学、物理学、计算机科学、宇宙学全新观念，甚至绝对不可能的，以基本算术的技巧从自然与数学两方面证明了P！＝NP。并在数学理论方面取得了实质性进展。而且极有可能推动物理学在宇宙量子态磁界统一场中的统一。

★P＝NP理论的任务在于, 化繁为简, 不是依靠提高速度, 而是依靠增加每个量子态结构的(N^n) ^n倍容量, 使量子态计算机及数学、物理学, 通过放大或收缩时间尺度和空间尺度, 进行有限量子态制约中的无限量子态运动。

 ★量子态计算机发展的趋势，不是运算次数的增加，而是运算次数的减少。不是运算速度的提高，而是运算速度的减缓。不是运算次数的增加，而是运算容量的增加。运算速度对于量子态计算机已不再重要。