On the complexity of probabilistic trials for hidden satisfiability problems

DOI10.4230/LIPICS.MFCS.2016.12zbMATH Open1398.68209arXiv1606.03585OpenAlexW2963036764MaRDI QIDQ4608570FDOQ4608570

Authors: Itai Arad, Adam Bouland, Daniel Grier, Miklos Santha, Aarthi Sundaram, Shengyu Zhang 

Publication date: 21 March 2018

Abstract: What is the minimum amount of information and time needed to solve 2SAT? When the instance is known, it can be solved in polynomial time, but is this also possible without knowing the instance? Bei, Chen and Zhang (STOC '13) considered a model where the input is accessed by proposing possible assignments to a special oracle. This oracle, on encountering some constraint unsatisfied by the proposal, returns only the constraint index. It turns out that, in this model, even 1SAT cannot be solved in polynomial time unless P=NP. Hence, we consider a model in which the input is accessed by proposing probability distributions over assignments to the variables. The oracle then returns the index of the constraint that is most likely to be violated by this distribution. We show that the information obtained this way is sufficient to solve 1SAT in polynomial time, even when the clauses can be repeated. For 2SAT, as long as there are no repeated clauses, in polynomial time we can even learn an equivalent formula for the hidden instance and hence also solve it. Furthermore, we extend these results to the quantum regime. We show that in this setting 1QSAT can be solved in polynomial time up to constant precision, and 2QSAT can be learnt in polynomial time up to inverse polynomial precision.

Full work available at URL: https://arxiv.org/abs/1606.03585

Recommendations

• scientific article; zbMATH DE number 6789292
• Linear-Time Algorithm for Quantum 2SAT
• Probabilistic performance of a heurisic for the satisfiability problem
• Probabilistic approach to the satisfiability problem
• Efficient algorithm for a quantum analogue of 2-SAT

zbMATH Keywords

computational complexitylearning theoryquantum computingtrial and errorsatisfiability problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Quantum algorithms and complexity in the theory of computing (68Q12)

This page was built for publication: On the complexity of probabilistic trials for hidden satisfiability problems

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