Boson Normal Ordering via Substitutions and Sheffer-type Polynomials
P Blasiak, A Horzela, K A Penson, G H E Duchamp, A I Solomon
Abstract
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 illustrated by a few examples.
Create a lesson
Related papers
Approximate Synthetic Spectra of Quantum Systems Associated with Compact Lie Groups
Junyang Liu, Hang Wang, Houjin Wang et al.
An example of universal braiding in Links--Gould topological quantum computation
Matthew Harper, Ben-Michael Kohli
Reasoning about Shared-Qubit Concurrency in Quantum Computing
Mingsheng Ying
Information-Geometric Representation of Upper Bounds on Fluctuation Growth in Open Quantum Systems
Newshaw Bahreyni, Paul M. Alsing
Initialization-controlled fault sensitivity and force-balance plateaus in noisy variational quantum optimization
Longhui Shen, Fangzhou Jin, Bin Guo
Quantum identity authentication protocol via perturbed probability amplitudes
Xiangqun Fu, Zheng Han, Hongwei Li et al.