- #1
Killtech
- 344
- 35
I am looking for a way to compare the handling of probability in QT with how it's done in classic PT (probability theory) - and their interpretations. QT does have it's own formalism that works, so there isn't much motivation to bring it into a usual representation which makes it hard to find literature that discusses this in detail.
In QT, the general way to represent probability measures is via DO (density operators). These produce entirely classic real probabilities between 0 and 1 and the sum over all outcomes still needs to be 1. So i want to know how their space differs from a classic measure space. One thing is of course that they are represented via matrices unlike in PT where a usual way to write measures is via real-values operators over the state space - i.e. vectors - using a specific basis for the space. Yet on the other hand the space of operators is itself a linear space so we can think of operators as vectors in that higher dimensional (operator) vector space. Since DOs must produce classic probabilities they form a small simplex within - same as probability measures do. I am looking for some literature that explore that space.
The thing is that when we focus on writing everything by the means of it, we can bring the QT formalism into a familiar form: if we forget the probability normalization of DOs for a second, we get a linear subspace and that has a basis. We are looking for a specific basis though - the barycentric coordinates: i.e. the vertices of the simplex which are special DOs of pure some states. This way we can represent any element of the simplex (any DO) as a positive semidefinite linear combination of the DO basis with total weight 1. That's useful when dealing with probabilities and the way PT does it. But represented in that basis, DOs look just like measures in PT.
Also notice that any transformation like ##\tilde U (\rho) := U \rho U^\dagger## is linear in ##\rho## since
$$\tilde U (a\rho_1 + b\rho_2) = U (a\rho_1 + b\rho_2) U^\dagger= a U \rho_1 U^\dagger+ b U \rho_2 U^\dagger = a \tilde U (\rho_1) + b \tilde U (\rho_2)$$
So in the vector space in which ##\rho## is a vector ##\tilde U## can be represented by a matrix and hence written as ##\tilde U \rho##. Note that matrices that maps the simplex onto itself expressed in barycentric coordinates are called stochastic matrices (i.e. operations that don't break probabilities).
The point is that when we represent things in this higher dimensional space everything starts to look very familiar.
In QT, the general way to represent probability measures is via DO (density operators). These produce entirely classic real probabilities between 0 and 1 and the sum over all outcomes still needs to be 1. So i want to know how their space differs from a classic measure space. One thing is of course that they are represented via matrices unlike in PT where a usual way to write measures is via real-values operators over the state space - i.e. vectors - using a specific basis for the space. Yet on the other hand the space of operators is itself a linear space so we can think of operators as vectors in that higher dimensional (operator) vector space. Since DOs must produce classic probabilities they form a small simplex within - same as probability measures do. I am looking for some literature that explore that space.
The thing is that when we focus on writing everything by the means of it, we can bring the QT formalism into a familiar form: if we forget the probability normalization of DOs for a second, we get a linear subspace and that has a basis. We are looking for a specific basis though - the barycentric coordinates: i.e. the vertices of the simplex which are special DOs of pure some states. This way we can represent any element of the simplex (any DO) as a positive semidefinite linear combination of the DO basis with total weight 1. That's useful when dealing with probabilities and the way PT does it. But represented in that basis, DOs look just like measures in PT.
Also notice that any transformation like ##\tilde U (\rho) := U \rho U^\dagger## is linear in ##\rho## since
$$\tilde U (a\rho_1 + b\rho_2) = U (a\rho_1 + b\rho_2) U^\dagger= a U \rho_1 U^\dagger+ b U \rho_2 U^\dagger = a \tilde U (\rho_1) + b \tilde U (\rho_2)$$
So in the vector space in which ##\rho## is a vector ##\tilde U## can be represented by a matrix and hence written as ##\tilde U \rho##. Note that matrices that maps the simplex onto itself expressed in barycentric coordinates are called stochastic matrices (i.e. operations that don't break probabilities).
The point is that when we represent things in this higher dimensional space everything starts to look very familiar.