mqt-core 3.1.0__tar.gz → 3.2.1__tar.gz

{mqt_core-3.1.0 → mqt_core-3.2.1}/.clang-format

@@ -1,3 +1,4 @@
 BasedOnStyle: LLVM
 IncludeBlocks: Regroup
 PointerAlignment: Left
+Standard: c++20

{mqt_core-3.1.0 → mqt_core-3.2.1}/.clang-tidy

@@ -3,6 +3,7 @@ FormatStyle: file
 Checks: |
   bugprone-*,
   -bugprone-easily-swappable-parameters,
+  -bugprone-unchecked-optional-access,
   clang-analyzer-*,
   -clang-analyzer-core.NullDereference,
   clang-diagnostic-*,

{mqt_core-3.1.0 → mqt_core-3.2.1}/.pre-commit-config.yaml

@@ -51,7 +51,7 @@ repos:
 
   # Handling unwanted unicode characters
   - repo: https://github.com/sirosen/texthooks
-    rev: 0.6.8
+    rev: 0.7.1
     hooks:
       - id: fix-ligatures
       - id: fix-smartquotes
@@ -66,7 +66,7 @@ repos:
 
   # Python linting using ruff
   - repo: https://github.com/astral-sh/ruff-pre-commit
-    rev: v0.12.2
+    rev: v0.12.5
     hooks:
       - id: ruff
         args: ["--fix", "--show-fixes"]
@@ -74,7 +74,7 @@ repos:
 
   # Static type checking using mypy
   - repo: https://github.com/pre-commit/mirrors-mypy
-    rev: v1.16.1
+    rev: v1.17.0
     hooks:
       - id: mypy
         files: ^(python/mqt|test/python|noxfile.py)
@@ -99,7 +99,7 @@ repos:
 
   # Clang-format the C++ part of the code base automatically
   - repo: https://github.com/pre-commit/mirrors-clang-format
-    rev: v20.1.7
+    rev: v20.1.8
     hooks:
       - id: clang-format
         types_or: [c++, c, cuda]

{mqt_core-3.1.0 → mqt_core-3.2.1}/CHANGELOG.md

@@ -9,7 +9,28 @@ This project adheres to [Semantic Versioning], with the exception that minor rel
 
 ## [Unreleased]
 
