The calculation efficiency problem

[lj-cug]

I'm interested at the HHL algorithm in Qpanda2, and now I generated 64 dimension sparse matrix A to test the HHL_Algorithm in QPanda2.
I found that the calculation is very slow when I increase the matrix's dimension or change the non-zero values in matrix, why? I'm not familar with quantum computation. I use the traditional PETSc solver (CG method et al.,) to solve my Poisson equation.
Could you please explain the reason or give me some suggestions?
Thanks
Li Jian

[shenzhi-git]

Thank you for your feedback, and thank you as well for testing and supporting the HHL_Algorithm in QPanda2. At present, the HHL implementation provided by QPanda2 is mainly intended for demonstration and educational purposes, and therefore has not undergone systematic optimization in terms of circuit design, numerical preconditioning, or algorithm-level improvements.When the matrix dimension grows larger or the sparsity pattern becomes more complex, the current implementation may inevitably exhibit performance bottlenecks.The in-depth optimization of the HHL algorithm is currently being advanced by a dedicated internal team.