1 Search Results for "Aldi, Marco"

Document
DOI: 10.4230/LIPIcs.MFCS.2018.38
On Efficiently Solvable Cases of Quantum k-SAT

Authors: Marco Aldi, Niel de Beaudrap, Sevag Gharibian, and Seyran Saeedi

Published in: LIPIcs, Volume 117, 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)

Abstract
The constraint satisfaction problems k-SAT and Quantum k-SAT (k-QSAT) are canonical NP-complete and QMA_1-complete problems (for k >= 3), respectively, where QMA_1 is a quantum generalization of NP with one-sided error. Whereas k-SAT has been well-studied for special tractable cases, as well as from a parameterized complexity perspective, much less is known in similar settings for k-QSAT. Here, we study the open problem of computing satisfying assignments to k-QSAT instances which have a "matching" or "dimer covering"; this is an NP problem whose decision variant is trivial, but whose search complexity remains open. Our results fall into three directions, all of which relate to the "matching" setting: (1) We give a polynomial-time classical algorithm for k-QSAT when all qubits occur in at most two clauses. (2) We give a parameterized algorithm for k-QSAT instances from a certain non-trivial class, which allows us to obtain exponential speedups over brute force methods in some cases by reducing the problem to solving for a single root of a single univariate polynomial. (3) We conduct a structural graph theoretic study of 3-QSAT interaction graphs which have a "matching". We remark that the results of (2), in particular, introduce a number of new tools to the study of Quantum SAT, including graph theoretic concepts such as transfer filtrations and blow-ups from algebraic geometry; we hope these prove useful elsewhere.
Cite as

Marco Aldi, Niel de Beaudrap, Sevag Gharibian, and Seyran Saeedi. On Efficiently Solvable Cases of Quantum k-SAT. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 38:1-38:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{aldi_et_al:LIPIcs.MFCS.2018.38,
  author =	{Aldi, Marco and de Beaudrap, Niel and Gharibian, Sevag and Saeedi, Seyran},
  title =	{{On Efficiently Solvable Cases of Quantum k-SAT}},
  booktitle =	{43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)},
  pages =	{38:1--38:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-086-6},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{117},
  editor =	{Potapov, Igor and Spirakis, Paul and Worrell, James},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.38},
  URN =		{urn:nbn:de:0030-drops-96201},
  doi =		{10.4230/LIPIcs.MFCS.2018.38},
  annote =	{Keywords: search complexity, local Hamiltonian, Quantum SAT, algebraic geometry}
}
  • Refine by Author
  • 1 Aldi, Marco
  • 1 Gharibian, Sevag
  • 1 Saeedi, Seyran
  • 1 de Beaudrap, Niel

  • Refine by Classification
  • 1 Theory of computation → Parameterized complexity and exact algorithms
  • 1 Theory of computation → Quantum complexity theory

  • Refine by Keyword
  • 1 Quantum SAT
  • 1 algebraic geometry
  • 1 local Hamiltonian
  • 1 search complexity

  • Refine by Type
  • 1 document

  • Refine by Publication Year
  • 1 2018

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact