Please use this identifier to cite or link to this item:
|Title:||Self-testing graph states||Authors:||McKague, M.||Issue Date:||2014||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. © 2014 Springer-Verlag Berlin Heidelberg.||Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||URI:||http://scholarbank.nus.edu.sg/handle/10635/126352||ISBN:||9783642544286||ISSN:||16113349||DOI:||10.1007/978-3-642-54429-3-7|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jul 7, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.