Stefan Krastanov

machine readable code information

11

It would be neat if besides human readable description, there is some more formal (maybe executable) description of the code, e.g. as a parity check matrix. I am setting up...

Simple Entanglement Switch

1

with tests and documentation based on "Maximizing Entanglement Rates via Efficient Memory Management in Flexible Quantum Switches" by Promponas et al (2024)

plot state information in tooltips in network visualizations (e.g. bloch spheres of phase space diagrams)

1

#94 has set the groundwork for this We need to think about what to do when the state is entangled with other locations

Currently we visualize states stored in registers as black diamonds. We should also have a way to denote states that are currently traveling through a channel, especially if they are...

#94 has set the groundwork for this

#94 has set the groundwork for this If a register slot is locked, show a small lock icon to the side

In #81 we now have a `SwapperProt`. It has a `nodeL` and `nodeR` properties which are then used by `query` to decide whether a pair of local slots are a...

Now that #81 is merged, we need to start trying to break it -- it is still rather fragile. - [x] Step 0: If we are going to have a...

an atomic tag-update function

1

Frequently we do ``` slot, tag = query(...) pop!(slot, tag) tag!(slot, tag) ``` This is fine as long as the `pop!` and `tag!` are next to each other, but it...

Tags should use a fast priority queue that resolves ties in FIFO order

1

`DataStructures.PriorityQueue` does not properly resolve ties (see https://github.com/JuliaCollections/DataStructures.jl/issues/498 ), hence we are using a slow simple `Vector` implementation currently (since #69 ). Implementing (and benchmarking) a potential new FIFO-tie-breaking priority...