General Wick's Theorem for bosonic and fermionic operators

• URL: http://arxiv.org/abs/2110.02920v2
• Date: Mon, 15 Nov 2021 17:40:51 GMT
• Title: General Wick's Theorem for bosonic and fermionic operators
• Authors: L. Ferialdi, L. Di\'osi
• Abstract summary: We name this the General Wick's Theorem (GWT) because it carries Wick's theorem as special instance. We show how the GWT helps treating demanding problems by reducing the amount of calculations required.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Wick's theorem provides a connection between time ordered products of bosonic or fermionic fields, and their normal ordered counterparts. We consider a generic pair of operator orderings and we prove, by induction, the theorem that relates them. We name this the General Wick's Theorem (GWT) because it carries Wick's theorem as special instance, when one applies the GWT to time and normal orderings. We establish the GWT both for bosonic and fermionic operators, i.e. operators that satisfy c-number commutation and anticommutation relations respectively. We remarkably show that the GWT is the same, independently from the type of operator involved. By means of a few examples, we show how the GWT helps treating demanding problems by reducing the amount of calculations required.

Related papers

• Generalized boson and fermion operators with a maximal total occupation property [0.0]
  We propose a new generalization of the standard (anti-)commutation relations for creation and operators of bosons and fermions. Only the standard (anti-)commutator relation involving one creation and one operator is deformed by introducing fractional coefficients. From the actions of creation and annihilation operators in the Fock space, a group theoretical framework is determined.
  arXiv  Detail & Related papers  (2024-09-23T08:05:34Z)
• Nonparametric Partial Disentanglement via Mechanism Sparsity: Sparse Actions, Interventions and Sparse Temporal Dependencies [58.179981892921056]
  This work introduces a novel principle for disentanglement we call mechanism sparsity regularization. We propose a representation learning method that induces disentanglement by simultaneously learning the latent factors. We show that the latent factors can be recovered by regularizing the learned causal graph to be sparse.
  arXiv  Detail & Related papers  (2024-01-10T02:38:21Z)
• Generalizable Chain-of-Thought Prompting in Mixed-task Scenarios with Large Language Models [68.05046964022844]
  Large language models (LLMs) have unveiled remarkable reasoning capabilities by exploiting chain-of-thought (CoT) prompting. We propose GeM-CoT, a Generalizable CoT prompting mechanism in Mixed-task scenarios where the type of input questions is unknown. With this technical design, GeM-CoT simultaneously enjoys superior generalization capabilities and remarkable performances on 10 public reasoning tasks and 23 BBH tasks.
  arXiv  Detail & Related papers  (2023-10-10T15:10:03Z)
• Generalized Schrödinger Bridge Matching [54.171931505066]
  Generalized Schr"odinger Bridge (GSB) problem setup is prevalent in many scientific areas both within and without machine learning. We propose Generalized Schr"odinger Bridge Matching (GSBM), a new matching algorithm inspired by recent advances. We show that such a generalization can be cast as solving conditional optimal control, for which variational approximations can be used.
  arXiv  Detail & Related papers  (2023-10-03T17:42:11Z)
• General ordering theorem [0.0]
  We prove the General Ordering Theorem (GOT), which establishes a relation among any pair of orderings. We show that it acts on operators satisfying generic (i.e. operatorial) commutation relations. Remarkably, it establishes a formal relation between these two theorems, and it provides compact expressions for them, unlike the notoriously complicated ones currently known.
  arXiv  Detail & Related papers  (2023-02-02T17:49:35Z)
• Instance-Dependent Generalization Bounds via Optimal Transport [51.71650746285469]
  Existing generalization bounds fail to explain crucial factors that drive the generalization of modern neural networks. We derive instance-dependent generalization bounds that depend on the local Lipschitz regularity of the learned prediction function in the data space. We empirically analyze our generalization bounds for neural networks, showing that the bound values are meaningful and capture the effect of popular regularization methods during training.
  arXiv  Detail & Related papers  (2022-11-02T16:39:42Z)
• String-net construction of RCFT correlators [3.803664831016232]
  We use string-net models to accomplish a direct, purely two-dimensional, approach to correlators of rational conformal field theories. We derive idempotents for objects describing bulk and boundary fields in terms of idempotents in the cylinder category of the underlying modular fusion category. We also derive an Eckmann-Hilton relation internal to a braided category, thereby demonstrating the utility of string nets for understanding algebra in braided tensor categories.
  arXiv  Detail & Related papers  (2021-12-23T16:57:26Z)
• Conformal field theory from lattice fermions [77.34726150561087]
  We provide a rigorous lattice approximation of conformal field theories given in terms of lattice fermions in 1+1-dimensions. We show how these results lead to explicit error estimates pertaining to the quantum simulation of conformal field theories.
  arXiv  Detail & Related papers  (2021-07-29T08:54:07Z)
• GroupifyVAE: from Group-based Definition to VAE-based Unsupervised Representation Disentanglement [91.9003001845855]
  VAE-based unsupervised disentanglement can not be achieved without introducing other inductive bias. We address VAE-based unsupervised disentanglement by leveraging the constraints derived from the Group Theory based definition as the non-probabilistic inductive bias. We train 1800 models covering the most prominent VAE-based models on five datasets to verify the effectiveness of our method.
  arXiv  Detail & Related papers  (2021-02-20T09:49:51Z)
• A Wigner-Eckart Theorem for Group Equivariant Convolution Kernels [16.143012623830792]
  Group equivariant convolutional networks (GCNNs) endow classical convolutional networks with additional symmetry priors. Recent advances in the theoretical description of GCNNs revealed that such models can generally be understood as performing convolutions with G-steerable kernels.
  arXiv  Detail & Related papers  (2020-10-21T12:42:23Z)
• 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.