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

From Algorithm Wiki
Revision as of 12:18, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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"