Entanglement, quantum correlators and connectivity in graph states
- URL: http://arxiv.org/abs/2308.07690v1
- Date: Tue, 15 Aug 2023 10:42:07 GMT
- Title: Entanglement, quantum correlators and connectivity in graph states
- Authors: Arthur Vesperini and Roberto Franzosi
- Abstract summary: This work contributes to a deeper understanding of the entanglement and connectivity properties of graph states.
It offers valuable insights for quantum information processing and quantum computing applications.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In this work, we present a comprehensive exploration of the entanglement and
graph connectivity properties of graph states. We quantify the entanglement in
pseudo graph states using the entanglement distance, a recently introduced
measure of entanglement. Additionally, we propose a novel approach to probe the
underlying graph connectivity of genuine graph states, using quantum
correlators of Pauli matrices. Our findings also reveal interesting
implications for measurement processes, demonstrating the equivalence of
certain projective measurements. Finally, we emphasize the simplicity of data
analysis within this framework. This work contributes to a deeper understanding
of the entanglement and connectivity properties of graph states, offering
valuable insights for quantum information processing and quantum computing
applications. In this work, we do not resort to the celebrated stabilizer
formalism, which is the framework typically preferred for the study of this
type of state; on the contrary, our approach is solely based on the concepts of
expectation values, quantum correlations and projective measurement, which have
the advantage of being very intuitive and fundamental tools of quantum theory.
Related papers
- Many-body quantum resources of graph states [0.0]
Characterizing the non-classical correlations of a complex many-body system is an important part of quantum technologies.
We consider four topologies, namely the star graph states with edges, Tur'an graphs, $r$-ary tree graphs, and square grid cluster states.
We characterize many-body entanglement depth in graph states with up to $8$ qubits in $146$ classes non-equivalent under local transformations and graph isomorphisms.
arXiv Detail & Related papers (2024-10-16T12:05:19Z) - Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
We explore the applicability of quantum-data learning to practical problems in high-energy physics.
We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states.
The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
arXiv Detail & Related papers (2023-06-29T18:00:01Z) - Correlations and projective measurements in maximally entangled
multipartite states [0.0]
Multipartite quantum states constitute the key resource for quantum computation.
This paper aims at examining the structure of multipartite maximally entangled pure states, using tools with a simple and intuitive physical meaning, namely, projective measurements and correlations.
arXiv Detail & Related papers (2023-04-21T13:34:39Z) - Graph-theoretic insights on the constructability of complex entangled states [0.24578723416255752]
We introduce the technique of local sparsification on experiment graphs, using which we answer a crucial open question in experimental quantum optics.
This provides us with more insights into quantum resource theory, the limitation of specific quantum photonic systems and initiates the use of graph-theoretic techniques for designing quantum physics experiments.
arXiv Detail & Related papers (2023-04-13T11:13:17Z) - QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional
Networks [124.7972093110732]
We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations.
To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections.
Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
arXiv Detail & Related papers (2022-11-09T21:43:16Z) - 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) - Designing exceptional-point-based graphs yielding topologically
guaranteed quantum search [0.0]
We show how to construct walks with the property that all the eigenvalues of the non-Hermitian survival operator, coalesce to zero.
The resulting search is guaranteed to succeed in a bounded time for any initial condition.
arXiv Detail & Related papers (2022-02-08T04:30:24Z) - Tracing Information Flow from Open Quantum Systems [52.77024349608834]
We use photons in a waveguide array to implement a quantum simulation of the coupling of a qubit with a low-dimensional discrete environment.
Using the trace distance between quantum states as a measure of information, we analyze different types of information transfer.
arXiv Detail & Related papers (2021-03-22T16:38:31Z) - Holographic tensor network models and quantum error correction: A
topical review [78.28647825246472]
Recent progress in studies of holographic dualities has led to a confluence with concepts and techniques from quantum information theory.
A particularly successful approach has involved capturing holographic properties by means of tensor networks.
arXiv Detail & Related papers (2021-02-04T14:09:21Z) - Graph approach to quantum teleportation dynamics [0.0]
An approach based on graph theory is introduced and discussed in the context of some applications.
Its main goal is to provide a fully symbolic framework for quantum teleportation from a dynamical viewpoint.
Several particular teleportation examples are examined, which include bipartite, tripartite and tetrapartite maximally entangled states as quantum channels.
arXiv Detail & Related papers (2020-07-06T16:52:32Z) - 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.