Operator growth in 2d CFT

• URL: http://arxiv.org/abs/2110.10519v2
• Date: Wed, 27 Oct 2021 09:44:28 GMT
• Title: Operator growth in 2d CFT
• Authors: Pawel Caputa, Shouvik Datta
• Abstract summary: We investigate and characterize the dynamics of operator growth in irrational two-dimensional conformal field theories. We implement the Lanczos algorithm and evaluate the Krylov of complexity under a unitary evolution protocol.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We investigate and characterize the dynamics of operator growth in irrational two-dimensional conformal field theories. By employing the oscillator realization of the Virasoro algebra and CFT states, we systematically implement the Lanczos algorithm and evaluate the Krylov complexity of simple operators (primaries and the stress tensor) under a unitary evolution protocol. Evolution of primary operators proceeds as a flow into the 'bath of descendants' of the Verma module. These descendants are labeled by integer partitions and have a one-to-one map to Young diagrams. This relationship allows us to rigorously formulate operator growth as paths spreading along the Young's lattice. We extract quantitative features of these paths and also identify the one that saturates the conjectured upper bound on operator growth.

Related papers

• Geometric structure and transversal logic of quantum Reed-Muller codes [51.11215560140181]
  In this paper, we aim to characterize the gates of quantum Reed-Muller (RM) codes by exploiting the well-studied properties of their classical counterparts. A set of stabilizer generators for a RM code can be described via $X$ and $Z$ operators acting on subcubes of particular dimensions.
  arXiv  Detail & Related papers  (2024-10-10T04:07:24Z)
• Monte Carlo Simulation of Operator Dynamics and Entanglement in Dual-Unitary Circuits [3.8572128827057255]
  We investigate operator dynamics and entanglement growth in dual-unitary circuits. Our work offers a scalable computational framework for studying long-time operator evolution and entanglement.
  arXiv  Detail & Related papers  (2024-10-01T18:00:00Z)
• What Improves the Generalization of Graph Transformers? A Theoretical Dive into the Self-attention and Positional Encoding [67.59552859593985]
  Graph Transformers, which incorporate self-attention and positional encoding, have emerged as a powerful architecture for various graph learning tasks. This paper introduces first theoretical investigation of a shallow Graph Transformer for semi-supervised classification.
  arXiv  Detail & Related papers  (2024-06-04T05:30:16Z)
• Operator dynamics in Lindbladian SYK: a Krylov complexity perspective [0.0]
  We analytically establish the linear growth of two sets of coefficients for any generic jump operators. We find that the Krylov complexity saturates inversely with the dissipation strength, while the dissipative timescale grows logarithmically.
  arXiv  Detail & Related papers  (2023-11-01T18:00:06Z)
• DynGFN: Towards Bayesian Inference of Gene Regulatory Networks with GFlowNets [81.75973217676986]
  Gene regulatory networks (GRN) describe interactions between genes and their products that control gene expression and cellular function. Existing methods either focus on challenge (1), identifying cyclic structure from dynamics, or on challenge (2) learning complex Bayesian posteriors over DAGs, but not both. In this paper we leverage the fact that it is possible to estimate the "velocity" of gene expression with RNA velocity techniques to develop an approach that addresses both challenges.
  arXiv  Detail & Related papers  (2023-02-08T16:36:40Z)
• Growth of a renormalized operator as a probe of chaos [0.2741266294612776]
  We propose that the size of an operator evolved under holographic renormalization group flow shall grow linearly with the scale. To test this conjecture, we study the operator growth in two different toy models.
  arXiv  Detail & Related papers  (2021-10-28T17:20:17Z)
• Model based Multi-agent Reinforcement Learning with Tensor Decompositions [52.575433758866936]
  This paper investigates generalisation in state-action space over unexplored state-action pairs by modelling the transition and reward functions as tensors of low CP-rank. Experiments on synthetic MDPs show that using tensor decompositions in a model-based reinforcement learning algorithm can lead to much faster convergence if the true transition and reward functions are indeed of low rank.
  arXiv  Detail & Related papers  (2021-10-27T15:36:25Z)
• Geometry of Krylov Complexity [0.0]
  We develop a geometric approach to operator growth and Krylov complexity in many-body quantum systems governed by symmetries. We show that, in this geometry, operator growth is represented by geodesics and Krylov complexity is proportional to a volume. We use techniques from quantum optics to study operator evolution with quantum information tools such as entanglement and Renyi entropies.
  arXiv  Detail & Related papers  (2021-09-08T18:00:00Z)
• X-volution: On the unification of convolution and self-attention [52.80459687846842]
  We propose a multi-branch elementary module composed of both convolution and self-attention operation. The proposed X-volution achieves highly competitive visual understanding improvements.
  arXiv  Detail & Related papers  (2021-06-04T04:32:02Z)
• Relevant OTOC operators: footprints of the classical dynamics [68.8204255655161]
  The OTOC-RE theorem relates the OTOCs summed over a complete base of operators to the second Renyi entropy. We show that the sum over a small set of relevant operators, is enough in order to obtain a very good approximation for the entropy. In turn, this provides with an alternative natural indicator of complexity, i.e. the scaling of the number of relevant operators with time.
  arXiv  Detail & Related papers  (2020-07-31T19:23:26Z)
• On operator growth and emergent Poincar\'e symmetries [0.0]
  We consider operator growth for generic large-N gauge theories at finite temperature. The algebra of these modes allows for a simple analysis of the operators with whom the initial operator mixes over time. We show all these approaches have a natural formulation in terms of the Gelfand-Naimark-Segal (GNS) construction.
  arXiv  Detail & Related papers  (2020-02-10T15:29:50Z)

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.