Quantum ground-state computation with static gates

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

2002-09-13

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

Physics

Quantum Physics

10 pages, LaTeX, 1 PS figure

Scientific paper

We develop a computation model for solving Boolean networks that implements wires through quantum ground-state computation and implements gates through identities following from angular momentum algebra and statistics. The gates are static in the sense that they contribute Hamiltonian 0 and hold as constants of the motion; only the wires are dynamic. Just as a spin 1/2 makes an ideal 1-bit memory element, a spin 1 makes an ideal 3-bit gate. Such gates cost no computation time: relaxing the wires alone solves the network. We compare computation time with that of an easier Boolean network where all the gate constraints are simply removed. This computation model 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-state 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-state computation with static gates, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum ground-state computation with static gates will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-331028