iqm.qrisp_iqm.passes.routing.core.section_count_heuristic.compute_cp_2qb

Contents

iqm.qrisp_iqm.passes.routing.core.section_count_heuristic.compute_cp_2qb#

iqm.qrisp_iqm.passes.routing.core.section_count_heuristic.compute_cp_2qb(forward_dag: CircuitDAG, instruction_list: list) → int#

Compute the routing-relevant critical path length.

The longest path through the instruction DAG counting only 2-qubit gate nodes.

Single-qubit gates, measurements, and TerminatorNodes contribute weight 0 — they don’t create routing constraints.

Parameters:
  • forward_dag (tuple) – Circuit DAG as returned by convert_qc_to_sparse_dag().

  • instruction_list (list) – Instruction list from convert_qc_to_sparse_dag. Entries are Instruction objects or None (for terminator nodes).

Returns:

The 2-qubit critical path length.

Return type:

int