Lessons from $O(N)$ models in one dimension

• URL: http://arxiv.org/abs/2109.06597v2
• Date: Fri, 24 Sep 2021 19:53:53 GMT
• Title: Lessons from $O(N)$ models in one dimension
• Authors: Daniel Schubring
• Abstract summary: Various topics related to the $O(N)$ model in one spacetime dimension (i.e. ordinary quantum mechanics) are considered. The focus is on a pedagogical presentation of quantum field theory methods in a simpler context.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Various topics related to the $O(N)$ model in one spacetime dimension (i.e. ordinary quantum mechanics) are considered. The focus is on a pedagogical presentation of quantum field theory methods in a simpler context where many exact results are available, but certain subtleties are discussed which may be of interest to active researchers in higher dimensional field theories as well. Large $N$ methods are introduced in the context of the zero-dimensional path integral and the connection to Stirling's series is shown. The entire spectrum of the $O(N)$ model, which includes the familiar $l(l+1)$ eigenvalues of the quantum rotor as a special case, is found both diagrammatically through large $N$ methods and by using Ward identities. The large $N$ methods are already exact at subleading order and the $\mathcal{O}\!\left(N^{-2}\right)$ corrections are explicitly shown to vanish. Peculiarities of gauge theories in $d=1$ are discussed in the context of the $CP^{N-1}$ sigma model, and the spectrum of a more general squashed sphere sigma model is found. The precise connection between the $O(N)$ model and the linear sigma model with a $\phi^4$ interaction is discussed. A valid form of the self-consistent screening approximation (SCSA) applicable to $O(N)$ models with a hard constraint is presented. The point is made that at least in $d=1$ the SCSA may do worse than simply truncating the large $N$ expansion to subleading order even for small $N$. In both the supersymmetric and non-supersymmetric versions of the $O(N)$ model, naive equations of motion relating vacuum expectation values are shown to be corrected by regularization-dependent finite corrections arising from contact terms associated to the equation of constraint.

Related papers

• Learning Orthogonal Multi-Index Models: A Fine-Grained Information Exponent Analysis [45.05072391903122]
  Information exponent plays important role in predicting sample complexity of online gradient descent. For multi-index models, focusing solely on the lowest degree can miss key structural details. We show that by considering both second- and higher-order terms, we can first learn the relevant space via the second-order terms.
  arXiv  Detail & Related papers  (2024-10-13T00:14:08Z)
• Decoherence and wavefunction deformation of $D_4$ non-Abelian topological order [0.0]
  We show that certain non-Abelian TOs can be analyzed and understood to a similar degree, despite being significantly richer. By identifying the corresponding local statistical mechanical spin or rotor model with $D_4$ symmetry, we find a remarkable stability against proliferating non-Abelian anyons.
  arXiv  Detail & Related papers  (2024-09-19T17:56:21Z)
• A Unified Framework for Uniform Signal Recovery in Nonlinear Generative Compressed Sensing [68.80803866919123]
  Under nonlinear measurements, most prior results are non-uniform, i.e., they hold with high probability for a fixed $mathbfx*$ rather than for all $mathbfx*$ simultaneously. Our framework accommodates GCS with 1-bit/uniformly quantized observations and single index models as canonical examples. We also develop a concentration inequality that produces tighter bounds for product processes whose index sets have low metric entropy.
  arXiv  Detail & Related papers  (2023-09-25T17:54:19Z)
• Effective Minkowski Dimension of Deep Nonparametric Regression: Function Approximation and Statistical Theories [70.90012822736988]
  Existing theories on deep nonparametric regression have shown that when the input data lie on a low-dimensional manifold, deep neural networks can adapt to intrinsic data structures. This paper introduces a relaxed assumption that input data are concentrated around a subset of $mathbbRd$ denoted by $mathcalS$, and the intrinsic dimension $mathcalS$ can be characterized by a new complexity notation -- effective Minkowski dimension.
  arXiv  Detail & Related papers  (2023-06-26T17:13:31Z)
• Spatially heterogeneous learning by a deep student machine [0.0]
  Deep neural networks (DNN) with a huge number of adjustable parameters remain largely black boxes. We study supervised learning by a DNN of width $N$ and depth $L$ consisting of $NL$ perceptrons with $c$ inputs by a statistical mechanics approach called the teacher-student setting. We show that the problem becomes exactly solvable in what we call as 'dense limit': $N gg c gg 1$ and $M gg 1$ with fixed $alpha=M/c$ using the replica method developed in (H. Yoshino, (
  arXiv  Detail & Related papers  (2023-02-15T01:09:03Z)
• Algebraic Aspects of Boundaries in the Kitaev Quantum Double Model [77.34726150561087]
  We provide a systematic treatment of boundaries based on subgroups $Ksubseteq G$ with the Kitaev quantum double $D(G)$ model in the bulk. The boundary sites are representations of a $*$-subalgebra $Xisubseteq D(G)$ and we explicate its structure as a strong $*$-quasi-Hopf algebra. As an application of our treatment, we study patches with boundaries based on $K=G$ horizontally and $K=e$ vertically and show how these could be used in a quantum computer
  arXiv  Detail & Related papers  (2022-08-12T15:05:07Z)
• Minimax Optimal Quantization of Linear Models: Information-Theoretic Limits and Efficient Algorithms [59.724977092582535]
  We consider the problem of quantizing a linear model learned from measurements. We derive an information-theoretic lower bound for the minimax risk under this setting. We show that our method and upper-bounds can be extended for two-layer ReLU neural networks.
  arXiv  Detail & Related papers  (2022-02-23T02:39:04Z)
• U(1) Fields from Qubits: an Approach via D-theory Algebra [0.0]
  A new quantum link microstructure was proposed for the lattice quantum chromodynamics (QCD) Hamiltonian. This formalism provides a general framework for building lattice field theory algorithms for quantum computing.
  arXiv  Detail & Related papers  (2022-01-07T11:45:22Z)
• Quantum double aspects of surface code models [77.34726150561087]
  We revisit the Kitaev model for fault tolerant quantum computing on a square lattice with underlying quantum double $D(G)$ symmetry. We show how our constructions generalise to $D(H)$ models based on a finite-dimensional Hopf algebra $H$.
  arXiv  Detail & Related papers  (2021-06-25T17:03:38Z)
• Sample-Efficient Reinforcement Learning for Linearly-Parameterized MDPs with a Generative Model [3.749193647980305]
  This paper considers a Markov decision process (MDP) that admits a set of state-action features. We show that a model-based approach (resp.$$Q-learning) provably learns an $varepsilon$-optimal policy with high probability.
  arXiv  Detail & Related papers  (2021-05-28T17:49:39Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)

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.