Physics for Maple 2019

All Products Maple MapleSim

Home : Support : Online Help : Physics : Updates : Physics for Maple 2019

Physics

Maple provides a state-of-the-art environment for algebraic computations in Physics, with emphasis on ensuring that the computational experience is as natural as possible. The theme of the Physics project for Maple 2019 has been the consolidation of the functionality introduced in previous releases, together with significant enhancements to further strengthen the functionality mainly in three areas:

1.	Quantum Mechanics: coherent states, tensor products of states, taylor series of expressions involving anticommutative variables and functions, and several improvements in the normalization and simplification of Commutator and AntiCommutator algebra rules.

Tensor computations in general, making Maple 2019 unmatched in the field, covering classical and quantum mechanics, and special and general relativity, using natural tensor input notation and textbook-like display of results. The functionality for tensors is tightly integrated with the full Maple computation system and extensively documented in "A Complete Guide for performing tensor computations using Physics".

3.	Documentation: besides the new guide for tensor computations, two other new pages, linked in all the help pages of Physics commands, are

a.	Physics Updates organizes and presents in one place all formerly scattered links to updates and presentations with examples on the use of Physics.

b.	Mini-Course: Computer Algebra for Physicists, is a course that can be used as a tutorial, with 10 sections to be covered in 5 hands-on guided experiences of 2 hours each. The first part, 5 sections, is about Maple 101, while the remaining 5 sections is all about using the Physics package.

Overall, the enhancements throughout the entire package increase robustness, versatility and functionality, extending furthermore the range of Physics-related algebraic computations that can be done naturally in a worksheet. The presentation below illustrates both the novelties and the kind of mathematical formulations that can now be performed.

As part of its commitment to providing the best possible environment for algebraic computations in Physics, Maplesoft launched a Maple Physics: Research and Development website with Maple 18, which enabled users to download research versions, ask questions, and provide feedback. The results from this accelerated exchange with people around the world have been incorporated into the Physics package in Maple 2019.

Tensor product of Quantum States using Dirac's Bra-Ket Notation

Coherent States in Quantum Mechanics

The Zassenhaus formula and the algebra of the Pauli matrices

Multivariable Taylor series of expressions involving anticommutative (Grassmannian) variables

New SortProducts command

Documentation: "Physics updates", "A complete guide for performing tensor computations" and the "Mini-Course: Computer Algebra for Physicists"

Simplification of tensors, Pauli and Dirac matrices and KroneckerDelta

See Also

Tensor product of Quantum States using Dirac's Bra-Ket Notation

Tensor products of Hilbert spaces and related quantum states are relevant in a myriad of situations in quantum mechanics, and in particular regarding quantum information. Tensor products are key in the mathematical formulation of entanglement. Below is a presentation of the design and implementation introduced in Maple 2019, with input/output and examples, organized in four sections:

1.	The basic ideas and design

2.	Tensor product notation and the hideketlabel option

3.	Entangled States and the Bell basis

4.	Entangled States, Operators and Projectors

	References
	[1] Cohen-Tannoudji, C.; Diu, B.; and Laloe,F. Quantum Mechanics, Chapter 2, section F. [2] Griffiths, Robert B. Hilbert Space Quantum Mechanics. Quantum Computation and Quantum Information Theory Course, Physics Department, Carnegie Mellon University, 2014.

The basic ideas and design implemented in Maple 2019

Suppose $A$ and $B$ are quantum operators and $|A_{α}⟩, |B_{β}⟩$ are, respectively, their eigenkets. The following works since the introduction of the Physics package in Maple

>	$with (Physics) &colon;$

>	$Setup (op = \{A, B\})$

$* Partial match of ' op' against keyword ' quantumoperators'$

$_______________________________________________________$

$[quantumoperators = \{A, B\}]$

(1)

>	$A \cdot Ket (A, alpha) = A &period; Ket (A, alpha)$

$A |A_{α}⟩ = α |A_{α}⟩$

(2)

>	$B \cdot Ket (B, beta) = B &period; Ket (B, beta)$

$B |B_{β}⟩ = β |B_{β}⟩$

(3)

In previous Maple releases, all quantum operators are supposed to act on the same Hilbert space. New in Maple 2019: suppose that $A$ and $B$ act on different, disjointed, Hilbert spaces.

1) To represent that situation, a new keyword in Setup, $hilbertspaces$ , is introduced. With it you can indicate the quantum operators that act on a Hilbert space, say as in $hilbertspaces = \{\{A\}, \{B\}\}$ with the meaning that the operator $A$ acts on one Hilbert space while $B$ acts on another one.

The Hilbert space thus has no particular name (as in 1, 2, 3 ...) and is instead identified by the operators that act on it. There can be one or more, and operators acting on one space can act on other spaces too. The disjointedspaces keyword is a synonym for hilbertspaces and hereafter all Hilbert spaces are assumed to be disjointed.

NOTE: noncommutative quantum operators acting on disjointed spaces commute between themselves, so after setting - for instance - $hilbertspaces = \{\{A\}, \{B\}\}$ , automatically, $A, B$ become quantum operators satisfying (see comment (ii) on page 156 of ref.[1])

${[A, B]}_{-} = 0$

2) Product of Kets and Bras that belong to different Hilbert spaces are understood as tensor products satisfying (see footnote on page 154 of ref.[1]):

$|A_{α}⟩ \otimes |B_{β}⟩ = |B_{β}⟩ \otimes |A_{α}⟩$

$⟨A_{α}| \otimes |B_{β}⟩ = |B_{β}⟩ \otimes ⟨A_{α}|$

while

$⟨A_{α}| |A_{β}⟩ \neq |A_{β}⟩ ⟨A_{α}|$

3) All the operators of one Hilbert space act transparently over operators, Bras, and Kets of other Hilbert spaces. For example

$A |B_{n}⟩ = |B_{n}⟩ A$

and the same for the Dagger of this equation, that is

$⟨B_{n}| A^{†} = A^{†} ⟨B_{n}|$

Hence, when we write the left-hand sides of the two equations above and press enter, they are automatically rewritten (returned) as the right-hand sides.

4) Every other quantum operator, set as such using Setup, and not indicated as acting on any particular Hilbert space, is assumed to act on all spaces.

5) Notation:

•

Tensor products formed with operators, or Bras and Kets belonging to different Hilbert spaces (set as such using Setup and the keyword hilbertspaces), are now displayed with the symbol ⊗ in between, as in $|A_{n}⟩ \otimes |B_{n}⟩$ instead of $|A_{n}⟩ |B_{n}⟩$ , and $A \otimes B$ instead of $A B$ . The product of an operator $A$ of one space and a Ket of another space $|B_{n}⟩$ however, is displayed $|B_{n}⟩$ $A$ , without ⊗.

•	A new Setup option hideketlabel , makes all the labels in Kets and Bras to be hidden when displaying Kets, Bras, and Bracket, so when you set it entering $Setup (hideketlabel = true)$ ,

$|A_{m, n, l}⟩$

is displayed as

$|_{} m, n, l⟩$

This is the notation frequently used when working with angular momentum or in quantum information, where tensor products of Hilbert spaces are used.

Design details

The commutativity of the eigenkets of $A$ and $B$ is consistent with ${[A, B]}_{-} = 0$ , see footnote on page 154 of ref. [1].

Taking advantage of this commutativity of Bras and Kets belonging to disjointed spaces, during the computer algebra session (on the worksheet) the ordering of their products in the output happens automatically and systematically, it is always the same, and according to the following rules: suppose there are two Hilbert subspaces, then:

1.	Within a product, contiguous Kets are grouped per Hilbert subspace

2.	The Hilbert subspaces are ordered by sorting, alphabetically, the operators that act on that subspace.

Example: if one Hilbert subspace has operators $\{A, E\}$ acting on it and the other has operators $\{B, C\}$ then a product of contiguous eigenkets of these operators is sorted as

$|A⟩ \otimes |E⟩ \otimes |B⟩ \otimes |C⟩$

Where the first pair of Kets belong to the first Hilbert subspace and the other pair to the second subspace, and where the first subspace is the one whose operands are alphabetically sorted first than the operands of the second subspace (in this example $A$ is sorted before $B$ ) and within a subspace, the Kets are also sorted alphabetically (so $A$ before $E$ , then in the second subspace $B$ before $C$ ).

Regarding the notation for the Dagger of a tensor product of states, say ${(|A_{α}⟩ \otimes |B_{β}⟩)}^{†}$ the standard convention for tensor products is to preserve the order, as in ${(|A_{α}⟩ \otimes |B_{β}⟩)}^{†} = ⟨A_{α}| \otimes ⟨B_{β}|$ representing an exception to the “reverse the order” rule of the Dagger operation. This is conventional, in that Kets and Bras belonging to disjointed spaces actually commute. This convention, however is notationally important for two reasons

1. Frequently, tensor product of states are written not as a product of Kets but as a single ket with many quantum numbers (multidimensional Hilbert space), for example as $|C_{α, β}⟩$ , and ${|C_{α, β}⟩}^{†}$ as $⟨C_{α, β}|$ , that is, preserving the order of the quantum numbers, the first index refers to the first Hilbert subspace and the second index to the other one, in both the Ket and the Bra (its Dagger). So, when these multi-index Kets can be expressed as tensor products, the ordering of the Hilbert subspaces is preserved.

2. This preservation of the ordering of the Hilbert subspaces in a tensor product of Kets is also relevant in connection with the new Setup keyword hideketlabel, which requires the ordering of subspaces to be preserved in order to have non-ambiguous notation when the quantum numbers of Kets belonging to identical subspaces (e.g. qubits) are the same.

Example: we know that

$|A_{0}⟩ \otimes |B_{1}⟩ \neq |B_{0}⟩ \otimes |A_{1}⟩$

In the left-hand and right-hand sides of the expression above, the ordering of the Hilbert subspaces is not the same. If we now omit the labels $A$ and $B$ , we would have

$|0⟩ \otimes |1⟩ \neq |0⟩ \otimes |1⟩$

which would be misleading. Likewise,

$|A_{0}⟩ \otimes |B_{1}⟩ = |B_{1}⟩ \otimes |A_{0}⟩$

and removing the labels we would get the misleading

$|0⟩ \otimes |1⟩ = |1⟩ \otimes |0⟩$

From all this we see that, in order to make sense of the notation without labels, it is necessary to preserve the ordering of the Hilbert subspaces present in a tensor product, and also when taking the Dagger of a Ket. Accordingly, within tensor products, for instance in these examples, the system will always write Kets of the subspace A before Kets of the subspace B.

Tensor product notation and the hideketlabel option

According to the design section, set now two disjointed Hilbert spaces with operators $A, C$ acting on one of them and $B, C$ on the other one (you can think of $C = A \otimes B$ )

>	$Setup (hilbertspaces = \{\{A, C\}, \{B, C\}\})$

