SU(N) solver is a hybrid algorithm designed for evaluating ground state energy of a hamiltonian. The ansatz to prepare the ground state is adaptively constructed using SU(n) starting from Hartree Fock state initialization.
This implementation has proved to reach ground state in fewer steps than the existing single pauli string based decomposition ansatz.
We would like to thank Shih-Yen Tseng (Qunasys) and Bo Peng (Cambridge) for their helpful discussions. K.C. is grateful for the financial support from both the Turing Scheme for the Imperial Global Fellows Fund and the Imperial QuEST Seed Fund. Special acknowledgement goes to the Quantum Open Source Foundation (QOSF) for their contributions and their quantum computing mentorship program.
Team name:
SU(N)-QSim
Team members:
Louis Chen Tina Oberoi Nicole
Project Description:
SU(N) solver is a hybrid algorithm designed for evaluating ground state energy of a hamiltonian. The ansatz to prepare the ground state is adaptively constructed using SU(n) starting from Hartree Fock state initialization.
This implementation has proved to reach ground state in fewer steps than the existing single pauli string based decomposition ansatz.
Presentation:
Presentation of QAGC challenge
Source code:
Submission Code
Your score (Optional)
Acknowledgements
We would like to thank Shih-Yen Tseng (Qunasys) and Bo Peng (Cambridge) for their helpful discussions. K.C. is grateful for the financial support from both the Turing Scheme for the Imperial Global Fellows Fund and the Imperial QuEST Seed Fund. Special acknowledgement goes to the Quantum Open Source Foundation (QOSF) for their contributions and their quantum computing mentorship program.