iqm-benchmarks 2.14__py3-none-any.whl → 2.16__py3-none-any.whl

iqm/benchmarks/entanglement/ghz.py

@@ -267,7 +267,7 @@ def generate_ghz_linear(num_qubits: int) -> QuantumCircuit:
         num_qubits: the number of qubits of the GHZ state
 
     Returns:
-        A quantum circuit generating a GHZ state of n qubits
+        QuantumCircuit: A quantum circuit generating a GHZ state on a given number of qubits.
     """
     s = int(num_qubits / 2)
     quantum_register = QuantumRegister(num_qubits)
@@ -290,7 +290,7 @@ def generate_ghz_log_cruz(num_qubits: int) -> QuantumCircuit:
         num_qubits: the number of qubits of the GHZ state
 
     Returns:
-        A quantum circuit generating a GHZ state of n qubits
+        QuantumCircuit: A quantum circuit generating a GHZ state on a given number of qubits.
     """
     quantum_register = QuantumRegister(num_qubits)
     qc = QuantumCircuit(quantum_register, name="GHZ_log_Cruz")
@@ -305,6 +305,24 @@ def generate_ghz_log_cruz(num_qubits: int) -> QuantumCircuit:
     return qc
 
 
+def generate_ghz_star(num_qubits: int) -> QuantumCircuit:
+    """
+    Generates the circuit for creating a GHZ state by maximizing the number of CZ gates between a pair of MOVE gates.
+    Args:
+        num_qubits: the number of qubits of the GHZ state
+
+    Returns:
+        QuantumCircuit: A quantum circuit generating a GHZ state on a given number of qubits.
+    """
+    quantum_register = QuantumRegister(num_qubits)
+    qc = QuantumCircuit(quantum_register, name="GHZ_star")
+    qc.h(0)
+    for i in range(num_qubits - 1):
+        qc.cx(0, i + 1)
+    qc.measure_all()
+    return qc
+
+
 def generate_ghz_log_mooney(num_qubits: int) -> QuantumCircuit:
     """
     Generates a GHZ state in log-depth according to https://arxiv.org/abs/2101.08946
@@ -312,7 +330,7 @@ def generate_ghz_log_mooney(num_qubits: int) -> QuantumCircuit:
         num_qubits: the number of qubits of the GHZ state
 
     Returns:
-        A quantum circuit generating a GHZ state of n qubits
+        QuantumCircuit: A quantum circuit generating a GHZ state on a given number of qubits.
     """
     quantum_register = QuantumRegister(num_qubits)
     qc = QuantumCircuit(quantum_register, name="GHZ_log_Mooney")
@@ -641,6 +659,9 @@ class GHZBenchmark(Benchmark):
         elif routine == "tree":
             # For star architectures, create an effective coupling map that represents all-to-all connectivity
             if "move" in self.backend.operation_names:
+                qcvv_logger.warning(
+                    f"The current backend is a star architecture for which a suboptimal state generation routine is chosen. Consider setting state_generation_routine={routine}."
+                )
                 effective_coupling_map = [[x, y] for x in qubit_layout for y in qubit_layout if x != y]
             else:
                 effective_coupling_map = self.backend.coupling_map
@@ -660,6 +681,19 @@ class GHZBenchmark(Benchmark):
                 optimize_sqg=self.optimize_sqg,
             )
             final_ghz = ghz_native_transpiled
