Timeline for How to compute configurations (entropy) of a system?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 17, 2013 at 23:12 | vote | accept | Chirag | ||
| Feb 17, 2013 at 3:16 | comment | added | Freedom | Agree, but I like the use of the direct product symbol, which is better 'grammatically' | |
| Feb 17, 2013 at 2:30 | comment | added | Mark Mitchison | I don't think my argument is "more correct". Actually it is the same as what you have described here, apart from the following point. Your assumption: "objects cannot be superposed (we are ignoring combinations of states in $H_1$ and $H_2$)" is surely not correct. In order to calculate the entropy, your $\Omega$ should enumerate the number of classically distinguishable states. Arbitrary combinations of states in $H_1\otimes H_2$ are not distinguishable. There are only $\mathrm{dim}(H_1\otimes H_2)$ distinguishable states, hence your answer is correct with no assumption. | |
| Feb 16, 2013 at 16:41 | history | edited | Freedom | CC BY-SA 3.0 |
added 163 characters in body
|
| Feb 16, 2013 at 16:39 | history | undeleted | Freedom | ||
| Feb 14, 2013 at 3:23 | history | deleted | Freedom | ||
| Feb 14, 2013 at 3:19 | history | answered | Freedom | CC BY-SA 3.0 |