Matched instances of quantum satisfiability (QSat) -- product state solutions of restrictions

DOI10.1007/978-3-030-19955-5_14MaRDI QIDQ2330558zbMATH OpenOpenAlexFDO

Authors Andreas Goerdt

Publication date 22 October 2019

Full work available at URL https://doi.org/10.1007/978-3-030-19955-5_14

zbMATH Keywords

\(QMA_1\)efficient algorithmsproduct statesquantum satisfiability

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• On efficiently solvable cases of quantum k-SAT
• Difficult instances of the counting problem for 2-quantum-SAT are very atypical
• Quantum 3-SAT Is QMA₁-complete
• Efficient algorithm for a quantum analogue of 2-SAT
• Random quantum satisfiability

This page was built for publication: Matched instances of quantum satisfiability (QSat) -- product state solutions of restrictions

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