Krenn-Gu conjecture for sparse graphs

• URL: http://arxiv.org/abs/2407.00303v1
• Date: Sat, 29 Jun 2024 03:51:14 GMT
• Title: Krenn-Gu conjecture for sparse graphs
• Authors: L. Sunil Chandran, Rishikesh Gajjala, Abraham M. Illickan,
• Abstract summary: Greenberger-Horne-Zeilinger (GHZ) states are quantum states involving at least three entangled particles. GHZ states are of fundamental interest in quantum information theory, and the construction of such states of high dimension has various applications in quantum communication and cryptography.
• Score: 0.22499166814992438
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Greenberger-Horne-Zeilinger (GHZ) states are quantum states involving at least three entangled particles. They are of fundamental interest in quantum information theory, and the construction of such states of high dimension has various applications in quantum communication and cryptography. They are of fundamental interest in quantum information theory, and the construction of such states of high dimension has various applications in quantum communication and cryptography. Krenn, Gu and Zeilinger discovered a correspondence between a large class of quantum optical experiments which produce GHZ states and edge-weighted edge-coloured multi-graphs with some special properties called the \emph{GHZ graphs}. On such GHZ graphs, a graph parameter called \emph{dimension} can be defined, which is the same as the dimension of the GHZ state produced by the corresponding experiment. Krenn and Gu conjectured that the dimension of any GHZ graph with more than $4$ vertices is at most $2$. An affirmative resolution of the Krenn-Gu conjecture has implications for quantum resource theory. On the other hand, the construction of a GHZ graph on a large number of vertices with a high dimension would lead to breakthrough results. In this paper, we study the existence of GHZ graphs from the perspective of the Krenn-Gu conjecture and show that the conjecture is true for graphs of vertex connectivity at most 2 and for cubic graphs. We also show that the minimal counterexample to the conjecture should be $4$-connected. Such information could be of great help in the search for GHZ graphs using existing tools like PyTheus. While the impact of the work is in quantum physics, the techniques in this paper are purely combinatorial, and no background in quantum physics is required to understand them.

Related papers

• On the Quantum Chromatic Gap [1.90365714903665]
  We put forth a quantum pseudo-telepathy version of Khot's $d$-to-$1$ Games Conjecture. We show that the existence of a certain form of pseudo-telepathic XOR games would imply the conjecture. We also prove that the Dinur--Khot--Kindler--Minzer--Safra reduction, recently used for proving the $2$-to-$2$ Games Theorem is quantum complete.
  arXiv  Detail & Related papers  (2025-03-29T20:10:34Z)
• Optimal spatial searches with long-range tunneling [0.0]
  We show that Grover's optimal scaling can be reached in lower dimensions on lattices of long-range interacting particles. Our work identifies an exact relation between criticality of long-range and short-range systems.
  arXiv  Detail & Related papers  (2025-01-14T14:25:02Z)
• 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)
• Limits, approximation and size transferability for GNNs on sparse graphs via graphops [44.02161831977037]
  We take a perspective of taking limits of operators derived from graphs, such as the aggregation operation that makes up GNNs. Our results hold for dense and sparse graphs, and various notions of graph limits.
  arXiv  Detail & Related papers  (2023-06-07T15:04:58Z)
• Quantum-Memory-Enhanced Preparation of Nonlocal Graph States [10.086067943202416]
  Graph states are an important class of multipartite entangled states. We show an efficient scheme to prepare graph states with only two atomic excitations in quantum networks. Our work demonstrates the prospect of efficient generation of multipartite entangled states in large-scale distributed systems.
  arXiv  Detail & Related papers  (2022-02-27T15:42:09Z)
• 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)
• The Exact Class of Graph Functions Generated by Graph Neural Networks [43.25172578943894]
  Graph Neural Network (GNN) whose output is identical to the graph function? In this paper, we fully answer this question and characterize the class of graph problems that can be represented by GNNs. We show that this condition can be efficiently verified by checking quadratically many constraints.
  arXiv  Detail & Related papers  (2022-02-17T18:54:27Z)
• On quantum tomography on locally compact groups [0.0]
  We introduce quantum tomography on locally compact Abelian groups $G$. We provide three examples in which $G=mathbb R$ (the optical tomography), $G=mathbb Z_n$ (corresponding to measurements in mutually unbiased bases) and $G=mathbb T$ (the tomography of the phase) As an application we have calculated the quantum tomogram for the output states of quantum Weyl channels.
  arXiv  Detail & Related papers  (2022-01-16T13:48:22Z)
• Spectral bounds for the quantum chromatic number of quantum graphs [0.0]
  We obtain lower bounds for the classical and quantum number of a quantum graph using eigenvalues of the quantum adjacency matrix. We generalize all the spectral bounds given by Elphick and Wocjan to the quantum graph setting. Our results are achieved using techniques from linear algebra and a complete definition of quantum graph coloring.
  arXiv  Detail & Related papers  (2021-12-03T05:36:21Z)
• Application of graph theory in quantum computer science [0.0]
  We demonstrate that the continuous-time quantum walk models remain powerful for nontrivial graph structures. The quantum spatial search defined through CTQW has been proven to work well on various undirected graphs. In the scope of this aspect we analyze, whether quantum speed-up is observed for complicated graph structures as well.
  arXiv  Detail & Related papers  (2021-09-27T12:07:25Z)
• Photon-mediated Stroboscopic Quantum Simulation of a $\mathbb{Z}_{2}$ Lattice Gauge Theory [58.720142291102135]
  Quantum simulation of lattice gauge theories (LGTs) aims at tackling non-perturbative particle and condensed matter physics. One of the current challenges is to go beyond 1+1 dimensions, where four-body (plaquette) interactions, not contained naturally in quantum simulating devices, appear. We show how to prepare the ground state and measure Wilson loops using state-of-the-art techniques in atomic physics.
  arXiv  Detail & Related papers  (2021-07-27T18:10:08Z)
• How to Teach a Quantum Computer a Probability Distribution [0.0]
  We explore teaching a coined discrete time quantum walk on a regular graph a probability distribution. We also discuss some hardware and software concerns as well as immediate applications and the several connections to machine learning.
  arXiv  Detail & Related papers  (2021-04-15T02:41:27Z)
• 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)

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.