iqm-benchmarks 2.3__py3-none-any.whl → 2.5__py3-none-any.whl

iqm/benchmarks/optimization/qscore.py

@@ -1,53 +1,571 @@
-# Copyright 2024 IQM Benchmarks developers
-#
-# Licensed under the Apache License, Version 2.0 (the "License");
-# you may not use this file except in compliance with the License.
-# You may obtain a copy of the License at
-#
-#     http://www.apache.org/licenses/LICENSE-2.0
-#
-# Unless required by applicable law or agreed to in writing, software
-# distributed under the License is distributed on an "AS IS" BASIS,
-# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-# See the License for the specific language governing permissions and
-# limitations under the License.
-
 """
-Q-score benchmark
+Qscore benchmark
 """
 
 import itertools
 import logging
 from time import strftime
-from typing import Callable, Dict, List, Literal, Optional, Tuple, Type
+from typing import Callable, Dict, List, Literal, Optional, Sequence, Tuple, Type, cast
 
 from matplotlib.figure import Figure
 import matplotlib.pyplot as plt
 from networkx import Graph
 import networkx as nx
 import numpy as np
+from qiskit import QuantumCircuit
 from scipy.optimize import basinhopping, minimize
-
-from iqm.benchmarks.benchmark import BenchmarkBase, BenchmarkConfigurationBase
+import xarray as xr
+
+from iqm.benchmarks.benchmark import BenchmarkConfigurationBase
+from iqm.benchmarks.benchmark_definition import (
+    Benchmark,
+    BenchmarkAnalysisResult,
+    BenchmarkObservation,
+    BenchmarkObservationIdentifier,
+    BenchmarkRunResult,
+    add_counts_to_dataset,
+)
+from iqm.benchmarks.circuit_containers import BenchmarkCircuit, CircuitGroup, Circuits
 from iqm.benchmarks.logging_config import qcvv_logger
-from iqm.benchmarks.utils import perform_backend_transpilation, retrieve_all_counts, submit_execute, timeit
-from iqm.qiskit_iqm import IQMCircuit as QuantumCircuit
+from iqm.benchmarks.utils import (  # execute_with_dd,
+    perform_backend_transpilation,
+    retrieve_all_counts,
+    submit_execute,
+    xrvariable_to_counts,
+)
 from iqm.qiskit_iqm.iqm_backend import IQMBackendBase
 
 
