UpCCGSD ansatz solver #372
Draft
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This PR introduces a full UpCCGSD operator-pool and stataprep solver implementation, constructed analogously to the current UCCGSD implementation. I also added analogous Python and C++ tests.
The UpCCGSD ansatz is the UCC ansatz with generalized singles and paired doubles, as described in this paper: https://arxiv.org/pdf/1810.02327.
UpCCGSD is lower-depth variant of UCCGSD in which double excitations are restricted to paired electron transfers between spatial orbitals, following the UpCC (unitary paired coupled-cluster) construction. While less expressive than full UCCGSD, it retains generalized spin-preserving singles and the most physically relevant pair-correlation channels, substantially reducing circuit depth and parameter count. This makes UpCCGSD attractive for larger systems or hardware-constrained regimes where UCCGSD is too costly.
@poojarao8