Emergent complex quantum networks in continuous-variables non-Gaussian states

• URL: http://arxiv.org/abs/2012.15608v4
• Date: Mon, 12 Sep 2022 09:35:24 GMT
• Title: Emergent complex quantum networks in continuous-variables non-Gaussian states
• Authors: Mattia Walschaers, Nicolas Treps, Bhuvanesh Sundar, Lincoln D. Carr, Valentina Parigi
• Abstract summary: We study a class of continuous-variable quantum states that present both multipartite entanglement and non-Gaussian statistics. In particular, the states are built from an initial imprinted cluster state created via Gaussian entangling operations.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We use complex network theory to study a class of continuous-variable quantum states that present both multipartite entanglement and non-Gaussian statistics. We consider the intermediate scale of several dozens of components at which such systems are already hard to characterize. In particular, the states are built from an initial imprinted cluster state created via Gaussian entangling operations according to a complex network structure. We then engender non-Gaussian statistics via multiple photon subtraction operations acting on a single node. We replicate in the quantum regime some of the models that mimic real-world complex networks in order to test their structural properties under local operations. We then go beyond the already known single-mode effects, by studying the emergent network of photon-number correlations via complex networks measures. We analytically prove that the imprinted network structure defines a vicinity of nodes, at a distance of four steps from the photon-subtracted node, in which the emergent network changes due to photon subtraction. Moreover, our numerical analysis shows that the emergent structure is greatly influenced by the structure of the imprinted network. Indeed, while the mean and the variance of the degree and clustering distribution of the emergent network always increase, the higher moments of the distributions are governed by the specific structure of the imprinted network. Finally, we show that the behaviour of nearest neighbours of the subtraction node depends on how they are connected to each other in the imprinted structure.

Related papers

• Spectral complexity of deep neural networks [2.099922236065961]
  We use the angular power spectrum of the limiting field to characterize the complexity of the network architecture. On this basis, we classify neural networks as low-disorder, sparse, or high-disorder. We show how this classification highlights a number of distinct features for standard activation functions, and in particular, sparsity properties of ReLU networks.
  arXiv  Detail & Related papers  (2024-05-15T17:55:05Z)
• Image segmentation with traveling waves in an exactly solvable recurrent neural network [71.74150501418039]
  We show that a recurrent neural network can effectively divide an image into groups according to a scene's structural characteristics. We present a precise description of the mechanism underlying object segmentation in this network. We then demonstrate a simple algorithm for object segmentation that generalizes across inputs ranging from simple geometric objects in grayscale images to natural images.
  arXiv  Detail & Related papers  (2023-11-28T16:46:44Z)
• DANI: Fast Diffusion Aware Network Inference with Preserving Topological Structure Property [2.8948274245812327]
  We propose a novel method called DANI to infer the underlying network while preserving its structural properties. DANI has higher accuracy and lower run time while maintaining structural properties, including modular structure, degree distribution, connected components, density, and clustering coefficients.
  arXiv  Detail & Related papers  (2023-10-02T23:23:00Z)
• Structural Balance and Random Walks on Complex Networks with Complex Weights [13.654842079699458]
  Recent years have seen an increasing interest to extend the tools of network science when the weight of edges are complex numbers. Here, we focus on the case when the weight matrix is Hermitian, a reasonable assumption in many applications. We introduce a classification of complex-weighted networks based on the notion of structural balance, and illustrate the shared spectral properties within each type.
  arXiv  Detail & Related papers  (2023-07-04T16:39:52Z)
• Neural Network Complexity of Chaos and Turbulence [0.0]
  We consider the relative complexity of chaos and turbulence from the perspective of deep neural networks. We analyze a set of classification problems, where the network has to distinguish images of fluid profiles in the turbulent regime. We quantify the complexity of the computation performed by the network via the intrinsic dimensionality of the internal feature representations.
  arXiv  Detail & Related papers  (2022-11-24T13:21:36Z)
• Entangled Residual Mappings [59.02488598557491]
  We introduce entangled residual mappings to generalize the structure of the residual connections. An entangled residual mapping replaces the identity skip connections with specialized entangled mappings. We show that while entangled mappings can preserve the iterative refinement of features across various deep models, they influence the representation learning process in convolutional networks.
  arXiv  Detail & Related papers  (2022-06-02T19:36:03Z)
• Deep Architecture Connectivity Matters for Its Convergence: A Fine-Grained Analysis [94.64007376939735]
  We theoretically characterize the impact of connectivity patterns on the convergence of deep neural networks (DNNs) under gradient descent training. We show that by a simple filtration on "unpromising" connectivity patterns, we can trim down the number of models to evaluate.
  arXiv  Detail & Related papers  (2022-05-11T17:43:54Z)
• The Sample Complexity of One-Hidden-Layer Neural Networks [57.6421258363243]
  We study a class of scalar-valued one-hidden-layer networks, and inputs bounded in Euclidean norm. We prove that controlling the spectral norm of the hidden layer weight matrix is insufficient to get uniform convergence guarantees. We analyze two important settings where a mere spectral norm control turns out to be sufficient.
  arXiv  Detail & Related papers  (2022-02-13T07:12:02Z)
• Controllable entangled state distribution in a dual-rail reconfigurable optical network [62.997667081978825]
  Reconfigurable distribution of entangled states is essential for operation of quantum networks connecting multiple devices such as quantum memories and quantum computers. We introduce new quantum distribution network architecture enabling control of the entangled state propagation direction using linear-optical devices and phase shifters.
  arXiv  Detail & Related papers  (2021-08-04T10:26:37Z)
• Problems of representation of electrocardiograms in convolutional neural networks [58.720142291102135]
  We show that these problems are systemic in nature. They are due to how convolutional networks work with composite objects, parts of which are not fixed rigidly, but have significant mobility.
  arXiv  Detail & Related papers  (2020-12-01T14:02:06Z)
• Emergent entanglement structures and self-similarity in quantum spin chains [0.0]
  We introduce an experimentally accessible network representation for many-body quantum states based on entanglement between all pairs of its constituents. We illustrate the power of this representation by applying it to a paradigmatic spin chain model, the XX model, and showing that it brings to light new phenomena.
  arXiv  Detail & Related papers  (2020-07-14T12:13:29Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.