- Quantum Mechanics
- Relativity
- Visual Matrices
- Algorithms – Dasgupta, C. H. Papadimitriou, and U. V. Vazirani Great summary of the methods. See chapter 10 for very rapid to understand explanation of quantum gates and Shor algorithm – Local Copy
- Shor Algorithm by the numbers
- Poor Man's explanation of Kalman Filtering
- TerryTao.wordpress.com – high level mathematics in a blog. Has entries related to the prime number conjecture
- PolyMath Project: Page on prime numbers – the rest of the blog looks pretty good too
2 Comments
Its like you read my thoughts! You appear to grasp so much approximately this, such as you wrote the e-book in it or something. I believe that you just could do with some p.c. to drive the message house a little bit, however other than that, that is great blog. A fantastic read. I’ll definitely be back.
OK, so you’ve got a group G and a vector space V (let’s work over the field of colmpex numbers.) Then a representation G is a map from the elements of the group to linear transforms on V which is a homomorphism. What does this mean? Suppose f is the mapping from the group to the linear transforms on V (i.e. matrices.) Then this map is a homomorphism if it satisfies the property f(g_1) f(g_2) =f(g_1g_2) for all g_1,g_2 in the group. A trivial example of a representation is the representation which maps all elements of the group to the one by one matrix with entry 1. I.e. f(g)=[1] for all g in the group. Then you can easily see that f(g_1)f(g_2)=[1][1]=[1]=f(g_1g_2). This representation is called the trivial representation. Other reprsentations are not so trivial! The study of the representation theory of groups is a powerful tool for studying problems with symmetry. And in particular for quantum computers, where you want some structure for the problem you are working on, it is often useful to work with representations of groups.