Fetching the paper…

Reading the bibliography…

2010

Self-testing graph states

McKague, Matthew

Original
PDF
Post on X

Understand

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.

Self-testing graph states · Around

Built on

Self-testing of universal and fault-tolerant sets of quantum gates
Wim van Dam, Frederic Magniez, Michele Mosca, and Miklos Santha · 2000
Earlier work this paper cites.
A one-way quantum computer
Robert Raussendorf and Hans J. Briegel · 2001
Earlier work this paper cites.
Self testing quantum apparatus
Dominic Mayers and Andrew Yao · 2004
Earlier work this paper cites.

Similar

Self-testing of quantum circuits
Frédéric Magniez, Dominic Mayers, Michele Mosca, and Harold Ollivier · 2006
Cited alongside, same era.
Graph Theory
Reinhard Diestel · 2010
Cited alongside, same era.

Then

Generalized self-testing and the security of the 6-state protocol
Original
Matthew McKague and Michele Mosca · 2010
Closest in time.
Random numbers certified by bell’s theorem
Original
S. Pironio, A. Acin, Antonio, S. Massar, A. Boyer de la Giroday, D. N. Matsukevich, P. Maunz, S. Olmschenk, D. Hayes, L. Luo, T. A. Manning, and C. Monroe · 2010
Closest in time.

Beyond the bibliography

alphaXiv searches the wider corpus for related work and actual follow-ups.

Open on alphaXiv

alphaXiv is searching for related work…