-class QScoreBenchmark(BenchmarkBase):
+def calculate_optimal_angles_for_QAOA_p1(graph: Graph) -> List[float]:
+    """Calculates the optimal angles for single layer QAOA MaxCut ansatz.
+
+    Args:
+        graph (networkx graph): the MaxCut problem graph.
+
+    Returns:
+        List[float]: optimal angles gamma and beta.
+
+    """
+
+    def get_Zij_maxcut_p1(edge_ij, gamma, beta):
+        """
+        Calculates <p1_QAOA | Z_i Z_j | p1_QAOA>, assuming ij is edge of G.
+        """
+        i, j = edge_ij
+        di = graph.degree[i]
+        dj = graph.degree[j]
+
+        first = np.cos(2 * gamma) ** (di - 1) + np.cos(2 * gamma) ** (dj - 1)
+        first *= 0.5 * np.sin(4 * beta) * np.sin(2 * gamma)
+
+        node_list = list(graph.nodes).copy()
+        node_list.remove(i)
+        node_list.remove(j)
+        f1 = 1
+        f2 = 1
+        for k in node_list:
+            if graph.has_edge(i, k) and graph.has_edge(j, k):  # ijk is triangle
+                f1 *= np.cos(4 * gamma)
+            elif graph.has_edge(i, k) or graph.has_edge(j, k):  # ijk is no triangle
+                f1 *= np.cos(2 * gamma)
+                f2 *= np.cos(2 * gamma)
+        second = 0.5 * np.sin(2 * beta) ** 2 * (f1 - f2)
+        return first - second
+
+    def get_expected_zz_edgedensity(x):
+        gamma = x[0]
+        beta = x[1]
+        # pylint: disable=consider-using-generator
+        return sum([get_Zij_maxcut_p1(edge, gamma, beta) for edge in graph.edges]) / graph.number_of_edges()
+
+    bounds = [(0.0, np.pi / 2), (-np.pi / 4, 0.0)]
+    x_init = [0.15, -0.28]
+
+    minimizer_kwargs = {"method": "L-BFGS-B", "bounds": bounds}
+    res = basinhopping(get_expected_zz_edgedensity, x_init, minimizer_kwargs=minimizer_kwargs, niter=10, T=2)
+
+    return res.x
+
+
+def cut_cost_function(x: str, graph: Graph) -> int:
+    """Returns the number of cut edges in a graph (with minus sign).
+
+    Args:
+        x (str): solution bitstring.
+        graph (networkx graph): the MaxCut problem graph.
+
+    Returns:
+        obj (float): number of cut edges multiplied by -1.
+    """
+    obj = 0
+    for i, j in graph.edges():
+        if x[i] != x[j]:
+            obj += 1
+    return -1 * obj
+
+
+def compute_expectation_value(
+    counts: Dict[str, int], graph: Graph, qubit_to_node: Dict[int, int], virtual_nodes: List[Tuple[int, int]]
+) -> float:
+    """Computes expectation value based on measurement results.
+
+    Args:
+        counts (Dict[str, int]): key as bitstring, val as count
+        graph (networkx) graph: the MaxCut problem graph
+        qubit_to_node (Dict[int, int]): mapping of qubit to nodes of the graph
+        virtual_nodes (List[Tuple[int, int]]): list of virtual nodes in the graph
+
+    Returns:
+        avg (float): expectation value of the cut edges for number of counts
+    """
+
+    avg = 0
+    sum_count = 0
+    for bitstring_aux, count in counts.items():
+        bitstring_aux_list = list(bitstring_aux)[::-1]  # go from qiskit endianness to networkx endianness
+
+        # map the qubits back to nodes
+        bitstring = [""] * (len(bitstring_aux_list) + len(virtual_nodes))
+        for qubit, node in qubit_to_node.items():
+            bitstring[node] = bitstring_aux_list[qubit]
+
+        # insert virtual node(s) to bitstring
+        for virtual_node in virtual_nodes:
+            if virtual_node[0] is not None:
+                bitstring[virtual_node[0]] = str(virtual_node[1])
+
+        obj = cut_cost_function("".join(bitstring), graph)
+        avg += obj * count
+        sum_count += count
+
+    return avg / sum_count
+
+
+def create_objective_function(
+    counts: Dict[str, int], graph: Graph, qubit_to_node: Dict[int, int], virtual_nodes: List[Tuple[int, int]]
+) -> Callable:
+    """
+    Creates a function that maps the parameters to the parametrized circuit,
+    runs it and computes the expectation value.
+
+    Args:
+        counts (Dict[str, int]): The dictionary of bitstring counts.
+        graph (networkx graph): the MaxCut problem graph.
+        qubit_to_node (Dict[int, int]): mapping of qubit to nodes of the graph
+        virtual_nodes (List[Tuple[int, int]]): list of virtual nodes in the graph
+    Returns:
+        callable: function that gives expectation value of the cut edges from counts sampled from the ansatz
+    """
+
+    def objective_function(temp):
+        temp = np.array(temp)
+        return compute_expectation_value(counts, graph, qubit_to_node, virtual_nodes)
+
+    return objective_function
+
+
+def is_successful(
+    approximation_ratio: float,
+) -> bool:
+    """Check whether a Q-score benchmark returned approximation ratio above beta*, therefore being successful.
+
+    This condition checks that the mean approximation ratio is above the beta* = 0.2 threshold.
+
+    Args:
+        approximation_ratio (float): the mean approximation ratio of all problem graphs
+
+    Returns:
+        bool: whether the Q-score benchmark was successful
+    """
+    return bool(approximation_ratio > 0.2)
+
+
+def plot_approximation_ratios(
+    nodes: list[int],
+    beta_ratio: list[float],
+    beta_std: list[float],
+    use_virtual_node: Optional[bool],
+    use_classically_optimized_angles: Optional[bool],
+    num_instances: int,
+    backend_name: str,
+    timestamp: str,
+) -> tuple[str, Figure]:
+    """Generate the figure of approximation ratios vs number of nodes,
+        including standard deviation and the acceptance threshold.
+
+    Args:
+        nodes (list[int]): list nodes for the problem graph sizes.
+        beta_ratio (list[float]): Beta ratio calculated for each graph size.
+        beta_std (list[float]): Standard deviation for beta ratio of each graph size.
+        use_virtual_node (Optional[bool]): whether to use virtual nodes or not.
+        use_classically_optimized_angles (Optional[bool]): whether to use classically optimized angles or not.
+        num_instances (int): the number of instances.
+        backend_name (str): the name of the backend.
+        timestamp (str): the timestamp of the execution of the experiment.
+
+    Returns:
+        str: the name of the figure.
+        Figure: the figure.
+    """
+
+    fig = plt.figure()
+    ax = plt.axes()
+
+    plt.axhline(0.2, color="red", linestyle="dashed", label="Threshold")
+    plt.errorbar(
+        nodes,
+        beta_ratio,
+        yerr=beta_std,
+        fmt="-o",
+        capsize=10,
+        markersize=8,
+        color="#759DEB",
+        label="Approximation ratio",
+    )
+
+    ax.set_ylabel(r"Q-score ratio $\beta(n)$")
+    ax.set_xlabel("Number of nodes $(n)$")
+    plt.xticks(range(min(nodes), max(nodes) + 1))
+    plt.legend(loc="lower right")
+    plt.grid(True)
+
+    if use_virtual_node and use_classically_optimized_angles:
+        title = f"Q-score, {num_instances} instances, with virtual node and classically optimized angles\nBackend: {backend_name} / {timestamp}"
+    elif use_virtual_node and not use_classically_optimized_angles:
+        title = f"Q-score, {num_instances} instances, with virtual node \nBackend: {backend_name} / {timestamp}"
+    elif not use_virtual_node and use_classically_optimized_angles:
+        title = f"Q-score, {num_instances} instances, with classically optimized angles\nBackend: {backend_name} / {timestamp}"
+    else:
+        title = f"Q-score, {num_instances} instances \nBackend: {backend_name} / {timestamp}"
+
+    plt.title(
+        title,
+        fontsize=9,
+    )
+    fig_name = f"{max(nodes)}_nodes_{num_instances}_instances.png"
+
+    # Show plot if verbose is True
+    plt.gcf().set_dpi(250)
+
+    plt.close()
+
+    return fig_name, fig
+
+
+def qscore_analysis(run: BenchmarkRunResult) -> BenchmarkAnalysisResult:
+    """Analysis function for a QScore experiment
+
+    Args:
+        run (RunResult): A QScore experiment run for which analysis result is created
+    Returns:
+        AnalysisResult corresponding to QScore
+    """
+
+    plots = {}
+    observations: list[BenchmarkObservation] = []
+    dataset = run.dataset.copy(deep=True)
+
+    backend_name = dataset.attrs["backend_name"]
+    timestamp = dataset.attrs["execution_timestamp"]
+
+    max_num_nodes = dataset.attrs["max_num_nodes"]
+    min_num_nodes = dataset.attrs["min_num_nodes"]
+    num_instances: int = dataset.attrs["num_instances"]
+
+    use_virtual_node: bool = dataset.attrs["use_virtual_node"]
+    use_classically_optimized_angles = dataset.attrs["use_classically_optimized_angles"]
+    num_qaoa_layers = dataset.attrs["num_qaoa_layers"]
+
+    qscore = 0
+    nodes_list = list(range(min_num_nodes, max_num_nodes + 1))
+    beta_ratio_list = []
+    beta_ratio_std_list = []
+    for num_nodes in nodes_list:
+        # Retrieve counts for all the instances within each executed node size.
+        execution_results = xrvariable_to_counts(dataset, num_nodes, num_instances)
+
+        # Retrieve other dataset values
+        dataset_dictionary = dataset.attrs[num_nodes]
+
+        # node_set_list = dataset_dictionary["qubit_set"]
+        graph_list = dataset_dictionary["graph"]
+        qubit_to_node_list = dataset_dictionary["qubit_to_node"]
+        virtual_node_list = dataset_dictionary["virtual_nodes"]
+        no_edge_instances = dataset_dictionary["no_edge_instances"]
+
+        cut_sizes_list = [0.0] * len(no_edge_instances)
+        instances_with_edges = set(range(num_instances)) - set(no_edge_instances)
+
+        for inst_idx in list(instances_with_edges):
+            cut_sizes = run_QAOA(
+                execution_results[inst_idx],
+                graph_list[inst_idx],
+                qubit_to_node_list[inst_idx],
+                use_classically_optimized_angles,
+                num_qaoa_layers,
+                virtual_node_list[inst_idx],
+            )
+            cut_sizes_list.append(cut_sizes)
+
+        ## compute the approximation ratio beta
+        LAMBDA = 0.178
+
+        average_cut_size = np.mean(cut_sizes_list) - num_nodes * (num_nodes - 1) / 8
+        average_best_cut_size = 0.178 * pow(num_nodes, 3 / 2)
+        approximation_ratio = float(average_cut_size / average_best_cut_size)
+
+        approximation_ratio_list = [
+            (np.array(cut_sizes) - num_nodes * (num_nodes - 1) / 8) / (LAMBDA * num_nodes ** (3 / 2))
+            for cut_sizes in cut_sizes_list
+        ]
+        beta_ratio_list.append(np.mean(approximation_ratio_list))
+        success = is_successful(approximation_ratio)
+        std_of_approximation_ratio = np.std(np.array(approximation_ratio_list)) / np.sqrt(
+            len(approximation_ratio_list) - 1
+        )
+        beta_ratio_std_list.append(std_of_approximation_ratio)
+
+        if success:
+            qcvv_logger.info(
+                f"Q-Score = {num_nodes} passed with approximation ratio (Beta) {approximation_ratio:.4f}; Avg MaxCut size: {np.mean(cut_sizes_list):.4f}"
+            )
+            qscore = num_nodes
+        else:
+            qcvv_logger.info(
+                f"Q-Score = {num_nodes} failed with approximation ratio (Beta) {approximation_ratio:.4f} < 0.2; Avg MaxCut size: {np.mean(cut_sizes_list):.4f}"
+            )
+        observations.extend(
+            [
+                BenchmarkObservation(
+                    name="approximation_ratio",
+                    value=approximation_ratio,
+                    uncertainty=std_of_approximation_ratio,
+                    identifier=BenchmarkObservationIdentifier(num_nodes),
+                ),
+                BenchmarkObservation(
+                    name="is_succesful",
+                    value=str(success),
+                    identifier=BenchmarkObservationIdentifier(num_nodes),
+                ),
+                BenchmarkObservation(
+                    name="Qscore_result",
+                    value=qscore if success else 1,
+                    identifier=BenchmarkObservationIdentifier(num_nodes),
+                ),
+            ]
+        )
+
+        dataset.attrs[num_nodes].update(
+            {
+                "approximate_ratio_list": approximation_ratio_list,
+            }
+        )
+
+    fig_name, fig = plot_approximation_ratios(
+        nodes_list,
+        beta_ratio_list,
+        beta_ratio_std_list,
+        use_virtual_node,
+        use_classically_optimized_angles,
+        num_instances,
+        backend_name,
+        timestamp,
+    )
+    plots[fig_name] = fig
+
+    return BenchmarkAnalysisResult(dataset=dataset, plots=plots, observations=observations)
+
+
+def run_QAOA(
+    counts: Dict[str, int],
+    graph_physical: Graph,
+    qubit_node: Dict[int, int],
+    use_classical_angles: bool,
+    qaoa_layers: int,
+    virtual_nodes: List[Tuple[int, int]],
+) -> float:
+    """
+    Solves the cut size of MaxCut for a graph using QAOA.
+    The result is average value sampled from the optimized ansatz.
+
+    Args:
+        counts (Dict[str, int]): key as bitstring, value as counts
+        graph_physical (Graph): the graph to be optimized
+        qubit_node (Dict[int, int]): the qubit to be optimized
+        use_classical_angles (bool): whether to use classical angles
+        qaoa_layers (int): the number of QAOA layers
+        virtual_nodes (List[Tuple[int, int]]): the presence of virtual nodes or not
+
+    Returns:
+        float: the expectation value of the maximum cut size.
+
+    """
+
+    objective_function = create_objective_function(counts, graph_physical, qubit_node, virtual_nodes)
+    if use_classical_angles:
+        if graph_physical.number_of_edges() != 0:
+            opt_angles = calculate_optimal_angles_for_QAOA_p1(graph_physical)
+        else:
+            opt_angles = [1.0, 1.0]
+        res = minimize(objective_function, opt_angles, method="COBYLA", tol=1e-5, options={"maxiter": 0})
+    else:
+        # Good initial angles from from Wurtz et.al. "The fixed angle conjecture for QAOA on regular MaxCut graphs." arXiv preprint arXiv:2107.00677 (2021).
+        OPTIMAL_INITIAL_ANGLES = {
+            "1": [-0.616, 0.393 / 2],
+            "2": [-0.488, 0.898 / 2, 0.555 / 2, 0.293 / 2],
+            "3": [-0.422, 0.798 / 2, 0.937 / 2, 0.609 / 2, 0.459 / 2, 0.235 / 2],
+            "4": [-0.409, 0.781 / 2, 0.988 / 2, 1.156 / 2, 0.600 / 2, 0.434 / 2, 0.297 / 2, 0.159 / 2],
+            "5": [-0.36, -0.707, -0.823, -1.005, -1.154, 0.632 / 2, 0.523 / 2, 0.390 / 2, 0.275 / 2, 0.149 / 2],
+            "6": [
+                -0.331,
+                -0.645,
+                -0.731,
+                -0.837,
+                -1.009,
+                -1.126,
+                0.636 / 2,
+                0.535 / 2,
+                0.463 / 2,
+                0.360 / 2,
+                0.259 / 2,
+                0.139 / 2,
+            ],
+            "7": [
+                -0.310,
+                -0.618,
+                -0.690,
+                -0.751,
+                -0.859,
+                -1.020,
+                -1.122,
+                0.648 / 2,
+                0.554 / 2,
+                0.490 / 2,
+                0.445 / 2,
+                0.341 / 2,
+                0.244 / 2,
+                0.131 / 2,
+            ],
+            "8": [
+                -0.295,
+                -0.587,
+                -0.654,
+                -0.708,
+                -0.765,
+                -0.864,
+                -1.026,
+                -1.116,
+                0.649 / 2,
+                0.555 / 2,
+                0.500 / 2,
+                0.469 / 2,
+                0.420 / 2,
+                0.319 / 2,
+                0.231 / 2,
+                0.123 / 2,
+            ],
+            "9": [
+                -0.279,
+                -0.566,
+                -0.631,
+                -0.679,
+                -0.726,
+                -0.768,
+                -0.875,
+                -1.037,
+                -1.118,
+                0.654 / 2,
+                0.562 / 2,
+                0.509 / 2,
+                0.487 / 2,
+                0.451 / 2,
+                0.403 / 2,
+                0.305 / 2,
+                0.220 / 2,
+                0.117 / 2,
+            ],
+            "10": [
+                -0.267,
+                -0.545,
+                -0.610,
+                -0.656,
+                -0.696,
+                -0.729,
+                -0.774,
+                -0.882,
+                -1.044,
+                -1.115,
+                0.656 / 2,
+                0.563 / 2,
+                0.514 / 2,
+                0.496 / 2,
+                0.496 / 2,
+                0.436 / 2,
+                0.388 / 2,
+                0.291 / 2,
+                0.211 / 2,
+                0.112 / 2,
+            ],
+            "11": [
+                -0.257,
+                -0.528,
+                -0.592,
+                -0.640,
+                -0.677,
+                -0.702,
+                -0.737,
+                -0.775,
+                -0.884,
+                -1.047,
+                -1.115,
+                0.656 / 2,
+                0.563 / 2,
+                0.516 / 2,
+                0.504 / 2,
+                0.482 / 2,
+                0.456 / 2,
+                0.421 / 2,
+                0.371 / 2,
+                0.276 / 2,
+                0.201 / 2,
+                0.107 / 2,
+            ],
+        }
+
+        theta = OPTIMAL_INITIAL_ANGLES[str(qaoa_layers)]
+        bounds = [(-np.pi, np.pi)] * qaoa_layers + [(0.0, np.pi)] * qaoa_layers
+
+        res = minimize(
+            objective_function,
+            theta,
+            bounds=bounds,
+            method="COBYLA",
+            tol=1e-5,
+            options={"maxiter": 300},
+        )
+
+    return -res.fun
+
+
+class QScoreBenchmark(Benchmark):
     """
     Q-score estimates the size of combinatorial optimization problems a given number of qubits can execute with meaningful results.
     """
 
