![]() ![]() ![]() Which makes them absurbly slow in some of the most simple tasks.įor example this. Those are just expend string input into a matrix, and then carryout matrix vector multiplication. Some are not even usnig symbolic computation. There are many Python library can do such symbolic quantum computation, however, not fast enough.Īlgorithm they use are naive, causing masive redundent runtime. Not because you don’t have to, it is just because coefficient is not the main concern in this research. You may try multipying those by hand, to confirm that they are valid.Īnd obviously these symbolic rules are valid, you can avoid matrix multiplication, and merely do the string manipulation. I tensor X = tensor X = Īnd the rules of multiplications are: I* = + * *I = + * XY = iZ YX = -iZ YZ = iX ZY = -iX ZX = iY XZ = -iY Then you can carry out tensor product to make larger matrix. Pauli decomposition: matrix A = summation(i) for example 4I + 2Y + 7X - 4Z + 3Y. Let say there is a matrix A, you are able to carry Pauli decomposition to it. In their matrix form I := X := Y := Z := The "i" in Y is the "i" of imaginary number. Pauli Operator a set of operation in quantum computing. ![]() Any Matrix can be expressed in sum of Pauli Operator. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |