Solving Satisfiability Problems by the Ground-State Quantum Computer

Details Solving Satisfiability Problems by the Ground-State Quantum Computer Solving Satisfiability Problems by the Ground-State Quantum Computer

2005-06-23

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

Phys. Rev. A 72, 052316 (2005)

Physics

Quantum Physics

Extended version of quant-ph/0411194. 8 pages, 7 figures

Scientific paper

10.1103/PhysRevA.72.052316

A quantum algorithm is proposed to solve the Satisfiability problems by the
ground-state quantum computer. The scale of the energy gap of the ground-state
quantum computer is analyzed for the 3-bit Exact Cover problem. The time cost
of this algorithm on the general SAT problems is discussed.

Affiliated with

Also associated with

No associations

Rating

Solving Satisfiability Problems by the Ground-State Quantum Computer 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 Solving Satisfiability Problems by the Ground-State Quantum Computer, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solving Satisfiability Problems by the Ground-State Quantum Computer will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-581665