New quantum algorithm solving the NP complete problem. (English) Zbl 1251.81029
Summary: We review the quantum chaos algorithm solving the NP-complete problems in polynomial time. This work has been done in the series of papers with Professor Igor Volovich for nearly ten years.
References:
| [1] | M. Garey and D. Johnson, Computers and Intractability – a guide to the theory of NP-completeness (Freeman, 1979). · Zbl 0411.68039 |
| [2] | P.W. Shor, ”Algorithm for quantum computation: Discrete logarithm and factoring algorithm,” in Proc. 35th Annual IEEE Symposium on Foundation of Computer Science, 124–134 (1994). |
| [3] | D. Deutsch, ”Quantum theory, the Church-Turing principle and the universal quantum computer,” Proc. Royal Soc. London A 400, 97–117 (1985). · Zbl 0900.81019 · doi:10.1098/rspa.1985.0070 |
| [4] | A. Ekert and R. Jozsa, ”Quantum computation and Shor’s factoring algorithm,” Rev. Mod. Phys. 68(3), 733–753 (1996). · doi:10.1103/RevModPhys.68.733 |
| [5] | E. Bernstein and U. Vazirani, ”Quantum complexity theory,” Proc. 25th ACM Symp. Theory Comput., 11–20 (1993). · Zbl 1310.68080 |
| [6] | M. Ohya and I. V. Volovich, ”Quantum computing and chaotic amplification,” J. Opt. B 5(6), 639–642 (2003). · doi:10.1088/1464-4266/5/6/015 |
| [7] | M. Ohya and I. V. Volovich, ”New quantum algorithm for studying NP-complete problems,” Rep. Math. Phys. 52(1), 25–33 (2003). · Zbl 1053.81014 · doi:10.1016/S0034-4877(03)90002-4 |
| [8] | M. Ohya and N. Masuda, ”NP problem in quantum algorithm,” Open Syst. Inform.Dyn. 7(1), 33–39 (2000). · Zbl 0963.68083 · doi:10.1023/A:1009651417615 |
| [9] | L. Accardi and M. Ohya, ”A stochastic limit approach to the SAT problem,” Open Syst. Inform. Dyn. 11, 1–16 (2004). · Zbl 1108.81006 · doi:10.1023/B:OPSY.0000047567.88377.74 |
| [10] | L. Accardi and R. Sabbadini, ”On the Ohya-Masuda quantum SAT algorithm,” Volterra Prepr. 432 (2000). · Zbl 0967.68064 |
| [11] | M. Ohya and I. V. Volovich, Mathematical Foundation of Quantum Information and Computation and its Applications to Nano- and Bio-Systems (Springer-Verlag, TMP Series, 2011). · Zbl 1269.81002 |
| [12] | C. H. Bennett, E. Bernstein, G. Brassard and U. Vazirani, ”Strengths and weaknesses of quantum computing,” SICOMP 26(5), 1510–1523 (1997). · Zbl 0895.68044 · doi:10.1137/S0097539796300933 |
| [13] | S. Iriyama and M. Ohya, ”Rigorous estimation of the computational complexity for OV SAT algorithm,” Open Syst. Inform. Dyn. 15(2), 173–187 (2008). · Zbl 1144.81442 · doi:10.1142/S1230161208000158 |
| [14] | S. Iriyama, T. Miyadera and M. Ohya, ”Note on a universal quantum Turing machine,” Phys. Lett. A 372, 5120–5122 (2008). · Zbl 1221.81042 · doi:10.1016/j.physleta.2008.05.069 |
| [15] | S. Iriyama and M. Ohya, ”Language classes defined by generalized quantum Turing machine,” Open Syst. Inform. Dyn. 15(4), 383–396 (2008). · Zbl 1188.81046 · doi:10.1142/S1230161208000262 |
| [16] | S. Iriyama, M. Ohya and I. V. Volovich, ”Generalized quantum Turing machine and its application to the SAT chaos algorithm,” QP-PQ: Quantum Prob. White Noise Anal., Quantum Inform. Comput. 19, 204–225 (World Sci. Publ., 2006). |
| [17] | S. Iriyama, M. Ohya and I. V. Volovich, ”On computational complexity of Shor’s quantum factoring algorithm,” TUS Preprint (2012). · Zbl 1325.81054 |
| [18] | L. Accardi, S. Iriyama, M. Ohya and I. V. Volovich, ”Note on Shor’s quantum factoring algorithm,” TUS Preprint (2012). |
| [19] | S. Iriyama, M. Ohya and I. V. Volovich, ”On quantum algorithm for binary search and its computational complexity,” TUS Preprint (2012). · Zbl 1328.81080 |
| [20] | Goto, S. Iriyama, M. Ohya and I. V. Volovich, ”New proof of the factoring algorithm,” in preparation. · Zbl 1325.81054 |
| [21] | S. Iriyama and M. Ohya, ”The problem to construct unitary quantum Turing machine computing partial recursive functions,” TUS Preprint (2009). · Zbl 1188.81045 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
