Related papers: Enumeration of N-rooted maps using quantum field t…
A method for successive synthesis of a Weyl matrix (or Dirichlet-to-Neumann map) of an arbitrary quantum tree is proposed. It allows one, starting from one boundary edge, to compute the Weyl matrix of a whole quantum graph by adding on new…
In this paper we consider the enumeration of orientable and non-orientable chord diagrams. We show that this enumeration is encoded in appropriate expectation values of the $\beta$-deformed Gaussian and RNA matrix models. We evaluate these…
Applications of decision diagrams in quantum circuit analysis have been an active research area. Our work introduces FeynmanDD, a new method utilizing standard and multi-terminal decision diagrams for quantum circuit simulation and…
Studying phase transitions in interacting quantum field theories generally requires the numerical study of the dynamical system on an N-dimensional lattice, which is, in most cases, computationally quite the challenging task even with…
We enumerate chord diagrams without loops and without both loops and parallel chords. We show that the former ones describe Hamiltonian paths in $n$-dimensional octahedrons. The latter ones are also known as shapes. For labelled diagrams we…
Graph theoretical ideas are highly utilized by computer science fields especially data mining. In this field, a data structure can be designed in the form of tree. Covering is a widely used form of data representation in data mining and…
Existing quantum routing implicitly mimics classical routing principles, with finding the ``best'' path (aka pathfinding), according to a selected routing metric, as a core mechanism for establishing end-to-end entanglement. However,…
The 1/N expansion in quantum field theory is formulated within an algebraic framework. For a scalar field taking values in the $N$ by $N$ hermitian matrices, we rigorously construct the gauge invariant interacting quantum field operators in…
In this paper, we explore some interesting applications of the matrix tree theorem. In particular, we present a combinatorial interpretation of a distribution of $(n-1)^{n-1}$, in the context of uprooted spanning trees of the complete graph…
We enumerate rooted 2-connected and 3-connected surface maps with respect to vertices and edges. We also derive the bivariate version of the large face-width result for random 3-connected maps. These results are then used to derive…
In this purely experimental work we try to represent the set of plane maps with 3 vertices and 3 faces as a bipartite ribbon graph. In particular, this construction allows one to estimate the genus of the initial set.
Even the uninitiated will know that Quantum Field Theory cannot be introduced systematically in just four lectures. I try to give a reasonably connected outline of part of it, from second quantization to the path-integral technique in…
Using the spectral properties of orthogonal polynomials, we introduce a finite version of quantum field theory for elementary particles. Closed-loop integrals in the Feynman diagrams for computing transition amplitudes are finite.…
We present an approach (the biroot method) for nth root approximation that yields closed-form rational functions with coefficients derived from binomial structures, Gaussian functions, or qualifying DAG structures. The method emerges from…
The predictions of the standard model of particle physics are highly successful in spite of the fact that several parts of the underlying quantum field theoretical framework are analytically problematic. Indeed, it has long been suggested,…
Recently, inspired by the Connes-Kreimer Hopf algebra of rooted trees, the second named author introduced rooted tree maps as a family of linear maps on the noncommutative polynomial algebra in two letters. These give a class of relations…
A generating function is derived that counts the number of diagrams in an arbitrary scalar field theory. The number of graphs containing any number $n_j$ of $j$-point vertices is given. The count is also used to obtain the number of…
An overview of a quantum algorithm application for the identification of causal singular configurations of multiloop Feynman diagrams is presented. The quantum algorithm is implemented in two different quantum simulators, the output…
We discuss a recursive family of iterative methods for the numerical approximation of roots of nonlinear functions in one variable. These methods are based on Newton-Cotes closed quadrature rules. We prove that when a quadrature rule with…
We give a concise and pedagogical introduction to Feynman diagrams. After discussing a toy model which requires only undergraduate mathematics, we focus on relativistic quantum field theory. We review the derivation of Feynman rules from…