Edge of entanglement in non-ergodic states: a complexity parameter formulation

• URL: http://arxiv.org/abs/2310.12796v1
• Date: Thu, 19 Oct 2023 14:52:43 GMT
• Title: Edge of entanglement in non-ergodic states: a complexity parameter formulation
• Authors: Devanshu Shekhar and Pragya Shukla
• Abstract summary: We analyze the subsystem size scaling of the entanglement entropy of a non-ergodic pure state. A rescaling of the complexity parameter helps us to identify the critical regime for the entanglement entropy of a broad range of pure non-ergodic states.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We analyze the subsystem size scaling of the entanglement entropy of a non-ergodic pure state that can be described by a multi-parametric Gaussian ensemble of complex matrices in a bipartite basis. Our analysis indicates, for a given set of global constraints, the existence of infinite number of universality classes of local complexity, characterized by the complexity parameter, for which the entanglement entropy reveals a universal scaling with subsystem size. A rescaling of the complexity parameter helps us to identify the critical regime for the entanglement entropy of a broad range of pure non-ergodic states.

Related papers

• Gaussian Entanglement Measure: Applications to Multipartite Entanglement of Graph States and Bosonic Field Theory [50.24983453990065]
  An entanglement measure based on the Fubini-Study metric has been recently introduced by Cocchiarella and co-workers. We present the Gaussian Entanglement Measure (GEM), a generalization of geometric entanglement measure for multimode Gaussian states. By providing a computable multipartite entanglement measure for systems with a large number of degrees of freedom, we show that our definition can be used to obtain insights into a free bosonic field theory.
  arXiv  Detail & Related papers  (2024-01-31T15:50:50Z)
• The Complexity of Being Entangled [0.0]
  Nielsen's approach to quantum state complexity relates the minimal number of quantum gates required to prepare a state to the length of geodesics computed with a certain norm on the manifold of unitary transformations. For a bipartite system, we investigate binding complexity, which corresponds to norms in which gates acting on a single subsystem are free of cost.
  arXiv  Detail & Related papers  (2023-11-07T19:00:02Z)
• An Analysis of On-the-fly Determinization of Finite-state Automata [65.268245109828]
  We establish an abstraction of on-the-fly determinization of finite-state automata and demonstrate how it can be applied to bound the automatons. A special case of our findings is that automata with many non-deterministic transitions almost always admit a determinization of complexity.
  arXiv  Detail & Related papers  (2023-08-27T11:51:27Z)
• Probing multipartite entanglement through persistent homology [6.107978190324034]
  We propose a study of multipartite entanglement through persistent homology. persistent homology is a tool used in topological data analysis. We show that persistence barcodes provide more fine-grained information than its topological summary.
  arXiv  Detail & Related papers  (2023-07-14T17:24:33Z)
• Entanglement dynamics of multi-parametric random states: a single parametric formulation [0.0]
  A non-ergodic quantum state of a many body system is in general random as well as multi-parametric, former due to a lack of exact information due to complexity and latter reflecting its varied behavior in different parts of the Hilbert space. Our theoretical analysis of these ensembles not only resolves the controversy about the growth rates of the average information entropies of the generic states but also leads to new insights in their entanglement dynamics.
  arXiv  Detail & Related papers  (2022-08-25T13:39:37Z)
• The Dynamics of Riemannian Robbins-Monro Algorithms [101.29301565229265]
  We propose a family of Riemannian algorithms generalizing and extending the seminal approximation framework of Robbins and Monro. Compared to their Euclidean counterparts, Riemannian algorithms are much less understood due to lack of a global linear structure on the manifold. We provide a general template of almost sure convergence results that mirrors and extends the existing theory for Euclidean Robbins-Monro schemes.
  arXiv  Detail & Related papers  (2022-06-14T12:30:11Z)
• Reinforcement Learning from Partial Observation: Linear Function Approximation with Provable Sample Efficiency [111.83670279016599]
  We study reinforcement learning for partially observed decision processes (POMDPs) with infinite observation and state spaces. We make the first attempt at partial observability and function approximation for a class of POMDPs with a linear structure.
  arXiv  Detail & Related papers  (2022-04-20T21:15:38Z)
• Detailed Account of Complexity for Implementation of Some Gate-Based Quantum Algorithms [55.41644538483948]
  In particular, some steps of the implementation, as state preparation and readout processes, can surpass the complexity aspects of the algorithm itself. We present the complexity involved in the full implementation of quantum algorithms for solving linear systems of equations and linear system of differential equations.
  arXiv  Detail & Related papers  (2021-06-23T16:33:33Z)
• On the Sample Complexity of Learning with Geometric Stability [42.813141600050166]
  We study the sample complexity of learning problems where the target function presents such invariance and stability properties. We provide non-parametric rates of convergence for kernel methods, and improvements in sample complexity by a factor equal to the size of the group.
  arXiv  Detail & Related papers  (2021-06-14T03:51:16Z)
• Subsystem complexity after a global quantum quench [0.0]
  We study the temporal evolution of the circuit complexity for a subsystem in harmonic lattices after a global quantum quench of the mass parameter. For infinite harmonic chains, the value of the subsystem complexity is studied through the generalised Gibbs ensemble.
  arXiv  Detail & Related papers  (2021-02-04T17:48:58Z)
• Entanglement marginal problems [0.0]
  entanglement marginal problem consists of deciding whether a number of reduced density matrices are compatible with an overall separable quantum state. We propose hierarchies of semidefinite programming relaxations of the set of quantum state marginals admitting a fully separable extension. Our results even extend to infinite systems, such as translation-invariant systems in 1D, as well as higher spatial dimensions with extra symmetries.
  arXiv  Detail & Related papers  (2020-06-16T10:48:56Z)

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.