Information Dissipation in Random Quantum Networks
classification
🪐 quant-ph
keywords
informationnetworkdissipationparameterweightingaccordinglyaddedcharacterized
read the original abstract
We study the information dynamics in a network of spin-$1/2$ particles when edges representing $XY$ interactions are randomly added to a disconnected graph accordingly to a probability distribution characterized by a "weighting" parameter. In this way we model dissipation of information initially localized in single or two qubits all over the network. We then show the dependence of this phenomenon from weighting parameter and size of the network.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.