Minimizing the number of edges in LC-equivalent graph states

• URL: http://arxiv.org/abs/2506.00292v1
• Date: Fri, 30 May 2025 22:49:45 GMT
• Title: Minimizing the number of edges in LC-equivalent graph states
• Authors: Hemant Sharma, Kenneth Goodenough, Johannes Borregaard, Filip Rozpędek, Jonas Helsen,
• Abstract summary: Local Clifford operations that map one graph state to another can alter the structure of the corresponding graphs, including changing the number of edges.<n>Here, we tackle the associated edge-minimization problem: finding graphs with the minimum number of edges in the LC-equivalence class of a given graph.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Graph states are a powerful class of entangled states with numerous applications in quantum communication and quantum computation. Local Clifford (LC) operations that map one graph state to another can alter the structure of the corresponding graphs, including changing the number of edges. Here, we tackle the associated edge-minimization problem: finding graphs with the minimum number of edges in the LC-equivalence class of a given graph. Such graphs are called minimum edge representatives (MER), and are crucial for minimizing the resources required to create a graph state. We leverage Bouchet's algebraic formulation of LC-equivalence to encode the edge-minimization problem as an integer linear program (ILP). We further propose a simulated annealing (SA) approach guided by the local clustering coefficient for edge minimization. We identify new MERs for graph states with up to 16 qubits by combining SA and ILP. We extend the ILP to weighted-edge minimization, where each edge has an associated weight, and prove that this problem is NP-complete. Finally, we employ our tools to minimize resources required to create all-photonic generalized repeater graph states using fusion operations.

Related papers

• What Do LLMs Need to Understand Graphs: A Survey of Parametric Representation of Graphs [69.48708136448694]
  Large language models (LLMs) are reorganizing in the AI community for their expected reasoning and inference abilities.<n>We believe this kind of parametric representation of graphs, graph laws, can be a solution for making LLMs understand graph data as the input.
  arXiv  Detail & Related papers  (2024-10-16T00:01:31Z)
• 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)
• Edge coloring lattice graphs [0.0]
  We prove a necessary and sufficient condition for a proper edge coloring of a patch of a lattice graph by translation. This condition forms the cornerstone of a method that finds nearly minimal or minimal edge colorings of infinite lattice graphs. Our work finds direct application by offering minimal-depth quantum circuits in the areas of quantum simulation, quantum optimization, and quantum state verification.
  arXiv  Detail & Related papers  (2024-02-13T19:38:58Z)
• One-step Bipartite Graph Cut: A Normalized Formulation and Its Application to Scalable Subspace Clustering [56.81492360414741]
  We show how to enforce a one-step normalized cut for bipartite graphs, especially with linear-time complexity. In this paper, we first characterize a novel one-step bipartite graph cut criterion with normalized constraints, and theoretically prove its equivalence to a trace problem. We extend this cut criterion to a scalable subspace clustering approach, where adaptive anchor learning, bipartite graph learning, and one-step normalized bipartite graph partitioning are simultaneously modeled.
  arXiv  Detail & Related papers  (2023-05-12T11:27:20Z)
• 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)
• Scaling R-GCN Training with Graph Summarization [71.06855946732296]
  Training of Relation Graph Convolutional Networks (R-GCN) does not scale well with the size of the graph. In this work, we experiment with the use of graph summarization techniques to compress the graph. We obtain reasonable results on the AIFB, MUTAG and AM datasets.
  arXiv  Detail & Related papers  (2022-03-05T00:28:43Z)
• Shortest Paths in Graphs with Matrix-Valued Edges: Concepts, Algorithm and Application to 3D Multi-Shape Analysis [69.08838724594584]
  Finding shortest paths in a graph is relevant for numerous problems in computer vision and graphics. We introduce the novel graph-theoretic concept of a shortest path in a graph with matrix-valued edges.
  arXiv  Detail & Related papers  (2021-12-08T08:23:37Z)
• LCS Graph Kernel Based on Wasserstein Distance in Longest Common Subsequence Metric Space [22.215852332444904]
  We propose a graph kernel to compute more comprehensive similarity between paths and walks. We also combine it with optimal transport theory to extract more in-depth features of graphs. Our proposed method outperforms many state-of-the-art graph kernel methods.
  arXiv  Detail & Related papers  (2020-12-07T11:59:14Z)
• Fast Convex Relaxations using Graph Discretizations [13.977100716044102]
  Matching and vision problems are fundamentals of computer computation applications. Applying techniques comes with a significant computational effort reducing their feasibility in practical applications. This setup allows us to faithfully work on problems constructed by SLIC or Cut-Pursuit.
  arXiv  Detail & Related papers  (2020-04-23T11:14:38Z)
• Wasserstein-based Graph Alignment [56.84964475441094]
  We cast a new formulation for the one-to-many graph alignment problem, which aims at matching a node in the smaller graph with one or more nodes in the larger graph. We show that our method leads to significant improvements with respect to the state-of-the-art algorithms for each of these tasks.
  arXiv  Detail & Related papers  (2020-03-12T22:31:59Z)

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.