-    def __init__(self, backend: IQMBackendBase, configuration: "QScoreConfiguration"):
+    analysis_function = staticmethod(qscore_analysis)
+
+    name: str = "qscore"
+
+    def __init__(self, backend_arg: IQMBackendBase, configuration: "QScoreConfiguration"):
         """Construct the QScoreBenchmark class.
 
         Args:
-            backend (IQMBackendBase): the backend to execute the benchmark on
+            backend_arg (IQMBackendBase): the backend to execute the benchmark on
             configuration (QScoreConfiguration): the configuration of the benchmark
         """
-        super().__init__(backend, configuration)
+        super().__init__(backend_arg, configuration)
+
+        self.backend_configuration_name = backend_arg if isinstance(backend_arg, str) else backend_arg.name
 
         self.num_instances = configuration.num_instances
         self.num_qaoa_layers = configuration.num_qaoa_layers
@@ -58,7 +576,8 @@ class QScoreBenchmark(BenchmarkBase):
         self.choose_qubits_routine = configuration.choose_qubits_routine
         self.qiskit_optim_level = configuration.qiskit_optim_level
         self.optimize_sqg = configuration.optimize_sqg
-        self.timestamp = strftime("%Y%m%d-%H%M%S")
+        self.session_timestamp = strftime("%Y%m%d-%H%M%S")
+        self.execution_timestamp = ""
         self.seed = configuration.seed
 
         self.graph_physical: Graph
