Topological entanglement and hyperbolic volume

• URL: http://arxiv.org/abs/2106.03396v2
• Date: Tue, 7 Dec 2021 11:14:55 GMT
• Title: Topological entanglement and hyperbolic volume
• Authors: Aditya Dwivedi, Siddharth Dwivedi, Bhabani Prasad Mandal, Pichai Ramadevi, Vivek Kumar Singh
• Abstract summary: Chern-Simons theory provides setting to visualise the $m$-moment of reduced density matrix as a three-manifold invariant $Z(M_mathcalK_m)$. For SU(2) group, we show that $Z(M_mathcalK_m)$ can grow at mostly in $k$. We conjecture that $ln Z(M_mathcalK_m)$ is the hyperbolic volume of the knot complement $S3backslash mathcalK_m
• Score: 1.1909611351044664
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The entanglement entropy of many quantum systems is difficult to compute in general. They are obtained as a limiting case of the R\'enyi entropy of index $m$, which captures the higher moments of the reduced density matrix. In this work, we study pure bipartite states associated with $S^3$ complements of a two-component link which is a connected sum of a knot $\mathcal{K}$ and the Hopf link. For this class of links, the Chern-Simons theory provides the necessary setting to visualise the $m$-moment of the reduced density matrix as a three-manifold invariant $Z(M_{\mathcal{K}_m})$, which is the partition function of $M_{\mathcal{K}_m}$. Here $M_{\mathcal{K}_m}$ is a closed 3-manifold associated with the knot $\mathcal K_m$, where $\mathcal K_m$ is a connected sum of $m$-copies of $\mathcal{K}$ (i.e., $\mathcal{K}\#\mathcal{K}\ldots\#\mathcal{K}$) which mimics the well-known replica method. We analyse the partition functions $Z(M_{\mathcal{K}_m})$ for SU(2) and SO(3) gauge groups, in the limit of the large Chern-Simons coupling $k$. For SU(2) group, we show that $Z(M_{\mathcal{K}_m})$ can grow at most polynomially in $k$. On the contrary, we conjecture that $Z(M_{\mathcal{K}_m})$ for SO(3) group shows an exponential growth in $k$, where the leading term of $\ln Z(M_{\mathcal{K}_m})$ is the hyperbolic volume of the knot complement $S^3\backslash \mathcal{K}_m$. We further propose that the R\'enyi entropies associated with SO(3) group converge to a finite value in the large $k$ limit. We present some examples to validate our conjecture and proposal.

Related papers

• Relative volume of comparable pairs under semigroup majorization [0.0]
  We review recent results and conjectures in the case of emphmajorization relation. We prove new exact finite-$n$ results in the case of emphUT-majorization relation.
  arXiv  Detail & Related papers  (2024-10-30T16:48:59Z)
• The Communication Complexity of Approximating Matrix Rank [50.6867896228563]
  We show that this problem has randomized communication complexity $Omega(frac1kcdot n2log|mathbbF|)$. As an application, we obtain an $Omega(frac1kcdot n2log|mathbbF|)$ space lower bound for any streaming algorithm with $k$ passes.
  arXiv  Detail & Related papers  (2024-10-26T06:21:42Z)
• Quantum Algorithms and Lower Bounds for Finite-Sum Optimization [22.076317220348145]
  We give a quantum algorithm with complexity $tildeObig(n+sqrtd+sqrtell/mubig)$, improving the classical tight bound $tildeThetabig(n+sqrtnell/mubig)$. We also prove a quantum lower bound $tildeOmega(n+n3/4(ell/mu)1/4)$ when $d$ is large enough.
  arXiv  Detail & Related papers  (2024-06-05T07:13:52Z)
• Towards verifications of Krylov complexity [0.0]
  I present the exact and explicit expressions of the moments $mu_m$ for 16 quantum mechanical systems which are em exactly solvable both in the Schr"odinger and Heisenberg pictures.
  arXiv  Detail & Related papers  (2024-03-11T02:57:08Z)
• Exploring topological entanglement through Dehn surgery [1.3328842853079743]
  We compute the partition function of a closed 3-manifold obtained from Dehn fillings of the link complement. We have given explicit results for all hyperbolic knots $mathcalK$ up to six crossings.
  arXiv  Detail & Related papers  (2024-02-12T07:38:14Z)
• Provably learning a multi-head attention layer [55.2904547651831]
  Multi-head attention layer is one of the key components of the transformer architecture that sets it apart from traditional feed-forward models. In this work, we initiate the study of provably learning a multi-head attention layer from random examples. We prove computational lower bounds showing that in the worst case, exponential dependence on $m$ is unavoidable.
  arXiv  Detail & Related papers  (2024-02-06T15:39:09Z)
• Monogamy of entanglement between cones [68.8204255655161]
  We show that monogamy is not only a feature of quantum theory, but that it characterizes the minimal tensor product of general pairs of convex cones. Our proof makes use of a new characterization of products of simplices up to affine equivalence.
  arXiv  Detail & Related papers  (2022-06-23T16:23:59Z)
• Learning a Single Neuron with Adversarial Label Noise via Gradient Descent [50.659479930171585]
  We study a function of the form $mathbfxmapstosigma(mathbfwcdotmathbfx)$ for monotone activations. The goal of the learner is to output a hypothesis vector $mathbfw$ that $F(mathbbw)=C, epsilon$ with high probability.
  arXiv  Detail & Related papers  (2022-06-17T17:55:43Z)
• Uncertainties in Quantum Measurements: A Quantum Tomography [52.77024349608834]
  The observables associated with a quantum system $S$ form a non-commutative algebra $mathcal A_S$. It is assumed that a density matrix $rho$ can be determined from the expectation values of observables. Abelian algebras do not have inner automorphisms, so the measurement apparatus can determine mean values of observables.
  arXiv  Detail & Related papers  (2021-12-14T16:29:53Z)
• Non-Parametric Estimation of Manifolds from Noisy Data [1.0152838128195467]
  We consider the problem of estimating a $d$ dimensional sub-manifold of $mathbbRD$ from a finite set of noisy samples. We show that the estimation yields rates of convergence of $n-frack2k + d$ for the point estimation and $n-frack-12k + d$ for the estimation of tangent space.
  arXiv  Detail & Related papers  (2021-05-11T02:29:33Z)
• On the Complexity of Minimizing Convex Finite Sums Without Using the Indices of the Individual Functions [62.01594253618911]
  We exploit the finite noise structure of finite sums to derive a matching $O(n2)$-upper bound under the global oracle model. Following a similar approach, we propose a novel adaptation of SVRG which is both emphcompatible with oracles, and achieves complexity bounds of $tildeO(n2+nsqrtL/mu)log (1/epsilon)$ and $O(nsqrtL/epsilon)$, for $mu>0$ and $mu=0$
  arXiv  Detail & Related papers  (2020-02-09T03:39:46Z)

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.