Normal-ordered equivalent of the Weyl ordering of $\hat{q}^j \hat{p}^k$

This paper derives an explicit formula for the normal-ordered equivalent of the Weyl-ordered operator $\hat{q}^j \hat{p}^k$ by expressing it in terms of creation and annihilation operators.

The Gist

Imagine you are trying to translate a recipe written in a language where the order of ingredients doesn't matter (like a smoothie where you can toss everything in a blender in any order) into a strict, step-by-step instruction manual for a robot.

In the world of quantum physics, this is exactly the problem scientists face. They have classical variables (like position $q$ and momentum $p$) that commute (order doesn't matter), but when they turn them into quantum operators ($\hat{q}$ and $\hat{p}$), the order suddenly becomes critical. If you tell the robot to "add sugar then stir," it's different from "stir then add sugar."

This paper by Hendry M. Lim is essentially a translation guide that solves a specific, tricky version of this problem. Here is the breakdown in simple terms:

1. The Problem: The "Ordering Ambiguity"

In classical physics, if you have a term like $q^2 p$ (position squared times momentum), it doesn't matter if you write it as $q \cdot q \cdot p$, $q \cdot p \cdot q$, or $p \cdot q \cdot q$. They are all the same.

But in quantum mechanics, these are like distinct Lego bricks that snap together differently depending on the order.

• The Dilemma: When quantizing a system, which order do we pick?
• The Solution (Weyl Ordering): The paper focuses on a specific rule called Weyl Ordering. Think of this as the "Democratic Approach." Instead of picking one order, you take every possible order, average them out, and use that average as your quantum rule. It's the fairest way to translate the classical recipe.

2. The Tools: The "Ladder" Operators

To do the math, physicists often stop using the raw position ($\hat{q}$) and momentum ($\hat{p}$) and switch to a different set of tools called Annihilation ($\hat{a}$) and Creation ($\hat{a}^\dagger$) operators.

• The Metaphor: Imagine a ladder.
  • $\hat{a}$ is a step down (removing a unit of energy).
  • $\hat{a}^\dagger$ is a step up (adding a unit of energy).
• Most quantum calculations are much easier if you arrange your steps so that all the "Up" moves happen before all the "Down" moves. This is called Normal Ordering. It's like organizing your closet: all the hanging coats (creation) go on the left, and all the folded shirts (annihilation) go on the right.

3. The Goal: The Translation

The paper asks: "If we take the 'Democratic' (Weyl) average of a quantum expression, what does it look like when we organize it into our neat 'Coats-Left, Shirts-Right' (Normal) order?"

The author takes a complex expression involving powers of position and momentum (like $\hat{q}^j \hat{p}^k$), averages all the chaotic orders, and then mathematically shuffles them until they are perfectly organized (all creation operators on the left, all annihilation on the right).

4. The "Magic Formula"

The core of the paper is a new, explicit formula (Equation 14 in the text) that acts as a universal translator.

• Input: You give it the powers of position ($j$) and momentum ($k$).
• Process: The formula uses a clever mathematical trick involving "signs" ($+1$ and $-1$) and binomial coefficients (like those in Pascal's Triangle) to count how many ways the operators can be shuffled.
• Output: It gives you the exact coefficients needed to write the result in the neat, organized "Normal Order."

5. Why This Matters

You might ask, "Why do we need to do this?"

• Physical Reality: In quantum optics and other fields, measurements often correspond to this "Normal Ordered" state. It's the only way to get a physically measurable number from the math.
• Efficiency: Before this paper, if you wanted to convert a complex Weyl-ordered term into Normal Order, you might have to do it by hand for every single case or use very complicated, indirect methods. This paper provides a direct "lookup table" (a formula) to do it instantly for any power of $q$ and $p$.

Summary Analogy

Imagine you have a messy pile of socks (the Weyl-ordered quantum operators) where left and right socks are mixed up in every possible permutation.

1. Weyl Ordering is the act of gathering all those permutations and finding the "average" pile.
2. Normal Ordering is the act of folding them perfectly: all left socks on the left, all right socks on the right.
3. This Paper provides the exact instruction manual (the formula) to take that messy "average pile" and instantly tell you exactly how many left and right socks you need in the final, perfectly folded stack, without having to try folding them one by one.

The author also checks their work against other known methods (like those by Cahill, Glauber, and Blasiak) and shows that their "brute force" counting method matches the results of these other sophisticated techniques, proving the formula is correct.

Technical Summary

1. Problem Statement

The quantization of classical bivariate dynamical systems (described by position $q$ and momentum $p$) faces the fundamental issue of operator ordering ambiguity. In classical mechanics, variables commute ($qp = pq$), but in quantum mechanics, the corresponding operators $\hat{q}$ and $\hat{p}$ do not ($[\hat{q}, \hat{p}] = i\hbar$). Consequently, a classical term like $q^j p^k$ does not have a unique quantum counterpart; it could be $\hat{q}^j \hat{p}^k$, $\hat{p}^k \hat{q}^j$, or any symmetrized combination.

While the Weyl ordering (symmetric ordering) is the standard choice for establishing the Wigner-Weyl correspondence and preserving phase-space structures, it is often inconvenient for practical calculations. Many quantum mechanical models, particularly those involving the harmonic oscillator, are more naturally expressed using annihilation ($\hat{a}$) and creation ($\hat{a}^\dagger$) operators. Furthermore, normal ordering (where all $\hat{a}^\dagger$ precede all $\hat{a}$) is physically significant as it corresponds to measurable quantities in quantum optics.

The Core Problem: Derive an explicit, closed-form formula that converts the Weyl-ordered operator $\hat{q}^j \hat{p}^k$ directly into its normal-ordered equivalent expressed in terms of $\hat{a}$ and $\hat{a}^\dagger$.

2. Methodology

The author employs a combinatorial approach involving "forced orderings" and mathematical induction to solve the problem.

• Operator Transformation: The position and momentum operators are expressed in terms of ladder operators:
  $$\hat{a} = \frac{\hat{q} + i\hat{p}}{\sqrt{2\hbar}}, \quad \hat{a}^\dagger = \frac{\hat{q} - i\hat{p}}{\sqrt{2\hbar}}$$
  This allows $\hat{q}$ and $\hat{p}$ to be written as linear combinations of $\hat{a}$ and $\hat{a}^\dagger$.

• Forced Ordering Strategy: Instead of summing over distinct permutations of operators (which depends on the specific values of $j$ and $k$), the author introduces "forced orderings." This treats identical operators as distinct entities during the permutation process. For $\hat{q}^j \hat{p}^k$, there are $(j+k)!$ forced orderings. The Weyl ordering is defined as the average over these permutations.

• Expansion and Grouping: The product of $(j+k)$ terms (each being a linear combination of $\hat{a}^\dagger$ and $\hat{a}$) is expanded. The resulting terms are grouped by the number of creation operators ($\hat{a}^\dagger$) and annihilation operators ($\hat{a}$). The expansion takes the form:
  $$\hat{S}_{jk} \propto \sum_{u, v} \eta_{jkuv\sigma} (\hat{a}^\dagger)^{j+k-2u-v} (\hat{a})^v$$
  where $\eta$ represents polynomials of the signs ($s = \pm 1$) associated with the $\hat{q}$ and $\hat{p}$ components.

• Combinatorial Summation: The author decomposes the sum over all permutations $\sigma$ into three distinct factors:

  1. $\lambda_{jkuv}$: A factorial term representing the multiplicity of terms.
  2. $\xi_{jkuv}$: A coefficient derived from "concatenated Bessel-scaled Pascal triangles."
  3. $\zeta_{jkuv}$: A sum over products of signs, which is identified as an alternating-sign Vandermonde convolution. This sum is shown to be equivalent to the coefficient of $x^{u+v}$ in the polynomial expansion of $(1+x)^j(1-x)^k$.

• Induction: Mathematical induction is used to prove the general form of these coefficients and to establish the final closed-form expression.

3. Key Contributions

• Explicit Formula: The paper provides a rigorous, closed-form expression for the normal-ordered equivalent of the Weyl-ordered operator $\hat{q}^j \hat{p}^k$. The result is given by:
  $$\hat{S}_{jk} = \sum_{u=0}^{(j+k)/2} \sum_{v=0}^{j+k-2u} h_{jkuv} (\hat{a}^\dagger)^{j+k-2u-v} (\hat{a})^v$$
  where the coefficient $h_{jkuv}$ is explicitly defined using binomial coefficients and the polynomial coefficient extraction operator:
  $$h_{jkuv} = \frac{i^k}{2^{(j+k)/2}} \frac{u!}{2^u} \binom{j+k-u-v}{u} \binom{u+v}{u} \left[ x^{u+v} \right] (1+x)^j (1-x)^k$$
• Symmetry Analysis: The author derives and proves symmetry properties of the coefficients $h_{jkuv}$, showing how they relate to the conjugate transpose of the operators and the reality of the original classical expression.
• Alternative Methods: The paper contextualizes the result by comparing it to existing methods, specifically the Cahill-Glauber formalism (for $\hat{a}^m \hat{a}^{\dagger n}$) and Blasiak's combinatorial approach for "boson strings," demonstrating that the derived formula is consistent with these established frameworks.

4. Results

• General Solution: The derived formula (Eq. 14a and 14b) successfully converts any Weyl-ordered monomial $\hat{q}^j \hat{p}^k$ into a sum of normal-ordered terms $(\hat{a}^\dagger)^m \hat{a}^n$.
• Coefficient Structure: The coefficients are shown to be products of factorials, powers of 2, and specific combinatorial sums (Vandermonde convolution).
• Verification: The supplementary materials provide a step-by-step derivation for small cases (e.g., $j+k=3$) to verify the pattern of coefficients and the validity of the "forced ordering" summation technique.
• Symmetry Properties: It is confirmed that if $j$ and $k$ are both odd, specific middle terms vanish, and the coefficients satisfy a conjugate symmetry relation involving $(-1)^k$.

5. Significance

• Bridging Formalisms: This work provides a direct computational bridge between the Wigner-Weyl phase-space formalism (crucial for quantum chaos and semiclassical analysis) and the Fock space formalism (crucial for quantum optics and harmonic oscillator models).
• Computational Efficiency: By providing an explicit formula, the paper eliminates the need for brute-force symmetrization or recursive commutation relations when converting classical Hamiltonians into quantum operators for specific dynamical systems.
• Theoretical Utility: The result is particularly useful for studying quantum limit cycles, relaxation oscillations, and transient dynamics in systems like the Stuart-Landau oscillator, where the Hamiltonian involves high-order polynomials of $q$ and $p$.
• Mathematical Insight: The identification of the coefficients with Bessel-scaled Pascal triangles and Vandermonde convolutions enriches the mathematical understanding of operator ordering combinatorics.

In summary, Hendry M. Lim presents a definitive combinatorial solution to a long-standing technical hurdle in quantum mechanics: the systematic conversion of Weyl-ordered position-momentum products into normal-ordered ladder operator forms, facilitating easier analysis of complex quantum dynamical systems.