Finding the Result of (a+a#)^n

  • Context: Graduate 
  • Thread starter Thread starter mkbh_10
  • Start date Start date
  • Tags Tags
    Creation Operator
Click For Summary
SUMMARY

The discussion focuses on calculating the expression \((a + a^\dagger)^n\), where \(a\) is the annihilation operator and \(a^\dagger\) is the creation operator. The user seeks a more efficient method than direct multiplication, especially for large \(n\), and suggests using Pascal's triangle. However, they acknowledge that the non-commuting nature of the operators complicates this approach, indicating that a general form for the result is not straightforward.

PREREQUISITES
  • Understanding of quantum mechanics and operator algebra
  • Familiarity with creation and annihilation operators
  • Knowledge of combinatorial mathematics, specifically Pascal's triangle
  • Basic grasp of non-commutative algebra
NEXT STEPS
  • Research the properties of non-commuting operators in quantum mechanics
  • Study the binomial theorem in the context of operator algebra
  • Explore the implications of operator ordering in quantum field theory
  • Learn about generating functions and their applications in quantum mechanics
USEFUL FOR

Quantum physicists, mathematicians specializing in operator theory, and students studying quantum mechanics who are interested in advanced algebraic techniques.

mkbh_10
Messages
217
Reaction score
0
Suppose a problem requires me to find the result of [(a+a#)^n ]ln> , where a is the annhilation operator , and a# is the creation operator , now n can be any number , suppose if it is 10 then will i write (a+a#) 10 times and then multiply each of these terms to see which are non zero , isn't there some general form of getting result of (a+a#)^n ?

The normal method of multiplying will become too cumbersome if n is a large number .
 
Physics news on Phys.org
Why not simply use Pascal's triangle?

edit: just realized that this might not actually works since the operators do not commute...
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 10 ·
Replies
10
Views
2K
Replies
5
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 8 ·
Replies
8
Views
3K