Quantum Computing, NP-complete Problems and Chaotic Dynamics

Details Quantum Computing, NP-complete Problems and Chaotic Dynamics Quantum Computing, NP-complete Problems and Chaotic Dynamics

1999-12-21

arxiv.org/abs/quant-ph/9912100v1

Physics

Quantum Physics

11 pages, 1 figure

Scientific paper

An 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.

Affiliated with

Also associated with

No associations

Rating

Quantum Computing, NP-complete Problems and Chaotic Dynamics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantum Computing, NP-complete Problems and Chaotic Dynamics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Computing, NP-complete Problems and Chaotic Dynamics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-519402