qiskit 2.0.1__tar.gz → 2.0.3__tar.gz

{qiskit-2.0.1 → qiskit-2.0.3}/Cargo.lock

@@ -1410,7 +1410,7 @@ dependencies = [
 
 [[package]]
 name = "qiskit-accelerate"
-version = "2.0.1"
+version = "2.0.3"
 dependencies = [
  "ahash 0.8.11",
  "approx",
@@ -1442,7 +1442,7 @@ dependencies = [
 
 [[package]]
 name = "qiskit-cext"
-version = "2.0.1"
+version = "2.0.3"
 dependencies = [
  "cbindgen",
  "num-complex",
@@ -1454,7 +1454,7 @@ dependencies = [
 
 [[package]]
 name = "qiskit-circuit"
-version = "2.0.1"
+version = "2.0.3"
 dependencies = [
  "ahash 0.8.11",
  "approx",
@@ -1476,7 +1476,7 @@ dependencies = [
 
 [[package]]
 name = "qiskit-pyext"
-version = "2.0.1"
+version = "2.0.3"
 dependencies = [
  "pyo3",
  "qiskit-accelerate",
@@ -1488,7 +1488,7 @@ dependencies = [
 
 [[package]]
 name = "qiskit-qasm2"
-version = "2.0.1"
+version = "2.0.3"
 dependencies = [
  "hashbrown 0.15.2",
  "num-bigint",
@@ -1498,7 +1498,7 @@ dependencies = [
 
 [[package]]
 name = "qiskit-qasm3"
-version = "2.0.1"
+version = "2.0.3"
 dependencies = [
  "ahash 0.8.11",
  "hashbrown 0.15.2",

{qiskit-2.0.1 → qiskit-2.0.3}/Cargo.toml

@@ -3,7 +3,7 @@ members = ["crates/*"]
 resolver = "2"
 
 [workspace.package]
-version = "2.0.1"
+version = "2.0.3"
 edition = "2021"
 rust-version = "1.79"  # Keep in sync with README.md, rust-toolchain.toml, and tools/install_rust_msrv.sh
 license = "Apache-2.0"

{qiskit-2.0.1 → qiskit-2.0.3}/PKG-INFO

@@ -1,15 +1,15 @@
 Metadata-Version: 2.4
 Name: qiskit
-Version: 2.0.1
+Version: 2.0.3
 Summary: An open-source SDK for working with quantum computers at the level of extended quantum circuits, operators, and primitives.
 Author-email: Qiskit Development Team <qiskit@us.ibm.com>
 License: Apache 2.0
 Project-URL: Homepage, https://www.ibm.com/quantum/qiskit
-Project-URL: Documentation, https://docs.quantum.ibm.com
-Project-URL: API Reference, https://docs.quantum.ibm.com/api/qiskit
+Project-URL: Documentation, https://quantum.cloud.ibm.com/docs
+Project-URL: API Reference, https://quantum.cloud.ibm.com/docs/api/qiskit
 Project-URL: Repository, https://github.com/Qiskit/qiskit
 Project-URL: Issues, https://github.com/Qiskit/qiskit/issues
-Project-URL: Changelog, https://docs.quantum.ibm.com/api/qiskit/release-notes
+Project-URL: Changelog, https://quantum.cloud.ibm.com/docs/api/qiskit/release-notes
 Keywords: qiskit,quantum circuit,quantum computing,quantum programming language,quantum,sdk
 Classifier: Environment :: Console
 Classifier: Intended Audience :: Developers
@@ -72,7 +72,7 @@ It also contains a transpiler that supports optimizing quantum circuits, and a q
 
 For more details on how to use Qiskit, refer to the documentation located here:
 
-<https://docs.quantum.ibm.com/>
+<https://quantum.cloud.ibm.com/docs/>
 
 
 ## Installation
@@ -85,7 +85,7 @@ pip install qiskit
 
 Pip will handle all dependencies automatically and you will always install the latest (and well-tested) version.
 
-To install from source, follow the instructions in the [documentation](https://docs.quantum.ibm.com/guides/install-qiskit-source).
+To install from source, follow the instructions in the [documentation](https://quantum.cloud.ibm.com/docs/guides/install-qiskit-source).
 
 ## Create your first quantum program in Qiskit
 
@@ -146,7 +146,7 @@ and see if you can achieve this outcome. (Spoiler alert: this is not possible!)
 Using the Qiskit-provided `qiskit.primitives.StatevectorSampler` and `qiskit.primitives.StatevectorEstimator` will not take you very far.
 The power of quantum computing cannot be simulated on classical computers and you need to use real quantum hardware to scale to larger quantum circuits.
 However, running a quantum circuit on hardware requires rewriting to the basis gates and connectivity of the quantum hardware.
-The tool that does this is the [transpiler](https://docs.quantum.ibm.com/api/qiskit/transpiler), and Qiskit includes transpiler passes for synthesis, optimization, mapping, and scheduling.
+The tool that does this is the [transpiler](https://quantum.cloud.ibm.com/docs/api/qiskit/transpiler), and Qiskit includes transpiler passes for synthesis, optimization, mapping, and scheduling.
 However, it also includes a default compiler, which works very well in most examples.
 The following code will map the example circuit to the `basis_gates = ["cz", "sx", "rz"]` and a linear chain of qubits $0 \rightarrow 1 \rightarrow 2$ with the `coupling_map = [[0, 1], [1, 2]]`.
 
@@ -209,7 +209,7 @@ release.
 
 Additionally, as part of each release, detailed release notes are written to
 document in detail what has changed as part of a release. This includes any
-documentation on potential breaking changes on upgrade and new features. See [all release notes here](https://docs.quantum.ibm.com/api/qiskit/release-notes).
+documentation on potential breaking changes on upgrade and new features. See [all release notes here](https://quantum.cloud.ibm.com/docs/api/qiskit/release-notes).
 
 ## Acknowledgements
 

{qiskit-2.0.1 → qiskit-2.0.3}/README.md

@@ -17,7 +17,7 @@ It also contains a transpiler that supports optimizing quantum circuits, and a q
 
 For more details on how to use Qiskit, refer to the documentation located here:
 
-<https://docs.quantum.ibm.com/>
+<https://quantum.cloud.ibm.com/docs/>
 
 
 ## Installation
@@ -30,7 +30,7 @@ pip install qiskit
 
 Pip will handle all dependencies automatically and you will always install the latest (and well-tested) version.
 
-To install from source, follow the instructions in the [documentation](https://docs.quantum.ibm.com/guides/install-qiskit-source).
+To install from source, follow the instructions in the [documentation](https://quantum.cloud.ibm.com/docs/guides/install-qiskit-source).
 
 ## Create your first quantum program in Qiskit
 
@@ -91,7 +91,7 @@ and see if you can achieve this outcome. (Spoiler alert: this is not possible!)
 Using the Qiskit-provided `qiskit.primitives.StatevectorSampler` and `qiskit.primitives.StatevectorEstimator` will not take you very far.
 The power of quantum computing cannot be simulated on classical computers and you need to use real quantum hardware to scale to larger quantum circuits.
 However, running a quantum circuit on hardware requires rewriting to the basis gates and connectivity of the quantum hardware.
-The tool that does this is the [transpiler](https://docs.quantum.ibm.com/api/qiskit/transpiler), and Qiskit includes transpiler passes for synthesis, optimization, mapping, and scheduling.
+The tool that does this is the [transpiler](https://quantum.cloud.ibm.com/docs/api/qiskit/transpiler), and Qiskit includes transpiler passes for synthesis, optimization, mapping, and scheduling.
 However, it also includes a default compiler, which works very well in most examples.
 The following code will map the example circuit to the `basis_gates = ["cz", "sx", "rz"]` and a linear chain of qubits $0 \rightarrow 1 \rightarrow 2$ with the `coupling_map = [[0, 1], [1, 2]]`.
 
@@ -154,7 +154,7 @@ release.
 
 Additionally, as part of each release, detailed release notes are written to
 document in detail what has changed as part of a release. This includes any
-documentation on potential breaking changes on upgrade and new features. See [all release notes here](https://docs.quantum.ibm.com/api/qiskit/release-notes).
+documentation on potential breaking changes on upgrade and new features. See [all release notes here](https://quantum.cloud.ibm.com/docs/api/qiskit/release-notes).
 
 ## Acknowledgements
 

{qiskit-2.0.1 → qiskit-2.0.3}/crates/accelerate/src/basis/basis_translator/mod.rs

@@ -170,7 +170,7 @@ fn run(
             basis: {:?}. This likely means the target basis is not universal \
             or there are additional equivalence rules needed in the EquivalenceLibrary being \
             used. For more details on this error see: \
-            https://docs.quantum.ibm.com/api/qiskit/qiskit.transpiler.passes.\
+            https://quantum.cloud.ibm.com/docs/api/qiskit/qiskit.transpiler.passes.\
             BasisTranslator#translation-errors",
                 local_source_basis
                     .iter()
@@ -188,7 +188,7 @@ fn run(
         basis: {:?}. This likely means the target basis is not universal \
         or there are additional equivalence rules needed in the EquivalenceLibrary being \
         used. For more details on this error see: \
-        https://docs.quantum.ibm.com/api/qiskit/qiskit.transpiler.passes. \
+        https://quantum.cloud.ibm.com/docs/api/qiskit/qiskit.transpiler.passes. \
         BasisTranslator#translation-errors",
             source_basis.iter().map(|x| x.0.as_str()).collect_vec(),
             &new_target_basis

{qiskit-2.0.1 → qiskit-2.0.3}/crates/accelerate/src/elide_permutations.rs

@@ -58,17 +58,13 @@ fn run(py: Python, dag: &mut DAGCircuit) -> PyResult<Option<(DAGCircuit, Vec<usi
                             .map(|q| q.index())
                             .collect();
 
-                        let remapped_qindices: Vec<usize> = (0..qindices.len())
-                            .map(|i| pattern[i])
-                            .map(|i| qindices[i as usize])
+                        let new_values: Vec<usize> = (0..qindices.len())
+                            .map(|i| mapping[qindices[pattern[i] as usize]])
                             .collect();
 
-                        qindices
-                            .iter()
-                            .zip(remapped_qindices.iter())
-                            .for_each(|(old, new)| {
-                                mapping[*old] = *new;
-                            });
+                        for i in 0..qindices.len() {
+                            mapping[qindices[i]] = new_values[i];
+                        }
                     } else {
                         unreachable!();
                     }

{qiskit-2.0.1 → qiskit-2.0.3}/crates/accelerate/src/equivalence.rs

@@ -300,7 +300,7 @@ impl<'py> FromPyObject<'py> for GateOper {
 /// called from Python, or once the API is able to seamlessly accept instances
 /// of [CircuitData].
 ///
-/// [`QuantumCircuit`]: https://docs.quantum.ibm.com/api/qiskit/qiskit.circuit.QuantumCircuit
+/// [`QuantumCircuit`]: https://quantum.cloud.ibm.com/docs/api/qiskit/qiskit.circuit.QuantumCircuit
 #[derive(Debug, Clone)]
 pub struct CircuitFromPython(pub CircuitData);
 

{qiskit-2.0.1 → qiskit-2.0.3}/crates/accelerate/src/high_level_synthesis.rs

@@ -477,6 +477,7 @@ fn run_on_circuitdata(
             .iter()
             .map(|q| input_qubits[q.index()])
             .collect::<Vec<usize>>();
+        let op_clbits = input_circuit.get_cargs(inst.clbits);
 
         // Start by handling special operations.
         // In the future, we can also consider other possible optimizations, e.g.:
@@ -629,8 +630,10 @@ fn run_on_circuitdata(
                         .iter()
                         .map(|q| Qubit::new(qubit_map[&q.index()]))
                         .collect();
-                    let inst_outer_clbits: Vec<Clbit> =
-                        inst_inner_clbits.iter().map(|c| Clbit(c.0)).collect();
+                    let inst_outer_clbits: Vec<Clbit> = inst_inner_clbits
+                        .iter()
+                        .map(|c| op_clbits[c.0 as usize])
+                        .collect();
 
                     output_circuit.push_packed_operation(
                         inst_inner.op.clone(),

{qiskit-2.0.1 → qiskit-2.0.3}/pyproject.toml

@@ -63,11 +63,11 @@ all = ["qiskit[qasm3-import,visualization,crosstalk-pass,csp-layout-pass]"]
 
 [project.urls]
 Homepage = "https://www.ibm.com/quantum/qiskit"
-Documentation = "https://docs.quantum.ibm.com"
-"API Reference" = "https://docs.quantum.ibm.com/api/qiskit"
+Documentation = "https://quantum.cloud.ibm.com/docs"
+"API Reference" = "https://quantum.cloud.ibm.com/docs/api/qiskit"
 Repository = "https://github.com/Qiskit/qiskit"
 Issues = "https://github.com/Qiskit/qiskit/issues"
-Changelog = "https://docs.quantum.ibm.com/api/qiskit/release-notes"
+Changelog = "https://quantum.cloud.ibm.com/docs/api/qiskit/release-notes"
 
 [project.entry-points."qiskit.unitary_synthesis"]
 default = "qiskit.transpiler.passes.synthesis.default_unitary_synth_plugin:DefaultUnitarySynthesis"

qiskit-2.0.3/qiskit/VERSION.txt

@@ -0,0 +1 @@
+2.0.3

{qiskit-2.0.1 → qiskit-2.0.3}/qiskit/circuit/library/arithmetic/adders/adder.py

@@ -48,7 +48,7 @@ class Adder(QuantumCircuit):
             "Use the adder gates provided in qiskit.circuit.library.arithmetic instead. "
             "The gate type depends on the adder kind: fixed, half, full are represented by "
             "ModularAdderGate, HalfAdderGate, FullAdderGate, respectively. For different adder "
-            "implementations, see https://docs.quantum.ibm.com/api/qiskit/synthesis.",
+            "implementations, see https://quantum.cloud.ibm.com/docs/api/qiskit/synthesis.",
         ),
         pending=True,
     )

{qiskit-2.0.1 → qiskit-2.0.3}/qiskit/circuit/library/arithmetic/multipliers/multiplier.py

@@ -51,7 +51,7 @@ class Multiplier(QuantumCircuit):
         additional_msg=(
             "Use the MultiplierGate provided in qiskit.circuit.library.arithmetic instead. "
             "For different multiplier implementations, see "
-            "https://docs.quantum.ibm.com/api/qiskit/synthesis.",
+            "https://quantum.cloud.ibm.com/docs/api/qiskit/synthesis.",
         ),
         pending=True,
     )

{qiskit-2.0.1 → qiskit-2.0.3}/qiskit/circuit/library/boolean_logic/quantum_or.py

@@ -151,11 +151,11 @@ class OrGate(Gate):
     ) -> None:
         """
         Args:
-            num_variable_qubits: The qubits of which the AND is computed. The result will be written
+            num_variable_qubits: The qubits of which the OR is computed. The result will be written
                 into an additional result qubit.
             flags: A list of +1/0/-1 marking negations or omissions of qubits.
         """
-        super().__init__("and", num_variable_qubits + 1, [])
+        super().__init__("or", num_variable_qubits + 1, [])
         self.num_variable_qubits = num_variable_qubits
         self.flags = flags
 

{qiskit-2.0.1 → qiskit-2.0.3}/qiskit/circuit/library/n_local/evolved_operator_ansatz.py

@@ -27,6 +27,7 @@ from qiskit.circuit import QuantumRegister
 from qiskit.circuit.quantumcircuit import QuantumCircuit
 from qiskit.quantum_info import Operator, Pauli, SparsePauliOp
 from qiskit.quantum_info.operators.base_operator import BaseOperator
+from qiskit.synthesis.evolution.product_formula import real_or_fail
 
 from qiskit._accelerate.circuit_library import pauli_evolution
 
@@ -136,7 +137,8 @@ def evolved_operator_ansatz(
             for term in sparse_labels:
                 param = next(param_iter)
                 expanded_paulis += [
-                    (pauli, indices, 2 * coeff * param) for pauli, indices, coeff in term
+                    (pauli, indices, 2 * real_or_fail(coeff) * param)
+                    for pauli, indices, coeff in term
                 ]
 
         data = pauli_evolution(num_qubits, expanded_paulis, insert_barriers, False)

{qiskit-2.0.1 → qiskit-2.0.3}/qiskit/circuit/library/quantum_volume.py

@@ -174,6 +174,7 @@ def quantum_volume(
     `arXiv:1811.12926 <https://arxiv.org/abs/1811.12926>`__
     """
     if isinstance(seed, np.random.Generator):
-        seed = seed.integers(0, dtype=np.uint64)
+        max_value = np.iinfo(np.int64).max
+        seed = seed.integers(max_value, dtype=np.int64)
     depth = depth or num_qubits
     return QuantumCircuit._from_circuit_data(qv_rs(num_qubits, depth, seed))

{qiskit-2.0.1 → qiskit-2.0.3}/qiskit/circuit/quantumcircuit.py

@@ -2248,7 +2248,7 @@ class QuantumCircuit:
 
         Remember that in the little-endian convention the leftmost operation will be at the bottom
         of the circuit. See also
-        `the docs <https://docs.quantum.ibm.com/guides/construct-circuits>`__
+        `the docs <https://quantum.cloud.ibm.com/docs/guides/construct-circuits>`__
         for more information.
 
         .. code-block:: text
@@ -3591,7 +3591,7 @@ class QuantumCircuit:
         parameter_map: dict[Parameter, ParameterValueType] | None = None,
         label: str | None = None,
     ) -> Gate:
-        """Create a :class:`.Gate` out of this circuit.  The circuit must act only qubits and
+        """Create a :class:`.Gate` out of this circuit.  The circuit must act only on qubits and
         contain only unitary operations.
 
         .. seealso::

{qiskit-2.0.1 → qiskit-2.0.3}/qiskit/dagcircuit/__init__.py

@@ -36,7 +36,18 @@ Exceptions
 
 .. autoexception:: DAGCircuitError
 .. autoexception:: DAGDependencyError
+
+Utilities
+=========
+
+.. autosummary::
+   :toctree: ../stubs/
+
+   BlockCollapser
+   BlockCollector
+   BlockSplitter
 """
+from .collect_blocks import BlockCollapser, BlockCollector, BlockSplitter
 from .dagcircuit import DAGCircuit
 from .dagnode import DAGNode, DAGOpNode, DAGInNode, DAGOutNode
 from .dagdepnode import DAGDepNode

{qiskit-2.0.1 → qiskit-2.0.3}/qiskit/dagcircuit/collect_blocks.py

@@ -17,11 +17,12 @@ from __future__ import annotations
 
 from collections.abc import Iterable, Callable
 
-from qiskit.dagcircuit import DAGDepNode
-
 from qiskit.circuit import QuantumCircuit, CircuitInstruction, ClassicalRegister, Bit
 from qiskit.circuit.controlflow import condition_resources
-from . import DAGOpNode, DAGCircuit, DAGDependency
+from qiskit.dagcircuit.dagcircuit import DAGCircuit
+from qiskit.dagcircuit.dagdependency import DAGDependency
+from qiskit.dagcircuit.dagnode import DAGOpNode
+from qiskit.dagcircuit.dagdepnode import DAGDepNode
 from .exceptions import DAGCircuitError
 
 
@@ -338,15 +339,18 @@ def split_block_into_layers(block: list[DAGOpNode | DAGDepNode]):
 
 class BlockCollapser:
     """This class implements various strategies of consolidating blocks of nodes
-     in a DAG (direct acyclic graph). It works both with the
-    :class:`~qiskit.dagcircuit.DAGCircuit` and
-    :class:`~qiskit.dagcircuit.DAGDependency` DAG representations.
+    in a DAG (direct acyclic graph). It works both with
+    the :class:`~qiskit.dagcircuit.DAGCircuit`
+    and :class:`~qiskit.dagcircuit.DAGDependency` DAG representations.
     """
 
     def __init__(self, dag):
         """
         Args:
             dag (Union[DAGCircuit, DAGDependency]): The input DAG.
+
+        Raises:
+            DAGCircuitError: the input object is not a DAG.
         """
 
         self.dag = dag

{qiskit-2.0.1 → qiskit-2.0.3}/qiskit/qpy/__init__.py

@@ -1096,7 +1096,7 @@ In addition, new payload MAP_ITEM is defined to implement the :ref:`qpy_mapping`
 
 With the support of ``ScheduleBlock``, now :class:`~.QuantumCircuit` can be
 serialized together with :attr:`~.QuantumCircuit.calibrations`, or
-`Pulse Gates <https://docs.quantum.ibm.com/guides/pulse>`_.
+`Pulse Gates <https://quantum.cloud.ibm.com/docs/guides/pulse>`_.
 In QPY version 5 and above, :ref:`qpy_circuit_calibrations` payload is
 packed after the :ref:`qpy_instructions` block.
 

{qiskit-2.0.1 → qiskit-2.0.3}/qiskit/quantum_info/operators/symplectic/sparse_pauli_op.py

@@ -992,7 +992,7 @@ class SparsePauliOp(LinearOp):
                 array (the default).
             force_serial: if ``True``, use an unthreaded implementation, regardless of the state of
                 the `Qiskit threading-control environment variables
-                <https://docs.quantum.ibm.com/guides/configure-qiskit-local#environment-variables>`__.
+                <https://quantum.cloud.ibm.com/docs/guides/configure-qiskit-local#environment-variables>`__.
                 By default, this will use threaded parallelism over the available CPUs.
 
         Returns:

{qiskit-2.0.1 → qiskit-2.0.3}/qiskit/transpiler/__init__.py

@@ -237,7 +237,7 @@ Initialization stage
 --------------------
 
 .. seealso::
-    `Init stage explanation <https://docs.quantum.ibm.com/guides/transpiler-stages#init-stage>`__
+    `Init stage explanation <https://quantum.cloud.ibm.com/docs/guides/transpiler-stages#init-stage>`__
         Higher-level user-facing explanation of the init stage in the IBM Quantum guide.
 
 The ``init`` stage is responsible for high-level, logical optimizations on abstract circuits, and
@@ -291,9 +291,11 @@ Layout stage
 ------------
 
 .. seealso::
-    `Layout stage explanation <https://docs.quantum.ibm.com/guides/transpiler-stages#layout-stage>`__
+    `Layout stage explanation`__
         Higher-level user-facing explanation of the layout stage in the IBM Quantum guide.
 
+__ https://quantum.cloud.ibm.com/docs/guides/transpiler-stages#layout-stage
+
 The layout stage is responsible for making an initial mapping between the virtual qubits of the
 input circuit, and the hardware qubits of the target.  This includes expanding the input circuit
 with explicit ancillas so it has as many qubits as the target has, and rewriting all operations in
@@ -452,9 +454,11 @@ Routing stage
 -------------
 
 .. seealso::
-    `Routing stage explanation <https://docs.quantum.ibm.com/guides/transpiler-stages#routing-stage>`__
+    `Routing stage explanation`__
         Higher-level user-facing explanation of the routing stage in the IBM Quantum guide.
 
+__ https://quantum.cloud.ibm.com/docs/guides/transpiler-stages#routing-stage
+
 The routing stage ensures that the virtual connectivity graph of the circuit is compatible with the
 hardware connectivity graph of the target.  In simpler terms, the routing stage makes sure that all
 two-qubit gates in the circuit are mapped to hardware qubits that have a defined two-qubit operation
@@ -598,7 +602,7 @@ Translation stage
     `Translation stage explanation`__
         Higher-level user-facing explanation of the translation stage in the IBM Quantum guide.
 
-.. __: https://docs.quantum.ibm.com/guides/transpiler-stages#translation-stage
+.. __: https://quantum.cloud.ibm.com/docs/guides/transpiler-stages#translation-stage
 
 The translation stage is responsible for rewriting all gates in the circuit into ones that are
 supported by the target ISA.  For example, if a ``cx`` is requested on hardware qubits 0 and 1, but
@@ -687,7 +691,7 @@ Optimization stage
     `Optimization stage explanation`__
         Higher-level user-facing explanation of the optimization stage in the IBM Quantum guide.
 
-.. __: https://docs.quantum.ibm.com/guides/transpiler-stages#optimization-stage
+.. __: https://quantum.cloud.ibm.com/docs/guides/transpiler-stages#optimization-stage
 
 The optimization stage is for low-level hardware-aware optimizations.  Unlike :ref:`the init stage
 <transpiler-preset-stage-init>`, the input to this stage is a circuit that is already

{qiskit-2.0.1 → qiskit-2.0.3}/qiskit/transpiler/passes/layout/apply_layout.py

@@ -48,11 +48,11 @@ class ApplyLayout(TransformationPass):
             TranspilerError: if no layout is found in ``property_set`` or no full physical qubits.
         """
         layout = self.property_set["layout"]
-        if not layout:
+        if layout is None:
             raise TranspilerError(
                 "No 'layout' is found in property_set. Please run a Layout pass in advance."
             )
-        if len(layout) != (1 + max(layout.get_physical_bits())):
+        if len(layout) != (1 + max(layout.get_physical_bits(), default=-1)):
             raise TranspilerError("The 'layout' must be full (with ancilla).")
 
         post_layout = self.property_set["post_layout"]

{qiskit-2.0.1 → qiskit-2.0.3}/qiskit/transpiler/passes/layout/vf2_utils.py

@@ -179,7 +179,9 @@ def build_average_error_map(target, coupling_map):
         coupling_map = target.build_coupling_map()
     if not built and coupling_map is not None and num_qubits is not None:
         for qubit in range(num_qubits):
-            degree = len(set(coupling_map.graph.neighbors_undirected(qubit)))
+            neighbor_set = set(coupling_map.graph.successor_indices(qubit))
+            neighbor_set.update(coupling_map.graph.predecessor_indices(qubit))
+            degree = len(neighbor_set)
             avg_map.add_error((qubit, qubit), degree / num_qubits)
         for edge in coupling_map.graph.edge_list():
             avg_map.add_error(edge, (avg_map[edge[0], edge[0]] + avg_map[edge[1], edge[1]]) / 2)

{qiskit-2.0.1 → qiskit-2.0.3}/qiskit/transpiler/passes/optimization/consolidate_blocks.py

@@ -91,6 +91,7 @@ class ConsolidateBlocks(TransformationPass):
         """
         super().__init__()
         self.basis_gates = None
+        self.basis_gate_name = None
         # Bypass target if it doesn't contain any basis gates (i.e. it's a _FakeTarget), as this
         # not part of the official target model.
         self.target = target if target is not None and len(target.operation_names) > 0 else None
@@ -99,6 +100,7 @@ class ConsolidateBlocks(TransformationPass):
         self.force_consolidate = force_consolidate
         if kak_basis_gate is not None:
             self.decomposer = TwoQubitBasisDecomposer(kak_basis_gate)
+            self.basis_gate_name = kak_basis_gate.name
         elif basis_gates is not None:
             kak_gates = KAK_GATE_NAMES.keys() & (basis_gates or [])
             kak_param_gates = KAK_GATE_PARAM_NAMES.keys() & (basis_gates or [])
@@ -106,14 +108,17 @@ class ConsolidateBlocks(TransformationPass):
                 self.decomposer = TwoQubitControlledUDecomposer(
                     KAK_GATE_PARAM_NAMES[list(kak_param_gates)[0]]
                 )
+                self.basis_gate_name = list(kak_param_gates)[0]
             elif kak_gates:
                 self.decomposer = TwoQubitBasisDecomposer(
                     KAK_GATE_NAMES[list(kak_gates)[0]], basis_fidelity=approximation_degree or 1.0
                 )
+                self.basis_gate_name = list(kak_gates)[0]
             else:
                 self.decomposer = None
         else:
             self.decomposer = TwoQubitBasisDecomposer(CXGate())
+            self.basis_gate_name = "cx"
 
     def run(self, dag):
         """Run the ConsolidateBlocks pass on `dag`.
@@ -134,7 +139,7 @@ class ConsolidateBlocks(TransformationPass):
         consolidate_blocks(
             dag,
             self.decomposer._inner_decomposer,
-            self.decomposer.gate_name,
+            self.basis_gate_name,
             self.force_consolidate,
             target=self.target,
             basis_gates=self.basis_gates,

{qiskit-2.0.1 → qiskit-2.0.3}/qiskit/transpiler/passes/routing/sabre_swap.py

@@ -374,6 +374,14 @@ def _apply_sabre_result(
         empty.add_clbits(block.clbits)
         for creg in block.cregs:
             empty.add_creg(creg)
+        for var_ in block.iter_declared_vars():
+            empty.add_declared_var(var_)
+        for var_ in block.iter_captured_vars():
+            empty.add_captured_var(var_)
+        for stretch in block.iter_declared_stretches():
+            empty.add_declared_stretch(stretch)
+        for stretch in block.iter_captured_stretches():
+            empty.add_captured_stretch(stretch)
         empty.global_phase = block.global_phase
         return empty
 

{qiskit-2.0.1 → qiskit-2.0.3}/qiskit/transpiler/passes/synthesis/hls_plugins.py

@@ -1696,13 +1696,15 @@ class PauliEvolutionSynthesisDefault(HighLevelSynthesisPlugin):
             # Don't do anything if a gate is called "evolution" but is not an
             # actual PauliEvolutionGate
             return None
-
         algo = high_level_object.synthesis
 
+        original_preserve_order = algo.preserve_order
         if "preserve_order" in options and isinstance(algo, ProductFormula):
             algo.preserve_order = options["preserve_order"]
 
-        return algo.synthesize(high_level_object)
+        synth_object = algo.synthesize(high_level_object)
+        algo.preserve_order = original_preserve_order
+        return synth_object
 
 
 class PauliEvolutionSynthesisRustiq(HighLevelSynthesisPlugin):
@@ -1753,6 +1755,7 @@ class PauliEvolutionSynthesisRustiq(HighLevelSynthesisPlugin):
             )
             return None
 
+        original_preserve_order = algo.preserve_order
         if "preserve_order" in options:
             algo.preserve_order = options["preserve_order"]
 
@@ -1765,7 +1768,7 @@ class PauliEvolutionSynthesisRustiq(HighLevelSynthesisPlugin):
         upto_phase = options.get("upto_phase", False)
         resynth_clifford_method = options.get("resynth_clifford_method", 1)
 
-        return synth_pauli_network_rustiq(
+        synth_object = synth_pauli_network_rustiq(
             num_qubits=num_qubits,
             pauli_network=pauli_network,
             optimize_count=optimize_count,
@@ -1774,6 +1777,8 @@ class PauliEvolutionSynthesisRustiq(HighLevelSynthesisPlugin):
             upto_phase=upto_phase,
             resynth_clifford_method=resynth_clifford_method,
         )
+        algo.preserve_order = original_preserve_order
+        return synth_object
 
 
 class AnnotatedSynthesisDefault(HighLevelSynthesisPlugin):