Fun with Graph States: Nonlocal Bell Pairs and the Arf Invariant

• URL: http://arxiv.org/abs/2606.06582v2
• Date: Wed, 10 Jun 2026 02:11:27 GMT
• Title: Fun with Graph States: Nonlocal Bell Pairs and the Arf Invariant
• Abstract summary: We study inner products and partial amplitudes of graph states, which are specified by graphs.<n>Results may illuminate the quantum advantage in the framework of Measurement-Based Quantum Computation.
• Score: 0.7568725564300122
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study inner products and partial amplitudes of graph states--a commonly employed class of quantum states, which are specified by graphs. We find that the magnitudes of these quantities are simply related to the rank of the adjacency matrix of the graph over F_2 while the phase is determined by the Arf invariant of its quadratic refinement. These facts motivate a nonlocal tensor factorization of the Hilbert space, with respect to which all graph states are products of Bell pairs with unentangled ancillae. These results may illuminate the quantum advantage in the framework of Measurement-Based Quantum Computation and suggest that graph states can be usefully visualized in the language of algebraic topology. In addition, we develop a specialized technique for computing expectation values of qubit-wise permutations in graph states, which is useful for calculating multi-invariants.

Related papers

• DiPhon: Diffusion on Graphons for Scalable Graph Generation [100.75398811422308]
  Diffusion models represent a leading paradigm for graph generation, with notable impact in domains such as molecular design.<n>We propose DiPhon, a discretized graph-level process that mimics these dynamics on finite graphs.<n>We prove that DiPhon matches exactly the first moment of the marginal distributions induced by the continuous graphon process, and approximates the second moment up to a closed-form discrepancy.
  arXiv  Detail & Related papers  (2026-07-08T10:15:17Z)
• Entanglement of multi-qubit quantum graph states and studies structural properties of tripartite graphs with quantum programming [0.0]
  We propose a method for constructing multi-qubit entangled quantum states representing weighted tripartite graphs.<n>An expression for the entanglement distance for multi-qubit states corresponding to arbitrary tripartite graph structures is obtained.
  arXiv  Detail & Related papers  (2026-04-30T13:18:04Z)
• Properties of multiqubit variational quantum states representing weighted graphs and their computing with quantum programming [0.0]
  We study multiqubit variational quantum states that can be considered as weighted quantum graph states.<n>We derive the geometric measure of entanglement and evaluate quantum correlators.
  arXiv  Detail & Related papers  (2026-04-01T14:33:09Z)
• A Graph-Theoretic Approach to Quantum Measurement Incompatibility [0.0]
  We develop a graph-theoretic framework for quantifying measurement incompatibility.<n>We show that the Lovsz number yields the correct scaling for $k$-body Majorana observables.<n>We identify structural conditions under which the robustness is determined.
  arXiv  Detail & Related papers  (2025-11-20T01:06:46Z)
• Generating Graphs via Spectral Diffusion [48.70458395826864]
  We present GGSD, a novel graph generative model based on 1) the spectral decomposition of the graph Laplacian matrix and 2) a diffusion process.<n>An extensive set of experiments on both synthetic and real-world graphs demonstrates the strengths of our model against state-of-the-art alternatives.
  arXiv  Detail & Related papers  (2024-02-29T09:26:46Z)
• Gaussian Entanglement Measure: Applications to Multipartite Entanglement of Graph States and Bosonic Field Theory [50.24983453990065]
  An entanglement measure based on the Fubini-Study metric has been recently introduced by Cocchiarella and co-workers. We present the Gaussian Entanglement Measure (GEM), a generalization of geometric entanglement measure for multimode Gaussian states. By providing a computable multipartite entanglement measure for systems with a large number of degrees of freedom, we show that our definition can be used to obtain insights into a free bosonic field theory.
  arXiv  Detail & Related papers  (2024-01-31T15:50:50Z)
• Supercharging Graph Transformers with Advective Diffusion [28.40109111316014]
  This paper proposes Advective Diffusion Transformer (AdvDIFFormer), a physics-inspired graph Transformer model designed to address this challenge.<n>We show that AdvDIFFormer has provable capability for controlling generalization error with topological shifts.<n> Empirically, the model demonstrates superiority in various predictive tasks across information networks, molecular screening and protein interactions.
  arXiv  Detail & Related papers  (2023-10-10T08:40:47Z)
• Graphon Pooling for Reducing Dimensionality of Signals and Convolutional Operators on Graphs [131.53471236405628]
  We present three methods that exploit the induced graphon representation of graphs and graph signals on partitions of [0, 1]2 in the graphon space. We prove that those low dimensional representations constitute a convergent sequence of graphs and graph signals. We observe that graphon pooling performs significantly better than other approaches proposed in the literature when dimensionality reduction ratios between layers are large.
  arXiv  Detail & Related papers  (2022-12-15T22:11:34Z)
• 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)
• Finite-Function-Encoding Quantum States [52.77024349608834]
  We introduce finite-function-encoding (FFE) states which encode arbitrary $d$-valued logic functions. We investigate some of their structural properties.
  arXiv  Detail & Related papers  (2020-12-01T13:53:23Z)
• Quantum mechanics of bipartite ribbon graphs: Integrality, Lattices and Kronecker coefficients [0.0]
  We define solvable quantum mechanical systems on a Hilbert space spanned by bipartite ribbon graphs with a fixed number of edges. The square of the Kronecker coefficient for a triple of Young diagrams is shown to be equal to the dimension of a sub-lattice in the lattice of ribbon graphs. As an avenue to explore quantum supremacy and its implications for computational complexity theory, we outline experiments to detect non-vanishing Kronecker coefficients for hypothetical quantum realizations/simulations of these quantum systems.
  arXiv  Detail & Related papers  (2020-10-08T15:18:46Z)
• Hamiltonian systems, Toda lattices, Solitons, Lax Pairs on weighted Z-graded graphs [62.997667081978825]
  We identify conditions which allow one to lift one dimensional solutions to solutions on graphs. We show that even for a simple example of a topologically interesting graph the corresponding non-trivial Lax pairs and associated unitary transformations do not lift to a Lax pair on the Z-graded graph.
  arXiv  Detail & Related papers  (2020-08-11T17:58:13Z)

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.