Pages that link to "Item:Q858019"
From MaRDI portal
The following pages link to The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states (Q858019):
Displaying 39 items.
- Quantum state representation based on combinatorial Laplacian matrix of star-relevant graph (Q264898) (← links)
- A graph theoretical approach to states and unitary operations (Q296156) (← links)
- Graph kernels from the Jensen-Shannon divergence (Q385342) (← links)
- Separability of density matrices of graphs for multipartite systems (Q396942) (← links)
- Path Laplacian matrices: introduction and application to the analysis of consensus in networks (Q417470) (← links)
- Upper and lower bounds for the \(q\)-entropy of network models with application to network model selection (Q503599) (← links)
- Note on von Neumann and Rényi entropies of a graph (Q513257) (← links)
- A note on the von Neumann entropy of random graphs (Q603103) (← links)
- On graphs whose Laplacian matrix's multipartite separability is invariant under graph isomorphism (Q710574) (← links)
- Ranking nodes according to their path-complexity (Q728368) (← links)
- Depth-based complexity traces of graphs (Q898379) (← links)
- Graphs whose normalized Laplacian matrices are separable as density matrices in quantum mechanics (Q906486) (← links)
- On the von Neumann entropy of a graph (Q1671376) (← links)
- Combinatorial entanglement: detecting entanglement in quantum states using grid-labelled graphs (Q1690020) (← links)
- Quantum discord of states arising from graphs (Q1699976) (← links)
- Multipartite separability of density matrices of graphs (Q1740740) (← links)
- Concurrence and three-tangle of the graph (Q1993873) (← links)
- Combinatorial entanglement (Q2020668) (← links)
- Entanglement and separability of graph Laplacian quantum states (Q2107117) (← links)
- Allometric scaling of von Neumann entropy in animal connectomes and its evolutionary aspect (Q2144993) (← links)
- Graph entropy based on the number of spanning forests of \(c\)-cyclic graphs (Q2286143) (← links)
- Entropy of tournament digraphs (Q2332443) (← links)
- Symmetric Laplacians, quantum density matrices and their von-Neumann entropy (Q2401309) (← links)
- The von Neumann entropy of random multipartite graphs (Q2410238) (← links)
- Laplacian matrices of weighted digraphs represented as quantum states (Q2412612) (← links)
- Depth-based hypergraph complexity traces from directed line graphs (Q2416965) (← links)
- Walk entropies in graphs (Q2438485) (← links)
- Estimating the trace of matrix functions with application to complex networks (Q2679672) (← links)
- Bound entanglement and distillability of multipartite quantum systems (Q3459131) (← links)
- On the degree conjecture for separability of multipartite quantum states (Q3544578) (← links)
- Network-Ensemble Comparisons with Stochastic Rewiring and Von Neumann Entropy (Q4609600) (← links)
- A note on the degree conjecture for separability of multipartite quantum states (Q4985088) (← links)
- Bipartite quantum states and random complex networks (Q5137589) (← links)
- A New Entropy for Hypergraphs (Q5237052) (← links)
- Entanglement and other quantum correlations of a single qudit state (Q5247041) (← links)
- New Minkowski type inequalities and entropic inequalities for quantum states of qudits (Q5247053) (← links)
- On the spectral properties of Feigenbaum graphs (Q5870292) (← links)
- Computation of the von Neumann entropy of large matrices via trace estimators and rational Krylov methods (Q6153360) (← links)
- Quantum entanglement \& purity testing: a graph zeta function perspective (Q6166587) (← links)