$[disjointedspaces = \{\{A, C\}, \{B, C\}\}]$

(4)

Consider a tensor product of Kets, each of which belongs to one of these different spaces, note the new notation using $\otimes$

>	$Ket (A, 1) Ket (B, 0)$

$|A_{1}⟩ \otimes |B_{0}⟩$

(5)

•	As explained in the Details of the design section, the ordering of the Hilbert spaces in tensor products is now preserved: Bras (Kets) of the first space always appear before Bras (Kets) of the second space. For example, construct a projector into the state (5)

>	$\cdot Dagger ()$

$|A_{1}⟩ \otimes |B_{0}⟩ \otimes ⟨A_{1}| \otimes ⟨B_{0}|$

(6)

You see that in the product of Bras, and also in the product of Kets, A comes first, then B.

Remark: some textbooks prefer a dyadic style for sorting the operands in products of Bras and Kets that belong to different spaces, for example, $(|A_{1}⟩ ⟨A_{1}|) \otimes (|B_{0}⟩ ⟨B_{0}|)$ instead of the projector sorting style of (6). Both reorderings of Kets and Bras are mathematically equal.

•	Because that ordering is preserved, one can now hide the label of Bras and Kets without ambiguity, as it is usual in textbooks (e.g. in Quantum Information). For that purpose use the new keyword option hideketlabel

>	$Setup (hide = true)$

$* Partial match of ' hide' against keyword ' hideketlabel'$

$_______________________________________________________$

$[hideketlabel = true]$

(7)

The display for (6) is now

$|1⟩ \otimes |0⟩ \otimes ⟨1| \otimes ⟨0|$

(8)

Important: this new option only hides the label while displaying the Bra or Ket. The label, however, is still there, both in the input and in the output. One can "see" what is behind this new display using show, that works the same way as it does in the context of CompactDisplay. The actual contents being displayed in (8) is thus (6)

$show$

$|A_{1}⟩ \otimes |B_{0}⟩ \otimes ⟨A_{1}| \otimes ⟨B_{0}|$

(9)

Operators of each of these spaces act on their eigenkets as usual. Here we distribute over both sides of an equation, using `*` on the left-hand side, to see the product uncomputed, and `.` on the right-hand side to see it computed:

>	$(`*` = `.`) (A, Ket (A, 1)) &semi;$

$A |1⟩ = |1⟩$

(10)

>	$(`*` = `.`) (A, Ket (A, 0)) &semi;$

$A |0⟩ = 0$

(11)

•	The tensor product of operators belonging to different Hilbert spaces is also displayed using ⊗

$A B$

$A \otimes B$

(12)

•

As mentioned in the preceding design section, using the commutativity between operators, Bras and Kets that belong to different Hilbert spaces, within a product, operators are placed contiguous to the Kets and Bras belonging to the space where the operator acts. For example, consider the delayed product represented using the start `*` operator

>	$' \cdot'$

$(A \otimes B) |1⟩ \otimes |0⟩ \otimes ⟨1| \otimes ⟨0|$

(13)

Release the product

$%$

$A |1⟩ B |0⟩ \otimes ⟨1| \otimes ⟨0|$

(14)

The same operation but now using the dot product `.` operator. Start by delaying the operation

>	$' &period;'$

$(A \otimes B) \cdot (|1⟩ \otimes |0⟩ \otimes ⟨1| \otimes ⟨0|)$

(15)

Recalling that this product is mathematically the same as (14), and that

>	$B \cdot \|B_{0}⟩$

$0$

(16)

by releasing the delayed product (15) we have

$0$

(17)

Reset hideketlabel

>	$Setup (hideketlabel = false)$

$[hideketlabel = false]$

(18)

Implementation details

•	When defining a disjointed Hilbert space that contains operators belonging to one of the previously defined disjointed spaces, if the previously defined space is a subset of the one being defined, the former definition is removed and only the latter is kept.

•	There are three new routines related to operators acting on disjointed spaces

>	$Library :- BelongToDifferentDisjointedSpaces (A, B)$

$true$

(19)

and, in connection with the possibility of indicating that two operators act on the same disjointed space, there is a new routine to tell when the operators belong to (act on) the same space

>	$Library :- BelongToTheSameDisjointedSpace (A, B)$

$false$

(20)

>	$Library :- BelongToTheSameDisjointedSpace (A, C)$

$true$

(21)

Finally, there is a routine to tell whether a sequence of objects belong (all of them) to (the same or different) disjointed spaces, i.e. were set as such using Setup and the hilbertpaces keyword

>	$Library :- BelongToDisjointedSpaces (A, B, C)$

$true$

(22)

>	$Setup (op = E)$

$* Partial match of ' op' against keyword ' quantumoperators'$

$_______________________________________________________$

$[quantumoperators = \{A, B, C, E\}]$

(23)

>	$Library :- BelongToDisjointedSpaces (E)$

$false$

(24)

>	$Library :- BelongToDisjointedSpaces (A, B, E)$

$false$

(25)

These three Physics:-Library routines, are the ones used internally by the Physics package to make decisions.

•	Coordinates of a coordinate system defined using the Coordinates, or equivalently the Setup, command, when they are also set to as quantum operators, are automatically assumed to act on disjointed spaces. For example,

>	$Setup (dimension = 3, signature = `+`, coordinates = cartesian, quantumoperators = \{X\}, quiet)$

$[coordinatesystems = \{X\}, dimension = 3, quantumoperators = \{A, B, C, E, x, y, z\}, signature = + + +]$

(26)

>	$Library :- BelongToDifferentDisjointedSpaces (x, y)$

$true$

(27)

Remove the coordinates from the quantum operators set

>	$Setup (clear, op = \{X\})$

$* Partial match of ' op' against keyword ' quantumoperators'$

$_______________________________________________________$

$[quantumoperators = \{A, B, C, E\}]$

(28)

•	The following swapped products on the left-hand and right-hand sides (with their evaluation delayed due to enclosing the equation between ' ' ) are automatically reordered in one and the same way when we remove the delay, as explained in the details of the design section.

Example

>	$Setup (hide = false)$

$* Partial match of ' hide' against keyword ' hideketlabel'$

$_______________________________________________________$

$[hideketlabel = false]$

(29)

>	$' Ket (A, n) \cdot Ket (B, m) = Ket (B, m) Ket (A, n)'$

$|A_{n}⟩ \otimes |B_{m}⟩ = |B_{m}⟩ \otimes |A_{n}⟩$

(30)

Remove now the evaluation delay and the ordering on the right-hand side is automatically rearranged as in the left-hand side.

$%$

$|A_{n}⟩ \otimes |B_{m}⟩ = |A_{n}⟩ \otimes |B_{m}⟩$

(31)

The same using the dot operator `.`

>	$' Ket (A, n) &period; Ket (B, m) = Ket (B, m) &period; Ket (A, n)'$

$|A_{n}⟩ \cdot |B_{m}⟩ = |B_{m}⟩ \cdot |A_{n}⟩$

(32)

$|A_{n}⟩ \otimes |B_{m}⟩ = |A_{n}⟩ \otimes |B_{m}⟩$

(33)

NOTE: the dot product operator, `.`, is used to perform contractions or attachments in the space of quantum states. Therefore, in the case of tensor products, it returns using the star product operator `*`, in that there is no meaning for the contraction of tensors of different (disjointed) Hilbert spaces.

Regarding the product of a Bra and a Ket belonging to disjointed spaces, we also have, automatically,

>	$' Bra (A, n) Ket (B, n) = Ket (B, n) Bra (A, n)'$

$⟨A_{n}| \otimes |B_{n}⟩ = |B_{n}⟩ \otimes ⟨A_{n}|$

(34)

$%$

$|B_{n}⟩ \otimes ⟨A_{n}| = |B_{n}⟩ \otimes ⟨A_{n}|$

(35)

So the left-hand side is rewritten as the right-hand side, and $⟨A_{n}| \otimes |B_{n}⟩$ is not a "scalar product", but an operator in the tensor product of spaces, since $A$ and $B$ belong to different disjointed spaces.

Enclose again the input with ' ' to delay its evaluation

>	$' A \cdot Ket (B, n) = Ket (B, n) \cdot A'$

$A |B_{n}⟩ = |B_{n}⟩ A$

(36)

Release the evaluation

$%$

$|B_{n}⟩ A = |B_{n}⟩ A$

(37)

In the output above we see that $A \cdot |B_{n}⟩$ is not interpreted as contraction between an operator and Ket, but as the product of $A = A {&Iopf;}_{B}$ acting on $|B_{n}⟩$ where $𝕀_{B}$ is the identity (projector) onto the $B$ space. That is, an operator of one disjointed space acts transparently over a Bra or a Ket of a different disjointed space. The same happens with $A^{†}$ just that, while $A$ moves to the right, jumping over a Bra or Ket (see (37)), $A^{†}$ moves to the left:

>	$' Dagger (A) \cdot Bra (B, n) = Bra (B, n) \cdot Dagger (A)'$

$A^{†} ⟨B_{n}| = ⟨B_{n}| A^{†}$

(38)

$%$

$A^{†} ⟨B_{n}| = A^{†} ⟨B_{n}|$

(39)

NOTE: Although determining "who is the Dagger of who" is arbitrary, this implementation follows what we do with paper and pencil: operators act to their right while those having an explicit Dagger act to their left.

Finally, the notation used for tensor products of operators is the same one used for tensor products of Bras and Kets:

>	$A \cdot B$

$A \otimes B$

(40)

As explained in the Details of the design section, the ordering of the Hilbert spaces in tensor products is now preserved, so taking the Dagger does not swap the operands in this product:

>	$Dagger ()$

$A^{†} \otimes B^{†}$

(41)

Entangled States and the Bell basis

With the introduction of disjointed Hilbert spaces in Maple 2019 it is possible to represent entangled quantum states in a simple way, basically as done with paper and pencil.

Recalling the Hilbert spaces set at this point are,

>	$Setup (hilbert)$

$* Partial match of ' hilbert' against keyword ' hilbertspaces'$

$_______________________________________________________$

$[disjointedspaces = \{\{A, C\}, \{B, C\}\}]$

(42)

where $C$ acts on the tensor product of the spaces where $A$ and $B$ act. An eigenstate of $C$ can then always be written as

>	$Ket (C, m, n) = Sum (Sum (M [j, p] Ket (A, j) Ket (B, p), j), p)$

$|C_{m, n}⟩ = \sum_{p} \sum_{j} M_{j, p} |A_{j}⟩ \otimes |B_{p}⟩$

(43)

where $M_{j, p}$ is a matrix of complex coefficients. Bra states of $C$ are formed as usual taking the Dagger

>	$Dagger ()$

$⟨C_{m, n}| = \sum_{p} \sum_{j} \overset{&conjugate0;}{M_{j, p}} ⟨A_{j}| \otimes ⟨B_{p}|$

(44)

•

