Response of quantum spin networks to attacks
Bhuvanesh Sundar, Mattia Walschaers, Valentina Parigi, Lincoln D. Carr

TL;DR
This paper studies how quantum spin networks, modeled on various network types, respond to projective measurement attacks, revealing that complex quantum networks are not more robust than simpler ones, contrasting classical network behavior.
Contribution
It introduces a framework to analyze the response of quantum spin networks to attacks using emergent network measures and finds that quantum networks do not exhibit increased robustness due to complexity.
Findings
Emergent networks do not satisfy classical complexity criteria.
Quantum networks respond similarly regardless of network class.
Complex quantum networks are not more robust to attacks than simple ones.
Abstract
We investigate the ground states of spin models defined on networks that we imprint (e.g. non-complex random networks like Erdos-Renyi or complex networks like Watts-Strogatz, and Barabasi-Albert), and their response to decohering processes which we model with network attacks. We quantify the complexity of these ground states, and their response to the attacks, by calculating distributions of network measures of an emergent network whose link weights are the pairwise mutual information between spins. We focus on attacks which projectively measure spins. We find that the emergent networks in the ground state do not satisfy the usual criteria for complexity, and their average properties are captured well by a single dimensionless parameter in the Hamiltonian. While the response of classical networks to attacks is well-studied, where classical complex networks are known to be more robust…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
