That's might be true. I recently found that sympy also started to support basic quantum computation routines. However, the coverage is narrow comparing to the other frameworks.
I thought It would be useful for the researchers to work with Hamiltonian, but it is true that my proposal is more likely to focus on computationability of group element. 2024년 3월 29일 (금) 오후 8:29, Sangyub Lee <[email protected]>님이 작성: > I think that it is fairly a good proposal. > However, the only problems are that we may not be familiar with the > physics, or quantum computation, > or we may not have clear roadmap whether the algorithm is significantly > necessary for the module, > However, if you already have self-motivated knowledge and practice about > the topic, > some people may be able to guide to complete your work with with general > python programming or general mathematical background. > > On Thursday, March 21, 2024 at 1:57:36 PM UTC+1 [email protected] wrote: > >> Title: Pauli class implementation for Hamiltonain decomposition. >> >> *Idea*: >> In 2023, Reggio et al <http://arxiv.org/pdf/2305.11847.pdf>, 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 >> <http://github.com/HANTLUK/PauliDecomposition>" 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*: >> I almost implemented core structure and oprations in Opttrot repository >> <http://github.com/HYUNSEONG-KIM/OptTrot> of mine >> 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 >> > -- > You received this message because you are subscribed to the Google Groups > "sympy" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to [email protected]. > To view this discussion on the web visit > https://groups.google.com/d/msgid/sympy/985c27b8-299b-4bf0-9716-2330bfe244a9n%40googlegroups.com > <https://groups.google.com/d/msgid/sympy/985c27b8-299b-4bf0-9716-2330bfe244a9n%40googlegroups.com?utm_medium=email&utm_source=footer> > . > -- You received this message because you are subscribed to the Google Groups "sympy" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/sympy/CAGbF2aj4jZLaG-ygPd7DTZbkk0mQ0%2BS%2BAgmr_0t3nMkreOvToA%40mail.gmail.com.