By definition, all states $|C_{m, n}⟩$ that can be written exactly as $|A_{m}⟩ \otimes |B_{n}⟩$ , that is, the product of an arbitrary state of the subspace A and another of the subspace B, are product states, and all the other ones are entangled states. Entanglement is a property that is independent of the basis $|A_{j}⟩ \otimes |B_{p}⟩$ used in (43).

The physical interpretation is the standard one: when the state of a system constituted by two subsystems A and B is represented by a product state, the properties of the subsystem A are well defined and all given by $|A_{j}⟩,$ while those for the subsystem B by $|B_{p}⟩$ . When the system is in an entangled state one typically cannot assign definite properties to the individual subsystems A or B, each subsystem has no independent reality.

To determine whether a state $|C_{n, m}⟩$ is entangled it then suffices to check the rank R of the matrix $M_{j, p}$ (see LinearAlgebra:-Rank): when $R = 1$ the state is a product state, otherwise it is an entangled state. When the state being analyzed belongs to the tensor product of two subspaces, $R = 1$ is equivalent to having the determinant of $M_{j, p}$ equal to 0. The condition $R = 1$ , however, is more general, and suffices to determine whether a state is a product state also on a Hilbert space that is the tensor product of three or more subspaces: ${&HilbertSpace;}^{} = {&HilbertSpace;}^{(1)} \otimes ℋ^{(2)} \otimes ℋ^{(3)} .. &period; ℋ^{(n)}$ , in which case the matrix M will have more rows and columns and a determinant equal to 0 would only warrant the possibility of factorizing one Ket.

Example: the Bell basis for a system of two qubits

Consider a 2-dimensional space of states acted upon by the operator $A$ , and let $B$ act upon another, disjointed, Hilbert space that is a replica of the Hilbert space on which $A$ acts. Set the dimensions of $A$ , $B$ and $C$ respectively equal to 2, 2 and 2x2 (see Setup)

>	$Setup (quantumbasisdimension = \{A = 2, B = 2, C [1] = 2, C [2] = 2\})$

$[quantumbasisdimension = \{A = 2, B = 2, C_{1} = 2, C_{2} = 2\}]$

(45)

The system C with the two subsystems A and B represents a two qubits system. The standard basis for C can be constructed in a natural way from the basis of Kets of A and B, $\{|A_{0}⟩, |A_{1}⟩, |B_{0}⟩, |B_{1}⟩\}$ , by taking their tensor products:

>	$seq (seq (Ket (A, j) \cdot Ket (B, k), k = 0 .. 1), j = 0 .. 1)$

$|A_{0}⟩ \otimes |B_{0}⟩, |A_{0}⟩ \otimes |B_{1}⟩, |A_{1}⟩ \otimes |B_{0}⟩, |A_{1}⟩ \otimes |B_{1}⟩$

(46)

Set a more mathematical display for the imaginary unit

>	$interface (imaginaryunit = i) &colon;$

The four entangled Bell states also form a basis of C and are given by

>	$Setup (op = &bernou;)$

$* Partial match of ' op' against keyword ' quantumoperators'$

$_______________________________________________________$

$[quantumoperators = \{ℬ, A, B, C, E\}]$

(47)

>	$Ket (&bernou;, 0) = \frac{1}{' sqrt' (2)} (Ket (A, 0) Ket (B, 0) + Ket (A, 1) Ket (B, 1))$

$|ℬ_{0}⟩ = \frac{|A_{0}⟩ \otimes |B_{0}⟩ + |A_{1}⟩ \otimes |B_{1}⟩}{\sqrt{2}}$

(48)

>	$Ket (&bernou;, 1) = \frac{1}{' sqrt' (2)} (Ket (A, 0) Ket (B, 1) + Ket (A, 1) Ket (B, 0))$

$|ℬ_{1}⟩ = \frac{|A_{0}⟩ \otimes |B_{1}⟩ + |A_{1}⟩ \otimes |B_{0}⟩}{\sqrt{2}}$

(49)

>	$Ket (&bernou;, 2) = \frac{i}{' sqrt' (2)} (Ket (A, 0) Ket (B, 1) - Ket (A, 1) Ket (B, 0))$

$|ℬ_{2}⟩ = \frac{ⅈ (|A_{0}⟩ \otimes |B_{1}⟩ - |A_{1}⟩ \otimes |B_{0}⟩)}{\sqrt{2}}$

(50)

>	$Ket (&bernou;, 3) = \frac{1}{' sqrt' (2)} (Ket (A, 0) Ket (B, 0) - Ket (A, 1) Ket (B, 1))$

$|ℬ_{3}⟩ = \frac{|A_{0}⟩ \otimes |B_{0}⟩ - |A_{1}⟩ \otimes |B_{1}⟩}{\sqrt{2}}$

(51)

There is no standard convention for the four linear combinations of the right-hand sides above defining the Bell states. The convention used here relates to the definition of these states using the Pauli matrices as shown further below. Regardless of the convention used, the Bell basis is orthonormal. That can be verified by taking dot products, for example:

>	$Dagger () &period;$

$1 = 1$

(52)

In steps, perform the same operation but using the star (`*`) operator, so that the contraction is represented but not performed

>	$Dagger () \cdot$

$⟨ℬ_{0}| |ℬ_{0}⟩ = \frac{(⟨A_{0}| \otimes ⟨B_{0}| + ⟨A_{1}| \otimes ⟨B_{1}|) (|A_{0}⟩ \otimes |B_{0}⟩ + |A_{1}⟩ \otimes |B_{1}⟩)}{2}$

(53)

Evaluate now the result at `*` = `.`, that is transforming the star product into a dot product

>	$eval (, `*` = `.`)$

$1 = 1$

(54)

>	$Dagger () \cdot$

$⟨ℬ_{0}| |ℬ_{1}⟩ = \frac{(⟨A_{0}| \otimes ⟨B_{0}| + ⟨A_{1}| \otimes ⟨B_{1}|) (|A_{0}⟩ \otimes |B_{1}⟩ + |A_{1}⟩ \otimes |B_{0}⟩)}{2}$

(55)

>	$eval (, `*` = `.`)$

$0 = 0$

(56)

The Bell basis and its relation with the Pauli matrices

The Bell basis can be constructed departing from $|{&bernou;}_{0}⟩$ using the Pauli matrices $σ_{j}$ . For that purpose, using a Vector representation for $|B_{j}⟩$ ,

>	$Ket (B, 0) = Vector ([1, 0]), Ket (B, 1) = Vector ([0, 1])$

$|B_{0}⟩ = [\begin{array}{c} 1 \\ 0 \end{array}], |B_{1}⟩ = [\begin{array}{c} 0 \\ 1 \end{array}]$

(57)

Multiplying $|B_{0}⟩$ by each of the $σ_{j}$ Pauli matrices and performing the matrix operations we have

>	$[seq (Psigma [j] \cdot [1], j = 1 .. 3)]$

$[σ_{1} |B_{0}⟩ = σ_{1} [\begin{array}{c} 1 \\ 0 \end{array}], σ_{2} |B_{0}⟩ = σ_{2} [\begin{array}{c} 1 \\ 0 \end{array}], σ_{3} |B_{0}⟩ = σ_{3} [\begin{array}{c} 1 \\ 0 \end{array}]]$

(58)

>	$Library :- PerformMatrixOperations (, only = righthandsides)$

$[σ_{1} |B_{0}⟩ = [\begin{array}{c} 0 \\ 1 \end{array}], σ_{2} |B_{0}⟩ = [\begin{array}{c} 0 \\ ⅈ \end{array}], σ_{3} |B_{0}⟩ = [\begin{array}{c} 1 \\ 0 \end{array}]]$

(59)

In this result we see that $σ_{1}$ and $σ_{2}$ flip the state, transforming $|B_{0}⟩$ into $|B_{1}⟩$ , $σ_{2}$ also multiplies by the imaginary unit $ⅈ$ , while $σ_{3}$ leaves the state $|B_{0}⟩$ unchanged.

We can express all that by removing from (59) the Vector representations shown in (57). For that purpose, create a list of substitution equations

>	$map (rhs = lhs, [, i \cdot ~])$

$[[\begin{array}{c} 1 \\ 0 \end{array}] = |B_{0}⟩, [\begin{array}{c} 0 \\ 1 \end{array}] = |B_{1}⟩, [\begin{array}{c} ⅈ \\ 0 \end{array}] = ⅈ |B_{0}⟩, [\begin{array}{c} 0 \\ ⅈ \end{array}] = ⅈ |B_{1}⟩]$

(60)

The action of $σ_{j}$ in $|B_{0}⟩$ is then given by

>	$Library :- SubstituteMatrix (,)$

$[σ_{1} |B_{0}⟩ = |B_{1}⟩, σ_{2} |B_{0}⟩ = ⅈ |B_{1}⟩, σ_{3} |B_{0}⟩ = |B_{0}⟩]$

(61)

For $|B_{1}⟩$ , performing the same steps, the action of the Pauli matrices on it is

>	$[seq (Psigma [j] \cdot [2], j = 1 .. 3)]$

$[σ_{1} |B_{1}⟩ = σ_{1} [\begin{array}{c} 0 \\ 1 \end{array}], σ_{2} |B_{1}⟩ = σ_{2} [\begin{array}{c} 0 \\ 1 \end{array}], σ_{3} |B_{1}⟩ = σ_{3} [\begin{array}{c} 0 \\ 1 \end{array}]]$

(62)

>	$Library :- PerformMatrixOperations (, only = righthandsides)$

$[σ_{1} |B_{1}⟩ = [\begin{array}{c} 1 \\ 0 \end{array}], σ_{2} |B_{1}⟩ = [\begin{array}{c} −ⅈ \\ 0 \end{array}], σ_{3} |B_{1}⟩ = [\begin{array}{c} 0 \\ −1 \end{array}]]$

(63)

>	$Library :- SubstituteMatrix (,)$

$[σ_{1} |B_{1}⟩ = |B_{0}⟩, σ_{2} |B_{1}⟩ = −ⅈ |B_{0}⟩, σ_{3} |B_{1}⟩ = - |B_{1}⟩]$

(64)

To obtain the other three Bell states using the results (61) and (64), indicate to the system that the Pauli matrices operate in the subspace where $B$ operates

>	$Setup (hilbert = \{\{B, C, Psigma\}\})$

$* Partial match of ' hilbert' against keyword ' hilbertspaces'$

$_______________________________________________________$

$[disjointedspaces = \{\{A, C\}, \{B, C, σ\}\}]$

(65)

Multiplying $|{&bernou;}_{0}⟩$ given in (48) by each of the three $σ_{j}$ we get the other three Bell states

$|ℬ_{0}⟩ = \frac{\sqrt{2} (|A_{0}⟩ \otimes |B_{0}⟩ + |A_{1}⟩ \otimes |B_{1}⟩)}{2}$

(66)

