View source for Quantum Adiabatic Algorithm (QAA) (CNF-SAT Boolean Satisfiability)

← Quantum Adiabatic Algorithm (QAA) (CNF-SAT Boolean Satisfiability)

Jump to navigation Jump to search

You do not have permission to edit this page, for the following reason:

The action you have requested is limited to users in the group: Users.

You can view and copy the source of this page.

== Time Complexity == 

$O({2}^n)$

== Space Complexity == 

$O(poly(n)$) qubits

()

== Description == 



== Approximate? == 

Approximate

Approximation Factor: 

== Randomized? == 

Yes, 

== Model of Computation == 

Quantum

== Year == 

2001

== Reference == 

https://arxiv.org/pdf/quant-ph/0001106.pdf

Return to Quantum Adiabatic Algorithm (QAA) (CNF-SAT Boolean Satisfiability).

Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Quantum_Adiabatic_Algorithm_(QAA)_(CNF-SAT_Boolean_Satisfiability)"

Navigation menu