## Unitary Transformations

Unitary transformations are like orthogonal transformations, except we’re working with a complex inner product space. We’ll focus on just the transformations that are unitary with respect to the inner product itself. That is, we ask that

and so we must have just as we wrote for orthogonal transformations, but we have to use the adjoint that’s appropriate to our complex inner product. In this way, unitary and orthogonal transformations are related in a way similar to that in which Hermitian and symmetric forms are related.

Now, we’ve got this running analogy between endomorphisms on an inner product space and complex numbers. Taking the adjoint is like complex conjugation, so Hermitian transformations are like real numbers because they’re equal to their own adjoints. But here, we’re looking at transformations whose *inverses* are equal to their adjoints. What does this look like in terms of our analogy?

Well, we’ve noted that a transformation composed with its own adjoint is a sure way to get a positive-definite transformation . This is analogous to the way that a complex number times its own conjugate is always nonnegative: . In fact, we use this to interpret as the squared-length of a the complex number . So what’s the analogue of the unitarity condition ? That’s like asking for , and so must be a unit-length complex number. Unitary transformations are like the complex numbers on the *unit* circle.

In Deutsche’s Problem, one is trying to compute or in 24 hours. Now if is not invertible, why do we need a unitary transformation ?

E.g. we have .

Comment by ramanujantao | July 28, 2009 |

Because Deutsche is working on

quantumcomputation, and all transformations in quantum mechanics are modeled with unitary operators on Hilbert spaces.Comment by John Armstrong | July 28, 2009 |

I see. The unitary transformation is essentially the “quantum computer.”

Comment by ramanujantao | July 28, 2009 |

[...] and Orthogonal Matrices Let’s see what happens when we take a unitary or orthogonal transformation and turn it into a matrix by picking a basis for our vector [...]

Pingback by Unitary and Orthogonal Matrices « The Unapologetic Mathematician | July 29, 2009 |

[...] Determinant of Unitary and Orthogonal Transformations Okay, we’ve got groups of unitary and orthogonal transformations (and the latter we can generalize to groups of matrices over [...]

Pingback by The Determinant of Unitary and Orthogonal Transformations « The Unapologetic Mathematician | July 31, 2009 |

[...] All the transformations in our analogy — self-adjoint and unitary (or orthogonal), and even anti-self-adjoint (antisymmetric and “skew-Hermitian”) [...]

Pingback by Normal Transformations « The Unapologetic Mathematician | August 5, 2009 |

[...] that unitary transformations are like unit complex numbers, while positive-semidefinite transformations are like nonnegative real numbers. And so this [...]

Pingback by Polar Decomposition « The Unapologetic Mathematician | August 19, 2009 |

[...] real vector space preserving a specified bilinear form . Lastly, we’ve defined the group of unitary transformations on — complex matrices whose conjugate transpose and inverse are the [...]

Pingback by The Special Linear Group (and others) « The Unapologetic Mathematician | September 8, 2009 |

[...] Finster, below, reminds me that since we've got a complex inner product we're using the group of unitary transformations with respect to the inner product : [...]

Pingback by Invariant Forms « The Unapologetic Mathematician | September 28, 2010 |