REVIEW 1 cited by
Self-testing graph states
Not yet reviewed by Pith; the record is open.
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
Self-testing graph states
read the original abstract
We give a construction for a self-test for any connected graph state. In other words, for each connected graph state we give a set of non-local correlations that can only be achieved (quantumly) by that particular graph state and certain local measurements. The number of correlations considered is small, being linear in the number of vertices in the graph. We also prove robustness for the test.
Forward citations
Cited by 1 Pith paper
-
Device-Independent Self-Testing of the Three-Qubit CCZ Hypergraph State
The CCZ hypergraph state and its Pauli measurements can be device-independently self-tested from twenty correlators, and also from maximal violation of a specially constructed Bell inequality.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.