+        elif routine == "star":
+            ghz: QuantumCircuit = generate_ghz_star(qubit_count)
+            circuit_group.add_circuit(ghz)
+            ghz_native_transpiled, _ = perform_backend_transpilation(
+                [ghz],
+                self.backend,
+                qubit_layout,
+                fixed_coupling_map,
+                qiskit_optim_level=self.qiskit_optim_level,
+                optimize_sqg=self.optimize_sqg,
+            )
+            final_ghz = ghz_native_transpiled
+
         else:
             ghz_log = [generate_ghz_log_cruz(qubit_count), generate_ghz_log_mooney(qubit_count)]
             ghz_native_transpiled, _ = perform_backend_transpilation(

iqm/benchmarks/optimization/qscore.py

@@ -27,6 +27,7 @@ from iqm.benchmarks.benchmark_definition import (
 )
 from iqm.benchmarks.circuit_containers import BenchmarkCircuit, CircuitGroup, Circuits
 from iqm.benchmarks.logging_config import qcvv_logger
+from iqm.benchmarks.readout_mitigation import apply_readout_error_mitigation
 from iqm.benchmarks.utils import (  # execute_with_dd,
     perform_backend_transpilation,
     retrieve_all_counts,
@@ -479,7 +480,7 @@ def qscore_analysis(run: BenchmarkRunResult) -> BenchmarkAnalysisResult:
         observations.extend(
             [
                 BenchmarkObservation(
-                    name="approximation_ratio",
+                    name="mean_approximation_ratio",
                     value=approximation_ratio,
                     uncertainty=std_of_approximation_ratio,
                     identifier=BenchmarkObservationIdentifier(num_nodes),
@@ -596,6 +597,8 @@ class QScoreBenchmark(Benchmark):
         self.choose_qubits_routine = configuration.choose_qubits_routine
         self.qiskit_optim_level = configuration.qiskit_optim_level
         self.optimize_sqg = configuration.optimize_sqg
+        self.REM = configuration.REM
+        self.mit_shots = configuration.mit_shots
         self.session_timestamp = strftime("%Y%m%d-%H%M%S")
         self.execution_timestamp = ""
         self.seed = configuration.seed
@@ -744,7 +747,7 @@ class QScoreBenchmark(Benchmark):
         dataset = xr.Dataset()
         self.add_all_meta_to_dataset(dataset)
 
-        if self.max_num_nodes is None:
+        if self.max_num_nodes is None or self.max_num_nodes == self.backend.num_qubits + 1:
             if self.use_virtual_node:
                 max_num_nodes = self.backend.num_qubits + 1
             else:
@@ -752,7 +755,7 @@ class QScoreBenchmark(Benchmark):
         else:
             max_num_nodes = self.max_num_nodes
 
-        dataset.attrs.update({"max_num_nodes": self.max_num_nodes})
+        dataset.attrs.update({"max_num_nodes": max_num_nodes})
 
         for num_nodes in range(self.min_num_nodes, max_num_nodes + 1):
             qc_list = []
@@ -761,6 +764,11 @@ class QScoreBenchmark(Benchmark):
             graph_list = []
             qubit_set_list = []
             theta_list = []
+            ## updates the number of qubits to choose for the grpah problem.
+            if self.use_virtual_node:
+                updated_num_nodes = num_nodes - 1
+            else:
+                updated_num_nodes = num_nodes
 
             qcvv_logger.debug(f"Executing on {self.num_instances} random graphs with {num_nodes} nodes.")
 
@@ -802,11 +810,11 @@ class QScoreBenchmark(Benchmark):
                 # Choose the qubit layout
 
                 if self.choose_qubits_routine.lower() == "naive":
-                    qubit_set = self.choose_qubits_naive(num_nodes)
+                    qubit_set = self.choose_qubits_naive(updated_num_nodes)
                 elif (
                     self.choose_qubits_routine.lower() == "custom" or self.choose_qubits_routine.lower() == "mapomatic"
                 ):
-                    qubit_set = self.choose_qubits_custom(num_nodes)
+                    qubit_set = self.choose_qubits_custom(updated_num_nodes)
                 else:
                     raise ValueError('choose_qubits_routine must either be "naive" or "custom".')
                 qubit_set_list.append(qubit_set)
@@ -863,9 +871,17 @@ class QScoreBenchmark(Benchmark):
                         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)
 
+                    if self.REM:
+                        rem_counts = apply_readout_error_mitigation(
+                            backend, transpiled_qc, [retrieve_all_counts(jobs)[0][0]], self.mit_shots
+                        )
+                        rem_distribution = rem_counts[0][0].nearest_probability_distribution()
+                        execution_results.append(rem_distribution)
+                    else:
+                        execution_results.append(retrieve_all_counts(jobs)[0][0])
+
                 seed += 1
                 qcvv_logger.debug(f"Solved the MaxCut on graph {instance+1}/{self.num_instances}.")
 
@@ -903,15 +919,21 @@ class QScoreConfiguration(BenchmarkConfigurationBase):
 
     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):
+        num_instances (int): Number of random graphs to be chosen.
+        num_qaoa_layers (int): Depth of the QAOA circuit.
+                            * Default is 1.
+        min_num_nodes (int): The min number of nodes to be taken into account, which should be >= 2.
+                            * Default is 2.
+        max_num_nodes (int): The max number of nodes to be taken into account, which has to be <= num_qubits + 1.
+                            * Default is None
+        use_virtual_node (bool): Parameter to increase the potential Qscore by +1.
+                            * Default is True.
+        use_classically_optimized_angles (bool): Use pre-optimised tuned parameters in the QAOA circuit.
+                            * Default is True.
         choose_qubits_routine (Literal["custom"]): The routine to select qubit layouts.
                             * Default is "custom".
-        min_num_qubits (int):
+        min_num_qubits (int): Minumum number of qubits. 
+                            * Default is 2
         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.
@@ -920,6 +942,10 @@ class QScoreConfiguration(BenchmarkConfigurationBase):
                             * Default is True.
         seed (int): The random seed.
                             * Default is 1.
+        REM (bool): Use readout error mitigation.
+                            * Default is False.
+        mit_shots: (int): Number of shots used in readout error mitigation.
+                            * Default is 1000.
     """
 
     benchmark: Type[Benchmark] = QScoreBenchmark
@@ -935,3 +961,5 @@ class QScoreConfiguration(BenchmarkConfigurationBase):
     qiskit_optim_level: int = 3
     optimize_sqg: bool = True
     seed: int = 1
+    REM: bool = False
+    mit_shots: int = 1000

iqm/benchmarks/utils.py

@@ -250,7 +250,7 @@ def perform_backend_transpilation(
             transpiled = optimize_single_qubit_gates(transpiled, drop_final_rz=drop_final_rz)
         if "move" in backend.operation_names:
             transpiled = transpile_to_IQM(
-                transpiled, backend=backend, optimize_single_qubits=optimize_sqg, remove_final_rzs=drop_final_rz
+                qc, backend=backend, optimize_single_qubits=optimize_sqg, remove_final_rzs=drop_final_rz
             )
         if aux_qc is not None:
             if "move" in backend.operation_names:

{iqm_benchmarks-2.14.dist-info → iqm_benchmarks-2.16.dist-info}/METADATA

@@ -1,8 +1,8 @@
 Metadata-Version: 2.2
 Name: iqm-benchmarks
-Version: 2.14
+Version: 2.16
 Summary: A package for implementation of Quantum Characterization, Verification and Validation (QCVV) techniques on IQM's hardware at gate level abstraction
-Author-email: IQM Finland Oy <developers@meetiqm.com>, Aniket Rath <aniket.rath@meetiqm.com>, Jami Rönkkö <jami@meetiqm.com>, Pedro Figueroa Romero <pedro.romero@meetiqm.com>, Vicente Pina Canelles <vicente.pina@meetiqm.com>, Raphael Brieger <raphael.brieger@meetiqm.com>, Stefan Seegerer <stefan.seegerer@meetiqm.com>, Miikka Koistinen <miikka@meetiqm.com>, Adrian Auer <adrian.auer@meetiqm.com>
+Author-email: IQM Finland Oy <developers@meetiqm.com>, Aniket Rath <aniket.rath@meetiqm.com>, Jami Rönkkö <jami@meetiqm.com>, Pedro Figueroa Romero <pedro.romero@meetiqm.com>, Vicente Pina Canelles <vicente.pina@meetiqm.com>, Raphael Brieger <raphael.brieger@meetiqm.com>, Stefan Seegerer <stefan.seegerer@meetiqm.com>, Miikka Koistinen <miikka@meetiqm.com>, Adrian Auer <adrian.auer@meetiqm.com>, Nadia Milazzo <nadia.milazzo@meetiqm.com>
 Project-URL: Homepage, https://github.com/iqm-finland/iqm-benchmarks
 Classifier: Development Status :: 4 - Beta
 Classifier: Programming Language :: Python :: 3 :: Only

{iqm_benchmarks-2.14.dist-info → iqm_benchmarks-2.16.dist-info}/RECORD

@@ -4,14 +4,14 @@ iqm/benchmarks/benchmark_definition.py,sha256=AZkvANrf0_0glbq_P_uo_YqbBU9IZa2gJl
 iqm/benchmarks/circuit_containers.py,sha256=anEtZEsodYqOX-34oZRmuKGeEpp_VfgG5045Mz4-4hI,7562
 iqm/benchmarks/logging_config.py,sha256=U7olP5Kr75AcLJqNODf9VBhJLVqIvA4AYR6J39D5rww,1052
 iqm/benchmarks/readout_mitigation.py,sha256=7FlbSH-RJTtQuRYLChwkQV_vBv0ZfMQTH519cAbyxQ4,12252
-iqm/benchmarks/utils.py,sha256=q4U3nuIOyLHhft8ixDXtV48KGm0uiV4tdtlWpGM1O1M,21180
+iqm/benchmarks/utils.py,sha256=wOgf8x1Z-DsVUL5KQSaKXjGDXDBSvhmwg4Qo-vTOoo0,21172
 iqm/benchmarks/compressive_gst/__init__.py,sha256=LneifgYXtcwo2jcXo7GdUEHL6_peipukShhkrdaTRCA,929
 iqm/benchmarks/compressive_gst/compressive_gst.py,sha256=spq6jP0NLbjaJDzESpbfRPs0N_YheFWl2Wa6USHS5sI,22398
 iqm/benchmarks/compressive_gst/gst_analysis.py,sha256=PxCThBfh2zdQpipI-6gAvLKdmkbYv_KSEpejltVkk7o,35330
 iqm/benchmarks/entanglement/__init__.py,sha256=9T7prOwqMmFWdb4t6ETAHZXKK5o6FvU2DvVb6WhNi-U,682
-iqm/benchmarks/entanglement/ghz.py,sha256=oNf4TE7zEh0fgmz6RaJG0luZZNc6h2Dgohf9KLGKryc,41251
+iqm/benchmarks/entanglement/ghz.py,sha256=0C3zppwGGn_gIkxRWkV_mYqpkygZsu1Ap-xV9PcN0wY,42668
 iqm/benchmarks/optimization/__init__.py,sha256=_ajW_OibYLCtzU5AUv5c2zuuVYn8ZNeZUcUUSIGt51M,747
-iqm/benchmarks/optimization/qscore.py,sha256=8y3MTCGXkVIMqSs9fGRwBENOvISSFBKLBoATc893yVk,35164
+iqm/benchmarks/optimization/qscore.py,sha256=q2gIU2blRagLfA6fU_iDg6WjdFgWMIqnKVvGgr-t3bI,36943
 iqm/benchmarks/quantum_volume/__init__.py,sha256=i-Q4SpDWELBw7frXnxm1j4wJRcxbIyrS5uEK_v06YHo,951
 iqm/benchmarks/quantum_volume/clops.py,sha256=aLxq2sC6cvRmtbmgr7TvluE2edkARH_ZzpTD1LEQEjw,30957
 iqm/benchmarks/quantum_volume/quantum_volume.py,sha256=njX5lBty9jcWMuJnl7uNqRfwE9akMe5gcX-f1_uYDXk,36791
@@ -36,8 +36,8 @@ mGST/optimization.py,sha256=YHwkzIkYvsZOPjclR-BCQWh24jeqjuXp0BB0WX5Lwow,10559
 mGST/qiskit_interface.py,sha256=L4H-4SdhP_bjSFFvpQoF1E7EyGbIJ_CI_y4a7_YEwmU,10102
 mGST/reporting/figure_gen.py,sha256=6Xd8vwfy09hLY1YbJY6TRevuMsQSU4MsWqemly3ZO0I,12970
 mGST/reporting/reporting.py,sha256=We1cccz9BKbITYcSlZHdmBGdjMWAa1xNZe5tKP-yh_E,26004
-iqm_benchmarks-2.14.dist-info/LICENSE,sha256=2Ncb40-hqkTil78RPv3-YiJfKaJ8te9USJgliKqIdSY,11558
-iqm_benchmarks-2.14.dist-info/METADATA,sha256=YyMx6U4xJ6WsysHLsxbj1oWXYwvjMpVD62H8M1x9ONs,10210
-iqm_benchmarks-2.14.dist-info/WHEEL,sha256=In9FTNxeP60KnTkGw7wk6mJPYd_dQSjEZmXdBdMCI-8,91
-iqm_benchmarks-2.14.dist-info/top_level.txt,sha256=3G23Z-1LGf-IOzTCUl6QwWqiQ3USz25Zt90Ihq192to,9
-iqm_benchmarks-2.14.dist-info/RECORD,,
+iqm_benchmarks-2.16.dist-info/LICENSE,sha256=2Ncb40-hqkTil78RPv3-YiJfKaJ8te9USJgliKqIdSY,11558
+iqm_benchmarks-2.16.dist-info/METADATA,sha256=5SuwCE3Uz6lhRtfFf6wxyUnHEmEkTV1dhAFtZdaVFVk,10253
+iqm_benchmarks-2.16.dist-info/WHEEL,sha256=In9FTNxeP60KnTkGw7wk6mJPYd_dQSjEZmXdBdMCI-8,91
+iqm_benchmarks-2.16.dist-info/top_level.txt,sha256=3G23Z-1LGf-IOzTCUl6QwWqiQ3USz25Zt90Ihq192to,9
+iqm_benchmarks-2.16.dist-info/RECORD,,