| FazBrowse GitHub Viewer | Trending | | Home |
| Tools: [Original HTTPS Page] |
The code is mainly developed at the group for Applied Computational Science at SINTEF Digital.
So far our main repositories are:
This package is a flexible python implementation of the Quantum Approximate Optimization Algorithm /Quantum Alternating Operator ansatz (QAOA) aimed at researchers to readily test the performance of a new ansatz, a new classical optimizers, etc.
A scalable and efficient heuristic algorithm for determining a bipartition of a graph with the minimal cut rank.
Loading…
Loading…
| Back | FazBrowse Home | New Git URL |