Show simple item record


dc.creatorLeporati, Alberto
dc.creatorFelloni, Sara
dc.description.abstractWe propose three quantum algorithms to solve the 3-SAT NP-complete decision problem. The first algorithm builds, for any instance Á of 3-SAT, a quantum Fredkin circuit that computes a superposition of all classical evaluations of Á in a given output line. Similarly, the second and third algorithms compute the same superposition on a given register of a quantum register machine, and as the energy of a given membrane in a quantum P system, respectively. Assuming that a specific non-unitary operator, built using the well known creation and annihilation operators, can be realized as a quantum gate, as an instruction of the quantum register machine, and as a rule of the quantum P system, respectively, we show how to decide whether Á is a positive instance of 3-SAT. The construction relies also upon the assumption that an external observer is able to distinguish, as the result of a measurement, between a null and a non-null
dc.publisherFénix Editoraes
dc.relation.ispartofProceedings of the Fourth Brainstorming Week on Membrane Computing, Vol.II, 137-159. Sevilla, E.T.S. de Ingeniería Informática, 30 de Enero-3 de Febrero, 2006es
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.titleThree Quantum Algorithms to Solve 3-SATes

quantumnp.pdf257.7KbIcon   [PDF] View/Open  

This item appears in the following collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Except where otherwise noted, this item's license is described as: Attribution-NonCommercial-NoDerivatives 4.0 Internacional