On the hamiltonian operators for adiabatic quantum reduction of SAT

Authors:
William Cruz-Santos;Guillermo Morales-Luna
Affiliations:
Computer Science Department, Cinvestav-IPN, Mexico City, Mexico;Computer Science Department, Cinvestav-IPN, Mexico City, Mexico
Venue:
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Year:
2010

Citing 3
Cited 0

How Powerful is Adiabatic Quantum Computation?

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Three "quantum" algorithms to solve 3-SAT

Theoretical Computer Science
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the Hamiltonians resulting from the Adiabatic Quantum Computing treatment of the Satisfiability Problem SAT. We provide respective procedures for explicit calculation of the involved Hamiltonians. The statement of the ending Hamiltonians allows us to pose a variant of SAT which is also NP-complete.