The first non-naïve deterministic algorithm to minimize the S-bandwidth of a quantum network (or, to be more precise, its graph representation), written in Julia.
(CURRENTLY UNDER DEVELOPMENT)
-
Notifications
You must be signed in to change notification settings - Fork 0
A dynamic algorithm to test a graph for S-diagonalizability and minimize its S-bandwidth, written in Julia.
License
GraphQuantum/SDiagonalizability.jl
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A dynamic algorithm to test a graph for S-diagonalizability and minimize its S-bandwidth, written in Julia.
Topics
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published