Efficiency of structured adiabatic quantum computation

Simple item page
dc.creatorGarcia-Ripoll, Juan Jose
dc.creatorBañuls, Mari Carmen
dc.date2008-12-09
dc.date.accessioned2026-07-07T12:10:53Z
dc.date.available2026-07-07T12:10:53Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/0812.1760
dc.identifierhttp://arxiv.org/abs/0812.1760
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/210059
dc.subjectQuantum Physics
dc.titleEfficiency of structured adiabatic quantum computation
dc.typetext

Files

Collections

arXiv