mqt.problemsolver 0.1.0__tar.gz → 0.3.0__tar.gz

mqt.problemsolver-0.3.0/.git_archival.txt

@@ -0,0 +1,4 @@
+node: $Format:%H$
+node-date: $Format:%cI$
+describe-name: $Format:%(describe:tags=true,match=*[0-9]*)$
+ref-names: $Format:%D$

mqt.problemsolver-0.3.0/.gitattributes

@@ -0,0 +1 @@
+.git_archival.txt export-subst

{mqt.problemsolver-0.1.0 → mqt.problemsolver-0.3.0}/.github/codecov.yml

@@ -1,3 +1,6 @@
+ignore:
+  - "tests/**/*"
+
 coverage:
   range: 60..90
   precision: 1

mqt.problemsolver-0.3.0/.github/release-drafter.yml

@@ -0,0 +1,49 @@
+name-template: "MQT ProblemSolver $RESOLVED_VERSION Release"
+tag-template: "v$RESOLVED_VERSION"
+categories:
+  - title: "🚀 Features and Enhancements"
+    labels:
+      - "feature"
+      - "usability"
+  - title: "🐛 Bug Fixes"
+    labels:
+      - "bug"
+  - title: "📄 Documentation"
+    labels:
+      - "documentation"
+  - title: "🤖 CI"
+    labels:
+      - "continuous integration"
+  - title: "📦 Packaging"
+    labels:
+      - "packaging"
+  - title: "⬆️ Dependencies"
+    collapse-after: 5
+    labels:
+      - "dependencies"
+      - "submodules"
+      - "github_actions"
+change-template: "- $TITLE @$AUTHOR (#$NUMBER)"
+change-title-escapes: '\<*_&'
+version-resolver:
+  major:
+    labels:
+      - "major"
+  minor:
+    labels:
+      - "minor"
+  patch:
+    labels:
+      - "patch"
+  default: patch
+autolabeler:
+  - label: "dependencies"
+    title:
+      - "/update pre-commit hooks/i"
+
+template: |
+  ## What Changed 👀
+
+  $CHANGES
+
+  **Full Changelog**: https://github.com/$OWNER/$REPOSITORY/compare/$PREVIOUS_TAG...v$RESOLVED_VERSION

{mqt.problemsolver-0.1.0 → mqt.problemsolver-0.3.0}/.github/workflows/coverage.yml

@@ -19,8 +19,9 @@ jobs:
       - name: Install MQT ProblemSolver
         run: pip install .[coverage]
       - name: Generate Report
-        run: pytest -v --cov=./ --cov-report=xml
-#    - name: Upload coverage to Codecov
-#      uses: codecov/codecov-action@v3
-#      with:
-#        fail_ci_if_error: true
+        run: pytest -v --cov --cov-config=pyproject.toml --cov-report=xml
+      - name: Upload coverage to Codecov
+        uses: codecov/codecov-action@v3
+        with:
+          fail_ci_if_error: true
+          token: ${{ secrets.CODECOV_TOKEN }}

{mqt.problemsolver-0.1.0 → mqt.problemsolver-0.3.0}/.github/workflows/deploy.yml

@@ -63,5 +63,5 @@ jobs:
       - uses: pypa/gh-action-pypi-publish@release/v1
         with:
           password: ${{ secrets.pypi_password }}
-          skip_existing: true
+          skip-existing: true
           verbose: true

mqt.problemsolver-0.3.0/.github/workflows/mypy.yml

@@ -0,0 +1,25 @@
+name: mypy
+
+on:
+  pull_request:
+  push:
+    branches:
+      - main
+  workflow_dispatch:
+
+concurrency:
+  group: ${{ github.workflow }}-${{ github.head_ref || github.run_id }}
+  cancel-in-progress: true
+
+jobs:
+  lint:
+    runs-on: ubuntu-latest
+    name: Run my[py] linter
+    steps:
+      - uses: actions/checkout@v3
+      - uses: actions/setup-python@v4
+        with:
+          python-version: "3.10"
+      - uses: pre-commit/action@v3.0.0
+        with:
+          extra_args: mypy --all-files