>	$Psigma [1] \cdot$

$σ_{1} |ℬ_{0}⟩ = \frac{\sqrt{2} σ_{1} (|A_{0}⟩ \otimes |B_{0}⟩ + |A_{1}⟩ \otimes |B_{1}⟩)}{2}$

(67)

Substitute in this result the first equations of (61) and (64)

>	$[1], [1]$

$σ_{1} |B_{0}⟩ = |B_{1}⟩, σ_{1} |B_{1}⟩ = |B_{0}⟩$

(68)

>	$map (rhs = lhs, [])$

$[|B_{1}⟩ = σ_{1} |B_{0}⟩, |B_{0}⟩ = σ_{1} |B_{1}⟩]$

(69)

>	$subs (,)$

$σ_{1} |ℬ_{0}⟩ = \frac{\sqrt{2} σ_{1} (|A_{0}⟩ σ_{1} |B_{1}⟩ + |A_{1}⟩ σ_{1} |B_{0}⟩)}{2}$

(70)

>	$factor (Simplify ())$

$σ_{1} |ℬ_{0}⟩ = \frac{\sqrt{2} (|A_{0}⟩ \otimes |B_{1}⟩ + |A_{1}⟩ \otimes |B_{0}⟩)}{2}$

(71)

This is $|{&bernou;}_{1}⟩$ defined in (49)

$|ℬ_{1}⟩ = \frac{\sqrt{2} (|A_{0}⟩ \otimes |B_{1}⟩ + |A_{1}⟩ \otimes |B_{0}⟩)}{2}$

(72)

$-$

$σ_{1} |ℬ_{0}⟩ - |ℬ_{1}⟩ = 0$

(73)

Multiplying now by $σ_{2}$ and substituting $|B_{j}⟩$ using the $2^{nd}$ equations of (61) and (64) we get $|{&bernou;}_{2}⟩$

>	$Psigma [2] \cdot$

$σ_{2} |ℬ_{0}⟩ = \frac{\sqrt{2} σ_{2} (|A_{0}⟩ \otimes |B_{0}⟩ + |A_{1}⟩ \otimes |B_{1}⟩)}{2}$

(74)

>	$[2], [2]$

$σ_{2} |B_{0}⟩ = ⅈ |B_{1}⟩, σ_{2} |B_{1}⟩ = −ⅈ |B_{0}⟩$

(75)

>	$zip (isolate, [], [Ket (B, 1), Ket (B, 0)])$

$[|B_{1}⟩ = −ⅈ σ_{2} |B_{0}⟩, |B_{0}⟩ = ⅈ σ_{2} |B_{1}⟩]$

(76)

>	$factor (Simplify (subs (,)))$

$σ_{2} |ℬ_{0}⟩ = \frac{ⅈ}{2} \sqrt{2} (|A_{0}⟩ \otimes |B_{1}⟩ - |A_{1}⟩ \otimes |B_{0}⟩)$

(77)

The above is $|&bernou;_{2}⟩$ defined in (50)

$|ℬ_{2}⟩ = \frac{ⅈ}{2} \sqrt{2} (|A_{0}⟩ \otimes |B_{1}⟩ - |A_{1}⟩ \otimes |B_{0}⟩)$

(78)

>	$Expand (-)$

$σ_{2} |ℬ_{0}⟩ - |ℬ_{2}⟩ = 0$

(79)

Finally, multiplying $|{&bernou;}_{0}⟩$ by $σ_{3}$

>	$Psigma [3] \cdot$

$σ_{3} |ℬ_{0}⟩ = \frac{\sqrt{2} σ_{3} (|A_{0}⟩ \otimes |B_{0}⟩ + |A_{1}⟩ \otimes |B_{1}⟩)}{2}$

(80)

Substituting

>	$[3], [3]$

$σ_{3} |B_{0}⟩ = |B_{0}⟩, σ_{3} |B_{1}⟩ = - |B_{1}⟩$

(81)

>	$(rhs = lhs) ([1]), (rhs = lhs) (- [2])$

$|B_{0}⟩ = σ_{3} |B_{0}⟩, |B_{1}⟩ = - σ_{3} |B_{1}⟩$

(82)

We get

>	$factor (Simplify (subs (,)))$

$σ_{3} |ℬ_{0}⟩ = \frac{\sqrt{2} (|A_{0}⟩ \otimes |B_{0}⟩ - |A_{1}⟩ \otimes |B_{1}⟩)}{2}$

(83)

which is $|{&bernou;}_{3}⟩$

$|ℬ_{3}⟩ = \frac{\sqrt{2} (|A_{0}⟩ \otimes |B_{0}⟩ - |A_{1}⟩ \otimes |B_{1}⟩)}{2}$

(84)

>	$Expand (-)$

$σ_{3} |ℬ_{0}⟩ - |ℬ_{3}⟩ = 0$

(85)

Reset the symbol representing imaginary unit to use i as an index in the next section

>	$interface (imaginaryunit = I) &colon;$

Entangled States, Operators and Projectors

Consider a fourth operator, $H$ , that is Hermitian and acts on the same space of $C$ , has the same dimension, and $ℋ, ℍ$ are its mean values in an entangled and product states respectively.

>	$Setup (additionally, hermitian = H, basisdimension = \{H [1] = 2, H [2] = 2\}, hilbertspaces = \{\{A, C, H\}, \{B, C, H\}\}, realobjects = \{&HilbertSpace;, &quaternions;\})$

$* Partial match of ' hermitian' against keyword ' hermitianoperators'$

$* Partial match of ' basisdimension' against keyword ' quantumbasisdimension'$

$_______________________________________________________$

$[disjointedspaces = \{\{A, C, H\}, \{B, C, H\}, \{B, C, σ\}\}, hermitianoperators = \{H\}, quantumbasisdimension = \{A = 2, B = 2, C_{1} = 2, C_{2} = 2, H_{1} = 2, H_{2} = 2\}, realobjects = \{ℍ, ℋ, x, y, z\}]$

(86)

To operate in a practical way with these operators, Bras and Kets, bracket rules reflecting their relationship are necessary. From the definition of $C$ as acting on the tensor product of spaces where $A$ and $B$ act (see (43)) and taking into account the dimensions specified for $A$ , $B$ and $C$ we have

>	$Ket (C, a, b) = Sum (Sum (M [a, j, b, p] Ket (A, j) Ket (B, p), j = 0 .. 1), p = 0 .. 1)$

$|C_{a, b}⟩ = \sum_{p = 0}^{1} \sum_{j = 0}^{1} M_{a, j, b, p} |A_{j}⟩ \otimes |B_{p}⟩$

(87)

>	$⟨A_{k}\| \cdot$

$⟨A_{k} | C_{a, b}⟩ = \sum_{p = 0}^{1} M_{a, k, b, p} |B_{p}⟩$

(88)

>	$⟨B_{k}\| \cdot$

$⟨B_{k} | C_{a, b}⟩ = \sum_{j = 0}^{1} M_{a, j, b, k} |A_{j}⟩$

(89)

>	$⟨A_{k}\| \cdot ⟨B_{l}\| \cdot$

$⟨A_{k}| ⟨B_{l} | C_{a, b}⟩ = M_{a, k, b, l}$

(90)

The bracket rules for $A$ , $B$ and $C$ are the first two of these; Set these rules, so that the system can take them into account

>	$Setup (,)$

$[bracketrules = \{⟨A_{k} | C_{a, b}⟩ = \sum_{p = 0}^{1} M_{a, k, b, p} |B_{p}⟩, ⟨B_{k} | C_{a, b}⟩ = \sum_{j = 0}^{1} M_{a, j, b, k} |A_{j}⟩\}]$

(91)

If we now recompute (90), the left-hand side is also computed

>	$⟨A_{k}\| \cdot ⟨B_{l}\| \cdot$

$M_{a, k, b, l} = M_{a, k, b, l}$

(92)

Suppose now that you want to compute with the Hermitian operator $H$ , that operates on the same space as $C$ , both using C and the operators $A$ and $B$ , as in

$⟨C_{ⅈ, j} | H | C_{k, l}⟩ = {&HilbertSpace;}_{i, j, k, l}$

$⟨A_{ⅈ}| \otimes ⟨B_{j}| H |A_{k}⟩ \otimes |B_{l}⟩ = {&quaternions;}_{ⅈ, j, k, l}$

where $ℋ_{i, j, k, l}$ = ${&quaternions;}_{ⅈ, j, k, l}$ when $|C_{i, j}⟩$ is a product (not entangled) state.

To compute taking into account $⟨C_{ⅈ, j} | H | C_{k, l}⟩ = {&HilbertSpace;}_{ⅈ, j, k, l}$ it suffices to set a bracket rule

>	$Setup (%Bracket (Bra (C, a, b), H, Ket (C, c, d)) = &HilbertSpace; [a, b, c, d], real = &HilbertSpace;)$

$* Partial match of ' real' against keyword ' realobjects'$

$_______________________________________________________$

$[bracketrules = \{⟨A_{k} | C_{a, b}⟩ = \sum_{p = 0}^{1} M_{a, k, b, p} |B_{p}⟩, ⟨B_{k} | C_{a, b}⟩ = \sum_{j = 0}^{1} M_{a, j, b, k} |A_{j}⟩, ⟨C_{a, b} | H | C_{c, d}⟩ = ℋ_{a, b, c, d}\}, realobjects = \{ℍ, ℋ, x, y, z\}]$

(93)

After that,

>	$⟨C_{j, k}\| \cdot H \cdot \|C_{m, n}⟩$

$ℋ_{j, k, m, n}$

(94)

Regarding $⟨A_{ⅈ}| \otimes ⟨B_{j}| H |A_{k}⟩ \otimes |B_{l}⟩ = &quaternions;_{ⅈ, j, k, l}$ , since $H$ belongs to the tensor product of spaces A and B, it can be an entangled operator, one that you cannot represent just as a product of one operator acting on A times another one acting on B. A computational representation for the operator $⟨B_{j}| H |A_{k}⟩$ (that is not just itself or as abstract) is not possible in the general case. For that you can use a different feature: define the action of the operator $H$ on Kets of $A$ and $B$ .

Basically, we want:

$H \cdot |A_{k}⟩ \to H_{k}$

$H_{k} \cdot |A_{l}⟩ \to H_{k, l} .. &period;$ $H_{i, j, k} \cdot |A_{l}⟩ \to ℍ_{i, j, k, l}$

A program sketch for that would be:

if H is applied to a Ket of A or B and it still has not 4 indices then

    if H itself is indexed then
        return H with its indices followed by the index of the Ket
    else

return H indexed by the index of the Ket;
otherwise
return the dot product operation uncomputed, unevaluated

In the Maple language (see sec. 1.4) that program-sketch becomes

