REVIEW 3 cited by
A simple protocol for certifying graph states and applications in quantum networks
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
Signed reviews
read the original abstract
We present a simple protocol for certifying graph states in quantum networks using stabiliser measurements. The certification statements can easily be applied to different protocols using graph states. We see for example how it can be used to for measurement based verified quantum compu- tation, certified sampling of random unitaries and quantum metrology and sharing quantum secrets over untrusted channels.
Forward citations
Cited by 3 Pith papers
-
General framework for verifying pure quantum states in the adversarial scenario
A general verification framework shows that pure quantum states can be certified against adversarial state preparation with at most a constant-factor overhead over nonadversarial verification.
-
Efficient Verification of Pure Quantum States in the Adversarial Scenario
Adding trivial 'always pass' tests lets any pure quantum state be verified against an adversarial device with at most a constant-factor overhead over nonadversarial verification.
-
Verifying a stabilizer state with few observables but many shots
A random-basis, minimum-of-means stabilizer certification protocol accepts good states and rejects bad states with error probabilities exponentially small in qubit number under a wide fidelity gap.
Discussion (0). Continue with ORCID to comment.