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

From Algorithm Wiki

Jump to navigation Jump to search

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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Quantum_Adiabatic_Algorithm_(QAA)_(CNF-SAT_Boolean_Satisfiability)&oldid=45624"