$H ≔ K \to if (procname ∷ Not (indexed) or nops (procname) < 4) and K ∷ Ket and op (1, K) ∷' identical (A, B)' then if procname ∷' indexed' then if nops (procname) = 3 then ℍ [op (procname), op (2, K)] &num; no more indices to be accumulated, scalar result else H [op (procname), op (2, K)] &num; accumulate indices, operator result fi else H [op (2, K)] fi else' procname &period; K' fi &colon;$

Let's see it in action. Start by erasing the Physics performance remember tables, which remember results computed before the definition of $H$

>	$Library :- Forget ()$

>	$H \cdot \|A_{k}⟩$

$H_{k}$

(95)

Recalling that $H$ is Hermitian,

>	$⟨B_{j}\| \cdot H$

$H_{j}$

(96)

>	$⟨B_{j}\| \cdot H \cdot \|A_{k}⟩$

$H_{j, k}$

(97)

>	$⟨B_{j}\| \cdot H \cdot \|A_{k}⟩ \cdot \|B_{l}⟩$

$H_{j, k, l}$

(98)

>	$⟨A_{i}\| \cdot ⟨B_{j}\| \cdot H \cdot \|A_{k}⟩ \cdot \|B_{l}⟩$

$ℍ_{i, j, k, l}$

(99)

Note that the definition of $H$ as a procedure does not interfere with the setting of a bracket rule for it with $|C_{a, b}⟩$ , that is still working

>	$⟨C_{i, j}\| \cdot H \cdot \|C_{k, l}⟩$

$ℋ_{i, j, k, l}$

(100)

where H = H when $|C_{k, l}⟩$ is a product state. The definition of H takes precedence, so if in that definition you indicate what to do with a $C$ Ket, that will be taken into account before the bracket rule.

•	You can set the projectors for all these operators / spaces. For example,

>	$&Iopf;__A ≔ Projector (Ket (A, i)) &semi; &Iopf;__B ≔ Projector (Ket (B, i)) &semi; &Iopf;__C ≔ Projector (Ket (C, a, b))$

$&Iopf;__A ≔ \sum_{i = 0}^{1} |A_{i}⟩ ⟨A_{i}|$

$&Iopf;__B ≔ \sum_{i = 0}^{1} |B_{i}⟩ ⟨B_{i}|$

$&Iopf;__C ≔ \sum_{b = 0}^{1} \sum_{a = 0}^{1} |C_{a, b}⟩ ⟨C_{a, b}|$

(101)

Since the algebra rules for computing with eigenkets of $A$ , $B$ and $C$ were already set in (91), from the projectors above you can construct any subspace projector, for example

>	$Bra (A, m) &period; &Iopf;__C$

$\sum_{b = 0}^{1} \sum_{a = 0}^{1} \sum_{p = 0}^{1} M_{a, m, b, p} |B_{p}⟩ ⟨C_{a, b}|$

(102)

>	$&Iopf;__C &period; Ket (A, m)$

$\sum_{b = 0}^{1} \sum_{a = 0}^{1} \sum_{p = 0}^{1} \overset{&conjugate0;}{M_{a, m, b, p}} |C_{a, b}⟩ ⟨B_{p}|$

(103)

The conjugate of $M_{a, m, b, p}$ is due to the contraction or attachment from the right of (102), that is with

>	$Dagger ()$

$⟨C_{a, b}| = \sum_{p = 0}^{1} \sum_{j = 0}^{1} \overset{&conjugate0;}{M_{a, j, b, p}} ⟨A_{j}| \otimes ⟨B_{p}|$

(104)

The coefficients $M_{a, m, b, p}$ satisfy constraints due to the normalization of Kets of $A$ and $B$ . One can derive these constraints by inserting the unit operator $&Iopf;__C$ in the identity

>	$⟨A_{m}\| \cdot ⟨B_{n}\| \cdot &Iopf;__C \cdot \|A_{r}⟩ \cdot \|B_{s}⟩ = ⟨A_{m}\| \cdot ⟨B_{n}\| \cdot \|A_{r}⟩ \cdot \|B_{s}⟩$

$\sum_{b = 0}^{1} \sum_{a = 0}^{1} \overset{&conjugate0;}{M_{a, r, b, s}} M_{a, m, b, n} = δ_{m, r} δ_{n, s}$

(105)

Transform this result into a function P to explore the identity further

>	$P ≔ unapply (subs (Sum = sum,), m, n, r, s)$

$P ≔ (m, n, r, s) \mapsto \sum_{b = 0}^{1} \sum_{a = 0}^{1} \overset{&conjugate0;}{M_{a, r, b, s}} M_{a, m, b, n} = δ_{m, r} δ_{n, s}$

(106)

The first and third indices refer to the quantum numbers of $A$ , the second and fourth to $B$ , so the right-hand sides in the following are respectively 1 and 0

>	$P (1, 0, 1, 0)$

$\overset{&conjugate0;}{M_{0, 1, 0, 0}} M_{0, 1, 0, 0} + \overset{&conjugate0;}{M_{1, 1, 0, 0}} M_{1, 1, 0, 0} + \overset{&conjugate0;}{M_{0, 1, 1, 0}} M_{0, 1, 1, 0} + \overset{&conjugate0;}{M_{1, 1, 1, 0}} M_{1, 1, 1, 0} = 1$

(107)

>	$P (1, 0, 0, 0)$

$\overset{&conjugate0;}{M_{0, 0, 0, 0}} M_{0, 1, 0, 0} + \overset{&conjugate0;}{M_{1, 0, 0, 0}} M_{1, 1, 0, 0} + \overset{&conjugate0;}{M_{0, 0, 1, 0}} M_{0, 1, 1, 0} + \overset{&conjugate0;}{M_{1, 0, 1, 0}} M_{1, 1, 1, 0} = 0$

(108)

To get the whole system of equations satisfied by the coefficients $M_{a, m, b, n}$ , use P to construct an Array with four indices running from 0..1

>	$Array (0 .. 1 &dollar; 4, P)$

Convert the whole Array into a set of equations

>	$simplify (convert (, setofequations))$

$\{{|M_{0, 0, 0, 0}|}^{2} + {|M_{1, 0, 0, 0}|}^{2} + {|M_{0, 0, 1, 0}|}^{2} + {|M_{1, 0, 1, 0}|}^{2} = 1, {|M_{0, 0, 0, 1}|}^{2} + {|M_{1, 0, 0, 1}|}^{2} + {|M_{0, 0, 1, 1}|}^{2} + {|M_{1, 0, 1, 1}|}^{2} = 1, {|M_{0, 1, 0, 0}|}^{2} + {|M_{1, 1, 0, 0}|}^{2} + {|M_{0, 1, 1, 0}|}^{2} + {|M_{1, 1, 1, 0}|}^{2} = 1, {|M_{0, 1, 0, 1}|}^{2} + {|M_{1, 1, 0, 1}|}^{2} + {|M_{0, 1, 1, 1}|}^{2} + {|M_{1, 1, 1, 1}|}^{2} = 1, \overset{&conjugate0;}{M_{0, 0, 0, 0}} M_{0, 0, 0, 1} + \overset{&conjugate0;}{M_{1, 0, 0, 0}} M_{1, 0, 0, 1} + \overset{&conjugate0;}{M_{0, 0, 1, 0}} M_{0, 0, 1, 1} + \overset{&conjugate0;}{M_{1, 0, 1, 0}} M_{1, 0, 1, 1} = 0, \overset{&conjugate0;}{M_{0, 0, 0, 0}} M_{0, 1, 0, 0} + \overset{&conjugate0;}{M_{1, 0, 0, 0}} M_{1, 1, 0, 0} + \overset{&conjugate0;}{M_{0, 0, 1, 0}} M_{0, 1, 1, 0} + \overset{&conjugate0;}{M_{1, 0, 1, 0}} M_{1, 1, 1, 0} = 0, \overset{&conjugate0;}{M_{0, 0, 0, 0}} M_{0, 1, 0, 1} + \overset{&conjugate0;}{M_{1, 0, 0, 0}} M_{1, 1, 0, 1} + \overset{&conjugate0;}{M_{0, 0, 1, 0}} M_{0, 1, 1, 1} + \overset{&conjugate0;}{M_{1, 0, 1, 0}} M_{1, 1, 1, 1} = 0, \overset{&conjugate0;}{M_{0, 0, 0, 1}} M_{0, 0, 0, 0} + \overset{&conjugate0;}{M_{1, 0, 0, 1}} M_{1, 0, 0, 0} + \overset{&conjugate0;}{M_{0, 0, 1, 1}} M_{0, 0, 1, 0} + \overset{&conjugate0;}{M_{1, 0, 1, 1}} M_{1, 0, 1, 0} = 0, \overset{&conjugate0;}{M_{0, 0, 0, 1}} M_{0, 1, 0, 0} + \overset{&conjugate0;}{M_{1, 0, 0, 1}} M_{1, 1, 0, 0} + \overset{&conjugate0;}{M_{0, 0, 1, 1}} M_{0, 1, 1, 0} + \overset{&conjugate0;}{M_{1, 0, 1, 1}} M_{1, 1, 1, 0} = 0, \overset{&conjugate0;}{M_{0, 0, 0, 1}} M_{0, 1, 0, 1} + \overset{&conjugate0;}{M_{1, 0, 0, 1}} M_{1, 1, 0, 1} + \overset{&conjugate0;}{M_{0, 0, 1, 1}} M_{0, 1, 1, 1} + \overset{&conjugate0;}{M_{1, 0, 1, 1}} M_{1, 1, 1, 1} = 0, \overset{&conjugate0;}{M_{0, 1, 0, 0}} M_{0, 0, 0, 0} + \overset{&conjugate0;}{M_{1, 1, 0, 0}} M_{1, 0, 0, 0} + \overset{&conjugate0;}{M_{0, 1, 1, 0}} M_{0, 0, 1, 0} + \overset{&conjugate0;}{M_{1, 1, 1, 0}} M_{1, 0, 1, 0} = 0, \overset{&conjugate0;}{M_{0, 1, 0, 0}} M_{0, 0, 0, 1} + \overset{&conjugate0;}{M_{1, 1, 0, 0}} M_{1, 0, 0, 1} + \overset{&conjugate0;}{M_{0, 1, 1, 0}} M_{0, 0, 1, 1} + \overset{&conjugate0;}{M_{1, 1, 1, 0}} M_{1, 0, 1, 1} = 0, \overset{&conjugate0;}{M_{0, 1, 0, 0}} M_{0, 1, 0, 1} + \overset{&conjugate0;}{M_{1, 1, 0, 0}} M_{1, 1, 0, 1} + \overset{&conjugate0;}{M_{0, 1, 1, 0}} M_{0, 1, 1, 1} + \overset{&conjugate0;}{M_{1, 1, 1, 0}} M_{1, 1, 1, 1} = 0, \overset{&conjugate0;}{M_{0, 1, 0, 1}} M_{0, 0, 0, 0} + \overset{&conjugate0;}{M_{1, 1, 0, 1}} M_{1, 0, 0, 0} + \overset{&conjugate0;}{M_{0, 1, 1, 1}} M_{0, 0, 1, 0} + \overset{&conjugate0;}{M_{1, 1, 1, 1}} M_{1, 0, 1, 0} = 0, \overset{&conjugate0;}{M_{0, 1, 0, 1}} M_{0, 0, 0, 1} + \overset{&conjugate0;}{M_{1, 1, 0, 1}} M_{1, 0, 0, 1} + \overset{&conjugate0;}{M_{0, 1, 1, 1}} M_{0, 0, 1, 1} + \overset{&conjugate0;}{M_{1, 1, 1, 1}} M_{1, 0, 1, 1} = 0, \overset{&conjugate0;}{M_{0, 1, 0, 1}} M_{0, 1, 0, 0} + \overset{&conjugate0;}{M_{1, 1, 0, 1}} M_{1, 1, 0, 0} + \overset{&conjugate0;}{M_{0, 1, 1, 1}} M_{0, 1, 1, 0} + \overset{&conjugate0;}{M_{1, 1, 1, 1}} M_{1, 1, 1, 0} = 0\}$

