Quantum Computing, NP-complete Problems and Chaotic Dynamics

Simple item page
dc.creatorOhya, Masanori
dc.creatorVolovich, Igor V.
dc.date1999-12-21
dc.date.accessioned2026-07-07T06:17:24Z
dc.date.available2026-07-07T06:17:24Z
dc.descriptionAn approach to the solution of NP-complete problems based on quantum computing and chaotic dynamics is proposed. We consider the satisfiability problem and argue that the problem, in principle, can be solved in polynomial time if we combine the quantum computer with the chaotic dynamics amplifier based on the logistic map. We discuss a possible implementation of such a chaotic quantum computation by using the atomic quantum computer with quantum gates described by the Hartree-Fock equations. In this case, in principle, one can build not only standard linear quantum gates but also nonlinear gates and moreover they obey to Fermi statistics. This new type of entaglement related with Fermi statistics can be interesting also for quantum communication theory.
dc.description11 pages, 1 figure
dc.identifierhttps://arxiv.org/abs/quant-ph/9912100
dc.identifierhttp://arxiv.org/abs/quant-ph/9912100
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/94376
dc.subjectQuantum Physics
dc.subjectChaotic Dynamics
dc.subjectMesoscale and Nanoscale Physics
dc.subjectComputational Complexity
dc.subjectAtomic Physics
dc.titleQuantum Computing, NP-complete Problems and Chaotic Dynamics
dc.typetext

Files

Collections

arXiv