mqt.problemsolver-0.3.0/.github/workflows/release-drafter.yml

@@ -0,0 +1,24 @@
+name: Release Drafter
+
+on:
+  push:
+    branches:
+      - main
+  pull_request:
+    types: [opened, reopened, synchronize]
+  pull_request_target:
+    types: [opened, reopened, synchronize]
+
+permissions:
+  contents: read
+
+jobs:
+  update_release_draft:
+    permissions:
+      contents: write
+      pull-requests: write
+    runs-on: ubuntu-latest
+    steps:
+      - uses: release-drafter/release-drafter@v5
+        env:
+          GITHUB_TOKEN: ${{ secrets.GITHUB_TOKEN }}

{mqt.problemsolver-0.1.0 → mqt.problemsolver-0.3.0}/.pre-commit-config.yaml

@@ -10,11 +10,12 @@
 ci:
   autoupdate_commit_msg: "⬆️🪝 update pre-commit hooks"
   autofix_commit_msg: "🎨 pre-commit fixes"
+  skip: [mypy]
 
 repos:
   # Standard hooks
   - repo: https://github.com/pre-commit/pre-commit-hooks
-    rev: "v4.3.0"
+    rev: "v4.5.0"
     hooks:
       - id: check-added-large-files
       - id: check-case-conflict
@@ -31,68 +32,14 @@ repos:
 
   # Handling unwanted unicode characters
   - repo: https://github.com/sirosen/texthooks
-    rev: "0.4.0"
+    rev: "0.6.3"
     hooks:
       - id: fix-ligatures
       - id: fix-smartquotes
 
-  # Sort includes
-  - repo: https://github.com/pycqa/isort
-    rev: 5.10.1
-    hooks:
-      - id: isort
-        args: ["--profile", "black", "--filter-files"]
-
-  # Upgrade old Python syntax
-  - repo: https://github.com/asottile/pyupgrade
-    rev: "v2.37.3"
-    hooks:
-      - id: pyupgrade
-        args: ["--py37-plus"]
-
-  # Run code formatting with Black
-  - repo: https://github.com/psf/black
-    rev: "22.8.0" # Keep in sync with blacken-docs
-    hooks:
-      - id: black
-
-  # Also run Black on examples in the documentation
-  - repo: https://github.com/asottile/blacken-docs
-    rev: "v1.12.1"
-    hooks:
-      - id: blacken-docs
-        additional_dependencies:
-          - black==22.8.0 # keep in sync with black hook
-
-  # Check for common mistakes
-  - repo: https://github.com/pre-commit/pygrep-hooks
-    rev: "v1.9.0"
-    hooks:
-      - id: python-check-blanket-noqa
-      - id: python-check-blanket-type-ignore
-      - id: python-no-log-warn
-      - id: python-no-eval
-      - id: python-use-type-annotations
-      - id: rst-backticks
-      - id: rst-directive-colons
-      - id: rst-inline-touching-normal
-
-  # Run Flake8 checks
-  - repo: https://github.com/PyCQA/flake8
-    rev: "5.0.4"
-    hooks:
-      - id: flake8
-        additional_dependencies:
-          - flake8-bugbear
-          - flake8-comprehensions
-          - flake8-future-annotations
-          - flake8-new-union-types
-          - flake8-simplify
-          - flake8-2020
-
   # Check for spelling
   - repo: https://github.com/codespell-project/codespell
-    rev: "v2.2.1"
+    rev: "v2.2.6"
     hooks:
       - id: codespell
         args: ["-L", "wille,linz"]
@@ -103,7 +50,42 @@ repos:
 
   # Format configuration files with prettier
   - repo: https://github.com/pre-commit/mirrors-prettier
-    rev: "v3.0.0-alpha.0"
+    rev: "v4.0.0-alpha.8"
     hooks:
       - id: prettier
         types_or: [yaml, markdown, html, css, javascript, json]
