Efficiency of structured adiabatic quantum computation

Details Efficiency of structured adiabatic quantum computation Efficiency of structured adiabatic quantum computation

2008-12-09

arxiv.org/abs/0812.1760v1

Physics

Quantum Physics

Scientific paper

We show enough evidence that a structured version of Adiabatic Quantum Computation (AQC) is efficient for most satisfiability problems. More precisely, when the success probability is fixed beforehand, the computational resources grow subexponentially in the number of qubits. Our study focuses on random satisfiability and exact cover problems, developing a multi-step algorithm that solves clauses one by one. Relating the computational cost to classical properties of the problem, we collect significant statistics with up to N=140 qubits, around the phase transitions, which is where the hardest problems appear.

Affiliated with

Also associated with

No associations

Rating

Efficiency of structured adiabatic quantum computation 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 Efficiency of structured adiabatic quantum computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficiency of structured adiabatic quantum computation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-282782