Journal of Computer and System Sciences
Introduction to Circuit Complexity: A Uniform Approach
Introduction to Circuit Complexity: A Uniform Approach
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Membrane Computing: An Introduction
Membrane Computing: An Introduction
NP Problem in Quantum Algorithm
Open Systems & Information Dynamics
Theoretical Computer Science - Natural computing
GP Systems with forbidding context
Fundamenta Informaticae - Membrane computing
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
From regulated rewriting to computing with membranes: collapsing hierarchies
Theoretical Computer Science
The conformon-P system: a molecular and cell biology-inspired computability model
Theoretical Computer Science
Computation: finite and infinite machines
Computation: finite and infinite machines
(Tissue) P Systems with Unit Rules and Energy Assigned to Membranes
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Reversible P Systems to Simulate Fredkin Circuits
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Quantum Computation and Quantum Information: 10th Anniversary Edition
Quantum Computation and Quantum Information: 10th Anniversary Edition
Quantum sequential p systems with unit rules and energy assigned to membranes
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Sequential p systems with unit rules and energy assigned to membranes
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Universal families of reversible p systems
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
(UREM) P systems with a quantum-like behavior: background, definition, and computational power
WMC'07 Proceedings of the 8th international conference on Membrane computing
On the hamiltonian operators for adiabatic quantum reduction of SAT
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
On efficient algorithms for SAT
CMC'12 Proceedings of the 13th international conference on Membrane Computing
| Hi-index | 5.23 |
In this paper we borrow some ideas from quantum computing, and we propose three ''quantum'' brute force algorithms to solve the 3-SAT NP-complete decision problem. The first algorithm builds, for any instance @f of 3-SAT, a quantum Fredkin circuit that computes a superposition of all classical evaluations of @f 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 a truncated version of 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 @f is a positive instance of 3-SAT. The construction relies also upon the assumption that an external observer is able to discriminate, as the result of a measurement, a null vector from a non-null vector.