We construct and analyze a family of coherent states built on sequences of integers originating from the solution of the boson normal ordering problem. These sequences generalize the conventional combinatorial Bell numbers and are shown to be moments of positive functions. Consequently, the resulting coherent states automatically satisfy the resolution of unity condition. In addition they display such non-classical fluctuation properties as super-Poissonian statistics and squeezing.
We consider the numbers arising in the problem of normal ordering of expressions in canonical boson creation and annihilation operators. We treat a general form of a boson string which is shown to be associated with generalizations of Stirling and Bell numbers. The recurrence relations and closed-form expressions (Dobiski-type formulas) are obtained for these quantities by both algebraic and combinatorial methods. By extensive use of methods of combinatorial analysis we prove the equivalence of the aforementioned problem to the enumeration of special families of graphs. This link provides a co…
We present a combinatorial method of constructing solutions to the normal ordering of boson operators. Generalizations of standard combinatorial notions - the Stirling and Bell numbers, Bell polynomials and Dobinski relations - lead to calculational tools which allow to find explicitly normally ordered forms for a large class of operator functions.
We solve the boson normal ordering problem for (q(a*)a + v(a*))^n with arbitrary functions q and v and integer n, where a and a* are boson annihilation and creation operators, satisfying [a,a*]=1. This leads to exponential operators generalizing the shift operator and we show that their action can be expressed in terms of substitutions. Our solution is naturally related through the coherent state representation to the exponential generating functions of Sheffer-type polynomials. This in turn opens a vast arena of combinatorial methodology which is applied to boson normal ordering and illustrat…
We solve the normal ordering problem for (A* A)^n where A* (resp. A) are one mode deformed bosonic creation (resp. annihilation) operators satisfying [A,A*]=[N+1]-[N]. The solution generalizes results known for canonical and q-bosons. It involves combinatorial polynomials in the number operator N for which the generating functions and explicit expressions are found. Simple deformations provide examples of the method.
We solve the boson normal ordering problem for F[(a*)^r a^s], with r,s positive integers, where a* and a are boson creation and annihilation operators satisfying [a,a*]=1. That is, we provide exact and explicit expressions for the normal form wherein all a's are to the right. The solution involves integer sequences of numbers which are generalizations of the conventional Bell and Stirling numbers whose values they assume for r=s=1. A comprehensive theory of such generalized combinatorial numbers is given including closed-form expressions (extended Dobinski-type formulas)and generating function…
We derive explicit formulas for the normal ordering of powers of arbitrary monomials of boson operators. These formulas lead to generalisations of conventional Bell and Stirling numbers and to appropriate generalisations of the Dobinski relations. These new combinatorial numbers are shown to be coherent state matrix elements of powers of the monomials in question. It is further demonstrated that such Bell-type numbers, when considered as power moments, give rise to positive measures on the positive half-axis, which in many cases can be written in terms of known functions.
For any function F(x) having a Taylor expansion we solve the boson normal ordering problem for F[(a*)^r a^s], with r,s positive integers,[a,a*]=1, i.e. we provide exact and explicit expressions for its normal form which has all a's to the right. The solution involves integer sequences of numbers which, for r,s >=1, are generalizations of the conventional Bell and Stirling numbers whose values they assume for r=s=1. A complete theory of such generalized combinatorial numbers is given including closed-form expressions (extended Dobinski - type formulas), recursion relations and generating functi…
In this paper we define generalizations of boson normal ordering. These are based on the number of contractions whose vertices are next to each other in the linear representation of the boson operator function. Our main motivation is to shed further light onto the combinatorics arising from algebraic and Fock space properties of boson operators.
A conventional context for supersymmetric problems arises when we consider systems containing both boson and fermion operators. In this note we consider the normal ordering problem for a string of such operators. In the general case, upon which we touch briefly, this problem leads to combinatorial numbers, the so-called Rook numbers. Since we assume that the two species, bosons and fermions, commute, we subsequently restrict ourselves to consideration of a single species, single-mode boson monomials. This problem leads to elegant generalisations of well-known combinatorial numbers, specificall…
We discuss a general combinatorial framework for operator ordering problems by applying it to the normal ordering of the powers and exponential of the boson number operator. The solution of the problem is given in terms of Bell and Stirling numbers enumerating partitions of a set. This framework reveals several inherent relations between ordering problems and combinatorial objects, and displays the analytical background to Wick's theorem. The methodology can be straightforwardly generalized from the simple example given herein to a wide class of operators.
In this article combinatorial aspects of normal ordering annihilation and creation operators of a multi-mode boson system are discussed. The modes are assumed to be coupled since otherwise the problem of normal ordering is reduced to the corresponding problem of the single-mode case. To describe the normal ordering in the multi-mode case for each mode a colour is introduced and coloured contractions are considered. A depiction for coloured contractions via coloured linear representations is given. In analogy to the single-mode case associated coloured Stirling numbers are defined as coefficien…
The general normal ordering problem for boson strings is a combinatorial problem. In this note we restrict ourselves to single-mode boson monomials. This problem leads to elegant generalisations of well-known combinatorial numbers, such as Bell and Stirling numbers. We explicitly give the generating functions for some classes of these numbers. Finally we show that a graphical representation of these combinatorial numbers leads to sets of model field theories, for which the graphs may be interpreted as Feynman diagrams corresponding to the bosons of the theory. The generating functions are the …
We construct explicit representations of the Heisenberg-Weyl algebra [P,M]=1 in terms of ladder operators acting in the space of Sheffer-type polynomials. Thus we establish a link between the monomiality principle and the umbral calculus. We use certain operator identities which allow one to evaluate explicitly special boson matrix elements between the coherent states. This yields a general demonstration of boson normal ordering of operator functions linear in either creation or annihilation operators. We indicate possible applications of these methods in other fields.
We provide the solution to the normal ordering problem for powers and exponentials of two classes of operators. The first one consists of boson strings and more generally homogeneous polynomials, while the second one treats operators linear in one of the creation or annihilation operators. Both solutions generalize Bell and Stirling numbers arising in the number operator case. We use the advanced combinatorial analysis to provide closed form expressions, generating functions, recurrences, etc. The analysis is based on the Dobiński-type relations and the umbral calculus methods. As an illustrat…
Although symmetry methods and analysis are a necessary ingredient in every physicist's toolkit, rather less use has been made of combinatorial methods. One exception is in the realm of Statistical Physics, where the calculation of the partition function, for example, is essentially a combinatorial problem. In this talk we shall show that one approach is via the normal ordering of the second quantized operators appearing in the partition function. This in turn leads to a combinatorial graphical description, giving essentially Feynman-type graphs associated with the theory. We illustrate this me…
In this communication, we consider the normal ordering of sums of elements of the form (a*^r a a*^s), where a* and a are boson creation and annihilation operators. We discuss the integration of the associated one-parameter groups and their combinatorial by-products. In particular, we show how these groups can be realized as groups of substitutions with prefunctions.
Normally ordered forms of functions of boson operators are important in many contexts in particular concerning Quantum Field Theory and Quantum Optics. Beginning with the seminal work of Katriel [Lett. Nuovo Cimento, 10(13):565--567, 1974], in the last few years, normally ordered forms have been shown to have a rich combinatorial structure, mainly in virtue of a link with the theory of partitions. In this paper, we attempt to enrich this link. By considering linear representations of noncrossing partitions, we define the notion of noncrossing normal ordering. Given the growing interest in nonc…
The normal ordering formulae for powers of the boson number operator $\hat{n}$ are extended to deformed bosons. It is found that for the `M-type' deformed bosons, which satisfy $a a^{\dagger} - q a^{\dagger} a = 1$, the extension involves a set of deformed Stirling numbers which replace the Stirling numbers occurring in the conventional case. On the other hand, the deformed Stirling numbers which have to be introduced in the case of the `P-type' deformed bosons, which satisfy $a a^{\dagger} - q a^{\dagger} a = q^{-\hat{n}}$, are found to depend on the operator $\hat{n}$. This distinction betwe…
We treat the problem of normally ordering expressions involving the standard boson operators a, a* where [a,a*]=1. We show that a simple product formula for formal power series - essentially an extension of the Taylor expansion - leads to a double exponential formula which enables a powerful graphical description of the generating functions of the combinatorial sequences associated with such functions - in essence, a combinatorial field theory. We apply these techniques to some examples related to specific physical Hamiltonians.
In this paper, we show that the infinite generalised Stirling matrices associated with boson strings with one annihilation operator are projective limits of approximate substitutions, the latter being characterised by a finite set of algebraic equations.
We suggest and analyze a new scheme to adiabatically cool bosonic atoms to picokelvin temperatures which should allow the observation of magnetic ordering via superexchange in optical lattices. The starting point is a gapped phase called the spin Mott phase where each site is occupied by one spin-up and one spin-down atom. An adiabatic ramp leads to an xy-ferromagnetic phase. We show that the combination of time-dependent density matrix renormalization group methods with quantum trajectories can be used to fully address possible experimental limitations due to decoherence, and demonstrate that…
We solve the boson normal ordering problem for $(q(a^†)a+v(a^†))^n$ with arbitrary functions $q(x)$ and $v(x)$ and integer $n$, where $a$ and $a^†$ are boson annihilation and creation operators, satisfying $[a,a^†]=1$. This consequently provides the solution for the exponential $e^{λ(q(a^†)a+v(a^†))}$ generalizing the shift operator. In the course of these considerations we define and explore the monomiality principle and find its representations. We exploit the properties of Sheffer-type polynomials which constitute the inherent structure of this problem. In the end we give some examples illu…
Quantum Circuit Representation of Combinatorial Matrix Functions
SKKU Advanced Institute of Nanotechnology (SAINT), Sungkyunkwan University（成均馆大学纳米技术高级研究所）；IBM Quantum（IBM量子）；Department of Physics, Chungbuk National University（忠北国立大学物理系）；Yonsei University（延世大学）
In this paper combinatorial aspects of normal ordering arbitrary words in the creation and annihilation operators of the q-deformed boson are discussed. In particular, it is shown how by introducing appropriate q-weights for the associated ``Feynman diagrams'' the normally ordered form of a general expression in the creation and annihilation operators can be written as a sum over all q-weighted Feynman diagrams, representing Wick's theorem in the present context.
We discuss how one calculates the coherent path integrals for locally interacting systems, where some inconsistencies with exact results have been reported previously. It is shown that the operator ordering subtlety that is hidden in the local interaction term modifies the Hubbard-Stratonovich transformation in the continuous time formulation, and it helps reproduce known results by the operator method. We also demonstrate that many-body effects in the strong interaction limit can be well characterized by the free-particle theory that is subject to annealed random potentials and dynamical gaug…
We describe a family of lattice models that support a new class of quantum magnetism characterized by correlated spin and bosonic ordering [Phys. Rev. Lett. 112, 180405 (2014)]. We explore the full phase diagram of the model using Matrix-Product-State methods. Guided by these numerical results, we describe a modified variational ansatz to improve our analytic description of the groundstate at low boson frequencies. Additionally, we introduce an experimental protocol capable of inferring the low-energy excitations of the system by means of Fano scattering spectroscopy. Finally, we discuss the i…
