|
| related topics |
| {state, algorithm, problem} |
| {qubit, qubits, gate} |
| {state, phys, rev} |
| {spin, pulse, spins} |
|
Quantum Algorithm to Solve Satisfiability Problems
Wenjin Mao
abstract: A new quantum algorithm is proposed to solve Satisfiability(SAT) problems by
taking advantage of non-unitary transformation in ground state quantum
computer. The energy gap scale of the ground state quantum computer is analyzed
for 3-bit Exact Cover problems. The time cost of this algorithm on general SAT
problems is discussed.
- oai_identifier:
- oai:arXiv.org:quant-ph/0411194
- categories:
- quant-ph
- comments:
- 5 pages, 3 figures
- arxiv_id:
- quant-ph/0411194
- journal_ref:
- Extended version is published on Phys. Rev. A 72, 052316 (2005)
- created:
- 2004-11-29
- updated:
- 2005-02-28
Full article ▸
|
|
| related documents |
| 0105071v2 |
| 0702007v2 |
| 0611140v3 |
| 0609125v1 |
| 0303070v1 |
| 0308060v1 |
| 0502014v2 |
| 0312083v1 |
| 0506244v2 |
| 0204013v1 |
| 0106152v1 |
| 0507036v3 |
| 0602135v1 |
| 0606077v1 |
| 0608039v4 |
| 0603285v1 |
| 0610258v1 |
| 0507262v1 |
| 0504169v1 |
| 0701079v1 |
| 0612033v1 |
| 0606242v3 |
| 0507024v1 |
| 0502144v1 |
| 0703193v2 |
|