Large Coherent States Formed from Disordered k-Regular Random Graphs

Abstract

The present work is motivated by the need for robust, large-scale coherent states that can play possible roles as quantum resources. A challenge is that large, complex systems tend to be fragile. However, emergent phenomena in classical systems tend to become more robust with scale. Do these classical systems inspire ways to think about robust quantum networks? This question is studied by characterizing the complex quantum states produced by mapping interactions between a set of qubits from structure in graphs. We focus on maps based on k-regular random graphs where many edges were randomly deleted. We ask how many edge deletions can be tolerated. Surprisingly, it was found that the emergent coherent state characteristic of these graphs was robust to a substantial number of edge deletions. The analysis considers the possible role of the expander property of k-regular random graphs.