Classical vs quantum satisfiability in linear constraint systems modulo an integer

DOI10.1088/1751-8121/ABA306MaRDI QIDQ5870684zbMATH OpenOpenAlexFDO

Authors Hammam Qassim, Joel J. Wallman

Publication date 23 January 2023

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

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

zbMATH Keywords

quantum contextualityquantum correlationsquantum nonlocality

Mathematics Subject Classification ID

Quantum theory (81-XX) Statistical mechanics, structure of matter (82-XX)

Recommendations

• Generalized satisfiability problems via operator assignments
• Classical and quantum satisfiability
• Generalized satisfiability problems via operator assignments
• Quantum 3-SAT Is QMA₁-complete
• Computational Complexity of Quantum Satisfiability

Cites work

• Abstract Algebra
• Characterization of binary constraint system games
• Discrete phase space based on finite fields
• Equivalence between contextuality and negativity of the Wigner function for qudits
• scientific article; zbMATH DE number 1305088 (Why is no real title available?)
• Hudson’s theorem for finite-dimensional quantum systems
• Linear equations over commutative rings
• Negative quasi-probability as a resource for quantum computation
• Non-closure of the set of quantum correlations via graphs
• On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
• Perfect commuting-operator strategies for linear system games
• Permutation symmetry determines the discrete Wigner function
• Quantum pseudo-telepathy
• The set of quantum correlations is not closed
• Tsirelson's problem and an embedding theorem for groups arising from non-local games
• Two simple proofs of the Kochen-Specker theorem

Cited in

(4)

• Commutative d-torsion K-theory and its applications
• Generalized satisfiability problems via operator assignments
• Classical vs. quantum satisfiability in linear constraint systems modulo an integer
• Satisfiability of commutative vs. non-commutative CSPs

Describes a project that uses

Uses Software

• GAP

This page was built for publication: Classical vs quantum satisfiability in linear constraint systems modulo an integer

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