(109)

Coherent States in Quantum Mechanics

Coherent states are among the most relevant representations for the state of a quantum system. These states, which are naturally radiated from lasers, form an overcomplete basis and minimize the quantum uncertainty between position x and momentum p, so that they satisfy the Heisenberg uncertainty principle with equality and their expectation values satisfy the classical equations of motion. In this sense, coherent states represent the best possible compromise between quantities that are incompatible with regards to Heisenberg's principle. Coherent states are widely used in quantum optics, quantum information and play a key role in the description of quantum systems that can be likened to a harmonic oscillator, as for instance electromagnetic radiation, superfluids and super-conductors.

	References
	[1] Cohen-Tannoudji, C.; Diu, B.; and Laloe, F. Quantum Mechanics. Paris, France: Hermann, 1977. [2] Massachusetts Institute of Technology OpenCourseWare, Quantum Physics II, Quantum Dynamics.

Definition and the basics

>	$restart &semi; with (Physics) &colon;$

Set a quantum operator $A$ and corresponding annihilation / creation operators

>	$Setup (quantumoperators = A)$

$[quantumoperators = \{A\}]$

(110)

>	$am ≔ Annihilation (A)$

$am ≔ a^{-}$

(111)

>	$ap ≔ Creation (A)$

$ap ≔ a^{+}$

(112)

In what follows, on the left-hand sides the product operator used is `*`, which properly represents, but does not perform the attachment of Bras, Kets, and operators. On the right-hand sides the product operator is `.`, that performs the attachments. Since the introduction of Physics in the Maple system, we have that

>	$am \cdot Ket (A, n) = am &period; Ket (A, n)$

$a^{-} |A_{n}⟩ = \sqrt{n} |A_{n - 1}⟩$

(113)

>	$(%Bracket = Bracket) (Bra (A, n), Ket (A, n))$

$⟨A_{n} | A_{n}⟩ = 1$

(114)

>	$(%Bracket = Bracket) (Bra (A, n), Ket (A, m))$

$⟨A_{n} | A_{m}⟩ = δ_{m, n}$

(115)

New in Maple 2019: coherent states, the eigenstates of the annihilation operator $a^{-}$ , with all of their properties, are now understood as such by the system

>	$am \cdot Ket (am, alpha) = am &period; Ket (am, alpha)$

$a^{-} |{a^{-}}_{α}⟩ = α |{a^{-}}_{α}⟩$

(116)

$|{a^{-}}_{α}⟩$ is an eigenket of $a^{-}$ but not of $a^{+}$

>	$ap &period; Ket (am, alpha)$

$a^{+} \cdot |{a^{-}}_{α}⟩$

(117)

The norm of these states is equal to 1

>	$(%Bracket = Bracket) (Bra (am, alpha), Ket (am, alpha))$

$⟨{a^{-}}_{α} | {a^{-}}_{α}⟩ = 1$

(118)

These states, however, are not orthonormal as the occupation number states $|A_{n}⟩$ are, and since $a^{-}$ is not Hermitian, its eigenvalues are not real but complex numbers. Instead of (115), in Maple 2019 we have

>	$(%Bracket = Bracket) (Bra (am, alpha), Ket (am, beta))$

$⟨{a^{-}}_{α} | {a^{-}}_{β}⟩ = {&ExponentialE;}^{- \frac{{|α|}^{2}}{2} - \frac{{|β|}^{2}}{2} + \overset{&conjugate0;}{α} β}$

(119)

At $α = β$ ,

>	$simplify (eval (, alpha = beta))$

$1 = 1$

(120)

Their scalar product with the occupation number states $|A_{n}⟩$ , using the inert %Bracket on the left-hand side and the active Bracket on the other side:

>	$(%Bracket = Bracket) (Bra (A, n), Ket (am, alpha))$

$⟨A_{n} | {a^{-}}_{α}⟩ = \frac{{&ExponentialE;}^{- \frac{{|α|}^{2}}{2}} α^{n}}{\sqrt{n!}}$

(121)

The expansion of coherent states into occupation number states, first representing the product operation using `*`, then performing the attachments replacing `*` by `.`

>	$Projector (Ket (A, n), dimension = infinity)$

$\sum_{n = 0}^{\infty} |A_{n}⟩ ⟨A_{n}|$

(122)

>	$Ket (am, alpha) = \cdot Ket (am, alpha)$

$|{a^{-}}_{α}⟩ = (\sum_{n = 0}^{\infty} |A_{n}⟩ ⟨A_{n}|) |{a^{-}}_{α}⟩$

(123)

>	$eval (, `*` = `.`)$

$|{a^{-}}_{α}⟩ = \sum_{n = 0}^{\infty} \frac{{&ExponentialE;}^{- \frac{{|α|}^{2}}{2}} α^{n} |A_{n}⟩}{\sqrt{n!}}$

(124)

Taking all into account,

>	$⟨A_{n}\| \cdot$

$\frac{{&ExponentialE;}^{- \frac{{|α|}^{2}}{2}} α^{n}}{\sqrt{n!}} = \frac{{&ExponentialE;}^{- \frac{{|α|}^{2}}{2}} α^{n}}{\sqrt{n!}}$

(125)

Hide now the ket label. When in doubt, input show to see the Kets with their labels explicitly shown

>	$Setup (hide = true)$

$* Partial match of ' hide' against keyword ' hideketlabel'$

$_______________________________________________________$

$[hideketlabel = true]$

(126)

Define eigenkets of the annihilation operator, with two different eigenvalues for experimentation

>	$K__α ≔ Ket (am, alpha)$

$K__α ≔ |α⟩$

(127)

>	$K__β ≔ Ket (am, beta)$

$K__β ≔ |β⟩$

(128)

Because the properties of coherent states are now known to the system, the following computations proceed automatically in Maple 2019. The left-hand sides use the `*`, while the right-hand sides use the `.`

>	$(`*` = `.`) (Dagger (K__α), ap, am, K__α)$

$⟨α| a^{+} a^{-} |α⟩ = {|α|}^{2}$

(129)

>	$(`*` = `.`) (Dagger (K__α), (ap + am), K__α)$

$⟨α| (a^{+} + a^{-}) |α⟩ = \overset{&conjugate0;}{α} + α$

(130)

>	$(`*` = `.`) (Dagger (K__α), (ap - am), K__α)$

$⟨α| (a^{+} - a^{-}) |α⟩ = \overset{&conjugate0;}{α} - α$

(131)

>	$(`*` = `.`) (Dagger (K__α), {(ap + am)}^{2}, K__α)$

$⟨α| {(a^{+} + a^{-})}^{2} |α⟩ = {\overset{&conjugate0;}{α}}^{2} + 2 {|α|}^{2} + 1 + α^{2}$

(132)

Properties of Coherent states

The mean value of the occupation number N

The occupation number operator N is given by

>	$N ≔ ap \cdot am$

$N ≔ a^{+} a^{-}$

(133)

$N is Hermitian$

>	$%Dagger (N) = N$

${(a^{+} a^{-})}^{†} = a^{+} a^{-}$

(134)

>	$value ()$

$a^{+} a^{-} = a^{+} a^{-}$

(135)

N is diagonal in the $|A_{n}⟩$ basis of the Fock (occupation number) space

>	$(`*` = `.`) (Bra (A, n), N, Ket (A, p))$

$⟨n| a^{+} a^{-} |p⟩ = p δ_{n, p}$

(136)

•	The mean value of N in a coherent state $\|{a^{-}}_{α}⟩ \equiv \|α⟩$

>	$Bracket {(%N)}_{α} = %Bracket (Bra (am, α), N^{}, Ket (am, α))$

${⟨N⟩}_{α} = ⟨α | a^{+} a^{-} | α⟩$

(137)

>	$value ()$

${⟨N⟩}_{α} = {|α|}^{2}$

(138)

The mean value of $N^{2}$

>	$Bracket {({%N}^{2})}_{α} = %Bracket (Bra (am, α), N^{2}, Ket (am, α))$

${⟨N^{2}⟩}_{α} = ⟨α | {(a^{+} a^{-})}^{2} | α⟩$

(139)

>	$value ()$

${⟨N^{2}⟩}_{α} = {|α|}^{4} + {|α|}^{2}$

(140)

The standard deviation $ΔN = \sqrt{{⟨N^{2}⟩}_{α} - {⟨N⟩}_{α}^{2}}$ for a state $|{a^{-}}_{α}⟩$

>	${(-^{2})}^{\frac{1}{2}}$

$\sqrt{- {⟨N⟩}_{α}^{2} + {⟨N^{2}⟩}_{α}} = |α|$

(141)

In conclusion, a coherent state $|α⟩$ has a finite spreading $ΔN = |α|$ . Coherent states are good approximations for the states of a laser, where the laser intensity I is proportional to the mean value of the photon number, I f ${⟨N⟩}_{α} = {|α|}^{2}$ , and so the intensity fluctuation, $\sqrt{I} \propto |α|$ .

•	The mean value of the occupation number N in an occupation number state $\|A_{n}⟩ \equiv \|n⟩$

>	$Bracket {(%N)}_{n} = %Bracket (Bra (A, n), N, Ket (A, n))$

${⟨N⟩}_{n} = ⟨n | a^{+} a^{-} | n⟩$

(142)

>	$value ()$

${⟨N⟩}_{n} = n$

(143)

The mean value of the occupation number N in a state $|A_{n}⟩$ is thus n itself, as expected since $|A_{n}⟩$ represents a (Fock space) state of n (quasi-) particles. Accordingly,

>	$Bracket {({%N}^{2})}_{n} = %Bracket (Bra (A, n), N^{2}, Ket (A, n))$

${⟨N^{2}⟩}_{n} = ⟨n | {(a^{+} a^{-})}^{2} | n⟩$

