A dual characterization of network entanglement

zbMATH Open1229.81047MaRDI QIDQ3172085FDOQ3172085

Gregory L. Light, Teodros Getachew

Publication date: 5 October 2011

Recommendations

• Cooperative cross-entropy method for generating entangled networks
• Controlled maximum entropy method optimization of the initial network topology and routing
• Separability of Pure and Mixed States of the Quantum Network of Four Nodes
• A Poisson model for entanglement optimization in the quantum Internet
• Separability of Pure States of the Quantum Network of Three Nodes

zbMATH Keywords

graph adjacencyinternet connectivitynode dependency

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Communication networks in operations research (90B18) Applications of graph theory to circuits and networks (94C15)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: A dual characterization of network entanglement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172085)