Closest N-representable Density Matrix (Semidefinite and Equality Constraints)
Nobody has claimed this yet.
- Dominant language
- C++
- Stars
- 35
- Forks
- 15
- PR merge metrics
- No merged PRs in 30d
Description
Semidefinite Constraints
In the Semidefinite Constraints the first step is to map the the density matrix, $\Gamma$ , to a positive semidefinite constraint. Do we have the definition of $\mathcal{L}(\Gamma)$ ?
Equality Constraints
In the Equality Constraints part if the equality is not satisfied do we need to check if $Tr[\mathbf{B}_m \Gamma] > 0$. If it's not, should we then replace $\mathbf{B}_m$ with $-\mathbf{B}_m$? After this adjustment, is the projection based on the constraint $Tr[\mathbf{B}_m \Gamma] \leq 0$?"
@PaulWAyers
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
No source files, tests, or entry points are named. Start by resolving the definitions and projection behavior asked about for the semidefinite and equality constraints; done requires a maintainer-confirmed explanation of L(Γ), the sign check, and the resulting projection constraint.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- cpp
- Domain
- hpc
- Issue type
- Documentation
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100