(144)

>	$value ()$

${⟨N^{2}⟩}_{n} = n^{2}$

(145)

The standard deviation $ΔN = \sqrt{{⟨N^{2}⟩}_{n} - {⟨N⟩}_{n}^{2}}$ for a state $|A_{n}⟩$ , is thus

>	${(- 2)}^{\frac{1}{2}}$

$\sqrt{- {⟨N⟩}_{n}^{2} + {⟨N^{2}⟩}_{n}} = 0$

(146)

That is, in a Fock state, $ΔN = 0$ , there is no intensity fluctuation.

$a^{-} |α⟩ = α |α⟩$

The specific properties of coherent states implemented in Maple 2019 can be derived explicitly departing from the projection of $|α⟩$ into the $|n⟩$ basis of occupation number states and the definition of $a^{-}$ as the operator that annihilates the vacuum $a^{-}$ $|0⟩ = 0$

>	$Ket (am, alpha) = \cdot Ket (am, alpha)$

$|α⟩ = (\sum_{n = 0}^{\infty} |n⟩ ⟨n|) |α⟩$

(147)

>	$eval (, `*` = `.`)$

$|α⟩ = \sum_{n = 0}^{\infty} \frac{{&ExponentialE;}^{- \frac{{|α|}^{2}}{2}} α^{n} |n⟩}{\sqrt{n!}}$

(148)

To derive $a^{-} |α⟩ = α |α⟩$ from the formula above, start multiplying by $a^{-}$

>	$am \cdot$

$a^{-} |α⟩ = a^{-} (\sum_{n = 0}^{\infty} \frac{{&ExponentialE;}^{- \frac{{|α|}^{2}}{2}} α^{n} |n⟩}{\sqrt{n!}})$

(149)

In view of $a^{-} |0⟩ = 0$ , discard the first term of the sum

>	$subs (0 = 1,)$

$a^{-} |α⟩ = a^{-} (\sum_{n = 1}^{\infty} \frac{{&ExponentialE;}^{- \frac{{|α|}^{2}}{2}} α^{n} |n⟩}{\sqrt{n!}})$

(150)

Change variables $n = k + 1$ ; in the result rename $k \to n$

>	$subs (k = n, PDEtools :- dchange (n = k + 1,, combine &commat; simplify))$

$a^{-} |α⟩ = \sum_{n = 0}^{\infty} \frac{{&ExponentialE;}^{- \frac{{|α|}^{2}}{2}} a^{-} |n + 1⟩ α^{n + 1}}{\sqrt{n!} \sqrt{n + 1}}$

(151)

Activate the product $a^{-} |n + 1⟩$ by replacing, in the right-hand side, the product operator `*` by `.`

>	$lhs () = eval (rhs (), `*` = `.`)$

$a^{-} |α⟩ = \sum_{n = 0}^{\infty} \frac{{&ExponentialE;}^{- \frac{{|α|}^{2}}{2}} |n⟩ α^{n + 1}}{\sqrt{n!}}$

(152)

By inspection the right-hand side of (152) is equal to $α$ times the right-hand side of (148)

>	$alpha \cdot -$

$α |α⟩ - a^{-} |α⟩ = α (\sum_{n = 0}^{\infty} \frac{{&ExponentialE;}^{- \frac{{|α|}^{2}}{2}} α^{n} |n⟩}{\sqrt{n!}}) - (\sum_{n = 0}^{\infty} \frac{{&ExponentialE;}^{- \frac{{|α|}^{2}}{2}} |n⟩ α^{n + 1}}{\sqrt{n!}})$

(153)

>	$combine ()$

$α |α⟩ - a^{-} |α⟩ = 0$

(154)

•	Overview of the coherent states distribution

Consider the projection of $|α⟩$ over an occupation number state $|n⟩$

>	$%Bracket (Bra (A, n), lhs ()) = Bracket (Bra (A, n), rhs ())$

$⟨n | α⟩ = \frac{{&ExponentialE;}^{- \frac{{|α|}^{2}}{2}} α^{n}}{\sqrt{n!}}$

(155)

An overview of the distribution of coherent states $|α⟩$ for a sample of values of n and $α$ is thus as follows

>	$plot3d (rhs (), n = 0 .. 25, α = 0 .. 10, axes = boxed, caption = lhs ())$

The distribution can be explored for ranges of values of n and $α$ using Explore

>	$NA ≔ Typesetting :- Typeset (⟨n \| α⟩) &colon;$

>	$Explore (plot (rhs (), n = 0 .. 200, view = 0 .. 0.6, labels = [n, NA]), parameters = [α = 0 .. 10], initialvalues = [α = 5])$

$α$

$a^{+} |α⟩ = \frac{\partial}{\partial α} |α⟩ + \frac{\overset{&conjugate0;}{α}}{2} |α⟩$

To verify this identity, construct each of the three terms, then simplify the result. Recalling the projection of a coherent state $|α⟩$ into the $|n⟩$ basis of occupation number states,

$|α⟩ = \sum_{n = 0}^{\infty} \frac{{&ExponentialE;}^{- \frac{{|α|}^{2}}{2}} α^{n} |n⟩}{\sqrt{n!}}$

(156)

The third term of this identity is thus

>	$T__3 ≔ \frac{conjugate (α)}{2} \cdot$

$T__3 ≔ \frac{\overset{&conjugate0;}{α} |α⟩}{2} = \frac{\overset{&conjugate0;}{α} (\sum_{n = 0}^{\infty} \frac{{&ExponentialE;}^{- \frac{{|α|}^{2}}{2}} α^{n} |n⟩}{\sqrt{n!}})}{2}$

(157)

The first term, on the left-hand side, is obtained multiplying by $a^{+}$

>	$ap &period;$

$a^{+} \cdot |α⟩ = \sum_{n = 0}^{\infty} \frac{{&ExponentialE;}^{- \frac{{|α|}^{2}}{2}} α^{n} \sqrt{n + 1} |n + 1⟩}{\sqrt{n!}}$

(158)

To have the three terms with $|n⟩$ in the summand, change variables $n = k - 1$ ; in the result rename $k \to n$

>	$subs (k = n, convert (PDEtools :- dchange (n = k - 1,, simplify), factorial))$

$a^{+} \cdot |α⟩ = \sum_{n = 1}^{\infty} \frac{{&ExponentialE;}^{- \frac{{|α|}^{2}}{2}} α^{n - 1} \sqrt{n} |n⟩}{\sqrt{(n - 1)!}}$

(159)

The radical in the summand can be rewritten taking into account that, when n is a positive integer,

>	$\frac{1}{sqrt ((n - 1) &excl;)} = \frac{sqrt (n)}{sqrt (n &excl;)}$

$\frac{1}{\sqrt{(n - 1)!}} = \frac{\sqrt{n}}{\sqrt{n!}}$

(160)

This identity can be verified as follows

>	$simplify ((lhs - rhs) ()) assuming n ∷ posint$

$0$

(161)

>	$subs (,)$

$a^{+} \cdot |α⟩ = \sum_{n = 1}^{\infty} \frac{{&ExponentialE;}^{- \frac{{|α|}^{2}}{2}} α^{n - 1} n |n⟩}{\sqrt{n!}}$

(162)

The summand, at $n = 0$ , is equal to 0

>	$summand ≔ op (1, rhs ())$

$summand ≔ \frac{{&ExponentialE;}^{- \frac{{|α|}^{2}}{2}} α^{n - 1} n |n⟩}{\sqrt{n!}}$

(163)

>	$eval (summand, n = 0)$

$0$

(164)

Rewriting then the sum to start from 0

>	$T__1 ≔ convert (subs (1 .. infinity = 0 .. infinity,), factorial)$

$T__1 ≔ a^{+} \cdot |α⟩ = \sum_{n = 0}^{\infty} \frac{{&ExponentialE;}^{- \frac{{|α|}^{2}}{2}} α^{n - 1} n |n⟩}{\sqrt{n!}}$

(165)

The second term of this identity is obtained by differentiation of (156)

>	$T__2 ≔ diff (, alpha)$

$T__2 ≔ \frac{&DifferentialD;}{&DifferentialD; α} |α⟩ = \sum_{n = 0}^{\infty} (- \frac{\overset{&conjugate0;}{α} {&ExponentialE;}^{- \frac{{|α|}^{2}}{2}} α^{n} |n⟩}{2 \sqrt{n!}} + \frac{{&ExponentialE;}^{- \frac{{|α|}^{2}}{2}} α^{n} n |n⟩}{α \sqrt{n!}})$

(166)

Putting the three terms together,

>	$T__1 - T__2 - T__3$

$a^{+} \cdot |α⟩ - \frac{&DifferentialD;}{&DifferentialD; α} |α⟩ - \frac{\overset{&conjugate0;}{α} |α⟩}{2} = (\sum_{n = 0}^{\infty} \frac{{&ExponentialE;}^{- \frac{{|α|}^{2}}{2}} α^{n - 1} n |n⟩}{\sqrt{n!}}) - (\sum_{n = 0}^{\infty} (- \frac{\overset{&conjugate0;}{α} {&ExponentialE;}^{- \frac{{|α|}^{2}}{2}} α^{n} |n⟩}{2 \sqrt{n!}} + \frac{{&ExponentialE;}^{- \frac{{|α|}^{2}}{2}} α^{n} n |n⟩}{α \sqrt{n!}})) - \frac{\overset{&conjugate0;}{α} (\sum_{n = 0}^{\infty} \frac{{&ExponentialE;}^{- \frac{{|α|}^{2}}{2}} α^{n} |n⟩}{\sqrt{n!}})}{2}$

(167)

Combining the sums the identity is verified

>	$combine ()$

$a^{+} \cdot |α⟩ - \frac{&DifferentialD;}{&DifferentialD; α} |α⟩ - \frac{\overset{&conjugate0;}{α} |α⟩}{2} = 0$

(168)

${&ExponentialE;}^{- \frac{{|α|}^{2}}{2}} {&ExponentialE;}^{α a^{+}}$ $|0⟩$ = $|α⟩$

The coherent state $|α⟩$ can be constructed from the vacuum state using the operator $𝒟_{1} = \exp (- \frac{1}{2} {|α|}^{2}) \cdot {&ExponentialE;}^{α a^{+}}$ .

>	$Setup (quantumoperators = \{&Dscr;\})$

$[quantumoperators = \{𝒟, A\}]$

(169)

>	${&Dscr;}_{1} = {&ExponentialE;}^{- \frac{1}{2} {\|α\|}^{2}} {&ExponentialE;}^{α ap}$

$𝒟_{1} = {&ExponentialE;}^{- \frac{{|α|}^{2}}{2}} {&ExponentialE;}^{α a^{+}}$

(170)

New in Maple 2019, the conversion network for mathematical functions can be used with not-commutative variables; develop the exponential function of $a^{+}$ in power series:

