Entanglement of weighted graphs uncovers transitions in variable-range interacting models

• URL: http://arxiv.org/abs/2307.11739v1
• Date: Fri, 21 Jul 2023 17:53:46 GMT
• Title: Entanglement of weighted graphs uncovers transitions in variable-range interacting models
• Authors: Debkanta Ghosh, Keshav Das Agarwal, Pritam Halder, Aditi Sen De
• Abstract summary: We show that a variable-range power law interacting Ising model can generate a genuine entangled graph state. In order to achieve a finite-size subsystem from the entire system, we design a local measurement strategy.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The cluster state acquired by evolving the nearest-neighbor (NN) Ising model from a completely separable state is the resource for measurement-based quantum computation. Instead of an NN system, a variable-range power law interacting Ising model can generate a genuine multipartite entangled (GME) weighted graph state (WGS) that may reveal intrinsic characteristics of the evolving Hamiltonian. We establish that the pattern of generalized geometric measure (GGM) in the evolved state with an arbitrary number of qubits is sensitive to fall-off rates and the range of interactions of the evolving Hamiltonian. We report that the time-derivative and time-averaged GGM at a particular time can detect the transition points present in the fall-off rates of the interaction strength, separating different regions, namely long-range, quasi-local and local ones in one- and two-dimensional lattices with deformation. Moreover, we illustrate that in the quasi-local and local regimes, there exists a minimum coordination number in the evolving Ising model for a fixed total number of qubits which can mimic the GGM of the long-range model. In order to achieve a finite-size subsystem from the entire system, we design a local measurement strategy that allows a WGS of an arbitrary number of qubits to be reduced to a local unitarily equivalent WGS having fewer qubits with modified weights.

Related papers

• Bridging Geometric States via Geometric Diffusion Bridge [79.60212414973002]
  We introduce the Geometric Diffusion Bridge (GDB), a novel generative modeling framework that accurately bridges initial and target geometric states. GDB employs an equivariant diffusion bridge derived by a modified version of Doob's $h$-transform for connecting geometric states. We show that GDB surpasses existing state-of-the-art approaches, opening up a new pathway for accurately bridging geometric states.
  arXiv  Detail & Related papers  (2024-10-31T17:59:53Z)
• Efficient Learning of Long-Range and Equivariant Quantum Systems [9.427635404752936]
  We consider a fundamental task in quantum many-body physics - finding and learning ground states of quantum Hamiltonians and their properties. Recent works have studied the task of predicting the ground state expectation value of sums of geometrically local observables by learning from data. We extend these results beyond the local requirements on both Hamiltonians and observables, motivated by the relevance of long-range interactions in molecular and atomic systems.
  arXiv  Detail & Related papers  (2023-12-28T13:42:59Z)
• Revealing Transition in Fall-off Rates of spin-s Ising Model through Multiqudit Graph states [0.0]
  A variable-range interacting Ising model with spin-1/2 particles exhibits distinct behavior depending on the fall-off rates in the range of interactions. We show that the scaling of time-averaged mutual information and the divergence in the first derivative of GME can indicate the transition point from NL to QL. We also suggest that the existence of a saturation value of a finite number of qudits capable of mimicking the GME pattern of an arbitrarily large system-size can reveal the second transition point between quasi-local and local regions.
  arXiv  Detail & Related papers  (2023-11-14T15:12:21Z)
• Convergence of mean-field Langevin dynamics: Time and space discretization, stochastic gradient, and variance reduction [49.66486092259376]
  The mean-field Langevin dynamics (MFLD) is a nonlinear generalization of the Langevin dynamics that incorporates a distribution-dependent drift. Recent works have shown that MFLD globally minimizes an entropy-regularized convex functional in the space of measures. We provide a framework to prove a uniform-in-time propagation of chaos for MFLD that takes into account the errors due to finite-particle approximation, time-discretization, and gradient approximation.
  arXiv  Detail & Related papers  (2023-06-12T16:28:11Z)
• Framework of dynamical transitions from long-range to short-range quantum systems [0.0]
  A quantum many-body system undergoes phase transitions of distinct species with variations of local and global parameters. We propose a framework in which a dynamical quantity can change its behavior for quenches across global or local system parameters.
  arXiv  Detail & Related papers  (2023-05-04T15:46:40Z)
• Global-to-Local Modeling for Video-based 3D Human Pose and Shape Estimation [53.04781510348416]
  Video-based 3D human pose and shape estimations are evaluated by intra-frame accuracy and inter-frame smoothness. We propose to structurally decouple the modeling of long-term and short-term correlations in an end-to-end framework, Global-to-Local Transformer (GLoT) Our GLoT surpasses previous state-of-the-art methods with the lowest model parameters on popular benchmarks, i.e., 3DPW, MPI-INF-3DHP, and Human3.6M.
  arXiv  Detail & Related papers  (2023-03-26T14:57:49Z)
• Multi-Scale Spatial Temporal Graph Convolutional Network for Skeleton-Based Action Recognition [13.15374205970988]
  We present a multi-scale spatial graph convolution (MS-GC) module and a multi-scale temporal graph convolution (MT-GC) module. The MS-GC and MT-GC modules decompose the corresponding local graph convolution into a set of sub-graph convolutions, forming a hierarchical residual architecture. We propose a multi-scale spatial temporal graph convolutional network (MST-GCN), which stacks multiple blocks to learn effective motion representations for action recognition.
  arXiv  Detail & Related papers  (2022-06-27T03:17:33Z)
• Circulating Genuine Multiparty Entanglement in Quantum Network [0.0]
  We propose a scheme of generating genuine multiparty entangled states in quantum networks of arbitrary size. We prove that the generalized geometric measure (GGM) of the resulting state of arbitrary qubits coincides with the minimum GGM of the initial resource states. We show that the method proposed here can be implemented by using logic gates, or by using the time dynamics of realizable spin Hamiltonians.
  arXiv  Detail & Related papers  (2021-12-19T11:26:16Z)
• Post-mortem on a deep learning contest: a Simpson's paradox and the complementary roles of scale metrics versus shape metrics [61.49826776409194]
  We analyze a corpus of models made publicly-available for a contest to predict the generalization accuracy of neural network (NN) models. We identify what amounts to a Simpson's paradox: where "scale" metrics perform well overall but perform poorly on sub partitions of the data. We present two novel shape metrics, one data-independent, and the other data-dependent, which can predict trends in the test accuracy of a series of NNs.
  arXiv  Detail & Related papers  (2021-06-01T19:19:49Z)
• Permutation-equivariant and Proximity-aware Graph Neural Networks with Stochastic Message Passing [88.30867628592112]
  Graph neural networks (GNNs) are emerging machine learning models on graphs. Permutation-equivariance and proximity-awareness are two important properties highly desirable for GNNs. We show that existing GNNs, mostly based on the message-passing mechanism, cannot simultaneously preserve the two properties. In order to preserve node proximities, we augment the existing GNNs with node representations.
  arXiv  Detail & Related papers  (2020-09-05T16:46:56Z)
• Graph Gamma Process Generalized Linear Dynamical Systems [60.467040479276704]
  We introduce graph gamma process (GGP) linear dynamical systems to model real multivariate time series. For temporal pattern discovery, the latent representation under the model is used to decompose the time series into a parsimonious set of multivariate sub-sequences. We use the generated random graph, whose number of nonzero-degree nodes is finite, to define both the sparsity pattern and dimension of the latent state transition matrix.
  arXiv  Detail & Related papers  (2020-07-25T04:16:34Z)

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.