Quick Navigation

Topics

Open Quantum Systems Decoherence Entanglement Theory Quantum Correlations

A Constructive Quantum Lovász Local Lemma for Commuting Projectors

arXiv
Authors: Itai Arad, Or Sattath

Year

2013

Paper ID

31187

Status

Preprint

Abstract Read

~2 min

Abstract Words

108

Citations

N/A

Abstract

The Quantum Satisfiability problem generalizes the Boolean satisfiability problem to the quantum setting by replacing classical clauses with local projectors. The Quantum Lovász Local Lemma gives a sufficient condition for a Quantum Satisfiability problem to be satisfiable [AKS12], by generalizing the classical Lovász Local Lemma. The next natural question that arises is: can a satisfying quantum state be efficiently found, when these conditions hold? In this work we present such an algorithm, with the additional requirement that all the projectors commute. The proof follows the information theoretic proof given by Moser's breakthrough result in the classical setting [Mos09]. Similar results were independently published in [CS11,CSV13].

Why This Paper Matters

  • This paper contributes to the Entanglement Theory & Quantum Correlations research area in the Quantum Articles archive.
  • It adds a 2013 reference point for readers tracking recent quantum research.
  • The Quantum Satisfiability problem generalizes the Boolean satisfiability problem to the quantum setting by replacing classical clauses with local projectors.

Paper Tools

Become a member to use research tools

Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.

Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

Local Citation Graph (Related-Paper Links)

Current Paper #31187

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0
Likes: 0 Dislikes: 0

Sign in to react to this paper.

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.