Anders and Briegel in Python
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

146 lines
3.4KB

  1. var abj = {};
  2. abj.node = {};
  3. abj.adj = {};
  4. abj.add_node = function(node, meta) {
  5. abj.adj[node] = {};
  6. abj.node[node] = {};
  7. abj.node[node].vop = tables.clifford.hadamard;
  8. Object.assign(abj.node[node], meta);
  9. };
  10. abj.add_nodes = function(nodes) {
  11. nodes.forEach(add_node);
  12. };
  13. abj.del_node = function(node) {
  14. for (var i in abj.adj[node]) {
  15. abj.del_edge(node, i);
  16. }
  17. delete abj.node[node];
  18. };
  19. abj.add_edge = function(a, b) {
  20. abj.adj[a][b] = {};
  21. abj.adj[b][a] = {};
  22. };
  23. abj.add_edges = function(edges) {
  24. edges.forEach(function(e) {
  25. add_edge(e[0], e[1]);
  26. });
  27. };
  28. abj.del_edge = function(a, b) {
  29. delete abj.adj[a][b];
  30. delete abj.adj[b][a];
  31. };
  32. abj.has_edge = function(a, b) {
  33. return Object.prototype.hasOwnProperty.call(abj.adj[a], b);
  34. };
  35. abj.toggle_edge = function(a, b) {
  36. if (abj.has_edge(a, b)) {
  37. abj.del_edge(a, b);
  38. } else {
  39. abj.add_edge(a, b);
  40. }
  41. };
  42. abj.get_swap = function(node, avoid) {
  43. for (var i in abj.adj[node]) {
  44. if (i != avoid) {
  45. return i;
  46. }
  47. }
  48. return avoid;
  49. };
  50. abj.remove_vop = function(node, avoid) {
  51. var swap_qubit = abj.get_swap(node, avoid);
  52. var decomposition = tables.decompositions[abj.node[node].vop];
  53. for (var i = decomposition.length - 1; i >= 0; --i) {
  54. var v = decomposition[i];
  55. abj.local_complementation(v == "x" ? node : swap_qubit);
  56. }
  57. };
  58. abj.local_complementation = function(node) {
  59. // TODO: inefficient
  60. var done = {};
  61. for (var i in abj.adj) {
  62. for (var j in abj.adj[i]) {
  63. var name = i>j ? [i,j] : [j,i];
  64. if (done[name]===false){
  65. abj.toggle_edge(i, j);
  66. done[name] = true;
  67. }
  68. }
  69. abj.node[i].vop = tables.times_table[abj.node[i].vop][6];
  70. }
  71. abj.node[node].vop = tables.times_table[abj.node[node].vop][14];
  72. };
  73. abj.act_local_rotation = function(node, operation) {
  74. var rotation = tables.clifford[operation];
  75. abj.node[node].vop = tables.times_table[rotation][abj.node[node].vop];
  76. };
  77. abj.act_hadamard = function(node) {
  78. abj.act_local_rotation(node, 10);
  79. };
  80. abj.is_sole_member = function(group, node) {
  81. var keys = Object.keys(group);
  82. return keys.length == 1 && keys[0] == node;
  83. };
  84. abj.act_cz = function(a, b) {
  85. if (abj.is_sole_member(abj.adj[a], b)) {
  86. abj.remove_vop(a, b);
  87. }
  88. if (abj.is_sole_member(abj.adj[b], a)) {
  89. abj.remove_vop(b, a);
  90. }
  91. if (abj.is_sole_member(abj.adj[a], b)) {
  92. abj.remove_vop(a, b);
  93. }
  94. var edge = abj.has_edge(a, b);
  95. var new_state = tables.cz_table[edge ? 1 : 0][abj.node[a].vop][abj.node[b].vop];
  96. abj.node[a].vop = new_state[1];
  97. abj.node[b].vop = new_state[2];
  98. if (new_state[0] != edge) {
  99. abj.toggle_edge(a, b);
  100. }
  101. };
  102. abj.edgelist = function() {
  103. var seen = {};
  104. var output = [];
  105. for (var i in abj.adj) {
  106. for (var j in abj.adj[i]) {
  107. if (!Object.prototype.hasOwnProperty.call(seen, j)) {
  108. output.push([i, j]);
  109. }
  110. }
  111. seen[i] = true;
  112. }
  113. return output;
  114. };
  115. abj.log_graph_state = function() {
  116. console.log(JSON.stringify(abj.node));
  117. console.log(JSON.stringify(abj.adj));
  118. };
  119. abj.update = function(newState) {
  120. abj.node = newState.node;
  121. abj.adj = newState.adj;
  122. };
  123. abj.order = function(){
  124. return Object.keys(abj.node).length;
  125. };