Pith. sign in

REVIEW 1 cited by

Non-closure of the set of quantum correlations via graphs

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1709.05032 v3 pith:JQNC5H32 submitted 2017-09-15 math.OA quant-ph

Ken Dykema , Vern I. Paulsen , Jitendra Prakash This is my paper · ORCID
classification math.OAquant-ph
keywords correlationsquantumbipartiteclosedcomputingconceptcorrelationfunctions
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We prove that the set of quantum correlations for a bipartite system of 5 inputs and 2 outputs is not closed. Our proof relies on computing the correlation functions of a graph, which is a concept that we introduce.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. All tight correlation Bell inequalities have quantum violations

    quant-ph 2019-08 accept novelty 8.0 of 10

    Every nontrivial tight correlation Bell inequality for bipartite binary-outcome systems is violated by some quantum strategy.

Pith tools