Closed-Form Expressions for Two- and Three-Colorable States

• URL: http://arxiv.org/abs/2408.09515v1
• Date: Sun, 18 Aug 2024 15:41:37 GMT
• Title: Closed-Form Expressions for Two- and Three-Colorable States
• Authors: Konstantinos-Rafail Revis, Hrachya Zakaryan, Zahra Raissi,
• Abstract summary: We present closed-form expressions for all two-colorable graph states. We explore a broad family of three-colorable graph states constructed from two two-colorable graph states. Our findings have broad implications for characterizing the LU/SLOCC equivalence of graph state classes.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Graph states are a class of multi-partite entangled quantum states, where colorability, a property rooted in their mathematical foundation, has significant implications for quantum information processing. In this study, we investigate the colorability of graph states in qudit systems to simplify their representation and enhance their practical applications. We present closed-form expressions for all two-colorable graph states. Our findings show that the closed-form expression of these states is tightly linked to the graph structure and the distribution of particles in red ($n_R$) and blue ($n_B$). Additionally, we explore a broad family of three-colorable graph states constructed from two two-colorable graph states. The closed-form expression for these states is in the form of one two-colorable state tensor product with the graph basis formed from another two-colorable state. Our approach systematically reduces the number of terms required to represent these states. Furthermore, we demonstrate that many well-known mathematical graphs, including friendship graphs, fit within our formalism. Finally, we discuss the LU/SLOCC (Local Unitary/Stochastic Local Operation and Classical Communication) equivalence between two- and three-colorable graph states. Our findings have broad implications for characterizing the LU/SLOCC equivalence of graph state classes and pave the way for future research.

Related papers

• 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)
• Probing Graph Representations [77.7361299039905]
  We use a probing framework to quantify the amount of meaningful information captured in graph representations. Our findings on molecular datasets show the potential of probing for understanding the inductive biases of graph-based models. We advocate for probing as a useful diagnostic tool for evaluating graph-based models.
  arXiv  Detail & Related papers  (2023-03-07T14:58:18Z)
• Graph Generation with Diffusion Mixture [57.78958552860948]
  Generation of graphs is a major challenge for real-world tasks that require understanding the complex nature of their non-Euclidean structures. We propose a generative framework that models the topology of graphs by explicitly learning the final graph structures of the diffusion process.
  arXiv  Detail & Related papers  (2023-02-07T17:07:46Z)
• 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)
• Tensor Rank and Other Multipartite Entanglement Measures of Graph States [5.8087716340417765]
  Graph states play an important role in quantum information theory through their connection to measurement-based computing and error correction. We show that several multipartite extensions of bipartite entanglement measures are dichotomous for graph states based on the connectivity of the corresponding graph.
  arXiv  Detail & Related papers  (2022-09-13T21:59:31Z)
• 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)
• Graph model overview, events scales structure and chains of events [0.0]
  We present a graph model for a background independent, relational approach to spacetime. The graph coloring determines the graph structure in clusters of graph vertices (events) that can be monochromatic (homogeneous loops) or polychromatic (inhomogeneous loops) The emerging structure has self-similar characteristics on different scales (states)
  arXiv  Detail & Related papers  (2020-07-12T16:42:09Z)
• 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)
• The Power of Graph Convolutional Networks to Distinguish Random Graph Models: Short Version [27.544219236164764]
  Graph convolutional networks (GCNs) are a widely used method for graph representation learning. We investigate the power of GCNs to distinguish between different random graph models on the basis of the embeddings of their sample graphs.
  arXiv  Detail & Related papers  (2020-02-13T17:58:42Z)
• Bridging Knowledge Graphs to Generate Scene Graphs [49.69377653925448]
  We propose a novel graph-based neural network that iteratively propagates information between the two graphs, as well as within each of them. Our Graph Bridging Network, GB-Net, successively infers edges and nodes, allowing to simultaneously exploit and refine the rich, heterogeneous structure of the interconnected scene and commonsense graphs.
  arXiv  Detail & Related papers  (2020-01-07T23:35:52Z)

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.