qiskit 1.3.0b1__cp39-abi3-win32.whl → 1.3.0rc2__cp39-abi3-win32.whl

qiskit/transpiler/passes/optimization/echo_rzx_weyl_decomposition.py

@@ -21,6 +21,7 @@ from qiskit.transpiler.basepasses import TransformationPass
 from qiskit.transpiler.exceptions import TranspilerError
 from qiskit.transpiler.layout import Layout
 from qiskit.transpiler.passes.calibration.rzx_builder import _check_calibration_type, CRCalType
+from qiskit.utils.deprecate_pulse import deprecate_pulse_dependency
 
 from qiskit.dagcircuit import DAGCircuit
 from qiskit.converters import circuit_to_dag
@@ -34,6 +35,7 @@ class EchoRZXWeylDecomposition(TransformationPass):
     Each pair of RZXGates forms an echoed RZXGate.
     """
 
+    @deprecate_pulse_dependency
     def __init__(self, instruction_schedule_map=None, target=None):
         """EchoRZXWeylDecomposition pass.
 
@@ -62,7 +64,7 @@ class EchoRZXWeylDecomposition(TransformationPass):
     def _echo_rzx_dag(theta):
         """Return the following circuit
 
-        .. parsed-literal::
+        .. code-block:: text
 
                  ┌───────────────┐┌───┐┌────────────────┐┌───┐
             q_0: ┤0              ├┤ X ├┤0               ├┤ X ├
@@ -83,7 +85,7 @@ class EchoRZXWeylDecomposition(TransformationPass):
     def _reverse_echo_rzx_dag(theta):
         """Return the following circuit
 
-        .. parsed-literal::
+        .. code-block:: text
 
                  ┌───┐┌───────────────┐     ┌────────────────┐┌───┐
             q_0: ┤ H ├┤1              ├─────┤1               ├┤ H ├─────

qiskit/transpiler/passes/optimization/elide_permutations.py

@@ -15,10 +15,9 @@
 
 import logging
 
-from qiskit.circuit.library.standard_gates import SwapGate
-from qiskit.circuit.library.generalized_gates import PermutationGate
 from qiskit.transpiler.basepasses import TransformationPass
 from qiskit.transpiler.layout import Layout
+from qiskit._accelerate import elide_permutations as elide_permutations_rs
 
 logger = logging.getLogger(__name__)
 
@@ -67,38 +66,16 @@ class ElidePermutations(TransformationPass):
             )
             return dag
 
-        op_count = dag.count_ops(recurse=False)
-        if op_count.get("swap", 0) == 0 and op_count.get("permutation", 0) == 0:
+        result = elide_permutations_rs.run(dag)
+
+        # If the pass did not do anything, the result is None
+        if result is None:
             return dag
 
-        new_dag = dag.copy_empty_like()
-        qubit_mapping = list(range(len(dag.qubits)))
-
-        def _apply_mapping(qargs):
-            return tuple(dag.qubits[qubit_mapping[dag.find_bit(qubit).index]] for qubit in qargs)
-
-        for node in dag.topological_op_nodes():
-            if not isinstance(node.op, (SwapGate, PermutationGate)):
-                new_dag.apply_operation_back(
-                    node.op, _apply_mapping(node.qargs), node.cargs, check=False
-                )
-            elif getattr(node.op, "condition", None) is not None:
-                new_dag.apply_operation_back(
-                    node.op, _apply_mapping(node.qargs), node.cargs, check=False
-                )
-            elif isinstance(node.op, SwapGate):
-                index_0 = dag.find_bit(node.qargs[0]).index
-                index_1 = dag.find_bit(node.qargs[1]).index
-                qubit_mapping[index_1], qubit_mapping[index_0] = (
-                    qubit_mapping[index_0],
-                    qubit_mapping[index_1],
-                )
-            elif isinstance(node.op, PermutationGate):
-                starting_indices = [qubit_mapping[dag.find_bit(qarg).index] for qarg in node.qargs]
-                pattern = node.op.params[0]
-                pattern_indices = [qubit_mapping[idx] for idx in pattern]
-                for i, j in zip(starting_indices, pattern_indices):
-                    qubit_mapping[i] = j
+        # Otherwise, the result is a pair consisting of the rewritten DAGCircuit and the
+        # qubit mapping.
+        (new_dag, qubit_mapping) = result
+
         input_qubit_mapping = {qubit: index for index, qubit in enumerate(dag.qubits)}
         self.property_set["original_layout"] = Layout(input_qubit_mapping)
         if self.property_set["original_qubit_indices"] is None:

