Quantum ground-mode computation with static gates

Details Quantum ground-mode computation with static gates Quantum ground-mode computation with static gates

2002-09-30

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

Physics

Quantum Physics

4 pages, PDF, fifth page is a figure; short version of arXiv:quant-ph/0209084 v1 13 Sep 2002; static gates yield a speed-up by

Scientific paper

We develop a computation model for solving Boolean networks by implementing wires through quantum ground-mode computation and gates through identities following from angular momentum algebra and statistics. Gates are represented by three-dimensional (triplet) symmetries due to particle indistinguishability and are identically satisfied throughout computation being constants of the motion. The relaxation of the wires yields the network solutions. Such gates cost no computation time, which is comparable with that of an easier Boolean network where all the gate constraints implemented as constants of the motion are removed. This model computation is robust with respect to decoherence and yields a generalized quantum speed-up for all NP problems.

Affiliated with

Also associated with

No associations

Rating

Quantum ground-mode computation with static gates 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 ground-mode computation with static gates, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum ground-mode computation with static gates will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-694308