-## [3.1.0]
+## [3.2.1] - 2025-08-01
+
+### Fixed
+
+- 🐛 Fix bug where lambda passed to `std::accumulate` incorrectly took the accumulator by reference instead of by value ([#1089]) ([**@denialhaag**])
+- 🐛 Fix bug in DD package ([#1088]) ([**@denialhaag**])
+
+you need to .
+
+## [3.2.0] - 2025-07-31
+
+### Added
+
+- 🐍 Build Python 3.14 wheels ([#1076]) ([**@denialhaag**])
+- ✨ Add MQT-internal MLIR dialect conversions ([#1001]) ([**@li-mingbao**])
+
+### Changed
+
+- ✨ Expose enums to Python via `pybind11`'s new (`enum.Enum`-compatible) `py::native_enum` ([#1075]) ([**@denialhaag**])
+- ⬆️ Require C++20 ([#897]) ([**@burgholzer**], [**@denialhaag**])
+
+## [3.1.0] - 2025-07-11
 
 _If you are upgrading: please see [`UPGRADING.md`](UPGRADING.md#310)._
 
@@ -28,10 +49,11 @@ _If you are upgrading: please see [`UPGRADING.md`](UPGRADING.md#310)._
 - 🐛 Add missing support for `sxdg` gates in Qiskit circuit import ([#930]) ([**@burgholzer**])
 - 🐛 Fix bug related to initialization of operations with duplicate operands ([#964]) ([**@ystade**])
 - 🐛 Open issue for Qiskit upstream test only when the test is actually failing not when it was cancelled ([#973]) ([**@ystade**])
+- 🐛 Fix parsing of `GPhase` in the `MQTOpt` MLIR dialect ([#1042]) ([**@ystade**], [**@DRovara**])
 
 ### Changed
 
-- ⬆️ Bump shared library ABI version from `3.0` to `3.1`.
+- ⬆️ Bump shared library ABI version from `3.0` to `3.1` ([#1047]) ([**@denialhaag**])
 - ♻️ Switch from reference counting to mark-and-sweep garbage collection in decision diagram package ([#1020]) ([**@MatthiasReumann**], [**burgholzer**], [**q-inho**])
 - ♻️ Move the C++ code for the Python bindings to the top-level `bindings` directory ([#982]) ([**@denialhaag**])
 - ♻️ Move all Python code (no tests) to the top-level `python` directory ([#982]) ([**@denialhaag**])
@@ -116,17 +138,26 @@ _📚 Refer to the [GitHub Release Notes](https://github.com/munich-quantum-tool
 
 <!-- Version links -->
 
-[unreleased]: https://github.com/munich-quantum-toolkit/core/compare/v3.1.0...HEAD
-[3.1.0]: https://github.com/munich-quantum-toolkit/core/compare/v3.0.2...v3.1.0
-[3.0.2]: https://github.com/munich-quantum-toolkit/core/compare/v3.0.1...v3.0.2
-[3.0.1]: https://github.com/munich-quantum-toolkit/core/compare/v3.0.0...v3.0.1
-[3.0.0]: https://github.com/munich-quantum-toolkit/core/compare/v2.7.0...v3.0.0
+[unreleased]: https://github.com/munich-quantum-toolkit/core/compare/v3.2.1...HEAD
+[3.2.1]: https://github.com/munich-quantum-toolkit/core/releases/tag/v3.2.1
+[3.2.0]: https://github.com/munich-quantum-toolkit/core/releases/tag/v3.2.0
+[3.1.0]: https://github.com/munich-quantum-toolkit/core/releases/tag/v3.1.0
+[3.0.2]: https://github.com/munich-quantum-toolkit/core/releases/tag/v3.0.2
+[3.0.1]: https://github.com/munich-quantum-toolkit/core/releases/tag/v3.0.1
+[3.0.0]: https://github.com/munich-quantum-toolkit/core/releases/tag/v3.0.0
 [2.7.0]: https://github.com/munich-quantum-toolkit/core/releases/tag/v2.7.0
 
 <!-- PR links -->
 
+[#1089]: https://github.com/munich-quantum-toolkit/core/pull/1089
+[#1088]: https://github.com/munich-quantum-toolkit/core/pull/1088
+[#1076]: https://github.com/munich-quantum-toolkit/core/pull/1076
+[#1075]: https://github.com/munich-quantum-toolkit/core/pull/1075
+[#1047]: https://github.com/munich-quantum-toolkit/core/pull/1047
+[#1042]: https://github.com/munich-quantum-toolkit/core/pull/1042
 [#1020]: https://github.com/munich-quantum-toolkit/core/pull/1020
 [#1019]: https://github.com/munich-quantum-toolkit/core/pull/1019
+[#1001]: https://github.com/munich-quantum-toolkit/core/pull/1001
 [#984]: https://github.com/munich-quantum-toolkit/core/pull/984
 [#982]: https://github.com/munich-quantum-toolkit/core/pull/982
 [#975]: https://github.com/munich-quantum-toolkit/core/pull/975
@@ -145,6 +176,7 @@ _📚 Refer to the [GitHub Release Notes](https://github.com/munich-quantum-tool
 [#911]: https://github.com/munich-quantum-toolkit/core/pull/911
 [#908]: https://github.com/munich-quantum-toolkit/core/pull/908
 [#900]: https://github.com/munich-quantum-toolkit/core/pull/900
+[#897]: https://github.com/munich-quantum-toolkit/core/pull/897
 [#895]: https://github.com/munich-quantum-toolkit/core/pull/895
 [#893]: https://github.com/munich-quantum-toolkit/core/pull/893
 [#892]: https://github.com/munich-quantum-toolkit/core/pull/892
@@ -195,6 +227,7 @@ _📚 Refer to the [GitHub Release Notes](https://github.com/munich-quantum-tool
 [**@MatthiasReumann**]: https://github.com/MatthiasReumann
 [**@denialhaag**]: https://github.com/denialhaag
 [**q-inho**]: https://github.com/q-inho
+[**@li-mingbao**]: https://github.com/li-mingbao
 
 <!-- General links -->
 

{mqt_core-3.1.0 → mqt_core-3.2.1}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: mqt-core
-Version: 3.1.0
+Version: 3.2.1
 Summary: The Backbone of the Munich Quantum Toolkit
 Keywords: MQT,quantum-computing,design-automation,decision-diagrams,zx-calculus
 Author-Email: Lukas Burgholzer <burgholzer@me.com>
@@ -20,6 +20,7 @@ Classifier: Programming Language :: Python :: 3.10
 Classifier: Programming Language :: Python :: 3.11
 Classifier: Programming Language :: Python :: 3.12
 Classifier: Programming Language :: Python :: 3.13
+Classifier: Programming Language :: Python :: 3.14
 Classifier: Topic :: Scientific/Engineering :: Electronic Design Automation (EDA)
 Classifier: Typing :: Typed
 Project-URL: Homepage, https://github.com/munich-quantum-toolkit/core
@@ -55,7 +56,7 @@ Description-Content-Type: text/markdown
 
 # MQT Core - The Backbone of the Munich Quantum Toolkit (MQT)
 
-MQT Core is an open-source C++17 and Python library for quantum computing that forms the backbone of the quantum software tools developed as part of the [_Munich Quantum Toolkit (MQT)_](https://mqt.readthedocs.io).
+MQT Core is an open-source C++20 and Python library for quantum computing that forms the backbone of the quantum software tools developed as part of the [_Munich Quantum Toolkit (MQT)_](https://mqt.readthedocs.io).
 
 <p align="center">
   <a href="https://mqt.readthedocs.io/projects/core">
@@ -93,7 +94,7 @@ Thank you to all the contributors who have helped make MQT Core a reality!
 
 ## Getting Started
 
-`mqt.core` is available via [PyPI](https://pypi.org/project/mqt.core/) for all major operating systems and supports Python 3.9 to 3.13.
+`mqt.core` is available via [PyPI](https://pypi.org/project/mqt.core/) for all major operating systems and supports Python 3.9 to 3.14.
 
 ```console
 (.venv) $ pip install mqt.core
@@ -117,7 +118,7 @@ print(qc)
 ## System Requirements
 
 Building (and running) is continuously tested under Linux, MacOS, and Windows using the [latest available system versions for GitHub Actions](https://github.com/actions/runner-images).
-However, the implementation should be compatible with any current C++ compiler supporting C++17 and a minimum CMake version of 3.24.
+However, the implementation should be compatible with any current C++ compiler supporting C++20 and a minimum CMake version of 3.24.
 
 MQT Core relies on some external dependencies:
 

{mqt_core-3.1.0 → mqt_core-3.2.1}/README.md

@@ -18,7 +18,7 @@
 
 # MQT Core - The Backbone of the Munich Quantum Toolkit (MQT)
 
-MQT Core is an open-source C++17 and Python library for quantum computing that forms the backbone of the quantum software tools developed as part of the [_Munich Quantum Toolkit (MQT)_](https://mqt.readthedocs.io).
+MQT Core is an open-source C++20 and Python library for quantum computing that forms the backbone of the quantum software tools developed as part of the [_Munich Quantum Toolkit (MQT)_](https://mqt.readthedocs.io).
 
 <p align="center">
   <a href="https://mqt.readthedocs.io/projects/core">
@@ -56,7 +56,7 @@ Thank you to all the contributors who have helped make MQT Core a reality!
 
 ## Getting Started
 
-`mqt.core` is available via [PyPI](https://pypi.org/project/mqt.core/) for all major operating systems and supports Python 3.9 to 3.13.
+`mqt.core` is available via [PyPI](https://pypi.org/project/mqt.core/) for all major operating systems and supports Python 3.9 to 3.14.
 
 ```console
 (.venv) $ pip install mqt.core
@@ -80,7 +80,7 @@ print(qc)
 ## System Requirements
 
 Building (and running) is continuously tested under Linux, MacOS, and Windows using the [latest available system versions for GitHub Actions](https://github.com/actions/runner-images).
-However, the implementation should be compatible with any current C++ compiler supporting C++17 and a minimum CMake version of 3.24.
+However, the implementation should be compatible with any current C++ compiler supporting C++20 and a minimum CMake version of 3.24.
 
 MQT Core relies on some external dependencies:
 

{mqt_core-3.1.0 → mqt_core-3.2.1}/UPGRADING.md

@@ -4,10 +4,23 @@ This document describes breaking changes and how to upgrade. For a complete list
 
 ## [Unreleased]
 
+## [3.2.0]
+
+The shared library ABI version (`SOVERSION`) is increased from `3.1` to `3.2`.
+Thus, consuming libraries need to update their wheel repair configuration for `cibuildwheel` to ensure the `mqt-core` libraries are properly skipped in the wheel repair step.
+
+With this release, the minimum required C++ version has been raised from C++17 to C++20.
+The default compilers of our test systems support all relevant features of the standard.
+Some frameworks we plan to integrate with even require C++20 by now.
+
+The `dd.BasisStates`, `ir.operations.ComparisonKind`, `ir.operations.Control.Type`, and `ir.operations.OpType` enums are now exposed via `pybind11`'s new `py::native_enum`, which makes them compatible with Python's `enum.Enum` class (PEP 435).
+As a result, the enums can no longer be initialized using a string.
+Instead of `OpType("x")`, use `OpType.x`.
+
 ## [3.1.0]
 
 The shared library ABI version (`SOVERSION`) is increased from `3.0` to `3.1`.
-Thus, consuming libraries need to update their wheel repair configuration for cibuildwheel to ensure the mqt-core libraries are properly skipped in the wheel repair step.
+Thus, consuming libraries need to update their wheel repair configuration for `cibuildwheel` to ensure the `mqt-core` libraries are properly skipped in the wheel repair step.
 
 Even tough this is not a breaking change, it is worth mentioning to developers of MQT Core that all Python code (except tests) has been moved to the top-level `python` directory.
 Furthermore, the C++ code for the Python bindings has been moved to the top-level `bindings` directory.
@@ -70,7 +83,8 @@ It also requires the `uv` library version 0.5.20 or higher.
 
 <!-- Version links -->
 
-[unreleased]: https://github.com/munich-quantum-toolkit/core/compare/v3.1.0...HEAD
+[unreleased]: https://github.com/munich-quantum-toolkit/core/compare/v3.2.0...HEAD
+[3.2.0]: https://github.com/munich-quantum-toolkit/core/compare/v3.1.0...v3.2.0
 [3.1.0]: https://github.com/munich-quantum-toolkit/core/compare/v3.0.0...v3.1.0
 [3.0.0]: https://github.com/munich-quantum-toolkit/core/compare/v2.7.0...v3.0.0
 

{mqt_core-3.1.0 → mqt_core-3.2.1}/bindings/dd/register_dd.cpp

@@ -22,7 +22,6 @@
 #include <pybind11/stl.h> // NOLINT(misc-include-cleaner)
 
 #include <pybind11/cast.h>
-#include <pybind11/numpy.h>
 // clang-format on
 
 #include <complex>

{mqt_core-3.1.0 → mqt_core-3.2.1}/bindings/dd/register_dd_package.cpp

@@ -27,6 +27,7 @@
 
 #include <pybind11/attr.h>
 #include <pybind11/cast.h>
+#include <pybind11/native_enum.h>
 #include <pybind11/numpy.h>
 // clang-format on
 
@@ -131,13 +132,15 @@ void registerDDPackage(const py::module& mod) {
       // keep the DD package alive while the returned vector DD is alive.
       py::keep_alive<0, 1>());
 
-  py::enum_<dd::BasisStates>(mod, "BasisStates")
+  py::native_enum<dd::BasisStates>(mod, "BasisStates", "enum.Enum",
+                                   "Enumeration of basis states.")
       .value("zero", dd::BasisStates::zero)
       .value("one", dd::BasisStates::one)
       .value("plus", dd::BasisStates::plus)
       .value("minus", dd::BasisStates::minus)
       .value("right", dd::BasisStates::right)
-      .value("left", dd::BasisStates::left);
+      .value("left", dd::BasisStates::left)
+      .finalize();
 
   dd.def(
       "basis_state",

{mqt_core-3.1.0 → mqt_core-3.2.1}/bindings/dd/register_matrix_dds.cpp

@@ -20,7 +20,7 @@
 
 #include <pybind11/buffer_info.h>
 #include <pybind11/cast.h>
-#include <pybind11/numpy.h>
+#include <pybind11/numpy.h> // NOLINT(misc-include-cleaner)
 // clang-format on
 
 #include <cmath>
@@ -44,7 +44,7 @@ struct Matrix {
 Matrix getMatrix(const dd::mEdge& m, const size_t numQubits,
                  const dd::fp threshold = 0.) {
   if (numQubits == 0U) {
-    return Matrix{{static_cast<std::complex<dd::fp>>(m.w)}, 1};
+    return Matrix{.data = {static_cast<std::complex<dd::fp>>(m.w)}, .n = 1};
   }
   const size_t dim = 1ULL << numQubits;
   auto data = std::vector<std::complex<dd::fp>>(dim * dim);
@@ -53,7 +53,7 @@ Matrix getMatrix(const dd::mEdge& m, const size_t numQubits,
       [&data, dim](const std::size_t i, const std::size_t j,
                    const std::complex<dd::fp>& c) { data[(i * dim) + j] = c; },
       numQubits, threshold);
-  return Matrix{data, dim};
+  return Matrix{.data = data, .n = dim};
 }
 
 // NOLINTNEXTLINE(misc-use-internal-linkage)

{mqt_core-3.1.0 → mqt_core-3.2.1}/bindings/dd/register_vector_dds.cpp

@@ -20,7 +20,7 @@
 
 #include <pybind11/buffer_info.h>
 #include <pybind11/cast.h>
-#include <pybind11/numpy.h>
+#include <pybind11/numpy.h> // NOLINT(misc-include-cleaner)
 // clang-format on
 
 #include <cmath>

{mqt_core-3.1.0 → mqt_core-3.2.1}/bindings/ir/operations/register_classic_controlled_operation.cpp

@@ -19,6 +19,7 @@
 #include <pybind11/stl.h> // NOLINT(misc-include-cleaner)
 
 #include <pybind11/cast.h>
+#include <pybind11/native_enum.h>
 // clang-format on
 
 #include <cstdint>
@@ -32,7 +33,9 @@ using namespace pybind11::literals;
 
 // NOLINTNEXTLINE(misc-use-internal-linkage)
 void registerClassicControlledOperation(const py::module& m) {
-  py::enum_<qc::ComparisonKind>(m, "ComparisonKind")
+  py::native_enum<qc::ComparisonKind>(
+      m, "ComparisonKind", "enum.Enum",
+      "Enumeration of comparison types for classic-controlled operations.")
       .value("eq", qc::ComparisonKind::Eq)
       .value("neq", qc::ComparisonKind::Neq)
       .value("lt", qc::ComparisonKind::Lt)
@@ -40,10 +43,7 @@ void registerClassicControlledOperation(const py::module& m) {
       .value("gt", qc::ComparisonKind::Gt)
       .value("geq", qc::ComparisonKind::Geq)
       .export_values()
-      .def("__str__",
-           [](const qc::ComparisonKind& cmp) { return qc::toString(cmp); })
-      .def("__repr__",
-           [](const qc::ComparisonKind& cmp) { return qc::toString(cmp); });
+      .finalize();
 
   auto ccop = py::class_<qc::ClassicControlledOperation, qc::Operation>(
       m, "ClassicControlledOperation");

{mqt_core-3.1.0 → mqt_core-3.2.1}/bindings/ir/operations/register_compound_operation.cpp

@@ -42,7 +42,7 @@ void registerCompoundOperation(const py::module& m) {
     if (i < 0) {
       i += static_cast<DiffType>(size);
     }
-    if (i < 0 || static_cast<SizeType>(i) >= size) {
+    if (i < 0 || std::cmp_greater_equal(i, size)) {
       throw py::index_error();
     }
     return i;

{mqt_core-3.1.0 → mqt_core-3.2.1}/bindings/ir/operations/register_control.cpp

@@ -17,6 +17,7 @@
 #include <pybind11/stl.h> // NOLINT(misc-include-cleaner)
 
 #include <pybind11/cast.h>
+#include <pybind11/native_enum.h>
 #include <pybind11/operators.h>
 #include <pybind11/pytypes.h>
 // clang-format on
@@ -30,26 +31,12 @@ using namespace pybind11::literals;
 void registerControl(const py::module& m) {
 
   auto control = py::class_<qc::Control>(m, "Control");
-  auto controlType = py::enum_<qc::Control::Type>(control, "Type");
-  controlType.value("Pos", qc::Control::Type::Pos);
-  controlType.value("Neg", qc::Control::Type::Neg);
-  controlType.def(
-      "__str__",
-      [](const qc::Control::Type& type) {
-        return type == qc::Control::Type::Pos ? "Pos" : "Neg";
-      },
-      py::prepend());
-  controlType.def(
-      "__repr__",
-      [](const qc::Control::Type& type) {
-        return type == qc::Control::Type::Pos ? "Pos" : "Neg";
-      },
-      py::prepend());
-  controlType.def("__bool__", [](const qc::Control::Type& type) {
-    return type == qc::Control::Type::Pos;
-  });
-  py::implicitly_convertible<py::bool_, qc::Control::Type>();
-  py::implicitly_convertible<py::str, qc::Control::Type>();
+
+  py::native_enum<qc::Control::Type>(control, "Type", "enum.Enum",
+                                     "Enumeration of control types.")
+      .value("Pos", qc::Control::Type::Pos)
+      .value("Neg", qc::Control::Type::Neg)
+      .finalize();
 
   control.def(py::init<qc::Qubit, qc::Control::Type>(), "qubit"_a,
               "type_"_a = qc::Control::Type::Pos);

{mqt_core-3.1.0 → mqt_core-3.2.1}/bindings/ir/operations/register_optype.cpp

@@ -15,11 +15,9 @@
 #include <pybind11/pybind11.h>
 #include <pybind11/stl.h> // NOLINT(misc-include-cleaner)
 
-#include <pybind11/pytypes.h>
+#include <pybind11/native_enum.h>
 // clang-format on
 
-#include <string>
-
 namespace mqt {
 
 namespace py = pybind11;
@@ -27,7 +25,8 @@ using namespace pybind11::literals;
 
 // NOLINTNEXTLINE(misc-use-internal-linkage)
 void registerOptype(const py::module& m) {
-  py::enum_<qc::OpType>(m, "OpType")
+  py::native_enum<qc::OpType>(m, "OpType", "enum.Enum",
+                              "Enumeration of operation types.")
       .value("none", qc::OpType::None)
       .value("gphase", qc::OpType::GPhase)
       .value("i", qc::OpType::I)
@@ -68,12 +67,7 @@ void registerOptype(const py::module& m) {
       .value("barrier", qc::OpType::Barrier)
       .value("classic_controlled", qc::OpType::ClassicControlled)
       .export_values()
-      .def("__str__", [](const qc::OpType& op) { return qc::toString(op); })
-      .def("__repr__", [](const qc::OpType& op) { return qc::toString(op); })
-      .def(py::init([](const std::string& str) -> qc::OpType {
-        return qc::opTypeFromString(str);
-      }));
-  py::implicitly_convertible<py::str, qc::OpType>();
+      .finalize();
 }
 
 } // namespace mqt

{mqt_core-3.1.0 → mqt_core-3.2.1}/bindings/ir/register_quantum_computation.cpp

@@ -31,6 +31,7 @@
 #include <memory>
 #include <stdexcept>
 #include <string>
+#include <utility>
 #include <vector>
 
 namespace mqt {
@@ -47,7 +48,7 @@ void registerQuantumComputation(py::module& m) {
     if (i < 0) {
       i += static_cast<DiffType>(size);
     }
-    if (i < 0 || static_cast<SizeType>(i) >= size) {
+    if (i < 0 || std::cmp_greater_equal(i, size)) {
       throw py::index_error();
     }
     return i;

{mqt_core-3.1.0 → mqt_core-3.2.1}/cmake/CompilerOptions.cmake

@@ -29,7 +29,7 @@ function(enable_project_options target_name)
     option(ENABLE_COVERAGE "Enable coverage reporting for gcc/clang" FALSE)
     if(ENABLE_COVERAGE)
       target_compile_options(${target_name} INTERFACE --coverage -fprofile-arcs -ftest-coverage -O0)
-      target_link_libraries(${target_name} INTERFACE gcov --coverage)
+      target_link_libraries(${target_name} INTERFACE --coverage)
     endif()
 
     if(NOT DEPLOY)

{mqt_core-3.1.0 → mqt_core-3.2.1}/cmake/ExternalDependencies.cmake

@@ -25,7 +25,7 @@ if(BUILD_MQT_CORE_BINDINGS)
   message(STATUS "Python executable: ${Python_EXECUTABLE}")
 
   # add pybind11 library
-  find_package(pybind11 2.13.6 CONFIG REQUIRED)
+  find_package(pybind11 3.0.0 CONFIG REQUIRED)
 endif()
 
 set(JSON_VERSION

{mqt_core-3.1.0 → mqt_core-3.2.1}/include/mqt-core/datastructures/DirectedAcyclicGraph.hpp

@@ -38,10 +38,10 @@ public:
     closureMatrix[i][i] = true;
   }
   auto addEdge(const V& u, const V& v) -> void override {
-    if (this->mapping.find(u) == this->mapping.end()) {
+    if (!this->mapping.contains(u)) {
       addVertex(u);
     }
-    if (this->mapping.find(v) == this->mapping.end()) {
+    if (!this->mapping.contains(v)) {
       addVertex(v);
     }
     std::size_t const i = this->mapping.at(u);
@@ -62,10 +62,10 @@ public:
     }
   }
   [[nodiscard]] auto isReachable(const V& u, const V& v) const -> bool {
-    if (this->mapping.find(u) == this->mapping.end()) {
+    if (!this->mapping.contains(u)) {
       throw std::invalid_argument("Vertex u not in graph.");
     }
-    if (this->mapping.find(v) == this->mapping.end()) {
+    if (!this->mapping.contains(v)) {
       throw std::invalid_argument("Vertex v not in graph.");
     }
     return closureMatrix[this->mapping.at(u)][this->mapping.at(v)];

{mqt_core-3.1.0 → mqt_core-3.2.1}/include/mqt-core/datastructures/DirectedGraph.hpp

@@ -59,7 +59,7 @@ public:
   virtual ~DirectedGraph() = default;
   virtual auto addVertex(const V& v) -> void {
     // check whether the vertex is already in the graph, if so do nothing
-    if (mapping.find(v) != mapping.end()) {
+    if (mapping.contains(v)) {
       std::stringstream ss;
       ss << "The vertex " << v << " is already in the graph.";
       throw std::invalid_argument(ss.str());
@@ -75,10 +75,10 @@ public:
     outDegrees.emplace_back(0);
   }
   virtual auto addEdge(const V& u, const V& v) -> void {
-    if (mapping.find(u) == mapping.end()) {
+    if (!mapping.contains(u)) {
       addVertex(u);
     }
-    if (mapping.find(v) == mapping.end()) {
+    if (!mapping.contains(v)) {
       addVertex(v);
     }
     const auto i = mapping.at(u);
@@ -93,7 +93,7 @@ public:
   [[nodiscard]] auto getNVertices() const -> std::size_t { return nVertices; }
   [[nodiscard]] auto getNEdges() const -> std::size_t { return nEdges; }
   [[nodiscard]] auto getInDegree(const V& v) const -> std::size_t {
-    if (mapping.find(v) == mapping.end()) {
+    if (!mapping.contains(v)) {
       std::stringstream ss;
       ss << "The vertex " << v << " is not in the graph.";
       throw std::invalid_argument(ss.str());
@@ -102,7 +102,7 @@ public:
     return inDegrees[i];
   }
   [[nodiscard]] auto getOutDegree(const V& v) const -> std::size_t {
-    if (mapping.find(v) == mapping.end()) {
+    if (!mapping.contains(v)) {
       std::stringstream ss;
       ss << "The vertex " << v << " is not in the graph.";
       throw std::invalid_argument(ss.str());
@@ -113,18 +113,18 @@ public:
   [[nodiscard]] auto getVertices() const -> std::unordered_set<V> {
     return std::accumulate(mapping.cbegin(), mapping.cend(),
                            std::unordered_set<V>(),
-                           [](auto& acc, const auto& v) {
+                           [](auto acc, const auto& v) {
                              acc.emplace(v.first);
                              return acc;
                            });
   }
   [[nodiscard]] auto isEdge(const V& u, const V& v) const -> bool {
-    if (mapping.find(u) == mapping.end()) {
+    if (!mapping.contains(u)) {
       std::stringstream ss;
       ss << "The vertex " << u << " is not in the graph.";
       throw std::invalid_argument(ss.str());
     }
-    if (mapping.find(v) == mapping.end()) {
+    if (!mapping.contains(v)) {
       std::stringstream ss;
       ss << "The vertex " << v << " is not in the graph.";
       throw std::invalid_argument(ss.str());

{mqt_core-3.1.0 → mqt_core-3.2.1}/include/mqt-core/datastructures/UndirectedGraph.hpp

@@ -62,7 +62,7 @@ protected:
 public:
   auto addVertex(const V& v) -> void {
     // check whether the vertex is already in the graph, if so do nothing
-    if (mapping.find(v) == mapping.end()) {
+    if (!mapping.contains(v)) {
       mapping[v] = nVertices;
       invMapping.emplace_back(v);
       ++nVertices;
@@ -80,10 +80,10 @@ public:
     }
   }
   auto addEdge(const V& u, const V& v, const E& e) -> void {
-    if (mapping.find(u) == mapping.end()) {
+    if (!mapping.contains(u)) {
       addVertex(u);
     }
-    if (mapping.find(v) == mapping.end()) {
+    if (!mapping.contains(v)) {
       addVertex(v);
     }
     const auto i = mapping.at(u);
@@ -132,7 +132,7 @@ public:
   }
   [[nodiscard]] auto getAdjacentEdges(const V& v) const
       -> std::unordered_set<std::pair<V, V>, PairHash<V, V>> {
-    if (mapping.find(v) == mapping.end()) {
+    if (!mapping.contains(v)) {
       std::stringstream ss;
       ss << "The vertex " << v << " is not in the graph.";
       throw std::invalid_argument(ss.str());
@@ -149,7 +149,7 @@ public:
     return result;
   }
   [[nodiscard]] auto getNeighbours(const V& v) const -> std::unordered_set<V> {
-    if (mapping.find(v) == mapping.end()) {
+    if (!mapping.contains(v)) {
       std::stringstream ss;
       ss << "The vertex " << v << " is not in the graph.";
       throw std::invalid_argument(ss.str());
@@ -165,7 +165,7 @@ public:
     return result;
   }
   [[nodiscard]] auto getDegree(const V& v) const -> std::size_t {
-    if (mapping.find(v) == mapping.end()) {
+    if (!mapping.contains(v)) {
       std::stringstream ss;
       ss << "The vertex " << v << " is not in the graph.";
       throw std::invalid_argument(ss.str());
@@ -176,18 +176,18 @@ public:
   [[nodiscard]] auto getVertices() const -> std::unordered_set<V> {
     return std::accumulate(mapping.cbegin(), mapping.cend(),
                            std::unordered_set<V>(),
-                           [](auto& acc, const auto& v) {
+                           [](auto acc, const auto& v) {
                              acc.emplace(v.first);
                              return acc;
                            });
   }
   [[nodiscard]] auto isAdjacent(const V& u, const V& v) const -> bool {
-    if (mapping.find(u) == mapping.end()) {
+    if (!mapping.contains(u)) {
       std::stringstream ss;
       ss << "The vertex " << u << " is not in the graph.";
       throw std::invalid_argument(ss.str());
     }
-    if (mapping.find(v) == mapping.end()) {
+    if (!mapping.contains(v)) {
       std::stringstream ss;
       ss << "The vertex " << v << " is not in the graph.";
       throw std::invalid_argument(ss.str());

{mqt_core-3.1.0 → mqt_core-3.2.1}/include/mqt-core/dd/Node.hpp

@@ -57,7 +57,7 @@ struct NodeBase : LLBase {
   void mark() noexcept { flags |= MARK_FLAG; }
 
   /// @brief Unmark the node.
-  void unmark() noexcept { flags &= ~MARK_FLAG; }
+  void unmark() noexcept { flags &= static_cast<uint16_t>(~MARK_FLAG); }
 
   /// Getter for the next object.
   [[nodiscard]] NodeBase* next() const noexcept {