qiskit/transpiler/passes/optimization/optimize_1q_decomposition.py

@@ -170,13 +170,13 @@ class Optimize1qGatesDecomposition(TransformationPass):
             return False
 
         # do we even have calibrations?
-        has_cals_p = dag.calibrations is not None and len(dag.calibrations) > 0
+        has_cals_p = dag._calibrations_prop is not None and len(dag._calibrations_prop) > 0
         # does this run have uncalibrated gates?
-        uncalibrated_p = not has_cals_p or any(not dag.has_calibration_for(g) for g in old_run)
+        uncalibrated_p = not has_cals_p or any(not dag._has_calibration_for(g) for g in old_run)
         # does this run have gates not in the image of ._decomposers _and_ uncalibrated?
         if basis is not None:
             uncalibrated_and_not_basis_p = any(
-                g.name not in basis and (not has_cals_p or not dag.has_calibration_for(g))
+                g.name not in basis and (not has_cals_p or not dag._has_calibration_for(g))
                 for g in old_run
             )
         else:
@@ -222,18 +222,12 @@ class Optimize1qGatesDecomposition(TransformationPass):
     def _error(self, circuit, qubit):
         """
         Calculate a rough error for a `circuit` that runs on a specific
-        `qubit` of `target` (`circuit` can either be an OneQubitGateSequence
-        from Rust or a list of DAGOPNodes).
+        `qubit` of `target` (`circuit` is a list of DAGOPNodes).
 
         Use basis errors from target if available, otherwise use length
         of circuit as a weak proxy for error.
         """
-        if isinstance(circuit, euler_one_qubit_decomposer.OneQubitGateSequence):
-            return euler_one_qubit_decomposer.compute_error_one_qubit_sequence(
-                circuit, qubit, self.error_map
-            )
-        else:
-            return euler_one_qubit_decomposer.compute_error_list(circuit, qubit, self.error_map)
+        return euler_one_qubit_decomposer.compute_error_list(circuit, qubit, self.error_map)
 
 
 def _possible_decomposers(basis_set):

qiskit/transpiler/passes/optimization/optimize_1q_gates.py

@@ -86,7 +86,7 @@ class Optimize1qGates(TransformationPass):
             for current_node in run:
                 left_name = current_node.name
                 if (
-                    getattr(current_node.op, "condition", None) is not None
+                    getattr(current_node, "condition", None) is not None
                     or len(current_node.qargs) != 1
                     or left_name not in ["p", "u1", "u2", "u3", "u", "id"]
                 ):

qiskit/transpiler/passes/optimization/optimize_swap_before_measure.py

@@ -40,7 +40,7 @@ class OptimizeSwapBeforeMeasure(TransformationPass):
 
         swaps = dag.op_nodes(SwapGate)
         for swap in swaps[::-1]:
-            if getattr(swap.op, "condition", None) is not None:
+            if getattr(swap.op, "_condition", None) is not None:
                 continue
             final_successor = []
             for successor in dag.descendants(swap):

qiskit/transpiler/passes/optimization/remove_identity_equiv.py

