|
- from graph import *
- import viz
- import itertools as it
- import clifford
-
-
- def local_complementation(g, vops, v):
- """ As defined in LISTING 1 of Anders & Briegel """
- for i, j in it.combinations(g[v], 2):
- toggle_edge(g, i, j)
-
- # Update VOPs
- vops[v] = clifford.times_table[vops[v]][clifford.sqx]
- for i in g[v]:
- vops[i] = clifford.times_table[vops[i]][clifford.msqz]
-
-
- def remove_vop(g, vops, a, b):
- """ Reduces VOP[a] to the identity, avoiding (if possible) the use of vertex b as a swapping partner """
- free_neighbours = g[a] - {b}
- c = b if len(free_neighbours) == 0 else free_neighbours.pop()
- d = clifford.decompositions[a]
- for v in reversed(d):
- target = a if v == clifford.sqx else b
- local_complementation(g, vops, target)
-
-
- if __name__ == '__main__':
- g, vops = graph()
- add_edge(g, 0, 1)
- add_edge(g, 1, 2)
- add_edge(g, 0, 2)
- add_edge(g, 0, 3)
-
- viz.draw(g, vops, "out.pdf")
- local_complementation(g, vops, 0)
- viz.draw(g, vops, "out2.pdf")
|