@@ -66,6 +585,11 @@ class QScoreBenchmark(BenchmarkBase):
         self.node_to_qubit: Dict[int, int]
         self.qubit_to_node: Dict[int, int]
 
+        # Initialize the variable to contain all QScore circuits
+        self.circuits = Circuits()
+        self.untranspiled_circuits = BenchmarkCircuit(name="untranspiled_circuits")
+        self.transpiled_circuits = BenchmarkCircuit(name="transpiled_circuits")
+
         if self.use_classically_optimized_angles and self.num_qaoa_layers > 1:
             raise ValueError("If the `use_classically_optimized_angles` is chosen, the `num_qaoa_layers` must be 1.")
 
@@ -73,11 +597,9 @@ class QScoreBenchmark(BenchmarkBase):
             raise ValueError("If the `use_virtual_node` is chosen, the `num_qaoa_layers` must be 1.")
 
         if self.choose_qubits_routine == "custom":
-            self.custom_qubits_array = configuration.custom_qubits_array
-
-    @staticmethod
-    def name() -> str:
-        return "qscore"
+            self.custom_qubits_array = [
+                list(x) for x in cast(Sequence[Sequence[int]], configuration.custom_qubits_array)
+            ]
 
     def generate_maxcut_ansatz(  # pylint: disable=too-many-branches
         self,
@@ -96,8 +618,6 @@ class QScoreBenchmark(BenchmarkBase):
         gamma = theta[: self.num_qaoa_layers]
         beta = theta[self.num_qaoa_layers :]
 
-        num_qubits = self.graph_physical.number_of_nodes()
-
         if self.graph_physical.number_of_nodes() != graph.number_of_nodes():
             num_qubits = self.graph_physical.number_of_nodes()
             # re-label the nodes to be between 0 and _num_qubits
@@ -111,7 +631,6 @@ class QScoreBenchmark(BenchmarkBase):
         # in case the graph is trivial: return empty circuit
         if num_qubits == 0:
             return QuantumCircuit(1)
-
         qaoa_qc = QuantumCircuit(num_qubits)
         for i in range(0, num_qubits):
             qaoa_qc.h(i)
@@ -136,335 +655,24 @@ class QScoreBenchmark(BenchmarkBase):
             for i in range(0, num_qubits):
                 qaoa_qc.rx(2 * beta[layer], i)
         qaoa_qc.measure_all()
-
         return qaoa_qc
 
-    @staticmethod
-    def cost_function(x: str, graph: Graph) -> int:
-        """Returns the number of cut edges in a graph (with minus sign).
-
-        Args:
-            x (str): solution bitstring.
-            graph (networkx graph): the MaxCut problem graph.
-
-        Returns:
-            obj (float): number of cut edges multiplied by -1.
-        """
-
-        obj = 0
-        for i, j in graph.edges():
-            if x[i] != x[j]:
-                obj += 1
-
-        return -1 * obj
-
-    def compute_expectation_value(self, counts: Dict[str, int], graph: Graph) -> float:
-        """Computes expectation value based on measurement results.
-
-        Args:
-            counts (Dict[str, int]): key as bitstring, val as count
-            graph (networkx) graph: the MaxCut problem graph
-
-        Returns:
-            avg (float): expectation value of the cut edges for number of counts
-        """
-
-        avg = 0
-        sum_count = 0
-        for bitstring_aux, count in counts.items():
-            bitstring_aux_list = list(bitstring_aux)[::-1]  # go from qiskit endianness to networkx endianness
-
-            # map the qubits back to nodes
-            bitstring = [""] * (len(bitstring_aux_list) + len(self.virtual_nodes))
-            for qubit, node in self.qubit_to_node.items():
-                bitstring[node] = bitstring_aux_list[qubit]
-
-            # insert virtual node(s) to bitstring
-            for virtual_node in self.virtual_nodes:
-                if virtual_node[0] is not None:
-                    bitstring[virtual_node[0]] = str(virtual_node[1])
-
-            obj = self.cost_function("".join(bitstring), graph)
-            avg += obj * count
-            sum_count += count
-
-        return avg / sum_count
-
-    def create_objective_function(self, graph: Graph, qubit_set: List[int]) -> Callable:
-        """
-        Creates a function that maps the parameters to the parametrized circuit,
-        runs it and computes the expectation value.
-
-        Args:
-            graph (networkx graph): the MaxCut problem graph.
-            qubit_set (List[int]): indices of the used qubits.
-        Returns:
-            callable: function that gives expectation value of the cut edges from counts sampled from the ansatz
-        """
-
-        def objective_function(theta):
-            qc = self.generate_maxcut_ansatz(graph, theta)
-
-            if len(qc.count_ops()) == 0:
-                counts = {"": 1.0}  # to handle the case of physical graph with no edges
-
-            else:
-                coupling_map = self.backend.coupling_map.reduce(qubit_set)
-                qcvv_logger.setLevel(logging.WARNING)
-                transpiled_qc_list, _ = perform_backend_transpilation(
-                    [qc],
-                    backend=self.backend,
-                    qubits=qubit_set,
-                    coupling_map=coupling_map,
-                    qiskit_optim_level=self.qiskit_optim_level,
-                    optimize_sqg=self.optimize_sqg,
-                    routing_method=self.routing_method,
-                )
-
-                sorted_transpiled_qc_list = {tuple(qubit_set): transpiled_qc_list}
-                # Execute on the backend
-                jobs, _ = submit_execute(
-                    sorted_transpiled_qc_list,
-                    self.backend,
-                    self.shots,
-                    self.calset_id,
-                    max_gates_per_batch=self.max_gates_per_batch,
-                )
-
-                counts = retrieve_all_counts(jobs)[0][0]
-                qcvv_logger.setLevel(logging.INFO)
-
-            return self.compute_expectation_value(counts, graph)
-
-        return objective_function
-
-    @staticmethod
-    def calculate_optimal_angles_for_QAOA_p1(graph: Graph) -> List[float]:
-        """
-        Calculates the optimal angles for single layer QAOA MaxCut ansatz.
-
-        Args:
-            graph (networkx graph): the MaxCut problem graph.
-
-        Returns:
-            List[float]: optimal angles gamma and beta.
-
-        """
-
-        def get_Zij_maxcut_p1(edge_ij, gamma, beta):
-            """
-            Calculates <p1_QAOA | Z_i Z_j | p1_QAOA>, assuming ij is edge of G.
-            """
-            i, j = edge_ij
-            di = graph.degree[i]
-            dj = graph.degree[j]
-
-            first = np.cos(2 * gamma) ** (di - 1) + np.cos(2 * gamma) ** (dj - 1)
-            first *= 0.5 * np.sin(4 * beta) * np.sin(2 * gamma)
-
-            node_list = list(graph.nodes).copy()
-            node_list.remove(i)
-            node_list.remove(j)
-            f1 = 1
-            f2 = 1
-            for k in node_list:
-                if graph.has_edge(i, k) and graph.has_edge(j, k):  # ijk is triangle
-                    f1 *= np.cos(4 * gamma)
-                elif graph.has_edge(i, k) or graph.has_edge(j, k):  # ijk is no triangle
-                    f1 *= np.cos(2 * gamma)
-                    f2 *= np.cos(2 * gamma)
-            second = 0.5 * np.sin(2 * beta) ** 2 * (f1 - f2)
-            return first - second
-
-        def get_expected_zz_edgedensity(x):
-            gamma = x[0]
-            beta = x[1]
-            # pylint: disable=consider-using-generator
-            return sum([get_Zij_maxcut_p1(edge, gamma, beta) for edge in graph.edges]) / graph.number_of_edges()
-
-        bounds = [(0.0, np.pi / 2), (-np.pi / 4, 0.0)]
-        x_init = [0.15, -0.28]
-
-        minimizer_kwargs = {"method": "L-BFGS-B", "bounds": bounds}
-        res = basinhopping(get_expected_zz_edgedensity, x_init, minimizer_kwargs=minimizer_kwargs, niter=10, T=2)
-
-        return res.x
-
-    def run_QAOA(self, graph: Graph, qubit_set: List[int]) -> float:
-        """
-        Solves the cut size of MaxCut for a graph using QAOA.
-        The result is average value sampled from the optimized ansatz.
+    def add_all_meta_to_dataset(self, dataset: xr.Dataset):
+        """Adds all configuration metadata and circuits to the dataset variable
 
         Args:
-            graph (networkx graph): the MaxCut problem graph.
-            qubit_set (List[int]): indices of the used qubits.
-
-        Returns:
-            float: the expectation value of the maximum cut size.
-
+            dataset (xr.Dataset): The xarray dataset
         """
-
-        objective_function = self.create_objective_function(graph, qubit_set)
-
-        if self.use_classically_optimized_angles:
-            if self.graph_physical.number_of_edges() != 0:
-                opt_angles = self.calculate_optimal_angles_for_QAOA_p1(self.graph_physical)
+        dataset.attrs["session_timestamp"] = self.session_timestamp
+        dataset.attrs["execution_timestamp"] = self.execution_timestamp
+        dataset.attrs["backend_configuration_name"] = self.backend_configuration_name
+        dataset.attrs["backend_name"] = self.backend.name
+
+        for key, value in self.configuration:
+            if key == "benchmark":  # Avoid saving the class object
+                dataset.attrs[key] = value.name
             else:
-                opt_angles = [1.0, 1.0]
-            res = minimize(objective_function, opt_angles, method="COBYLA", tol=1e-5, options={"maxiter": 0})
-        else:
-            # Good initial angles from from Wurtz et.al. "The fixed angle conjecture for QAOA on regular MaxCut graphs." arXiv preprint arXiv:2107.00677 (2021).
-            OPTIMAL_INITIAL_ANGLES = {
-                "1": [-0.616, 0.393 / 2],
-                "2": [-0.488, 0.898 / 2, 0.555 / 2, 0.293 / 2],
-                "3": [-0.422, 0.798 / 2, 0.937 / 2, 0.609 / 2, 0.459 / 2, 0.235 / 2],
-                "4": [-0.409, 0.781 / 2, 0.988 / 2, 1.156 / 2, 0.600 / 2, 0.434 / 2, 0.297 / 2, 0.159 / 2],
-                "5": [-0.36, -0.707, -0.823, -1.005, -1.154, 0.632 / 2, 0.523 / 2, 0.390 / 2, 0.275 / 2, 0.149 / 2],
-                "6": [
-                    -0.331,
-                    -0.645,
-                    -0.731,
-                    -0.837,
-                    -1.009,
-                    -1.126,
-                    0.636 / 2,
-                    0.535 / 2,
-                    0.463 / 2,
-                    0.360 / 2,
-                    0.259 / 2,
-                    0.139 / 2,
-                ],
-                "7": [
-                    -0.310,
-                    -0.618,
-                    -0.690,
-                    -0.751,
-                    -0.859,
-                    -1.020,
-                    -1.122,
-                    0.648 / 2,
-                    0.554 / 2,
-                    0.490 / 2,
-                    0.445 / 2,
-                    0.341 / 2,
-                    0.244 / 2,
-                    0.131 / 2,
-                ],
-                "8": [
-                    -0.295,
-                    -0.587,
-                    -0.654,
-                    -0.708,
-                    -0.765,
-                    -0.864,
-                    -1.026,
-                    -1.116,
-                    0.649 / 2,
-                    0.555 / 2,
-                    0.500 / 2,
-                    0.469 / 2,
-                    0.420 / 2,
-                    0.319 / 2,
-                    0.231 / 2,
-                    0.123 / 2,
-                ],
-                "9": [
-                    -0.279,
-                    -0.566,
-                    -0.631,
-                    -0.679,
-                    -0.726,
-                    -0.768,
-                    -0.875,
-                    -1.037,
-                    -1.118,
-                    0.654 / 2,
-                    0.562 / 2,
-                    0.509 / 2,
-                    0.487 / 2,
-                    0.451 / 2,
-                    0.403 / 2,
-                    0.305 / 2,
-                    0.220 / 2,
-                    0.117 / 2,
-                ],
-                "10": [
-                    -0.267,
-                    -0.545,
-                    -0.610,
-                    -0.656,
-                    -0.696,
-                    -0.729,
-                    -0.774,
-                    -0.882,
-                    -1.044,
-                    -1.115,
-                    0.656 / 2,
-                    0.563 / 2,
-                    0.514 / 2,
-                    0.496 / 2,
-                    0.496 / 2,
-                    0.436 / 2,
-                    0.388 / 2,
-                    0.291 / 2,
-                    0.211 / 2,
-                    0.112 / 2,
-                ],
-                "11": [
-                    -0.257,
-                    -0.528,
-                    -0.592,
-                    -0.640,
-                    -0.677,
-                    -0.702,
-                    -0.737,
-                    -0.775,
-                    -0.884,
-                    -1.047,
-                    -1.115,
-                    0.656 / 2,
-                    0.563 / 2,
-                    0.516 / 2,
-                    0.504 / 2,
-                    0.482 / 2,
-                    0.456 / 2,
-                    0.421 / 2,
-                    0.371 / 2,
-                    0.276 / 2,
-                    0.201 / 2,
-                    0.107 / 2,
-                ],
-            }
-
-            theta = OPTIMAL_INITIAL_ANGLES[str(self.num_qaoa_layers)]
-            bounds = [(-np.pi, np.pi)] * self.num_qaoa_layers + [(0.0, np.pi)] * self.num_qaoa_layers
-
-            res = minimize(
-                objective_function,
-                theta,
-                bounds=bounds,
-                method="COBYLA",
-                tol=1e-5,
-                options={"maxiter": 300},
-            )
-
-        return -res.fun
-
-    @staticmethod
-    def is_successful(
-        approximation_ratio: float,
-    ) -> bool:
-        """Check whether a Q-score benchmark returned approximation ratio above beta*, therefore being successful.
-
-        This condition checks that the mean approximation ratio is above the beta* = 0.2 threshold.
-
-        Args:
-            approximation_ratio (float): the mean approximation ratio of all problem graphs
-
-        Returns:
-            bool: whether the Q-score benchmark was successful
-        """
-        return bool(approximation_ratio > 0.2)
+                dataset.attrs[key] = value
 
     @staticmethod
     def choose_qubits_naive(num_qubits: int) -> list[int]:
@@ -502,171 +710,19 @@ class QScoreBenchmark(BenchmarkBase):
             # The execute_single_benchmark call must be looped through a COPY of custom_qubits_array
         else:
             chosen_qubits = selected_qubits[0]
-        return chosen_qubits
-
-    def plot_approximation_ratios(
-        self, list_of_num_nodes: list[int], list_of_cut_sizes: list[list[float]]
-    ) -> tuple[str, Figure]:
-        """Generate the figure of approximation ratios vs number of nodes,
-            including standard deviation and the acceptance threshold.
-
-        Args:
-            list_of_num_nodes (list[int]): list of problem graph sizes.
-            list_of_cut_sizes (list[list[float]]): the list of lists of maximum average cut sizes of problem graph instances for each problem size.
-
-        Returns:
-            str: the name of the figure.
-            Figure: the figure.
-        """
-
-        LAMBDA = 0.178
-
-        approximation_ratio_lists = {
-            num_nodes: (np.array(cut_sizes) - num_nodes * (num_nodes - 1) / 8) / (LAMBDA * num_nodes ** (3 / 2))
-            for num_nodes, cut_sizes in zip(list_of_num_nodes, list_of_cut_sizes)
-        }
+        return list(chosen_qubits)
 
-        avg_approximation_ratios = {
-            num_nodes: np.mean(approximation_ratios)
-            for num_nodes, approximation_ratios in approximation_ratio_lists.items()
-        }
-
-        std_of_approximation_ratios = {
-            num_nodes: np.std(approximation_ratios) / np.sqrt(len(approximation_ratios) - 1)
-            for num_nodes, approximation_ratios in approximation_ratio_lists.items()
-        }
-
-        nodes = list(avg_approximation_ratios.keys())
-        ratios = list(avg_approximation_ratios.values())
-        std = list(std_of_approximation_ratios.values())
-
-        fig = plt.figure()
-        ax = plt.axes()
-
-        plt.axhline(0.2, color="red", linestyle="dashed", label="Threshold")
-        plt.errorbar(
-            nodes, ratios, yerr=std, fmt="-o", capsize=10, markersize=8, color="#759DEB", label="Approximation ratio"
-        )
-
-        ax.set_ylabel(r"Q-score ratio $\beta(n)$")
-        ax.set_xlabel("Number of nodes $(n)$")
-        plt.xticks(range(min(nodes), max(nodes) + 1))
-        plt.legend(loc="lower right")
-        plt.grid(True)
-
-        if self.use_virtual_node and self.use_classically_optimized_angles:
-            title = f"Q-score, {self.num_instances} instances, with virtual node and classically optimized angles\nBackend: {self.backend.name} / {self.timestamp}"
-        elif self.use_virtual_node and not self.use_classically_optimized_angles:
-            title = f"Q-score, {self.num_instances} instances, with virtual node \nBackend: {self.backend.name} / {self.timestamp}"
-        elif not self.use_virtual_node and self.use_classically_optimized_angles:
-            title = f"Q-score, {self.num_instances} instances, with classically optimized angles\nBackend: {self.backend.name} / {self.timestamp}"
-        else:
-            title = f"Q-score, {self.num_instances} instances \nBackend: {self.backend.name} / {self.timestamp}"
-
-        plt.title(
-            title,
-            fontsize=9,
-        )
-        fig_name = f"{max(nodes)}_nodes_{self.num_instances}_instances.png"
-
-        # Show plot if verbose is True
-        plt.gcf().set_dpi(250)
-        plt.show()
-
-        plt.close()
-
-        return fig_name, fig
-
-    def execute_single_benchmark(
+    def execute(
         self,
-        num_nodes: int,
-    ) -> tuple[bool, float, list[float], list[int]]:
-        """Execute a single benchmark, for a given number of qubits.
-
-        Args:
-            num_nodes (int): number of nodes in the MaxCut problem graphs.
-
-        Returns:
-            bool: whether the benchmark was successful.
-            float: approximation_ratio.
-            list[float]: the list of maximum average cut sizes of problem graph instances.
-            list[int]: the set of qubits the Q-score benchmark was executed on.
-        """
-
-        cut_sizes: list[float] = []
-        seed = self.seed
+        backend: IQMBackendBase,
+        # pylint: disable=too-many-branches
+        # pylint: disable=too-many-statements
+    ) -> xr.Dataset:
+        """Executes the benchmark."""
+        self.execution_timestamp = strftime("%Y%m%d-%H%M%S")
 
-        for i in range(self.num_instances):
-            graph = nx.generators.erdos_renyi_graph(num_nodes, 0.5, seed=seed)
-            qcvv_logger.debug(f"graph: {graph}")
-            self.graph_physical = graph.copy()
-            self.virtual_nodes = []
-            if self.use_virtual_node:
-                virtual_node, _ = max(
-                    graph.degree(), key=lambda x: x[1]
-                )  # choose the virtual node as the most connected node
-                self.virtual_nodes.append(
-                    (virtual_node, 1)
-                )  # the second element of the tuple is the value assigned to the virtual node
-                self.graph_physical.remove_node(self.virtual_nodes[0][0])
-            # See if there are any non-connected nodes if so, remove them also
-            # and set them to be opposite value to the possible original virtual node
-            for node in self.graph_physical.nodes():
-                if self.graph_physical.degree(node) == 0:
-                    self.virtual_nodes.append((node, 0))
-            for vn in self.virtual_nodes:
-                if self.graph_physical.has_node(vn[0]):
-                    self.graph_physical.remove_node(vn[0])
-
-            # Graph with no edges has cut size = 0
-            if graph.number_of_edges() == 0:
-                cut_sizes.append(0)
-                seed += 1
-                qcvv_logger.debug(f"Graph {i+1}/{self.num_instances} had no edges: cut size = 0.")
-                continue
-
-            # Choose the qubit layout
-            qubit_set = []
-            if self.choose_qubits_routine.lower() == "naive":
-                qubit_set = self.choose_qubits_naive(num_nodes)
-            elif self.choose_qubits_routine.lower() == "custom":
-                qubit_set = self.choose_qubits_custom(num_nodes)
-            else:
-                raise ValueError('choose_qubits_routine must either be "naive" or "custom".')
-
-            # Solve the maximum cut size with QAOA
-            cut_sizes.append(self.run_QAOA(graph, qubit_set))
-            seed += 1
-            qcvv_logger.debug(f"Solved the MaxCut on graph {i+1}/{self.num_instances}.")
-
-        average_cut_size = np.mean(cut_sizes) - num_nodes * (num_nodes - 1) / 8
-        average_best_cut_size = 0.178 * pow(num_nodes, 3 / 2)
-        approximation_ratio = float(average_cut_size / average_best_cut_size)
-
-        self.raw_data[num_nodes] = {
-            "qubit_set": qubit_set,
-            "cut_sizes": cut_sizes,
-        }
-        self.results[num_nodes] = {
-            "qubit_set": qubit_set,
-            "is_successful": str(self.is_successful(approximation_ratio)),
-            "approximation_ratio": approximation_ratio,
-        }
-
-        # Return whether the single Q-score Benchmark was successful and its mean approximation ratio
-        # and cut sizes for all instances.
-        return self.is_successful(approximation_ratio), approximation_ratio, cut_sizes, qubit_set
-
-    @timeit
-    def execute_full_benchmark(self) -> tuple[int, list[float], list[list[float]]]:
-        """Execute the full benchmark, starting with self.min_num_nodes nodes up to failure.
-
-        Returns:
-            int: the Q-score of the device.
-            list[float]: the list of approximation rations over problem graph instances for each problem size.
-            list[list[float]]: the list of lists of maximum average cut sizes of problem graph instances for each problem size.
-        """
-        qscore = 0
+        dataset = xr.Dataset()
+        self.add_all_meta_to_dataset(dataset)
 
         if self.max_num_nodes is None:
             if self.use_virtual_node:
@@ -676,38 +732,158 @@ class QScoreBenchmark(BenchmarkBase):
         else:
             max_num_nodes = self.max_num_nodes
 
-        approximation_ratios = []
-        list_of_cut_sizes = []
+        dataset.attrs.update({"max_num_nodes": self.max_num_nodes})
 
         for num_nodes in range(self.min_num_nodes, max_num_nodes + 1):
+            qc_list = []
+            qc_transpiled_list: List[QuantumCircuit] = []
+            execution_results = []
+            graph_list = []
+            qubit_set_list = []
+
             qcvv_logger.debug(f"Executing on {self.num_instances} random graphs with {num_nodes} nodes.")
-            is_successful, approximation_ratio, cut_sizes = self.execute_single_benchmark(num_nodes)[0:3]
-            approximation_ratios.append(approximation_ratio)
 
-            list_of_cut_sizes.append(cut_sizes)
-            if is_successful:
-                qcvv_logger.info(
-                    f"Q-Score = {num_nodes} passed with:\nApproximation ratio (Beta): {approximation_ratio:.4f}; Avg MaxCut size: {np.mean(cut_sizes):.4f}"
-                )
-                qscore = num_nodes
-                continue
+            # self.untranspiled_circuits[str(num_nodes)] = {}
+            # self.transpiled_circuits[str(num_nodes)] = {}
+
+            seed = self.seed
+            virtual_node_list = []
+            qubit_to_node_list = []
+            no_edge_instances = []
+            for instance in range(self.num_instances):
+                qcvv_logger.debug(f"Executing graph {instance} with {num_nodes} nodes.")
+                graph = nx.generators.erdos_renyi_graph(num_nodes, 0.5, seed=seed)
+                graph_list.append(graph)
+                self.graph_physical = graph.copy()
+                self.virtual_nodes = []
+                if self.use_virtual_node:
+                    virtual_node, _ = max(
+                        graph.degree(), key=lambda x: x[1]
+                    )  # choose the virtual node as the most connected node
+                    self.virtual_nodes.append(
+                        (virtual_node, 1)
+                    )  # the second element of the tuple is the value assigned to the virtual node
+                    self.graph_physical.remove_node(self.virtual_nodes[0][0])
+                # See if there are any non-connected nodes if so, remove them also
+                # and set them to be opposite value to the possible original virtual node
+                for node in self.graph_physical.nodes():
+                    if self.graph_physical.degree(node) == 0:
+                        self.virtual_nodes.append((node, 0))
+                for vn in self.virtual_nodes:
+                    if self.graph_physical.has_node(vn[0]):
+                        self.graph_physical.remove_node(vn[0])
+                virtual_node_list.append(self.virtual_nodes)
+                # Graph with no edges has cut size = 0
+                if graph.number_of_edges() == 0:
+                    no_edge_instances.append(instance)
+                    qcvv_logger.debug(f"Graph {instance+1}/{self.num_instances} had no edges: cut size = 0.")
+
+                # Choose the qubit layout
+
+                if self.choose_qubits_routine.lower() == "naive":
+                    qubit_set = self.choose_qubits_naive(num_nodes)
+                elif (
+                    self.choose_qubits_routine.lower() == "custom" or self.choose_qubits_routine.lower() == "mapomatic"
+                ):
+                    qubit_set = self.choose_qubits_custom(num_nodes)
+                else:
+                    raise ValueError('choose_qubits_routine must either be "naive" or "custom".')
+                qubit_set_list.append(qubit_set)
+
+                qc = self.generate_maxcut_ansatz(graph, theta=[float(q) for q in qubit_set])
+                qc_list.append(qc)
+                qubit_to_node_copy = self.qubit_to_node.copy()
+                qubit_to_node_list.append(qubit_to_node_copy)
+
+                if len(qc.count_ops()) == 0:
+                    counts = {"": 1.0}  # to handle the case of physical graph with no edges
+                    qc_transpiled_list.append([])
+                    execution_results.append(counts)
+                    qc_list.append([])
+                    qcvv_logger.debug(f"This graph instance has no edges.")
+                else:
+                    # execute for a given num_node and a given instance
+                    coupling_map = self.backend.coupling_map.reduce(qubit_set)
+                    qcvv_logger.setLevel(logging.WARNING)
+                    transpiled_qc, _ = perform_backend_transpilation(
+                        [qc],
+                        backend=self.backend,
+                        qubits=qubit_set,
+                        coupling_map=coupling_map,
+                        qiskit_optim_level=self.qiskit_optim_level,
+                        optimize_sqg=self.optimize_sqg,
+                        routing_method=self.routing_method,
+                    )
+
+                    sorted_transpiled_qc_list = {tuple(qubit_set): transpiled_qc}
+                    # Execute on the backend
+                    jobs, _ = submit_execute(
+                        sorted_transpiled_qc_list,
+                        self.backend,
+                        self.shots,
+                        self.calset_id,
+                        max_gates_per_batch=self.max_gates_per_batch,
+                    )
+                    qc_transpiled_list.append(transpiled_qc)
+                    execution_results.append(retrieve_all_counts(jobs)[0][0])
+                    qcvv_logger.setLevel(logging.INFO)
 
-            qcvv_logger.info(
-                f"Q-Score = {num_nodes} failed with \napproximation ratio (Beta): {approximation_ratio:.4f} < 0.2; Avg MaxCut size: {np.mean(cut_sizes):.4f}"
+                seed += 1
+                qcvv_logger.debug(f"Solved the MaxCut on graph {instance+1}/{self.num_instances}.")
+
+            dataset.attrs.update(
+                {
+                    num_nodes: {
+                        "qubit_set": qubit_set_list,
+                        "seed_start": seed,
+                        "graph": graph_list,
+                        "virtual_nodes": virtual_node_list,
+                        "qubit_to_node": qubit_to_node_list,
+                        "no_edge_instances": no_edge_instances,
+                    }
+                }
             )
 
-        self.results["qscore"] = qscore
-        fig_name, fig = self.plot_approximation_ratios(
-            list(range(self.min_num_nodes, max_num_nodes + 1)), list_of_cut_sizes
-        )
-        self.figures[fig_name] = fig
-        return num_nodes, approximation_ratios, list_of_cut_sizes
+            qcvv_logger.debug(f"Adding counts for the random graph for {num_nodes} nodes to the dataset")
+            dataset, _ = add_counts_to_dataset(execution_results, str(num_nodes), dataset)
+
+            # self.untranspiled_circuits[str(num_nodes)].update({tuple(qubit_set): qc_list})
+            # self.transpiled_circuits[str(num_nodes)].update(sorted_transpiled_qc_list)
+            self.untranspiled_circuits.circuit_groups.append(CircuitGroup(name=str(num_nodes), circuits=qc_list))
+            self.transpiled_circuits.circuit_groups.append(
+                CircuitGroup(name=str(num_nodes), circuits=qc_transpiled_list)
+            )
+
+        self.circuits = Circuits([self.transpiled_circuits, self.untranspiled_circuits])
+
+        return dataset
 
 
 class QScoreConfiguration(BenchmarkConfigurationBase):
-    """Q-score configuration."""
+    """Q-score configuration.
+
+    Attributes:
+        benchmark (Type[Benchmark]): QScoreBenchmark
+        num_instances (int):
+        num_qaoa_layers (int):
+        min_num_nodes (int):
+        max_num_nodes (int):
+        use_virtual_node (bool):
+        use_classically_optimized_angles (bool):
+        choose_qubits_routine (Literal["custom"]): The routine to select qubit layouts.
+                            * Default is "custom".
+        min_num_qubits (int):
+        custom_qubits_array (Optional[Sequence[Sequence[int]]]): The physical qubit layouts to perform the benchmark on.
+                            * Default is None.
+        qiskit_optim_level (int): The Qiskit transpilation optimization level.
+                            * Default is 3.
+        optimize_sqg (bool): Whether Single Qubit Gate Optimization is performed upon transpilation.
+                            * Default is True.
+        seed (int): The random seed.
+                            * Default is 1.
+    """
 
-    benchmark: Type[BenchmarkBase] = QScoreBenchmark
+    benchmark: Type[Benchmark] = QScoreBenchmark
     num_instances: int
     num_qaoa_layers: int = 1
     min_num_nodes: int = 2
@@ -716,7 +892,7 @@ class QScoreConfiguration(BenchmarkConfigurationBase):
     use_classically_optimized_angles: bool = True
     choose_qubits_routine: Literal["naive", "custom"] = "naive"
     min_num_qubits: int = 2  # If choose_qubits_routine is "naive"
-    custom_qubits_array: Optional[list[list[int]]] = None
+    custom_qubits_array: Optional[Sequence[Sequence[int]]] = None
     qiskit_optim_level: int = 3
     optimize_sqg: bool = True
     seed: int = 1