iqm-benchmarks 1.3__py3-none-any.whl

iqm_benchmarks-1.3.dist-info/LICENSE

@@ -0,0 +1,205 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright 2024 IQM
+
+   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.
+
+
+This repository contains also code from other authors, which is licensed under the following licences:
+* mGST under MIT License (in `src/mGST`) by Raphael Brieger, Ingo Roth, Martin Kliesch (see LICENSE file in mGST folder)

iqm_benchmarks-1.3.dist-info/METADATA

@@ -0,0 +1,190 @@
+Metadata-Version: 2.1
+Name: iqm-benchmarks
+Version: 1.3
+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>
+Project-URL: Homepage, https://github.com/iqm-finland/iqm-benchmarks
+Classifier: Development Status :: 4 - Beta
+Classifier: Programming Language :: Python :: 3 :: Only
+Classifier: Topic :: Scientific/Engineering :: Physics
+Classifier: Intended Audience :: Science/Research
+Requires-Python: >=3.11
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Requires-Dist: lmfit==1.3.1
+Requires-Dist: matplotlib==3.9.0
+Requires-Dist: more-itertools==10.1.0
+Requires-Dist: mthree==2.6.3
+Requires-Dist: networkx==2.8.8
+Requires-Dist: numpy>=1.24.2
+Requires-Dist: qiskit==0.45.3
+Requires-Dist: qiskit-aer==0.13.3
+Requires-Dist: qiskit-iqm==15.1
+Requires-Dist: scikit-optimize==0.10.2
+Requires-Dist: tabulate==0.9.0
+Requires-Dist: uncertainties==3.2.1
+Requires-Dist: pycurl==7.45.3
+Requires-Dist: xarray==2024.6.0
+Requires-Dist: types-pycurl
+Provides-Extra: develop
+Requires-Dist: tox==4.16.0; extra == "develop"
+Provides-Extra: examples
+Requires-Dist: notebook==7.2.1; extra == "examples"
+Provides-Extra: mgst
+Requires-Dist: numpy<2.0; extra == "mgst"
+Requires-Dist: cvxpy==1.5.3; extra == "mgst"
+Requires-Dist: pygsti==0.9.12.3; extra == "mgst"
+Requires-Dist: tqdm==4.66.5; extra == "mgst"
+Requires-Dist: numba==0.60.0; extra == "mgst"
+Provides-Extra: test
+Requires-Dist: black==24.4.2; extra == "test"
+Requires-Dist: isort==5.13.2; extra == "test"
+Requires-Dist: mypy==1.10.1; extra == "test"
+Requires-Dist: pylint==3.2.5; extra == "test"
+Requires-Dist: pytest==7.4.4; extra == "test"
+Requires-Dist: pytest-cov==4.1.0; extra == "test"
+Requires-Dist: pytest-isort==3.1.0; extra == "test"
+Requires-Dist: pytest-mypy==0.10.3; extra == "test"
+Requires-Dist: pytest-pylint==0.21.0; extra == "test"
+
+# IQM Benchmarks
+
+The IQM Benchmarks is a suite of quantum characterization, verification, and validation (QCVV) tools for quantum computing. It is designed to be a comprehensive tool for benchmarking quantum hardware. The suite is designed to be modular, allowing users to easily add new benchmarks and customize existing ones. The suite is designed to be easy to use, with a simple API that allows users to run benchmarks with a single command.
+
+
+Below is a list of the benchmarks currently available in the suite:
+* Randomized Benchmarking: A suite of randomized benchmarking protocols for characterizing the performance of quantum gates (Clifford Randomized Benchmarking, Mirror Randomized Benchmarking, Interleaved Randomized Benchmarking).
+* Quantum Volume: A benchmark for characterizing the performance of quantum computers.
+* Q-Score: A benchmark that estimates the size of combinatorial optimization problems a given number of qubits can execute with meaningful results.
+* GHZ State Benchmarking: A benchmark for characterizing the performance of multi-qubit entangled states.
+
+
+The project is split into different benchmarks, all sharing the `Benchmark` class or the legacy `BenchmarkBase` class. Each individual benchmark takes as an argument their own `BenchmarkConfigurationBase` class. All the (legacy) benchmarks executed at once are wrapped by the `BenchmarkExperiment` class, which handles dependencies among the benchmarks, storing the results, producing the plots...
+
+
+## Installation _(latest release)_
+
+Usually it makes sense to use a new Conda environment (e.g. ``iqm-benchmarks``) to isolate your setup from the global Python installation. That way, you can play around without messing the rest of your system.
+
+Start a terminal in your machine, and type
+
+```
+conda create -n iqm-benchmarks python=3.11.2
+conda activate iqm-benchmarks
+```
+
+Then, you can install the latest release of the IQM Benchmarks by running:
+```bash
+$ pip install iqm-benchmarks
+```
+
+If you have already installed `iqm-benchmarks` and want to get the latest release you can add the --upgrade flag:
+
+```bash
+pip install iqm-benchmarks --upgrade
+```
+
+## Development mode _(latest changes: recommended)_
+
+To install in development mode with all required dependencies, you can instead clone the [repository](https://www.github.com/iqm-finland/iqm-benchmarks) and from the project directory run
+
+```bash
+python -m pip install -e ".[develop,test]" --upgrade --upgrade-strategy=eager
+```
+
+To run the tests, you can use the following command:
+
+```bash
+tox -e test
+```
+
+## Characterize Physical Hardware
+
+The IQM Benchmarks suite is designed to be used with real quantum hardware. To use the suite, you will need to have access to a quantum computer. The suite is designed to work with both IQM Resonance (IQM's quantum cloud service) and on-prem devices, but can be easily adapted to work with other quantum computing platforms.
+
+To use the suite with IQM Resonance, you will need to set up an account and obtain an API token. You can then set the `IQM_TOKEN` environment variable to your API token. The suite will automatically use this token to authenticate with IQM Resonance.
+
+```python
+import os
+os.environ["IQM_TOKEN"] = "your_token"
+```
+
+### Using a Jupyter notebook or Python script
+
+You can easily set up one or more benchmarks by defining a configuration for them. For example, for Randomized, Interleaved and Mirror Benchmarking, or Quantum Volume:
+
+```python
+from iqm.benchmarks.randomized_benchmarking.interleaved_rb.interleaved_rb import InterleavedRBConfiguration
+from iqm.benchmarks.randomized_benchmarking.mirror_rb.mirror_rb import MirrorRBConfiguration
+from iqm.benchmarks.quantum_volume.quantum_volume import QuantumVolumeConfiguration
+
+EXAMPLE_IRB = InterleavedRBConfiguration(
+    qubits_array=[[3,4],[8,9]],
+    sequence_lengths=[2**(m+1)-1 for m in range(7)],
+    num_circuit_samples=30,
+    shots=2**10,
+    calset_id=None,
+    parallel_execution=True,
+    interleaved_gate = "iSwapGate",
+    interleaved_gate_params = None,
+    simultaneous_fit = ["amplitude", "offset"],
+)
+
+EXAMPLE_MRB = MirrorRBConfiguration(
+    qubits_array=[[0,1],
+                  [0,1,3,4],
+                  [0,1,3,4,8,9],
+                  [0,1,3,4,8,9,13,14],
+                  [0,1,3,4,8,9,13,14,17,18]],
+    depths_array=[[2**m for m in range(9)],
+                  [2**m for m in range(8)],
+                  [2**m for m in range(7)],
+                  [2**m for m in range(6)],
+                  [2**m for m in range(5)]],
+    num_circuit_samples=10,
+    num_pauli_samples=5,
+    shots=2**8,
+    two_qubit_gate_ensemble={"CZGate": 0.7, "iSwapGate": 0.3}, # {GATE: PROBABILITY}
+    density_2q_gates=0.25,
+    calset_id=None,
+)
+
+EXAMPLE_QV = QuantumVolumeConfiguration(
+    num_circuits=500,
+    shots=2**8,
+    calset_id=None,
+    num_sigmas=2,
+    choose_qubits_routine="custom",
+    custom_qubits_array=[[0,1,2,3], [0,1,3,4]],
+    qiskit_optim_level=3,
+    optimize_sqg=True,
+    routing_method="sabre",
+    physical_layout="fixed",
+    max_gates_per_batch=60_000,
+    rem=True,
+    mit_shots=1_000,
+)
+```
+
+In order to execute them, you must specify a backend.
+* for IQM Resonance this can be given as a simple string, such as "garnet" (together with your IQM Token environment variable)
+* and for an on-prem device and IQM Resonance this can be defined using the URL of the quantum computer.
+
+Also, you need to reference the benchmark configuration you want to run:
+
+```python
+from iqm.benchmarks.randomized_benchmarking.mirror_rb.mirror_rb import *
+# import os
+# os.environ["IQM_TOKEN"] = "your_token"
+
+backend = IQMProvider("https://example-station.qc.iqm.fi/cocos/").get_backend()
+
+EXAMPLE_EXPERIMENT = MirrorRandomizedBenchmarking(backend, EXAMPLE_MRB)
+EXAMPLE_EXPERIMENT.run()
+```
+
+Full examples on how to run benchmarks and analyze the results can be found in the `examples` folder.
+
+### Scheduled benchmarks using a CI/CD Pipeline
+
+This repository can be setup to perform a scheduled (weekly, daily...) benchmark from a Gitlab/Github pipeline, executed on a real device. An example configuration is given in the `scheduled_experiments` folder.

iqm_benchmarks-1.3.dist-info/RECORD

@@ -0,0 +1,42 @@
+iqm/benchmarks/__init__.py,sha256=OPL9DS7yU21ZYrYGJ_VGpSeWH-CpW_iq5w0mSPx7bAE,1055
+iqm/benchmarks/benchmark.py,sha256=SGhBcSxLPUu-cVXAjG4Db2TRobFCRBYoE1NtTDK1lJg,4432
+iqm/benchmarks/benchmark_definition.py,sha256=1VxXaJBUHuiLh1VgSuG7xUfZ8ZxTMxrN7IkzQdnvBzw,9232
+iqm/benchmarks/benchmark_experiment.py,sha256=0BFNn04jyD1Yj-pIKnuZjCD00v3pU5EnwkRzJUBc0n4,6540
+iqm/benchmarks/logging_config.py,sha256=U7olP5Kr75AcLJqNODf9VBhJLVqIvA4AYR6J39D5rww,1052
+iqm/benchmarks/readout_mitigation.py,sha256=cx8K2EAjhYfVKGSRlpoh9xBFQZZhyL63wPMtzNL3hAg,12329
+iqm/benchmarks/utils.py,sha256=fNuGkN_GI73nZD6xDN_r97Pr6I8uIDhPXZqdQkQvDpM,21291
+iqm/benchmarks/compressive_gst/__init__.py,sha256=4F_5YxExn4ysGQaEs-WNfm0yiFBxkKtGAYBZFWnRsSk,915
+iqm/benchmarks/compressive_gst/compressive_gst.py,sha256=iLBG6HBPfW3y4EYs6DItuBjqBbMQIoCFsJlUSgH_w8w,46288
+iqm/benchmarks/entanglement/__init__.py,sha256=9T7prOwqMmFWdb4t6ETAHZXKK5o6FvU2DvVb6WhNi-U,682
+iqm/benchmarks/entanglement/ghz.py,sha256=T7HCYmI9pCZn5JuONZMc_J-zFxxf2ioIQ-iMHBOQ8u4,35242
+iqm/benchmarks/optimization/__init__.py,sha256=_ajW_OibYLCtzU5AUv5c2zuuVYn8ZNeZUcUUSIGt51M,747
+iqm/benchmarks/optimization/qscore.py,sha256=_s5_w5QTlaeDcHX1BmAevVctHOTVobee1eGkFx7DTEs,27942
+iqm/benchmarks/quantum_volume/__init__.py,sha256=i-Q4SpDWELBw7frXnxm1j4wJRcxbIyrS5uEK_v06YHo,951
+iqm/benchmarks/quantum_volume/clops.py,sha256=8HxCNaI5_ZUBgRqE6hQkcR7Exc-E9INv4GFvv-QF--U,30837
+iqm/benchmarks/quantum_volume/quantum_volume.py,sha256=An1NUsS5ekuDn4fk7MrS1B-YRoG4cboPwGQd4YMuQ5M,35839
+iqm/benchmarks/randomized_benchmarking/__init__.py,sha256=IkKo-7zUChxZZd3my_csQCJfJfZNsV3-JTvdG8uqys4,734
+iqm/benchmarks/randomized_benchmarking/clifford_1q.pkl,sha256=SVcye1bsjxf1hvC1ku2vHOIZQRG5hy1loAOugpVhUE8,42517
+iqm/benchmarks/randomized_benchmarking/clifford_2q.pkl,sha256=BLDpXdyDGkFUxCMHyUMDBnNclCQTsty-kIXwiuY31eA,82994083
+iqm/benchmarks/randomized_benchmarking/multi_lmfit.py,sha256=Se1ygR4mXn_2_P82Ch31KBnCmY-g_A9NKzE9Ir8nEvw,3247
+iqm/benchmarks/randomized_benchmarking/randomized_benchmarking_common.py,sha256=RZX1G9PBCwqwHk_ylqPHLtWk3GMN5Tc2OchnaEv9W2Y,37824
+iqm/benchmarks/randomized_benchmarking/clifford_rb/__init__.py,sha256=bTDA156LAl7OLGcMec--1nzDrV1XpPRVq3CquTmucgE,677
+iqm/benchmarks/randomized_benchmarking/clifford_rb/clifford_rb.py,sha256=0zaFjzz95aDsZ7dxV5-rXd8lGOSk9KuCXZBtk988I8M,16911
+iqm/benchmarks/randomized_benchmarking/interleaved_rb/__init__.py,sha256=sq6MgN_hwlpkOj10vyCU4e6eKSX-oLcF2L9na6W2Gt4,681
+iqm/benchmarks/randomized_benchmarking/interleaved_rb/interleaved_rb.py,sha256=kZHS3_FnwgVAt4_UmOmwl5DRDO24dKNV6epAGxGRM-U,25563
+iqm/benchmarks/randomized_benchmarking/mirror_rb/__init__.py,sha256=ZekEqI_89nXzGO1vjM-b5Uwwicy59M4fYHXfA-f0MIg,674
+iqm/benchmarks/randomized_benchmarking/mirror_rb/mirror_rb.py,sha256=yDYJePSG6kcW0aa3Xw5GHris5L7Sry3JWemvEW5iH2o,34060
+mGST/LICENSE,sha256=TtHNq55cUcbglb7uhVudeBLUh_qPdUoAEvU0BBwFz-k,1098
+mGST/README.md,sha256=v_5kw253csHF4-RfE-44KqFmBXIsSMRmOtN0AUPrRxE,5050
+mGST/additional_fns.py,sha256=_SEJ10FRNM7_CroysT8hCLZTfpm6ZhEIDCY5zPTnhjo,31390
+mGST/algorithm.py,sha256=jSB9G9uI30zD-IZBJvrvIbdPMXp0elXPxk8F8QeyC3w,26006
+mGST/compatibility.py,sha256=00DsPnNfOtrQcDTvxBDs-0aMhmuXmOIIxl_Ohy-Emkg,8920
+mGST/low_level_jit.py,sha256=z6taafZOmgIRsnKZKPFN6aJ2daRsVjzOeOk_GtmcdwI,27023
+mGST/optimization.py,sha256=YHwkzIkYvsZOPjclR-BCQWh24jeqjuXp0BB0WX5Lwow,10559
+mGST/qiskit_interface.py,sha256=2XuJ4WFViLsHCTpEZncwsLbRr-cELEYhegTpRPzCcuI,10080
+mGST/reporting/figure_gen.py,sha256=6Xd8vwfy09hLY1YbJY6TRevuMsQSU4MsWqemly3ZO0I,12970
+mGST/reporting/reporting.py,sha256=-XBy3OCJIMOsA8cApwKjhVKBwnjSAoxm-voHNbRWytM,25803
+iqm_benchmarks-1.3.dist-info/LICENSE,sha256=2Ncb40-hqkTil78RPv3-YiJfKaJ8te9USJgliKqIdSY,11558
+iqm_benchmarks-1.3.dist-info/METADATA,sha256=Xl9uaemgivU4KTvjrt9A0nF97TFNyKfHputsfiKl4KI,8378
+iqm_benchmarks-1.3.dist-info/WHEEL,sha256=PZUExdf71Ui_so67QXpySuHtCi3-J3wvF4ORK6k_S8U,91
+iqm_benchmarks-1.3.dist-info/top_level.txt,sha256=3G23Z-1LGf-IOzTCUl6QwWqiQ3USz25Zt90Ihq192to,9
+iqm_benchmarks-1.3.dist-info/RECORD,,

iqm_benchmarks-1.3.dist-info/WHEEL

@@ -0,0 +1,5 @@
+Wheel-Version: 1.0
+Generator: setuptools (75.6.0)
+Root-Is-Purelib: true
+Tag: py3-none-any
+

iqm_benchmarks-1.3.dist-info/top_level.txt

@@ -0,0 +1,2 @@
+iqm
+mGST

mGST/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2021 Raphael Brieger, Ingo Roth, Martin Kliesch
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

mGST/README.md

@@ -0,0 +1,54 @@
+# Compressive gate set tomography
+
+This is a copy of the [mGST repository](https://github.com/rabrie/mGST/tree/main).
+
+This repository contains the Python implementation of a flexible and efficient gate set tomography technique based on low-rank approximations, as described in the following research paper:
+
+**Title**: Compressive gate set tomography
+
+**Authors**: Raphael Brieger, Ingo Roth, and Martin Kliesch
+
+**Links**: https://arxiv.org/abs/2112.05176, https://journals.aps.org/prxquantum/pdf/10.1103/PRXQuantum.4.010325
+
+## Abstract
+Flexible characterization techniques that identify and quantify experimental imperfections under realistic assumptions are crucial for the development of quantum computers. Gate set tomography is a characterization approach that simultaneously and self-consistently extracts a tomographic description of the implementation of an entire set of quantum gates, as well as the initial state and measurement, from experimental data. Obtaining such a detailed picture of the experimental implementation is associated with high requirements on the number of sequences and their design, making gate set tomography a challenging task even for only two qubits.
+In this work, we show that low-rank approximations of gate sets can be obtained from significantly fewer gate sequences and that it is sufficient to draw them randomly. Such tomographic information is needed for the crucial task of dealing with coherent noise. To this end, we formulate the data processing problem of gate set tomography as a rank-constrained tensor completion problem. We provide an algorithm to solve this problem while respecting the usual positivity and normalization constraints of quantum mechanics by using second-order geometrical optimization methods on the complex Stiefel manifold. Besides the reduction in sequences, we demonstrate numerically that the algorithm does not rely on structured gate sets or an elaborate circuit design to robustly perform gate set tomography. Therefore, it is more flexible than traditional approaches. We also demonstrate how coherent errors in shadow estimation protocols can be mitigated using estimates from gate set tomography.
+
+## Use Case
+This Python package allows users to perform gate set tomography on quantum devices using low-rank approximations, which reduces the number of gate sequences and the post processing time required. The standard sequence design needed for compressive GST is given by random sequences of short depth, and the python package provides functions that generate those sequences based on high level parameters such as the number of gates and the system size. In its standard configuration, the mGST algorithm assumes no prior knowledge about the gate set parameters and uses local optimization coupled with random initializations until a high quality fit is obtained. Alternatively, an initial guess for the initialization can be supplied, which can lead to large reductions in runtime.
+
+For single qubit gate set tomography we recommend using 100 sequences with at least 1000 shots each. For two qubits with model rank up to 4, we recommend 400 sequences and also at least 1000 shots each. The runtime varies for different gate sets and ranks, but is expected to be on the order of a minute for a single qubit and on the order of an hour for two qubits. Details can be found in the linked publication. 
+
+## Automatic compressive GST with tex-report
+The folder tutorials/sample_project contains the blueprint for automatically running mGST from the command line. 
+
+In order to use make use of this functionality, the following steps should be performed:
+    1) Copy the entire "sample_project" folder to a desired location and rename to identify the current experiment.
+    2) Replace the file "synthetic_data.txt" in the "exp_data" subfolder with a text file containting experimental data.
+    3) Edit the file "exp_description" in the "exp_design" subfolder to define the parameters in your experiment.
+    4) Replace the file "sequences.csv" with the gate sequences used in your current experiment.
+    5) Open a terminal in the main project folder and run the command "python3 run_mGST.py".
+
+The mGST-Algorithm should now run and give updates on the current state of the optimization. After an estimate is found, "y/n" promts will guide through the next steps considering whether bootstrapping error bars and tex-reports should be generated. 
+Gate error tables as well as plots of gate parametrizations are saved in the subfolder "mGST_results", and the full late-report is saved in the "report"-subfolder. 
+
+
+## Installation Instructions
+To install the package, follow these steps:
+
+### Clone the repository to your local machine:
+```bash
+git clone git@github.com:rabrie/mGST.git
+```
+
+### Change to the repository's directory:
+```bash
+cd mGST
+```
+
+### Install the package using pip:
+```bash
+pip install .
+```
+
+Now you can import the package in your Python scripts and use it. For examples and usage instructions, please refer to the provided Jupyter notebook.