bqth29 / simulated-bifurcation-algorithm

Python CPU/GPU implementation of the Simulated Bifurcation (SB) algorithm to solve quadratic optimization problems (QUBO, Ising, TSP, optimal asset allocations for a portfolio, etc.).

MIT License

103 stars 25 forks source link

💬 Pull Request Description

It is possible to determine the optimal value of some spins before entering the SB algorithm. This ensures that the spins will contribute optimally to the objective functions and they can therefore be removed from the optimization to allow a lighter Ising model to be optimized.

✔️ Check list

Before you open the pull request, make sure the following requirements are met.

[ ] The code matches the styling rules
[ ] The new code is covered by relevant tests
[ ] Documentation was added

🚀 New features

Make a comprehensive list of all the new features your pull request will bring.

🐞 Bug fixes

If your pull request fixed any bugs or problems in the code, list them here.

📣 Supplementary information

Use this section to include any other information you think might be relevant to whoever is reading the pull request.

Codecov Report

All modified and coverable lines are covered by tests :white_check_mark:

Project coverage is 100.00%. Comparing base (6194a9e) to head (67bfdc4).

Additional details and impacted files

```diff @@ Coverage Diff @@ ## main #54 +/- ## ========================================== Coverage 100.00% 100.00% ========================================== Files 36 40 +4 Lines 1600 1780 +180 ========================================== + Hits 1600 1780 +180 ```