  We develop a symmetric monoidal closed category of games, incorporating sums
and products, to model quantum computation at higher types. This model is
expressive, capable of representing all unitary operators at base types. It is
compatible with base types and realizable by unitary operators.