@@ -0,0 +1,69 @@
+# This code is part of Qiskit.
+#
+# (C) Copyright IBM 2024.
+#
+# This code is licensed under the Apache License, Version 2.0. You may
+# obtain a copy of this license in the LICENSE.txt file in the root directory
+# of this source tree or at http://www.apache.org/licenses/LICENSE-2.0.
+#
+# Any modifications or derivative works of this code must retain this
+# copyright notice, and modified files need to carry a notice indicating
+# that they have been altered from the originals.
+
+"""Transpiler pass to drop gates with negligible effects."""
+
+from __future__ import annotations
+
+from qiskit.dagcircuit import DAGCircuit
+from qiskit.transpiler.target import Target
+from qiskit.transpiler.basepasses import TransformationPass
+from qiskit._accelerate.remove_identity_equiv import remove_identity_equiv
+
+
+class RemoveIdentityEquivalent(TransformationPass):
+    r"""Remove gates with negligible effects.
+
+    Removes gates whose effect is close to an identity operation, up to the specified
+    tolerance. Zero qubit gates such as :class:`.GlobalPhaseGate` are not considered
+    by this pass.
+
+    For a cutoff fidelity :math:`f`, this pass removes gates whose average
+    gate fidelity with respect to the identity is below :math:`f`. Concretely,
+    a gate :math:`G` is removed if :math:`\bar F < f` where
+
+    .. math::
+
+        \bar{F} = \frac{1 + F_{\text{process}}}{1 + d},\ 
+
+        F_{\text{process}} = \frac{|\mathrm{Tr}(G)|^2}{d^2}
+
+    where :math:`d = 2^n` is the dimension of the gate for :math:`n` qubits.
+    """
+
+    def __init__(
+        self, *, approximation_degree: float | None = 1.0, target: None | Target = None
+    ) -> None:
+        """Initialize the transpiler pass.
+
+        Args:
+            approximation_degree: The degree to approximate for the equivalence check. This can be a
+                floating point value between 0 and 1, or ``None``. If the value is 1 this does not
+                approximate above floating point precision. For a value < 1 this is used as a scaling
+                factor for the cutoff fidelity. If the value is ``None`` this approximates up to the
+                fidelity for the gate specified in ``target``.
+
+            target: If ``approximation_degree`` is set to ``None`` and a :class:`.Target` is provided
+                for this field the tolerance for determining whether an operation is equivalent to
+                identity will be set to the reported error rate in the target. If
+                ``approximation_degree`` (the default) this has no effect, if
+                ``approximation_degree=None`` it uses the error rate specified in the ``Target`` for
+                the gate being evaluated, and a numeric value other than 1 with ``target`` set is
+                used as a scaling factor of the target's error rate.
+        """
+        super().__init__()
+        self._approximation_degree = approximation_degree
+        self._target = target
+
+    def run(self, dag: DAGCircuit) -> DAGCircuit:
+        remove_identity_equiv(dag, self._approximation_degree, self._target)
+        return dag

qiskit/transpiler/passes/optimization/template_matching/backward_match.py

@@ -242,7 +242,7 @@ class BackwardMatch:
         Returns:
             bool: True if the same, False otherwise.
         """
-        return node_circuit.op == node_template.op
+        return node_circuit.op.soft_compare(node_template.op)
 
     def _is_same_q_conf(self, node_circuit, node_template, qarg_circuit):
         """
@@ -304,15 +304,15 @@ class BackwardMatch:
         """
         if (
             node_circuit.type == "op"
-            and getattr(node_circuit.op, "condition", None)
+            and getattr(node_circuit.op, "_condition", None)
             and node_template.type == "op"
-            and getattr(node_template.op, "condition", None)
+            and getattr(node_template.op, "_condition", None)
         ):
             if set(carg_circuit) != set(node_template.cindices):
                 return False
             if (
-                getattr(node_circuit.op, "condition", None)[1]
-                != getattr(node_template.op, "condition", None)[1]
+                getattr(node_circuit.op, "_condition", None)[1]
+                != getattr(node_template.op, "_condition", None)[1]
             ):
                 return False
         return True

qiskit/transpiler/passes/optimization/template_matching/forward_match.py

@@ -311,15 +311,15 @@ class ForwardMatch:
         """
         if (
             node_circuit.type == "op"
-            and getattr(node_circuit.op, "condition", None)
+            and getattr(node_circuit.op, "_condition", None)
             and node_template.type == "op"
-            and getattr(node_template.op, "condition", None)
+            and getattr(node_template.op, "_condition", None)
         ):
             if set(self.carg_indices) != set(node_template.cindices):
                 return False
             if (
-                getattr(node_circuit.op, "condition", None)[1]
-                != getattr(node_template.op, "condition", None)[1]
+                getattr(node_circuit.op, "_condition", None)[1]
+                != getattr(node_template.op, "_condition", None)[1]
             ):
                 return False
         return True

