On the Hamiltonian operators for adiabatic quantum reduction of SAT

DOI10.1007/978-3-642-13089-2_20zbMATH Open1284.68269OpenAlexW1501703753MaRDI QIDQ3564865FDOQ3564865

Authors: William Cruz-Santos, Guillermo Morales Luna 

Publication date: 26 May 2010

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13089-2_20

Recommendations

• scientific article; zbMATH DE number 1984609
• Different adiabatic quantum optimization algorithms for the NP-complete exact cover and 3SAT problems
• A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Random matrix model of adiabatic quantum computing

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Cited In (1)

• A family of system Hamiltonian in quantum adiabatic search type problem

This page was built for publication: On the Hamiltonian operators for adiabatic quantum reduction of SAT

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3564865)