Classical and quantum satisfiability

MaRDI QIDQ5858678zbMATH OpenFDO

Authors Marcelo Finger, Anderson De Araújo

Publication date 14 April 2021

Full work available at URL https://arxiv.org/abs/1203.6161, http://eptcs.web.cse.unsw.edu.au/paper.cgi?LSFA2011.6

Mathematics Subject Classification ID

Logic in computer science (03B70) Quantum algorithms and complexity in the theory of computing (68Q12) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25) Logical foundations of quantum mechanics; quantum logic (quantum-theoretic aspects) (81P10) Quantum computation (81P68)

Recommendations

• Computational Complexity of Quantum Satisfiability
• Quantum 3-SAT Is QMA₁-complete
• Efficient algorithm for a quantum analogue of 2-SAT
• Random quantum satisfiability
• A parallel quantum algorithm for the satisfiability problem

Cited in

(5)

• Computational Complexity of Quantum Satisfiability
• Random quantum satisfiability
• A parallel quantum algorithm for the satisfiability problem
• Classical vs quantum satisfiability in linear constraint systems modulo an integer
• A physical model for the satisfiability problem

This page was built for publication: Classical and quantum satisfiability

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