Self-Testing Graph States Permitting Bounded Classical Communication

• URL: http://arxiv.org/abs/2404.03496v2
• Date: Tue, 21 May 2024 16:22:32 GMT
• Title: Self-Testing Graph States Permitting Bounded Classical Communication
• Authors: Uta Isabella Meyer, Ivan Šupić, Frédéric Grosshans, Damian Markham,
• Abstract summary: We show that certain graph states can be robustly self-tested even allowing for communication. We provide an explicit self-test for the circular graph state and the honeycomb cluster state.
• Score: 1.2499537119440245
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Self-testing identifies quantum states and correlations that exhibit nonlocality, distinguishing them, up to local transformations, from other quantum states. Due to their strong nonlocality, it is known that all graph states can be self-tested in the standard setting - where parties are not allowed to communicate. Recently it has been shown that graph states display nonlocal correlations even when bounded classical communication on the underlying graph is permitted, a feature that has found applications in proving a circuit-depth separation between classical and quantum computing. In this work, we develop self testing in the framework of bounded classical communication, and we show that certain graph states can be robustly self-tested even allowing for communication. In particular, we provide an explicit self-test for the circular graph state and the honeycomb cluster state - the latter known to be a universal resource for measurement based quantum computation. Since communication generally obstructs self-testing of graph states, we further provide a procedure to robustly self-test any graph state from larger ones that exhibit nonlocal correlations in the communication scenario.

Related papers

• Fermionic Insights into Measurement-Based Quantum Computation: Circle Graph States Are Not Universal Resources [5.552495672853301]
  Measurement-based quantum computation (MBQC) is a strong contender for realizing quantum computers.<n>A critical question for MBQC is the identification of resource graph states that can enable universal quantum computation.<n>We show that, in spite of their expressivity, circle graph states are not efficiently universal for MBQC.
  arXiv  Detail & Related papers  (2025-10-07T04:05:02Z)
• Nonclassical Nullifiers for Quantum Hypergraph States [0.0]
  Quantum hypergraph states form a generalisation of the graph state formalism.<n>Networks of such states are able to achieve universality for continuous variable measurement based quantum computation.
  arXiv  Detail & Related papers  (2025-02-04T11:06:19Z)
• Local equivalence of stabilizer states: a graphical characterisation [0.0]
  A fundamental property of graph states is that applying a local complementation results in a graph that represents the same entanglement as the original. This property served as the cornerstone for capturing non-trivial quantum properties in a simple graphical manner. We introduce a generalization of local complementation which graphically characterises the LU-equivalence of graph states.
  arXiv  Detail & Related papers  (2024-09-30T10:51:15Z)
• 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)
• Inflated Graph States Refuting Communication-Assisted LHV Models [0.0]
  correlations from Pauli measurements on certain network graphs refute a local hidden variable description even allowing some communication along the graph. This has recently found applications in proving separation between classical and quantum computing. In this work, we propose systematic extensions of any graph state, which we dub inflated graph states such that they exhibit correlations which refute any communication assisted LHV model.
  arXiv  Detail & Related papers  (2022-10-13T14:49:32Z)
• QuTE: decentralized multiple testing on sensor networks with false discovery rate control [130.7122910646076]
  This paper designs methods for decentralized multiple hypothesis testing on graphs equipped with provable guarantees on the false discovery rate (FDR) We consider the setting where distinct agents reside on the nodes of an undirected graph, and each agent possesses p-values corresponding to one or more hypotheses local to its node. Each agent must individually decide whether to reject one or more of its local hypotheses by only communicating with its neighbors, with the joint aim that the global FDR over the entire graph must be controlled at a predefined level.
  arXiv  Detail & Related papers  (2022-10-09T19:48:39Z)
• Compilation of algorithm-specific graph states for quantum circuits [55.90903601048249]
  We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages. The computation can then be implemented using a series of non-Pauli measurements on this graph state.
  arXiv  Detail & Related papers  (2022-09-15T14:52:31Z)
• Similarity-aware Positive Instance Sampling for Graph Contrastive Pre-training [82.68805025636165]
  We propose to select positive graph instances directly from existing graphs in the training set. Our selection is based on certain domain-specific pair-wise similarity measurements. Besides, we develop an adaptive node-level pre-training method to dynamically mask nodes to distribute them evenly in the graph.
  arXiv  Detail & Related papers  (2022-06-23T20:12:51Z)
• 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)
• Verification of graph states in an untrusted network [0.0]
  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.
  arXiv  Detail & Related papers  (2020-07-26T13:17:21Z)
• Gaussian Process States: A data-driven representation of quantum many-body physics [59.7232780552418]
  We present a novel, non-parametric form for compactly representing entangled many-body quantum states. The state is found to be highly compact, systematically improvable and efficient to sample. It is also proven to be a universal approximator' for quantum states, able to capture any entangled many-body state with increasing data set size.
  arXiv  Detail & Related papers  (2020-02-27T15:54:44Z)
• Block-Approximated Exponential Random Graphs [77.4792558024487]
  An important challenge in the field of exponential random graphs (ERGs) is the fitting of non-trivial ERGs on large graphs. We propose an approximative framework to such non-trivial ERGs that result in dyadic independence (i.e., edge independent) distributions. Our methods are scalable to sparse graphs consisting of millions of nodes.
  arXiv  Detail & Related papers  (2020-02-14T11:42:16Z)

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.