Classical vs quantum satisfiability in linear constraint systems modulo an integer
From MaRDI portal
Publication:5870684
DOI10.1088/1751-8121/ABA306OpenAlexW3039749731MaRDI QIDQ5870684FDOQ5870684
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
Recommendations
Cites Work
- Permutation symmetry determines the discrete Wigner function
- Characterization of binary constraint system games
- Abstract Algebra
- Discrete phase space based on finite fields
- Two simple proofs of the Kochen-Specker theorem
- Quantum pseudo-telepathy
- Title not available (Why is that?)
- Hudson’s theorem for finite-dimensional quantum systems
- On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
- Linear equations over commutative rings
- Negative quasi-probability as a resource for quantum computation
- Tsirelson's problem and an embedding theorem for groups arising from non-local games
- The set of quantum correlations is not closed
- Non-closure of the set of quantum correlations via graphs
- Perfect commuting-operator strategies for linear system games
- Equivalence between contextuality and negativity of the Wigner function for qudits
Cited In (2)
Uses Software
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)
