Quantum state representation based on combinatorial Laplacian matrix of star-relevant graph
From MaRDI portal
(Redirected from Publication:264898)
Abstract: We consider the density matrices derived from combinatorial laplacian matrix of graphs. Specifically, the star-relevant graph, which means adding certain edges on peripheral vertices of star graph, is the focus of this paper. Initially, we provide the spectrum of the density matrices corresponding to star-like graph(i.e., adding an edge on star graph) and present that the Von Neumann entropy will increase under the graph operation(adding an edge on star graph) and the graph operation cannot simulated by local operation and classical communication (LOCC). Subsequently, we illustrate the spectrum of density matrices corresponding to star-alike graph(i.e, adding one edge on star-like graph) and exhibit that the Von Neumann entropy will increase under the graph operation(adding an edge on star-like graph)and the graph operation cannot simulated by LOCC. Finally, the spectrum of density matrices corresponding to star-mlike graph(i.e.,adding nonadjacent edges on the peripheral vertices of star graph) is demonstrated and the relation between the graph operation and Von Neumann entropy, LOCC is revealed in this paper.
Recommendations
- The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
- Laplacian matrices of weighted digraphs represented as quantum states
- A combinatorial approach to multipartite quantum systems: basic formulation
- Separability of density matrices of graphs for multipartite systems
- Symmetric Laplacians, quantum density matrices and their von-Neumann entropy
Cites work
- A combinatorial approach to multipartite quantum systems: basic formulation
- Book review of: T. Mitsa, Temporal data mining.
- Combinatorial laplacians and positivity under partial transpose
- Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
- Conditions for separability in generalized Laplacian matrices and diagonally dominant matrices as density matrices
- CONTROLLED QUANTUM SECURE DIRECT COMMUNICATION WITH QUANTUM ENCRYPTION
- Everything you always wanted to know about LOCC (but were afraid to ask)
- Experimental quantum teleportation
- Graphs, Algorithms, and Optimization
- scientific article; zbMATH DE number 5320162 (Why is no real title available?)
- scientific article; zbMATH DE number 3109251 (Why is no real title available?)
- Inequalities: theory of majorization and its applications
- Networks. An introduction.
- On graphs whose Laplacian matrix's multipartite separability is invariant under graph isomorphism
- On the degree conjecture for separability of multipartite quantum states
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum cryptography: public key distribution and coin tossing
- Quantum secret sharing
- Spectra of graphs
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
- The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
- The theory of quantum information
Cited in
(5)- Combinatorial entanglement
- Vector representations of graphs and distinguishing quantum product states with one-way LOCC
- Laplacian matrices of weighted digraphs represented as quantum states
- A graph theoretical approach to states and unitary operations
- Measuring vertex centrality using the Holevo quantity
This page was built for publication: Quantum state representation based on combinatorial Laplacian matrix of star-relevant graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q264898)
