mqt.ionshuttler.single_shuttler.cycles¶

Module Contents¶

class MemoryZone(m: int, n: int, v: int, h: int, starting_config: dict[int, Edge], max_timestep: int, max_num_parking: int, pz: str, time_2qubit_gate: int = 2, time_1qubit_gate: int = 1)[source]¶

mz_Graph_creator¶

mz_graph¶

graph_creator¶

graph¶

starting_config¶

max_timestep¶

max_num_parking¶

time_2qubit_gate = 2¶

time_1qubit_gate = 1¶

num_ion_chains¶

idc_dict¶

dist_dict: dict[Edge, int]¶

dist_dict_nodes¶

ion_chains¶

junction_nodes¶

path_entry_to_exit = []¶

node_path_dict¶

get_state_idxs() → list[int][source]¶

update_distance_map() → dict[int, int][source]¶

count_chains_in_pz() → int[source]¶

count_chains_in_exit() → int[source]¶

count_chains_in_parking() → int[source]¶

find_chain_in_edge(edge_idc: Edge) → int | None[source]¶

find_chains_in_parking() → list[int][source]¶

find_next_edge(edge_idc: Edge, towards: Node | str = (0, 0)) → Edge[source]¶

find_ordered_edges(edge1: Edge, edge2: Edge) → tuple[Edge, Edge][source]¶

have_common_junction_node(edge1: Edge, edge2: Edge) → bool[source]¶

create_outer_circle(edge_idc: Edge, next_edge: Edge, other_next_edges: list[Edge], towards: Node = (0, 0)) → list[Edge][source]¶

check_if_edge_is_filled(edge_idc: Edge) → bool[source]¶

find_nonfree_and_free_circle_idxs(circles_dict: dict[int, list[Edge]]) → list[Node][source]¶

rotate(full_circle_idxs: list[int]) → dict[int, int][source]¶

bfs_free_edge(node: Node, other_next_edges: list[Edge]) → Edge[source]¶

find_least_import_chain_in_parking(seq: list[int], ions_in_parking: list[int]) → int[source]¶