>	$\exp (α ap) = convert (\exp (α ap), Sum)$

${&ExponentialE;}^{α a^{+}} = \sum_{_k1 = 0}^{\infty} \frac{{(α a^{+})}^{_k1}}{_k1!}$

(171)

So $𝒟_{1}$ becomes

>	$subs (,_k1 = n,)$

$𝒟_{1} = {&ExponentialE;}^{- \frac{{|α|}^{2}}{2}} (\sum_{n = 0}^{\infty} \frac{{(α a^{+})}^{n}}{n!})$

(172)

Therefore, for $𝒟_{1}$ · $|0⟩$ , we have

>	$\cdot Ket (A, 0)$

$𝒟_{1} \cdot |0⟩ = \sum_{n = 0}^{\infty} \frac{{&ExponentialE;}^{- \frac{{|α|}^{2}}{2}} ({(α a^{+})}^{n} \cdot |0⟩)}{n!}$

(173)

>	$combine (Expand ())$

$𝒟_{1} \cdot |0⟩ = \sum_{n = 0}^{\infty} \frac{{&ExponentialE;}^{- \frac{{|α|}^{2}}{2}} α^{n} |n⟩}{\sqrt{n!}}$

(174)

By inspection the right-hand side is already the projection of $|α⟩$ into the basis or occupation number states $|n⟩$ computed previously in (148)

$|α⟩ = \sum_{n = 0}^{\infty} \frac{{&ExponentialE;}^{- \frac{{|α|}^{2}}{2}} α^{n} |n⟩}{\sqrt{n!}}$

(175)

$-$

$𝒟_{1} \cdot |0⟩ - |α⟩ = 0$

(176)

>	$isolate (, {&Dscr;}_{1} \cdot \|0⟩)$

$𝒟_{1} \cdot |0⟩ = |α⟩$

(177)

Remark: $𝒟_{1}$ is not unitary, $𝒟_{1} \cdot 𝒟_{1}^{†} \neq 1$

>	$Dagger () \cdot$

${𝒟_{1}}^{†} 𝒟_{1} = {({&ExponentialE;}^{- \frac{{|α|}^{2}}{2}})}^{2} {&ExponentialE;}^{\overset{&conjugate0;}{α} a^{-}} {&ExponentialE;}^{α a^{+}}$

(178)

>	$simplify ()$

${𝒟_{1}}^{†} 𝒟_{1} = {&ExponentialE;}^{\overset{&conjugate0;}{α} a^{-} + α a^{+} - \frac{{|α|}^{2}}{2}}$

(179)

${&ExponentialE;}^{α a^{+} - \overset{&conjugate0;}{α} a}$ $|0⟩$ = $|α⟩$

Here, we use another operator, $𝒟_{2}$ = ${&ExponentialE;}^{α a^{†} - \overset{&conjugate0;}{α} a}$ to construct $|α⟩$ from the vacuum. $𝒟_{2}$ is sometime called the "displacement" operator. It has the advantage over $𝒟_{1}$ that $𝒟_{2}$ is unitary, $𝒟_{2} \cdot 𝒟_{2}^{†} = 𝒟_{2}^{†} \cdot 𝒟_{2} = 1.$ As a consequence: $𝒟_{2} \cdot |0⟩ = |α⟩ \Rightarrow 𝒟_{2}^{†} \cdot |α⟩ = |0⟩$ .

>	$𝒟_{2} = {&ExponentialE;}^{α ap - \overset{&conjugate0;}{α} am}$

$𝒟_{2} = {&ExponentialE;}^{α a^{+} - \overset{&conjugate0;}{α} a^{-}}$

(180)

This operator is unitary

>	$\cdot Dagger ()$

$𝒟_{2} {𝒟_{2}}^{†} = {&ExponentialE;}^{α a^{+} - \overset{&conjugate0;}{α} a^{-}} {&ExponentialE;}^{\overset{&conjugate0;}{α} a^{-} - α a^{+}}$

(181)

>	$Simplify ()$

$𝒟_{2} {𝒟_{2}}^{†} = 1$

(182)

To verify that $𝒟_{2}^{†} \cdot 𝒟_{2} = 1$ one can proceed as in the above, or directly compute their commutator, expecting ${[𝒟_{2}, 𝒟_{2}^{†}]}_{-} = 0$ .

>	$%Commutator (, Dagger ())$

${[𝒟_{2} = {&ExponentialE;}^{α a^{+} - \overset{&conjugate0;}{α} a^{-}}, {𝒟_{2}}^{†} = {&ExponentialE;}^{\overset{&conjugate0;}{α} a^{-} - α a^{+}}]}_{-}$

(183)

>	$value (%)$

${[𝒟_{2}, {𝒟_{2}}^{†}]}_{-} = 0$

(184)

For $𝒟_{2}$ · $|0⟩ = |α⟩$ , start multiplying by $𝒟_{2}$

>	$\cdot Ket (A, 0)$

$𝒟_{2} |0⟩ = {&ExponentialE;}^{α a^{+} - \overset{&conjugate0;}{α} a^{-}} |0⟩$

(185)

>	$simplify (expand ())$

$𝒟_{2} |0⟩ = {&ExponentialE;}^{α a^{+}} {&ExponentialE;}^{- \overset{&conjugate0;}{α} a^{-}} |0⟩ {&ExponentialE;}^{- \frac{{|α|}^{2}}{2}}$

(186)

Recalling the definition of $𝒟_{1}$ in the previous section

$𝒟_{1} = {&ExponentialE;}^{- \frac{{|α|}^{2}}{2}} {&ExponentialE;}^{α a^{+}}$

(187)

The expression above (186) can be simplified using this definition

>	$isolate (, {&ExponentialE;}^{α ap})$

${&ExponentialE;}^{α a^{+}} = \frac{𝒟_{1}}{{&ExponentialE;}^{- \frac{{|α|}^{2}}{2}}}$

(188)

>	$simplify (subs (,))$

$𝒟_{2} |0⟩ = 𝒟_{1} {&ExponentialE;}^{- \overset{&conjugate0;}{α} a^{-}} |0⟩$

(189)

In turn ${&ExponentialE;}^{- \overset{&conjugate0;}{α} a^{-}} |0⟩$ can be computed by replacing the `*` product by a dot product `.`

>	$eval (, `*` = `.`)$

$𝒟_{2} \cdot |0⟩ = 𝒟_{1} \cdot |0⟩$

(190)

Finally, we arrive at the desired result recalling the result of the previous section,

$𝒟_{1} \cdot |0⟩ = |α⟩$

(191)

>	$subs (,)$

$𝒟_{2} \cdot |0⟩ = |α⟩$

(192)

$⟨β | α⟩ = {&ExponentialE;}^{\overset{&conjugate0;}{β} α - \frac{1}{2} {|β|}^{2} - \frac{1}{2} {|α|}^{2}}$

The identity in the title can be derived departing again from the projection of a coherent state $|α⟩$ into the $|n⟩$ basis of occupation number states

$|α⟩ = \sum_{n = 0}^{\infty} \frac{{&ExponentialE;}^{- \frac{{|α|}^{2}}{2}} α^{n} |n⟩}{\sqrt{n!}}$

(193)

>	$Dagger (subs (\{α = β, n = k\},))$

$⟨β| = \sum_{k = 0}^{\infty} \frac{{&ExponentialE;}^{- \frac{{|β|}^{2}}{2}} {\overset{&conjugate0;}{β}}^{k} ⟨k|}{\sqrt{k!}}$

(194)

Taking the `*` product of these two expressions

$\cdot$

$⟨β| |α⟩ = (\sum_{k = 0}^{\infty} \frac{{&ExponentialE;}^{- \frac{{|β|}^{2}}{2}} {\overset{&conjugate0;}{β}}^{k} ⟨k|}{\sqrt{k!}}) (\sum_{n = 0}^{\infty} \frac{{&ExponentialE;}^{- \frac{{|α|}^{2}}{2}} α^{n} |n⟩}{\sqrt{n!}})$

(195)

Perform the attachment of Bras and Kets on the right-hand side by replacing `*` by `.`, evaluating the sum and simplifying the result

>	$lhs () = simplify (value (eval (rhs (), `*` = `.`)))$

$⟨β| |α⟩ = {&ExponentialE;}^{- \frac{{|β|}^{2}}{2} - \frac{{|α|}^{2}}{2} + α \overset{&conjugate0;}{β}}$

(196)

•	Overview of the real and imaginary part of $⟨β \| α⟩$

In most cases, $α$ and $β$ are complex valued numbers. Below, the plots assume that $α$ and $β$ are both real. To take into account the general case, the possibility to tune a phase difference $θ$ between $α$ and $β$ is explicitly added, so that (196) becomes

>	$⟨β \| α⟩ = subs (\overset{&conjugate0;}{β} = \overset{&conjugate0;}{β} {&ExponentialE;}^{θ I}, rhs ())$

$⟨β | α⟩ = {&ExponentialE;}^{- \frac{{|β|}^{2}}{2} - \frac{{|α|}^{2}}{2} + α \overset{&conjugate0;}{β} {&ExponentialE;}^{I θ}}$

(197)

>	$Explore (plot3d (ℜ (rhs ()), α = - 10 .. 10, β = - 10 .. 10, view = - 1 .. 1, orientation = [- 12, 74, 3], axes = boxed), parameters = [θ = 0 .. 2 \cdot π], initialvalues = [θ = \frac{π}{10}])$

$θ$

Continue reading about new Physics features: What's New in Physics, Continued

	See Also
	Index of New Maple 2019 Features, Physics , Computer Algebra for Theoretical Physics, The Physics project, The Physics Updates

Download Help Document

Maple

Maple Add-Ons

MapleSim

MapleSim Add-Ons

Systems Engineering

Consulting Services

Maple T.A. and Möbius

Education

Industries

Automotive and Aerospace

Robotics

Machine Design & Industrial Automation

Other

Application Areas

Product Pricing

Purchasing

Institutional Student Licensing

Maplesoft Elite Maintenance (EMP)

Support

Product Training

Online Product Help

Webinars & Events

Publications

Content Hubs

Examples & Applications

Community

About Maplesoft

Media Center

User Community

Contact

Online Help

All Products Maple MapleSim

Maple

Powerful math software that is easy to use

Maple Add-Ons

MapleSim

Advanced System Level Modeling

MapleSim Add-Ons

Systems Engineering

Consulting Services

Maple T.A. and Möbius

Education

Industries

Automotive and Aerospace

Robotics

Machine Design & Industrial Automation

Other

Application Areas

Product Pricing

Purchasing

Institutional Student Licensing

Maplesoft Elite Maintenance (EMP)

Support

Product Training

Online Product Help

Webinars & Events

Publications

Content Hubs

Examples & Applications

Community

About Maplesoft

Media Center

User Community

Contact

Online Help

All Products Maple MapleSim