Quantum max-flow in the bridge graph

• URL: http://arxiv.org/abs/2212.09794v1
• Date: Mon, 19 Dec 2022 19:07:37 GMT
• Title: Quantum max-flow in the bridge graph
• Authors: Fulvio Gesmundo, Vladimir Lysikov, Vincent Steffan
• Abstract summary: The quantum max-flow quantifies the maximal possible entanglement between two regions of a tensor network state for a fixed graph and fixed bond dimensions. We draw connections to the theory of prehomogenous tensor and the representation theory of quivers.
• Score: 0.10742675209112622
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The quantum max-flow quantifies the maximal possible entanglement between two regions of a tensor network state for a fixed graph and fixed bond dimensions. In this work, we calculate the quantum max-flow exactly in the case of the bridge graph. The result is achieved by drawing connections to the theory of prehomogenous tensor and the representation theory of quivers. Further, we highlight relations to invariant theory and to algebraic statistics.

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)
• An Analysis of Quantum Annealing Algorithms for Solving the Maximum Clique Problem [49.1574468325115]
  We analyse the ability of quantum D-Wave annealers to find the maximum clique on a graph, expressed as a QUBO problem. We propose a decomposition algorithm for the complementary maximum independent set problem, and a graph generation algorithm to control the number of nodes, the number of cliques, the density, the connectivity indices and the ratio of the solution size to the number of other nodes.
  arXiv  Detail & Related papers  (2024-06-11T04:40:05Z)
• Strong quantum state transfer on graphs via loop edges [0.39462888523270856]
  We quantify the effect of weighted loops at the source and target nodes of a graph on the strength of quantum state transfer. By considering local spectral symmetry, we show that the required weight depends only on the maximum degree of the graph.
  arXiv  Detail & Related papers  (2024-04-01T15:26:38Z)
• 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)
• 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)
• Scattering entropies of quantum graphs with several channels [0.0]
  We deal with the scattering entropy of quantum graphs in many different circumstances. We think the results may be used as quantifiers in models related to the transport in quantum graphs.
  arXiv  Detail & Related papers  (2022-11-17T17:35:06Z)
• From Quantum Graph Computing to Quantum Graph Learning: A Survey [86.8206129053725]
  We first elaborate the correlations between quantum mechanics and graph theory to show that quantum computers are able to generate useful solutions. For its practicability and wide-applicability, we give a brief review of typical graph learning techniques. We give a snapshot of quantum graph learning where expectations serve as a catalyst for subsequent research.
  arXiv  Detail & Related papers  (2022-02-19T02:56:47Z)
• Stochastic approximate state conversion for entanglement and general quantum resource theories [41.94295877935867]
  An important problem in any quantum resource theory is to determine how quantum states can be converted into each other. Very few results have been presented on the intermediate regime between probabilistic and approximate transformations. We show that these bounds imply an upper bound on the rates for various classes of states under probabilistic transformations. We also show that the deterministic version of the single copy bounds can be applied for drawing limitations on the manipulation of quantum channels.
  arXiv  Detail & Related papers  (2021-11-24T17:29:43Z)
• Quantum Max-Flow Min-Cut theorem [11.98034899127065]
  We establish a quantum max-flow min-cut theorem for a new definition of quantum maximum flow. Our result implies that the ratio of the quantum max-flow to the quantum min-cut converges to $1$ as the dimension $n$ tends to infinity.
  arXiv  Detail & Related papers  (2021-10-03T02:11:39Z)
• 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)
• Quantum Statistical Complexity Measure as a Signalling of Correlation Transitions [55.41644538483948]
  We introduce a quantum version for the statistical complexity measure, in the context of quantum information theory, and use it as a signalling function of quantum order-disorder transitions. We apply our measure to two exactly solvable Hamiltonian models, namely: the $1D$-Quantum Ising Model and the Heisenberg XXZ spin-$1/2$ chain. We also compute this measure for one-qubit and two-qubit reduced states for the considered models, and analyse its behaviour across its quantum phase transitions for finite system sizes as well as in the thermodynamic limit by using Bethe ansatz.
  arXiv  Detail & Related papers  (2020-02-05T00:45:21Z)

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.