Verification of graph states in an untrusted network

• URL: http://arxiv.org/abs/2007.13126v2
• Date: Fri, 13 May 2022 14:38:36 GMT
• Title: Verification of graph states in an untrusted network
• Authors: Anupama Unnikrishnan, Damian Markham
• Abstract summary: We consider verification of graph states generated by an untrusted source and shared between a network of possibly dishonest parties. This has implications in certifying the application of graph states for various distributed tasks. We present a protocol which is globally efficient for a large family of useful graph states.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Graph states are a large class of multipartite entangled quantum states that form the basis of schemes for quantum computation, communication, error correction, metrology, and more. In this work, we consider verification of graph states generated by an untrusted source and shared between a network of possibly dishonest parties. This has implications in certifying the application of graph states for various distributed tasks. We present a protocol which is globally efficient for a large family of useful graph states, including cluster states, GHZ states, cycle graph states and more. For general graph states, efficiency with respect to the security parameter is maintained, though there is a cost increase with the size of the graph state. The protocols are practical, requiring only multiple copies of the graph state, local measurements and classical communication.

Related papers

• Distinguishing Graph States by the Properties of Their Marginals [0.0]
  We introduce a family of easy-to-compute LU-invariants based on the marginal structure of the graphs. We show that these invariants can uniquely identify all LU-orbits and entanglement classes of every graph state of 8 qubits or less. We also discuss examples of entanglement classes with more nodes, where their marginal structure does not allow us to tell them apart.
  arXiv  Detail & Related papers  (2024-06-14T12:03:10Z)
• Graph Coarsening with Message-Passing Guarantees [10.02138130221506]
  We propose a new message-passing operation specific to coarsened graphs, which exhibit theoretical guarantees on the preservation of the propagated signal. We conduct node classification tasks on synthetic and real data and observe improved results compared to performing naive message-passing on the coarsened graph.
  arXiv  Detail & Related papers  (2024-05-28T12:39:24Z)
• Multipartite Entanglement Distribution in Quantum Networks using Subgraph Complementations [9.32782060570252]
  We propose a novel approach for distributing graph states across a quantum network. We show that the distribution of graph states can be characterized by a system of subgraph complementations. We find a close to optimal sequence of subgraph complementation operations to distribute an arbitrary graph state.
  arXiv  Detail & Related papers  (2023-08-25T23:03:25Z)
• Graph-theoretical optimization of fusion-based graph state generation [0.0]
  We present a graph-theoretical strategy to effectively optimize fusion-based generation of any given graph state, along with a Python package OptGraphState. Our strategy comprises three stages: simplifying the target graph state, building a fusion network, and determining the order of fusions.
  arXiv  Detail & Related papers  (2023-04-24T10:46:54Z)
• You Only Transfer What You Share: Intersection-Induced Graph Transfer Learning for Link Prediction [79.15394378571132]
  We investigate a previously overlooked phenomenon: in many cases, a densely connected, complementary graph can be found for the original graph. The denser graph may share nodes with the original graph, which offers a natural bridge for transferring selective, meaningful knowledge. We identify this setting as Graph Intersection-induced Transfer Learning (GITL), which is motivated by practical applications in e-commerce or academic co-authorship predictions.
  arXiv  Detail & Related papers  (2023-02-27T22:56:06Z)
• Semi-Supervised Hierarchical Graph Classification [54.25165160435073]
  We study the node classification problem in the hierarchical graph where a 'node' is a graph instance. We propose the Hierarchical Graph Mutual Information (HGMI) and present a way to compute HGMI with theoretical guarantee. We demonstrate the effectiveness of this hierarchical graph modeling and the proposed SEAL-CI method on text and social network data.
  arXiv  Detail & Related papers  (2022-06-11T04:05:29Z)
• Efficient tensor network simulation of quantum many-body physics on sparse graphs [0.0]
  We study tensor network states defined on an underlying graph which is sparsely connected. We find that message-passing inference algorithms can lead to efficient computation of local expectation values.
  arXiv  Detail & Related papers  (2022-06-09T18:00:03Z)
• Distributed Graph Learning with Smooth Data Priors [61.405131495287755]
  We propose a novel distributed graph learning algorithm, which permits to infer a graph from signal observations on the nodes. Our results show that the distributed approach has a lower communication cost than a centralised algorithm without compromising the accuracy in the inferred graph.
  arXiv  Detail & Related papers  (2021-12-11T00:52:02Z)
• Spectral Embedding of Graph Networks [76.27138343125985]
  We introduce an unsupervised graph embedding that trades off local node similarity and connectivity, and global structure. The embedding is based on a generalized graph Laplacian, whose eigenvectors compactly capture both network structure and neighborhood proximity in a single representation.
  arXiv  Detail & Related papers  (2020-09-30T04:59:10Z)
• Natural Graph Networks [80.77570956520482]
  We show that the more general concept of naturality is sufficient for a graph network to be well-defined. We define global and local natural graph networks, the latter of which are as scalable as conventional message passing graph neural networks.
  arXiv  Detail & Related papers  (2020-07-16T14:19:06Z)
• Inverse Graph Identification: Can We Identify Node Labels Given Graph Labels? [89.13567439679709]
  Graph Identification (GI) has long been researched in graph learning and is essential in certain applications. This paper defines a novel problem dubbed Inverse Graph Identification (IGI) We propose a simple yet effective method that makes the node-level message passing process using Graph Attention Network (GAT) under the protocol of GI.
  arXiv  Detail & Related papers  (2020-07-12T12:06:17Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.