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

• Multiple-basis representation of quantum states [1.1999555634662633]
  We explore a new hybrid, efficient quantum-classical representation of quantum states, the multiple-basis representation. This representation consists of a linear combination of states that are sparse in some given and different bases, specified by quantum circuits. We find cases in which this representation can be used, namely approximation of ground states, simulation of deeper computations by specifying bases with shallow circuits, and a tomographical protocol to describe states as multiple-basis representations.
  arXiv  Detail & Related papers  (2024-11-05T13:57:57Z)
• 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)
• 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)
• Quantum Graph-State Synthesis with SAT [0.0]
  We present a CNF encoding for both local and non-local graph state operations. We use this encoding in a bounded-model-checking set-up to synthesize the desired transformation. We find that the approach is able to synthesize transformations for graphs up to 17 qubits in under 30 minutes.
  arXiv  Detail & Related papers  (2023-09-07T09:35:31Z)
• 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)
• GRAPE optimization for open quantum systems with time-dependent decoherence rates driven by coherent and incoherent controls [77.34726150561087]
  The GRadient Ascent Pulse Engineering (GRAPE) method is widely used for optimization in quantum control. We adopt GRAPE method for optimizing objective functionals for open quantum systems driven by both coherent and incoherent controls. The efficiency of the algorithm is demonstrated through numerical simulations for the state-to-state transition problem.
  arXiv  Detail & Related papers  (2023-07-17T13:37:18Z)
• 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)
• Quantum entanglement and contextuality with complexifications of $E_8$ root system [55.2480439325792]
  The Witting configuration with 40 complex rays was suggested as a possible reformulation of Penrose model with two spin-3/2 systems based on geometry of dodecahedron. An analysis of properties of suggested configuration of quantum states is provided using many analogies with properties of Witting configuration.
  arXiv  Detail & Related papers  (2022-10-27T11:23:12Z)
• 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)
• 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)
• Bipartite quantum measurements with optimal single-sided distinguishability [0.0]
  We look for a basis with optimal single-sided mutual state distinguishability in $Ntimes N$ Hilbert space. In the case $N=2$ of a two-qubit system our solution coincides with the elegant joint measurement introduced by Gisin. We show that the one-party measurement that distinguishes the states of an optimal basis of the composite system leads to a local quantum state tomography.
  arXiv  Detail & Related papers  (2020-10-28T10:30:35Z)
• 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)
• Architecture and noise analysis of continuous-variable quantum gates using two-dimensional cluster states [0.0]
  We propose a measurement-based quantum computing architecture for the implementation of a universal set of gates on two-dimensional cluster states. We compare the four different states and find that, although they all allow for universal computation, the quad-rail lattice cluster state performs better than the other three states.
  arXiv  Detail & Related papers  (2020-05-27T17:42:42Z)
• Spectra of Perfect State Transfer Hamiltonians on Fractal-Like Graphs [62.997667081978825]
  We study the spectral features, on fractal-like graphs, of Hamiltonians which exhibit the special property of perfect quantum state transfer. The essential goal is to develop the theoretical framework for understanding the interplay between perfect quantum state transfer, spectral properties, and the geometry of the underlying graph.
  arXiv  Detail & Related papers  (2020-03-25T02:46:14Z)
• 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.