qiskit/transpiler/passes/optimization/template_matching/template_substitution.py

@@ -450,7 +450,7 @@ class TemplateSubstitution:
         template_sublist and circuit_sublist match up to the
         assignment of the parameters. For example the template
 
-        .. parsed-literal::
+        .. code-block:: text
 
                  ┌───────────┐                  ┌────────┐
             q_0: ┤ P(-1.0*β) ├──■────────────■──┤0       ├
@@ -460,7 +460,7 @@ class TemplateSubstitution:
 
         should only maximally match once in the circuit
 
-        .. parsed-literal::
+        .. code-block:: text
 
                  ┌───────┐
             q_0: ┤ P(-2) ├──■────────────■────────────────────────────

qiskit/transpiler/passes/routing/commuting_2q_gate_routing/commuting_2q_gate_router.py

@@ -41,7 +41,7 @@ class Commuting2qGateRouter(TransformationPass):
     qubit :class:`.PauliEvolutionGate` to qubits 0, 1, 3, and 4 of the five qubit device with
     the coupling map
 
-    .. parsed-literal::
+    .. code-block:: text
 
         0 -- 1 -- 2
              |

qiskit/transpiler/passes/routing/commuting_2q_gate_routing/swap_strategy.py

@@ -30,7 +30,7 @@ class SwapStrategy:
     parallel. This means that a qubit can only be present once in a swap layer. For example, the
     following swap layers represent the optimal swap strategy for a line with five qubits
 
