-
### What should we add?
At the moment, `OptimizeSwapBeforeMeasure` has an unfortunate complexity where it iterates many times through a circuit, and looks like it even has a worst-case quadratic comp…
-
### What is the expected enhancement?
Update the code in https://github.com/Qiskit/rustworkx/blob/main/src/link_analysis.rs to use https://github.com/sarah-ek/faer-rs/.
The functions shoul…
-
The [Louvain algorithm](https://en.wikipedia.org/wiki/Louvain_method) is commonly used to identify communities in graphs, and is present in other libraries/tools such as [NetworkX](https://networkx.or…
-
### What is the expected enhancement?
Add a retworkx algorithm function for the `PatternMatch` algorithm from: https://arxiv.org/pdf/1909.05270.pdf
In qiskit terra there is a python implem…
-
The [Community Detection via Semi-Synchronous Label Propagation Algorithms](https://arxiv.org/abs/1103.4550) is commonly used to identify communities in graphs, and is present in other libraries/tools…
-
Graph representations are common in GP, but also in other domains, such as neural networks, job shop scheduling, and TSP.
-
### Description
I am wanting to read in a dataset of _paths_ which consist of a variable length list of xy coordinates.
One row entry could be `[[0,0], [1,1]]`, another could be `[[0,0], [1,1], …
-
A major bottleneck was found in agent_chains.py when profiling the performance profiles:
- 50% of the calculation time in the step function is used by agent_chains.py (find-conflics)
- agent-chain.p…
-
# The Future of Octopoes
## Introduction
Octopoes is the very core of OpenKAT's functionality. It contains all the relevant data gathered whether by declarations (by user input), observation (by B…
-
- Graph construction was implemented using `rustworkx` in #234, I want to mention that the `rustworkx` python interface is remarkably optimized. Using Python, we can build all graph-downstream analyse…