Tensor Rank and Other Multipartite Entanglement Measures of Graph States

• URL: http://arxiv.org/abs/2209.06320v2
• Date: Tue, 10 Jan 2023 23:50:44 GMT
• Title: Tensor Rank and Other Multipartite Entanglement Measures of Graph States
• Authors: Louis Schatzki, Linjian Ma, Edgar Solomonik, Eric Chitambar
• Abstract summary: 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.
• Score: 5.8087716340417765
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Graph states play an important role in quantum information theory through their connection to measurement-based computing and error correction. Prior work has revealed elegant connections between the graph structure of these states and their multipartite entanglement content. We continue this line of investigation by identifying additional entanglement properties for certain types of graph states. From the perspective of tensor theory, we tighten both upper and lower bounds on the tensor rank of odd ring states ($|R_{2n+1}\rangle$) to read $2^n+1 \leq rank(|R_{2n+1}\rangle) \leq 3*2^{n-1}$. Next, we show that several multipartite extensions of bipartite entanglement measures are dichotomous for graph states based on the connectivity of the corresponding graph. Lastly, we give a simple graph rule for computing the n-tangle $\tau_n$.

Related papers

• Entanglement of multi-qubit states representing directed networks and its detection with quantum computing [0.0]
  We consider quantum graph states that can be mapped to directed weighted graphs, also known as directed networks. The geometric measure of entanglement of the states is calculated for the quantum graph states corresponding to arbitrary graphs.
  arXiv  Detail & Related papers  (2024-07-13T19:36:11Z)
• 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)
• Two-state transfer: a generalization of pair and plus state transfer [0.0]
  A two-state in a graph $X$ is a quantum state of the form $mathbfe_u+smathbfe_v$. We investigate quantum state transfer between two-states, where the Hamiltonian is taken to be the adjacency, Laplacian or signless Laplacian matrix of the graph.
  arXiv  Detail & Related papers  (2024-04-25T14:45:49Z)
• 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)
• Bounding Entanglement Entropy with Contracted Graphs [0.0]
  We study contracted graphs for stabilizer states, W states and Dicke states. We derive an upper bound on the number of entropy vectors that can be generated using any $n$-qubit Clifford circuit. We speculate on the holographic implications for the relative proximity of gravitational duals of states within the same Clifford orbit.
  arXiv  Detail & Related papers  (2023-10-30T18:00:01Z)
• Finding the Missing-half: Graph Complementary Learning for Homophily-prone and Heterophily-prone Graphs [48.79929516665371]
  Graphs with homophily-prone edges tend to connect nodes with the same class. Heterophily-prone edges tend to build relationships between nodes with different classes. Existing GNNs only take the original graph during training.
  arXiv  Detail & Related papers  (2023-06-13T08:06:10Z)
• 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)
• Application of quotient graph theory to three-edge star graphs [0.0]
  We find quotient graphs for the three-edge star quantum graph with Neumann boundary conditions at the loose ends. These quotient graphs are smaller than the original graph and the direct sum of quotient graph Hamiltonians is unitarily equivalent to the original Hamiltonian.
  arXiv  Detail & Related papers  (2021-08-11T14:48:52Z)
• Line Graph Neural Networks for Link Prediction [71.00689542259052]
  We consider the graph link prediction task, which is a classic graph analytical problem with many real-world applications. In this formalism, a link prediction problem is converted to a graph classification task. We propose to seek a radically different and novel path by making use of the line graphs in graph theory. In particular, each node in a line graph corresponds to a unique edge in the original graph. Therefore, link prediction problems in the original graph can be equivalently solved as a node classification problem in its corresponding line graph, instead of a graph classification task.
  arXiv  Detail & Related papers  (2020-10-20T05:54:31Z)
• Factorizable Graph Convolutional Networks [90.59836684458905]
  We introduce a novel graph convolutional network (GCN) that explicitly disentangles intertwined relations encoded in a graph. FactorGCN takes a simple graph as input, and disentangles it into several factorized graphs. We evaluate the proposed FactorGCN both qualitatively and quantitatively on the synthetic and real-world datasets.
  arXiv  Detail & Related papers  (2020-10-12T03:01:40Z)
• Spectral Embedding of Graph Networks [76.27138343125985]
  We introduce an unsupervised graph embedding that trades off local node similarity and connectivity, and global structure. The embedding is based on a generalized graph Laplacian, whose eigenvectors compactly capture both network structure and neighborhood proximity in a single representation.
  arXiv  Detail & Related papers  (2020-09-30T04:59:10Z)

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.