Three ``quantum algorithms to solve 3-SAT

DOI10.1016/J.TCS.2006.11.026zbMath1111.68041OpenAlexW1972178813MaRDI QIDQ872207

Sara Felloni, Alberto Leporati

Publication date: 27 March 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://idus.us.es/xmlui/handle/11441/38392

zbMATH Keywords

systemsNP-complete problemsquantummembrane computing3-SATquantum circuitsquantum register machines

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

(UREM) P Systems with a Quantum-Like Behavior: Background, Definition, and Computational Power

Cites Work

• Conservative logic
• Fault-tolerant quantum computation with higher-dimensional systems
• Computing with membranes
• A guide to membrane computing.
• Membrane computing. An introduction.
• From regulated rewriting to computing with membranes: collapsing hierarchies
• The conformon-P system: a molecular and cell biology-inspired computability model
• P systems with energy accounting^∗
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Machines, Computations, and Universality
• Machines, Computations, and Universality
• Membrane Computing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Three ``quantum algorithms to solve 3-SAT