+
+  - repo: https://github.com/astral-sh/ruff-pre-commit
+    rev: v0.1.13
+    hooks:
+      - id: ruff
+        args: ["--fix", "--show-fixes"]
+        types_or: [python, pyi, jupyter]
+      - id: ruff-format
+        types_or: [python, pyi, jupyter]
+
+  # Also run Black on examples in the documentation
+  - repo: https://github.com/adamchainz/blacken-docs
+    rev: 1.16.0
+    hooks:
+      - id: blacken-docs
+        additional_dependencies: [black==23.*]
+
+  # Clean jupyter notebooks
+  - repo: https://github.com/srstevenson/nb-clean
+    rev: "3.2.0"
+    hooks:
+      - id: nb-clean
+
+  - repo: https://github.com/pre-commit/mirrors-mypy
+    rev: v1.8.0
+    hooks:
+      - id: mypy
+        files: ^(src|tests|setup.py)
+        args: []
+        additional_dependencies:
+          - types-setuptools
+          - python_tsp
+          - networkx
+          - mqt.ddsim
+          - pytest

mqt.problemsolver-0.3.0/PKG-INFO

@@ -0,0 +1,229 @@
+Metadata-Version: 2.1
+Name: mqt.problemsolver
+Version: 0.3.0
+Summary: MQT ProblemSolver - A MQT tool for Solving Problems Using Quantum Computing
+Author-email: Nils Quetschlich <nils.quetschlich@tum.de>, Lukas Burgholzer <lukas.burgholzer@jku.at>
+Project-URL: Homepage, https://github.com/cda-tum/mqtproblemsolver
+Project-URL: Bug Tracker, https://github.com/cda-tum/mqtproblemsolver/issues
+Project-URL: Discussions, https://github.com/cda-tum/mqtproblemsolver/discussions
+Project-URL: Research, https://www.cda.cit.tum.de/research/quantum/
+Keywords: MQT,quantum computing
+Classifier: Development Status :: 4 - Beta
+Classifier: Intended Audience :: Developers
+Classifier: License :: OSI Approved :: MIT License
+Classifier: Operating System :: Microsoft :: Windows
+Classifier: Operating System :: MacOS
+Classifier: Operating System :: POSIX :: Linux
+Classifier: Programming Language :: Python :: 3 :: Only
+Classifier: Programming Language :: Python :: 3.8
+Classifier: Programming Language :: Python :: 3.9
+Classifier: Programming Language :: Python :: 3.10
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Intended Audience :: Science/Research
+Classifier: Natural Language :: English
+Classifier: Topic :: Scientific/Engineering :: Electronic Design Automation (EDA)
+Requires-Python: >=3.8
+Description-Content-Type: text/markdown
+Requires-Dist: qiskit<0.42.0,>=0.36.0
+Requires-Dist: joblib
+Requires-Dist: numpy
+Requires-Dist: matplotlib
+Requires-Dist: mqt.ddsim
+Requires-Dist: networkx
+Requires-Dist: python_tsp
+Requires-Dist: docplex
+Requires-Dist: qiskit_optimization
+Provides-Extra: test
+Requires-Dist: pytest>=7; extra == "test"
+Provides-Extra: coverage
+Requires-Dist: mqt.problemsolver[test]; extra == "coverage"
+Requires-Dist: coverage[toml]~=6.5.0; extra == "coverage"
+Requires-Dist: pytest-cov~=4.0.0; extra == "coverage"
+Provides-Extra: dev
+Requires-Dist: mqt.problemsolver[coverage]; extra == "dev"
+
+[![CodeCov](https://github.com/cda-tum/MQTProblemSolver/actions/workflows/coverage.yml/badge.svg)](https://github.com/cda-tum/MQTProblemSolver/actions/workflows/coverage.yml)
+[![Deploy to PyPI](https://github.com/cda-tum/MQTProblemSolver/actions/workflows/deploy.yml/badge.svg)](https://github.com/cda-tum/MQTProblemSolver/actions/workflows/deploy.yml)
+
+<p align="center">
+<picture>
+  <source media="(prefers-color-scheme: dark)" srcset="https://raw.githubusercontent.com/cda-tum/MQTProblemSolver/main/img/mqt_light.png" width="60%">
+  <img src="https://raw.githubusercontent.com/cda-tum/MQTProblemSolver/main/img/mqt_dark.png" width="60%">
+</picture>
+</p>
+
+# MQT ProblemSolver
+
+MQT ProblemSolver is a framework to utilize quantum computing as a technology for users with little to no
+quantum computing knowledge.
+All necessary quantum parts are embedded by domain experts while the interfaces provided are similar to the ones
+classical solver provide:
+
+<p align="center">
+<img src="img/framework.png" height=300px>
+</p>
+
+When provided with a problem description, MQT ProblemSolver offers a selection of implemented quantum algorithms.
+The user just has to chose one and all further (quantum) calculation steps are encapsulated within MQT ProblemSolver.
+After the calculation finished, the respective solution is returned - again in the same format as classical
+solvers use.
+
+In the current implementation, two case studies are conducted:
+
+1. A SAT Problem: Constraint Satisfaction Problem
+2. A Graph-based Optimization Problem: Travelling Salesman Problem
+
+## A SAT Problem: Constraint Satisfaction Problem
+
+This exemplary implementation can be found in the [CSP_example.ipynb](notebooks/csp_example.ipynb) Jupyter notebook.
+Here, the solution to a Kakuro riddle with a 2x2 grid can be solved for arbitrary sums `s0` to `s3`:
+
+<p align="center">
+<img src="img/kakuro.png" height=100px>
+</p>
+
+MQT ProblemSolver will return valid values to `a`, `b`, `c`, and `d` if a solution exists.
+
+## A Graph-based Optimization Problem: Travelling Salesman Problem
+
+This exemplary implementation can be found in the [TSP_example.ipynb](notebooks/tsp_example.ipynb) Jupyter notebook.
+Here, the solution to a Travelling Salesman Problem with 4 cities can be solved for arbitrary distances `dist_1_2` to `dist_3_4`between the cities.
+
+<p align="center">
+<img src="img/tsp.png" height=200px>
+</p>
+
+MQT ProblemSolver will return the shortest path visiting all cities as a list.
+
+## Satellite Mission Planning Problem
+
+Additional to the two case studies, we provide a more complex example for the satellite mission planning problem.
+The goal is to maximize the accumulated values of all images taken by the satellite while it is often not possible
+to take all images since the satellite must rotate and adjust its optics.
+
+In the following example, there are five to-be-captured locations which their assigned value.
+
+<p align="center">
+<img src="img/satellite_mission_planning_problem.png" height=200px>
+</p>
+
+# Pre-Compilation
+
+Every quantum computing application must be encoded into a quantum circuit and then compiled for a specific device.
+This lengthy compilation process is a key bottleneck and intensifies for recurring problems---each of which requires
+a new compilation run thus far.
+
+<p align="center">
+<img src="img/workflow_old.png">
+</p>
+
+Pre-compilation is a promising approach to overcome this bottleneck.
+Beginning with a problem class and suitable quantum algorithm, a **predictive encoding** scheme is applied to encode a
+representative problem instance into a general-purpose quantum circuit for that problem class.
+Once the real problem instance is known, the previously constructed circuit only needs to be
+**adjusted**—with (nearly) no compilation necessary:
+
+<p align="center">
+<img src="img/workflow_new.png">
+</p>
+Following this approach, we provide a pre-compilation module that can be used to precompile QAOA circuits
+for the MaxCut problem.
+
+# Usage
+
+MQT ProblemSolver is available via [PyPI](https://pypi.org/project/mqt.problemsolver/):
+
+```console
+(venv) $ pip install mqt.problemsolver
+```
+
+# Repository Structure
+
+```
+.
+├── src
+│ └── mqt
+│     └── problemsolver
+│        └── satelitesolver
+│        │   └── ...
+│        └── precompilation
+│        │   └── ...
+│        └── csp.py
+│        └── tsp.py
+└── notebooks
+     └── satelitesolver
+     │   └── ...
+     └── precompilation
+     │   └── ...
+     └── problemsolver_paper_figures.ipynb
+     └── csp_example.ipynb
+     └── tsp_example.ipynb
+```
+
+# References
+
+In case you are using MQT ProblemSolver in your work, we would be thankful if you referred to it by citing the following publication:
+
+```bibtex
+@INPROCEEDINGS{quetschlich2023mqtproblemsolver,
+    title     = {{Towards an Automated Framework for Realizing Quantum Computing Solutions}},
+    author    = {N. Quetschlich and L. Burgholzer and R. Wille},
+    booktitle = {International Symposium on Multiple-Valued Logic (ISMVL)},
+    year      = {2023},
+}
+```
+
+which is also available on arXiv:
+[![a](https://img.shields.io/static/v1?label=arXiv&message=2210.14928&color=inactive&style=flat-square)](https://arxiv.org/abs/2210.14928)
+
+In case you are using our Pre-Compilation approach, we would be thankful if you referred to it by citing the following publication:
+
+```bibtex
+@INPROCEEDINGS{quetschlich2023precompilation,
+    title     = {{Reducing the Compilation Time of Quantum Circuits Using Pre-Compilation on the Gate Level}},
+    author    = {N. Quetschlich and L. Burgholzer and R. Wille},
+    booktitle = {IEEE International Conference on Quantum Computing and Engineering (QCE)},
+    year      = {2023},
+}
+```
+
+which is also available on arXiv:
+[![a](https://img.shields.io/static/v1?label=arXiv&message=2305.04941&color=inactive&style=flat-square)](https://arxiv.org/abs/2305.04941)
+
+In case you are using our Satellite Mission Planning Problem approach, we would be thankful if you referred to it by citing the following publication:
+
+```bibtex
+@INPROCEEDINGS{quetschlich2023satellite,
+    title     = {{A Hybrid Classical Quantum Computing Approach to the Satellite Mission Planning Problem}},
+    author    = {N. Quetschlich and V. Koch and L. Burgholzer and R. Wille},
+    booktitle = {IEEE International Conference on Quantum Computing and Engineering (QCE)},
+    year      = {2023},
+}
+```
+
+which is also available on arXiv:
+[![a](https://img.shields.io/static/v1?label=arXiv&message=2308.00029&color=inactive&style=flat-square)](https://arxiv.org/abs/2308.00029)
+
+## Acknowledgements
+
+The Munich Quantum Toolkit has been supported by the European
+Research Council (ERC) under the European Union's Horizon 2020 research and innovation program (grant agreement
+No. 101001318), the Bavarian State Ministry for Science and Arts through the Distinguished Professorship Program, as well as the
+Munich Quantum Valley, which is supported by the Bavarian state government with funds from the Hightech Agenda Bayern Plus.
+
+<p align="center">
+<picture>
+<source media="(prefers-color-scheme: dark)" srcset="https://raw.githubusercontent.com/cda-tum/mqt-problemsolver/main/img/tum_dark.svg" width="28%">
+<img src="https://raw.githubusercontent.com/cda-tum/mqt-problemsolver/main/img/tum_light.svg" width="28%">
+</picture>
+<picture>
+<img src="https://raw.githubusercontent.com/cda-tum/mqt-problemsolver/main/img/logo-bavaria.svg" width="16%">
+</picture>
+<picture>
+<source media="(prefers-color-scheme: dark)" srcset="https://raw.githubusercontent.com/cda-tum/mqt-problemsolver/main/img/erc_dark.svg" width="24%">
+<img src="https://raw.githubusercontent.com/cda-tum/mqt-problemsolver/main/img/erc_light.svg" width="24%">
+</picture>
+<picture>
+<img src="https://raw.githubusercontent.com/cda-tum/mqt-problemsolver/main/img/logo-mqv.svg" width="28%">
+</picture>
+</p>

mqt.problemsolver-0.3.0/README.md

@@ -0,0 +1,185 @@
+[![CodeCov](https://github.com/cda-tum/MQTProblemSolver/actions/workflows/coverage.yml/badge.svg)](https://github.com/cda-tum/MQTProblemSolver/actions/workflows/coverage.yml)
+[![Deploy to PyPI](https://github.com/cda-tum/MQTProblemSolver/actions/workflows/deploy.yml/badge.svg)](https://github.com/cda-tum/MQTProblemSolver/actions/workflows/deploy.yml)
+
+<p align="center">
+<picture>
+  <source media="(prefers-color-scheme: dark)" srcset="https://raw.githubusercontent.com/cda-tum/MQTProblemSolver/main/img/mqt_light.png" width="60%">
+  <img src="https://raw.githubusercontent.com/cda-tum/MQTProblemSolver/main/img/mqt_dark.png" width="60%">
+</picture>
+</p>
+
+# MQT ProblemSolver
+
+MQT ProblemSolver is a framework to utilize quantum computing as a technology for users with little to no
+quantum computing knowledge.
+All necessary quantum parts are embedded by domain experts while the interfaces provided are similar to the ones
+classical solver provide:
+
+<p align="center">
+<img src="img/framework.png" height=300px>
+</p>
+
+When provided with a problem description, MQT ProblemSolver offers a selection of implemented quantum algorithms.
+The user just has to chose one and all further (quantum) calculation steps are encapsulated within MQT ProblemSolver.
+After the calculation finished, the respective solution is returned - again in the same format as classical
+solvers use.
+
+In the current implementation, two case studies are conducted:
+
+1. A SAT Problem: Constraint Satisfaction Problem
+2. A Graph-based Optimization Problem: Travelling Salesman Problem
+
+## A SAT Problem: Constraint Satisfaction Problem
+
+This exemplary implementation can be found in the [CSP_example.ipynb](notebooks/csp_example.ipynb) Jupyter notebook.
+Here, the solution to a Kakuro riddle with a 2x2 grid can be solved for arbitrary sums `s0` to `s3`:
+
+<p align="center">
+<img src="img/kakuro.png" height=100px>
+</p>
+
+MQT ProblemSolver will return valid values to `a`, `b`, `c`, and `d` if a solution exists.
+
+## A Graph-based Optimization Problem: Travelling Salesman Problem
+
+This exemplary implementation can be found in the [TSP_example.ipynb](notebooks/tsp_example.ipynb) Jupyter notebook.
+Here, the solution to a Travelling Salesman Problem with 4 cities can be solved for arbitrary distances `dist_1_2` to `dist_3_4`between the cities.
+
+<p align="center">
+<img src="img/tsp.png" height=200px>
+</p>
+
+MQT ProblemSolver will return the shortest path visiting all cities as a list.
+
+## Satellite Mission Planning Problem
+
+Additional to the two case studies, we provide a more complex example for the satellite mission planning problem.
+The goal is to maximize the accumulated values of all images taken by the satellite while it is often not possible
+to take all images since the satellite must rotate and adjust its optics.
+
+In the following example, there are five to-be-captured locations which their assigned value.
+
+<p align="center">
+<img src="img/satellite_mission_planning_problem.png" height=200px>
+</p>
+
+# Pre-Compilation
+
+Every quantum computing application must be encoded into a quantum circuit and then compiled for a specific device.
+This lengthy compilation process is a key bottleneck and intensifies for recurring problems---each of which requires
+a new compilation run thus far.
+
+<p align="center">
+<img src="img/workflow_old.png">
+</p>
+
+Pre-compilation is a promising approach to overcome this bottleneck.
+Beginning with a problem class and suitable quantum algorithm, a **predictive encoding** scheme is applied to encode a
+representative problem instance into a general-purpose quantum circuit for that problem class.
+Once the real problem instance is known, the previously constructed circuit only needs to be
+**adjusted**—with (nearly) no compilation necessary:
+
+<p align="center">
+<img src="img/workflow_new.png">
+</p>
+Following this approach, we provide a pre-compilation module that can be used to precompile QAOA circuits
+for the MaxCut problem.
+
+# Usage
+
+MQT ProblemSolver is available via [PyPI](https://pypi.org/project/mqt.problemsolver/):
+
+```console
+(venv) $ pip install mqt.problemsolver
+```
+
+# Repository Structure
+
+```
+.
+├── src
+│ └── mqt
+│     └── problemsolver
+│        └── satelitesolver
+│        │   └── ...
+│        └── precompilation
+│        │   └── ...
+│        └── csp.py
+│        └── tsp.py
+└── notebooks
+     └── satelitesolver
+     │   └── ...
+     └── precompilation
+     │   └── ...
+     └── problemsolver_paper_figures.ipynb
+     └── csp_example.ipynb
+     └── tsp_example.ipynb
+```
+
+# References
+
+In case you are using MQT ProblemSolver in your work, we would be thankful if you referred to it by citing the following publication:
+
+```bibtex
+@INPROCEEDINGS{quetschlich2023mqtproblemsolver,
+    title     = {{Towards an Automated Framework for Realizing Quantum Computing Solutions}},
+    author    = {N. Quetschlich and L. Burgholzer and R. Wille},
+    booktitle = {International Symposium on Multiple-Valued Logic (ISMVL)},
+    year      = {2023},
+}
+```
+
+which is also available on arXiv:
+[![a](https://img.shields.io/static/v1?label=arXiv&message=2210.14928&color=inactive&style=flat-square)](https://arxiv.org/abs/2210.14928)
+
+In case you are using our Pre-Compilation approach, we would be thankful if you referred to it by citing the following publication:
+
+```bibtex
+@INPROCEEDINGS{quetschlich2023precompilation,
+    title     = {{Reducing the Compilation Time of Quantum Circuits Using Pre-Compilation on the Gate Level}},
+    author    = {N. Quetschlich and L. Burgholzer and R. Wille},
+    booktitle = {IEEE International Conference on Quantum Computing and Engineering (QCE)},
+    year      = {2023},
+}
+```
+
+which is also available on arXiv:
+[![a](https://img.shields.io/static/v1?label=arXiv&message=2305.04941&color=inactive&style=flat-square)](https://arxiv.org/abs/2305.04941)
+
+In case you are using our Satellite Mission Planning Problem approach, we would be thankful if you referred to it by citing the following publication:
+
+```bibtex
+@INPROCEEDINGS{quetschlich2023satellite,
+    title     = {{A Hybrid Classical Quantum Computing Approach to the Satellite Mission Planning Problem}},
+    author    = {N. Quetschlich and V. Koch and L. Burgholzer and R. Wille},
+    booktitle = {IEEE International Conference on Quantum Computing and Engineering (QCE)},
+    year      = {2023},
+}
+```
+
+which is also available on arXiv:
+[![a](https://img.shields.io/static/v1?label=arXiv&message=2308.00029&color=inactive&style=flat-square)](https://arxiv.org/abs/2308.00029)
+
+## Acknowledgements
+
+The Munich Quantum Toolkit has been supported by the European
+Research Council (ERC) under the European Union's Horizon 2020 research and innovation program (grant agreement
+No. 101001318), the Bavarian State Ministry for Science and Arts through the Distinguished Professorship Program, as well as the
+Munich Quantum Valley, which is supported by the Bavarian state government with funds from the Hightech Agenda Bayern Plus.
+
+<p align="center">
+<picture>
+<source media="(prefers-color-scheme: dark)" srcset="https://raw.githubusercontent.com/cda-tum/mqt-problemsolver/main/img/tum_dark.svg" width="28%">
+<img src="https://raw.githubusercontent.com/cda-tum/mqt-problemsolver/main/img/tum_light.svg" width="28%">
+</picture>
+<picture>
+<img src="https://raw.githubusercontent.com/cda-tum/mqt-problemsolver/main/img/logo-bavaria.svg" width="16%">
+</picture>
+<picture>
+<source media="(prefers-color-scheme: dark)" srcset="https://raw.githubusercontent.com/cda-tum/mqt-problemsolver/main/img/erc_dark.svg" width="24%">
+<img src="https://raw.githubusercontent.com/cda-tum/mqt-problemsolver/main/img/erc_light.svg" width="24%">
+</picture>
+<picture>
+<img src="https://raw.githubusercontent.com/cda-tum/mqt-problemsolver/main/img/logo-mqv.svg" width="28%">
+</picture>
+</p>