Title: Pauli class implementation for Hamiltonain decomposition.
Idea:
In 2023,
Reggio et al, used xz code for determining the commutation of the given two Pauli string, P1, P2. I found that we can construct more efficient implementation of Pauli group structure with two integer tuple, xz code including the next things.
- Fast commuting determination.
- Pauli matrix algebra of 2^n dimension as n length binary representation of integer.
- Matrix-xz code transformation.
The matrix-xz code transformation is achieved through application of "
Tensorized Pauli decomposition algorithm" method. They researched to find decomposed coefficient location of the given Hermit matrix. I found a transformation that xz code to corresponding coefficient location on the matrix.
Status:
as a prototype.
It was written in C at first, but python version also exists.
Matrix-xz code transformation routine is remained.
Involved Software
Tensorized Pauli decomposition algorithm paper code
Difficulty
Intermediate
Prerequisite Knowledge
Linear algebra,
Binary operation,
Basic group theory,
Project Length
175 hours