-    .. parsed-literal::
+    .. code-block:: text
 
         (
             ((0, 1), (2, 3)),  # Swap layer no. 1

qiskit/transpiler/passes/routing/sabre_swap.py

@@ -41,8 +41,9 @@ class SabreSwap(TransformationPass):
     r"""Map input circuit onto a backend topology via insertion of SWAPs.
 
     Implementation of the SWAP-based heuristic search from the SABRE qubit
-    mapping paper [1] (Algorithm 1). The heuristic aims to minimize the number
-    of lossy SWAPs inserted and the depth of the circuit.
+    mapping paper [2] (Algorithm 1) with the modifications from the LightSABRE
+    paper [1]. The heuristic aims to minimize the number of lossy SWAPs inserted
+    and the depth of the circuit.
 
     This algorithm starts from an initial layout of virtual qubits onto physical
     qubits, and iterates over the circuit DAG until all gates are exhausted,
@@ -69,7 +70,10 @@ class SabreSwap(TransformationPass):
 
     **References:**
 
-    [1] Li, Gushu, Yufei Ding, and Yuan Xie. "Tackling the qubit mapping problem
+    [1] Henry Zou and Matthew Treinish and Kevin Hartman and Alexander Ivrii and Jake Lishman.
+    "LightSABRE: A Lightweight and Enhanced SABRE Algorithm"
+    `arXiv:2409.08368 <https://doi.org/10.48550/arXiv.2409.08368>`__
+    [2] Li, Gushu, Yufei Ding, and Yuan Xie. "Tackling the qubit mapping problem
     for NISQ-era quantum devices." ASPLOS 2019.
     `arXiv:1809.02573 <https://arxiv.org/pdf/1809.02573.pdf>`_
     """

qiskit/transpiler/passes/routing/star_prerouting.py

@@ -223,7 +223,7 @@ class StarPreRouting(TransformationPass):
             return (
                 len(node.qargs) <= 2
                 and len(node.cargs) == 0
-                and getattr(node.op, "condition", None) is None
+                and getattr(node, "condition", None) is None
                 and not isinstance(node.op, Barrier)
             )
 
@@ -372,7 +372,7 @@ def _extract_nodes(nodes, dag):
         qubit_indices = [dag.find_bit(qubit).index for qubit in node.qargs]
         classical_bit_indices = set()
 
-        if node.op.condition is not None:
+        if node.condition is not None:
             classical_bit_indices.update(condition_resources(node.op.condition).clbits)
 
         if isinstance(node.op, SwitchCaseOp):

qiskit/transpiler/passes/scheduling/alap.py

@@ -144,7 +144,7 @@ class ALAPSchedule(BaseSchedulerTransform):
 
         new_dag.name = dag.name
         new_dag.metadata = dag.metadata
-        new_dag.calibrations = dag.calibrations
+        new_dag._calibrations_prop = dag._calibrations_prop
 
         # set circuit duration and unit to indicate it is scheduled
         new_dag.duration = circuit_duration

qiskit/transpiler/passes/scheduling/alignments/align_measures.py

@@ -63,7 +63,7 @@ class AlignMeasures(TransformationPass):
     Examples:
         We assume executing the following circuit on a backend with ``alignment=16``.
 
-        .. parsed-literal::
+        .. code-block:: text
 
                  ┌───┐┌────────────────┐┌─┐
             q_0: ┤ X ├┤ Delay(100[dt]) ├┤M├
@@ -74,7 +74,7 @@ class AlignMeasures(TransformationPass):
         Note that delay of 100 dt induces a misalignment of 4 dt at the measurement.
         This pass appends an extra 12 dt time shift to the input circuit.
 
-        .. parsed-literal::
+        .. code-block:: text
 
                  ┌───┐┌────────────────┐┌─┐
             q_0: ┤ X ├┤ Delay(112[dt]) ├┤M├

qiskit/transpiler/passes/scheduling/alignments/check_durations.py

@@ -70,7 +70,7 @@ class InstructionDurationCheck(AnalysisPass):
                 return
 
         # Check custom gate durations
-        for inst_defs in dag.calibrations.values():
+        for inst_defs in dag._calibrations_prop.values():
             for caldef in inst_defs.values():
                 dur = caldef.duration
                 if not (dur % self.acquire_align == 0 and dur % self.pulse_align == 0):

qiskit/transpiler/passes/scheduling/alignments/pulse_gate_validation.py

@@ -17,6 +17,7 @@ from qiskit.pulse import Play
 from qiskit.transpiler.basepasses import AnalysisPass
 from qiskit.transpiler.exceptions import TranspilerError
 from qiskit.transpiler.target import Target
+from qiskit.utils.deprecate_pulse import deprecate_pulse_dependency
 
 
 class ValidatePulseGates(AnalysisPass):
@@ -40,6 +41,7 @@ class ValidatePulseGates(AnalysisPass):
     the backend control electronics.
     """
 
+    @deprecate_pulse_dependency
     def __init__(
         self,
         granularity: int = 1,

qiskit/transpiler/passes/scheduling/alignments/reschedule.py

@@ -35,7 +35,7 @@ class ConstrainedReschedule(AnalysisPass):
 
         We assume executing the following circuit on a backend with 16 dt of acquire alignment.
 
-        .. parsed-literal::
+        .. code-block:: text
 
                  ┌───┐┌────────────────┐┌─┐
             q_0: ┤ X ├┤ Delay(100[dt]) ├┤M├
@@ -46,7 +46,7 @@ class ConstrainedReschedule(AnalysisPass):
         Note that delay of 100 dt induces a misalignment of 4 dt at the measurement.
         This pass appends an extra 12 dt time shift to the input circuit.
 
-        .. parsed-literal::
+        .. code-block:: text
 
                  ┌───┐┌────────────────┐┌─┐
             q_0: ┤ X ├┤ Delay(112[dt]) ├┤M├

qiskit/transpiler/passes/scheduling/asap.py

@@ -167,7 +167,7 @@ class ASAPSchedule(BaseSchedulerTransform):
 
         new_dag.name = dag.name
         new_dag.metadata = dag.metadata
-        new_dag.calibrations = dag.calibrations
+        new_dag._calibrations_prop = dag._calibrations_prop
 
         # set circuit duration and unit to indicate it is scheduled
         new_dag.duration = circuit_duration

qiskit/transpiler/passes/scheduling/base_scheduler.py

@@ -42,7 +42,7 @@ class BaseSchedulerTransform(TransformationPass):
         conditioned on the same register are commute, i.e. read-access to the
         classical register doesn't change its state.
 
-        .. parsed-literal::
+        .. code-block:: text
 
             qc = QuantumCircuit(2, 1)
             qc.delay(100, 0)
@@ -52,7 +52,7 @@ class BaseSchedulerTransform(TransformationPass):
         The scheduler SHOULD comply with above topological ordering policy of the DAG circuit.
         Accordingly, the `asap`-scheduled circuit will become
 
-        .. parsed-literal::
+        .. code-block:: text
 
                  ┌────────────────┐   ┌───┐
             q_0: ┤ Delay(100[dt]) ├───┤ X ├──────────────
@@ -76,7 +76,7 @@ class BaseSchedulerTransform(TransformationPass):
         is moved to the classical register (C).
         The sequence from t0 to t1 of the measure instruction interval might be modeled as follows:
 
-        .. parsed-literal::
+        .. code-block:: text
 
             Q ░▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒░
             B ░░▒▒▒▒▒▒▒▒░░░░░░░░░
@@ -90,7 +90,7 @@ class BaseSchedulerTransform(TransformationPass):
 
         This precise model may induce weird edge case.
 
-        .. parsed-literal::
+        .. code-block:: text
 
                     ┌───┐
             q_0: ───┤ X ├──────
@@ -107,7 +107,7 @@ class BaseSchedulerTransform(TransformationPass):
         is unchanged during the stimulus, thus two nodes are simultaneously operated.
         If one `alap`-schedule this circuit, it may return following circuit.
 
-        .. parsed-literal::
+        .. code-block:: text
 
                  ┌────────────────┐   ┌───┐
             q_0: ┤ Delay(500[dt]) ├───┤ X ├──────
@@ -122,7 +122,7 @@ class BaseSchedulerTransform(TransformationPass):
         It looks like the topological ordering between the nodes are flipped in the scheduled view.
         This behavior can be understood by considering the control flow model described above,
 
-        .. parsed-literal::
+        .. code-block:: text
 
             : Quantum Circuit, first-measure
             0 ░░░░░░░░░░░░▒▒▒▒▒▒░
@@ -154,7 +154,7 @@ class BaseSchedulerTransform(TransformationPass):
         In this case, ``Measure`` instruction immediately locks the register C.
         Under this configuration, the `alap`-scheduled circuit of above example may become
 
-        .. parsed-literal::
+        .. code-block:: text
 
                     ┌───┐
             q_0: ───┤ X ├──────
@@ -168,7 +168,8 @@ class BaseSchedulerTransform(TransformationPass):
         it may separately schedule qubit and classical register,
         insertion of the delay yields unnecessary longer total execution time.
 
-        .. parsed-literal::
+        .. code-block:: text
+
             : Quantum Circuit, first-xgate
             0 ░▒▒▒░░░░░░░░░░░░░░░
             1 ░▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒░
@@ -185,7 +186,7 @@ class BaseSchedulerTransform(TransformationPass):
         If finite conditional latency is provided, for example, 30 dt, the circuit
         is scheduled as follows.
 
-        .. parsed-literal::
+        .. code-block:: text
 
                  ┌───────────────┐   ┌───┐
             q_0: ┤ Delay(30[dt]) ├───┤ X ├──────
@@ -197,7 +198,8 @@ class BaseSchedulerTransform(TransformationPass):
 
         with the timing model:
 
-        .. parsed-literal::
+        .. code-block:: text
+
             : Quantum Circuit, first-xgate
             0 ░░▒▒▒░░░░░░░░░░░░░░░
             1 ░░▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒░
@@ -264,10 +266,10 @@ class BaseSchedulerTransform(TransformationPass):
         """A helper method to get duration from node or calibration."""
         indices = [dag.find_bit(qarg).index for qarg in node.qargs]
 
-        if dag.has_calibration_for(node):
+        if dag._has_calibration_for(node):
             # If node has calibration, this value should be the highest priority
             cal_key = tuple(indices), tuple(float(p) for p in node.op.params)
-            duration = dag.calibrations[node.op.name][cal_key].duration
+            duration = dag._calibrations_prop[node.op.name][cal_key].duration
         else:
             duration = node.op.duration
 

qiskit/transpiler/passes/scheduling/dynamical_decoupling.py

@@ -13,6 +13,7 @@
 """Dynamical Decoupling insertion pass."""
 
 import itertools
+import warnings
 
 import numpy as np
 from qiskit.circuit import Gate, Delay, Reset
@@ -288,11 +289,15 @@ class DynamicalDecoupling(TransformationPass):
         """
         circ_durations = InstructionDurations()
 
-        if dag.calibrations:
+        if dag._calibrations_prop:
             cal_durations = []
-            for gate, gate_cals in dag.calibrations.items():
-                for (qubits, parameters), schedule in gate_cals.items():
-                    cal_durations.append((gate, qubits, parameters, schedule.duration))
+            with warnings.catch_warnings():
+                warnings.simplefilter(action="ignore", category=DeprecationWarning)
+                # `schedule.duration` emits pulse deprecation warnings which we don't want
+                # to see here
+                for gate, gate_cals in dag._calibrations_prop.items():
+                    for (qubits, parameters), schedule in gate_cals.items():
+                        cal_durations.append((gate, qubits, parameters, schedule.duration))
             circ_durations.update(cal_durations, circ_durations.dt)
 
         if self._durations is not None:

qiskit/transpiler/passes/scheduling/padding/base_padding.py

@@ -99,7 +99,7 @@ class BasePadding(TransformationPass):
         new_dag.name = dag.name
         new_dag.metadata = dag.metadata
         new_dag.unit = self.property_set["time_unit"]
-        new_dag.calibrations = dag.calibrations
+        new_dag._calibrations_prop = dag._calibrations_prop
         new_dag.global_phase = dag.global_phase
 
         idle_after = {bit: 0 for bit in dag.qubits}

qiskit/transpiler/passes/scheduling/padding/dynamical_decoupling.py

@@ -14,6 +14,7 @@
 from __future__ import annotations
 
 import logging
+import warnings
 import numpy as np
 
 from qiskit.circuit import Gate, ParameterExpression, Qubit
@@ -187,11 +188,15 @@ class PadDynamicalDecoupling(BasePadding):
         """
         circ_durations = InstructionDurations()
 
-        if dag.calibrations:
+        if dag._calibrations_prop:
             cal_durations = []
-            for gate, gate_cals in dag.calibrations.items():
-                for (qubits, parameters), schedule in gate_cals.items():
-                    cal_durations.append((gate, qubits, parameters, schedule.duration))
+            with warnings.catch_warnings():
+                warnings.simplefilter(action="ignore", category=DeprecationWarning)
+                # `schedule.duration` emits pulse deprecation warnings which we don't want
+                # to see here
+                for gate, gate_cals in dag._calibrations_prop.items():
+                    for (qubits, parameters), schedule in gate_cals.items():
+                        cal_durations.append((gate, qubits, parameters, schedule.duration))
             circ_durations.update(cal_durations, circ_durations.dt)
 
         if self._durations is not None:
@@ -252,7 +257,13 @@ class PadDynamicalDecoupling(BasePadding):
                 try:
                     # Check calibration.
                     params = self._resolve_params(gate)
-                    gate_length = dag.calibrations[gate.name][((physical_index,), params)].duration
+                    with warnings.catch_warnings():
+                        warnings.simplefilter(action="ignore", category=DeprecationWarning)
+                        # `schedule.duration` emits pulse deprecation warnings which we don't want
+                        # to see here
+                        gate_length = dag._calibrations_prop[gate.name][
+                            ((physical_index,), params)
+                        ].duration
                     if gate_length % self._alignment != 0:
                         # This is necessary to implement lightweight scheduling logic for this pass.
                         # Usually the pulse alignment constraint and pulse data chunk size take

qiskit/transpiler/passes/scheduling/padding/pad_delay.py

@@ -27,6 +27,9 @@ class PadDelay(BasePadding):
 
     .. code-block:: python
 
+        from qiskit import QuantumCircuit
+        from qiskit.transpiler import InstructionDurations
+
         durations = InstructionDurations([("x", None, 160), ("cx", None, 800)])
 
         qc = QuantumCircuit(2)
@@ -36,7 +39,7 @@ class PadDelay(BasePadding):
 
     The ASAP-scheduled circuit output may become
 
-    .. parsed-literal::
+    .. code-block:: text
 
              ┌────────────────┐
         q_0: ┤ Delay(160[dt]) ├──■──