qiskit 1.3.0__cp39-abi3-win32.whl → 1.3.0rc1__cp39-abi3-win32.whl

qiskit/VERSION.txt

@@ -1 +1 @@
-1.3.0
+1.3.0rc1

qiskit/circuit/library/__init__.py

@@ -36,7 +36,7 @@ For example, to append a multi-controlled CNOT:
    circuit.append(gate, [0, 1, 4, 2, 3])
    circuit.draw('mpl')
 
-The library is organized in several sections. The function
+The library is organized in several sections. The function 
 :func:`.get_standard_gate_name_mapping` allows you to see the available standard gates and operations.
 
 .. autofunction:: get_standard_gate_name_mapping
@@ -221,10 +221,10 @@ or of a set of qubit states.
    OrGate
    XOR
    BitwiseXorGate
-   random_bitwise_xor
    InnerProduct
    InnerProductGate
 
+.. autofunction:: random_bitwise_xor
 
 Basis Change Circuits
 =====================
@@ -280,9 +280,6 @@ Adders
    CDKMRippleCarryAdder
    VBERippleCarryAdder
    WeightedAdder
-   ModularAdderGate
-   HalfAdderGate
-   FullAdderGate
 
 Multipliers
 -----------
@@ -293,7 +290,6 @@ Multipliers
 
    HRSCumulativeMultiplier
    RGQFTMultiplier
-   MultiplierGate
 
 Comparators
 -----------
@@ -325,40 +321,29 @@ Other arithmetic functions
 Particular Quantum Circuits
 ===========================
 
-The following gates and quantum circuits define specific
-quantum circuits of interest:
-
 .. autosummary::
    :toctree: ../stubs/
    :template: autosummary/class_no_inherited_members.rst
 
    FourierChecking
+   fourier_checking
    GraphState
    GraphStateGate
    HiddenLinearFunction
+   hidden_linear_function
    IQP
+   iqp
+   random_iqp
    QuantumVolume
+   quantum_volume
    PhaseEstimation
+   phase_estimation
    GroverOperator
+   grover_operator
    PhaseOracle
    PauliEvolutionGate
    HamiltonianGate
    UnitaryOverlap
-
-For circuits that have a well-defined structure it is preferrable
-to use the following functions to construct them:
-
-.. autosummary::
-   :toctree: ../stubs/
-   :template: autosummary/class_no_inherited_members.rst
-
-   fourier_checking
-   hidden_linear_function
-   iqp
-   random_iqp
-   quantum_volume
-   phase_estimation
-   grover_operator
    unitary_overlap
 
 
@@ -377,7 +362,6 @@ a broad set of variational quantum algorithms:
    real_amplitudes
    pauli_two_design
    excitation_preserving
-   qaoa_ansatz
    hamiltonian_variational_ansatz
    evolved_operator_ansatz
 
@@ -402,7 +386,7 @@ They are heavily used in near-term algorithms in e.g. Chemistry, Physics or Opti
 Data encoding circuits
 ======================
 
-The following functions return a parameterized :class:`.QuantumCircuit` to use as data
+The following functions return a parameterized :class:`.QuantumCircuit` to use as data 
 encoding circuits in a series of variational quantum algorithms:
 
 .. autosummary::
@@ -423,17 +407,6 @@ data in quantum states and are used as feature maps for classification.
    PauliFeatureMap
    ZFeatureMap
    ZZFeatureMap
-
-
-Data preparation circuits
-=========================
-
-The following operations are used for state preparation:
-
-.. autosummary::
-   :toctree: ../stubs/
-   :template: autosummary/class_no_inherited_members.rst
-
    StatePreparation
    Initialize
 

qiskit/circuit/library/arithmetic/adders/adder.py

@@ -21,7 +21,7 @@ from qiskit.utils.deprecation import deprecate_func
 class Adder(QuantumCircuit):
     r"""Compute the sum of two equally sized qubit registers.
 
-    For two registers :math:`|a\rangle_n` and :math:`|b\rangle_n` with :math:`n` qubits each, an
+    For two registers :math:`|a\rangle_n` and :math:|b\rangle_n` with :math:`n` qubits each, an
     adder performs the following operation
 
     .. math::
@@ -74,7 +74,7 @@ class Adder(QuantumCircuit):
 class HalfAdderGate(Gate):
     r"""Compute the sum of two equally-sized qubit registers, including a carry-out bit.
 
-    For two registers :math:`|a\rangle_n` and :math:`|b\rangle_n` with :math:`n` qubits each, an
+    For two registers :math:`|a\rangle_n` and :math:|b\rangle_n` with :math:`n` qubits each, an
     adder performs the following operation
 
     .. math::
@@ -120,7 +120,7 @@ class HalfAdderGate(Gate):
 class ModularAdderGate(Gate):
     r"""Compute the sum modulo :math:`2^n` of two :math:`n`-sized qubit registers.
 
-    For two registers :math:`|a\rangle_n` and :math:`|b\rangle_n` with :math:`n` qubits each, an
+    For two registers :math:`|a\rangle_n` and :math:|b\rangle_n` with :math:`n` qubits each, an
     adder performs the following operation
 
     .. math::
@@ -166,12 +166,12 @@ class ModularAdderGate(Gate):
 class FullAdderGate(Gate):
     r"""Compute the sum of two :math:`n`-sized qubit registers, including carry-in and -out bits.
 
-    For two registers :math:`|a\rangle_n` and :math:`|b\rangle_n` with :math:`n` qubits each, an
+    For two registers :math:`|a\rangle_n` and :math:|b\rangle_n` with :math:`n` qubits each, an
     adder performs the following operation
 
     .. math::
 
-        |c_{\text{in}}\rangle_1 |a\rangle_n |b\rangle_n
+        |c_{\text{in}\rangle_1 |a\rangle_n |b\rangle_n
         \mapsto |a\rangle_n |c_{\text{in}} + a + b \rangle_{n + 1}.
 
     The quantum register :math:`|a\rangle_n` (and analogously :math:`|b\rangle_n`)

qiskit/circuit/library/arithmetic/adders/cdkm_ripple_carry_adder.py

@@ -84,7 +84,7 @@ class CDKMRippleCarryAdder(Adder):
         :class:`.ModularAdderGate`: A generic inplace adder, modulo :math:`2^n`. This
             is functionally equivalent to ``kind="fixed"``.
 
-        :class:`.HalfAdderGate`: A generic inplace adder. This
+        :class:`.AdderGate`: A generic inplace adder. This
             is functionally equivalent to ``kind="half"``.
 
         :class:`.FullAdderGate`: A generic inplace adder, with a carry-in bit. This

qiskit/circuit/library/arithmetic/adders/draper_qft_adder.py

@@ -54,7 +54,7 @@ class DraperQFTAdder(Adder):
         :class:`.ModularAdderGate`: A generic inplace adder, modulo :math:`2^n`. This
             is functionally equivalent to ``kind="fixed"``.
 
-        :class:`.HalfAdderGate`: A generic inplace adder. This
+        :class:`.AdderGate`: A generic inplace adder. This
             is functionally equivalent to ``kind="half"``.
 
     **References:**

qiskit/circuit/library/arithmetic/adders/vbe_ripple_carry_adder.py

@@ -60,7 +60,7 @@ class VBERippleCarryAdder(Adder):
         :class:`.ModularAdderGate`: A generic inplace adder, modulo :math:`2^n`. This
             is functionally equivalent to ``kind="fixed"``.
 
-        :class:`.HalfAdderGate`: A generic inplace adder. This
+        :class:`.AdderGate`: A generic inplace adder. This
             is functionally equivalent to ``kind="half"``.
 
         :class:`.FullAdderGate`: A generic inplace adder, with a carry-in bit. This

qiskit/primitives/utils.py

@@ -82,7 +82,7 @@ def init_observable(observable: BaseOperator | str) -> SparsePauliOp:
     since="1.2",
     additional_msg="Use ``QuantumCircuit.layout`` and ``SparsePauliOp.apply_layout`` "
     + "to adjust an operator for a layout. Otherwise, use ``mthree.utils.final_measurement_mapping``. "
-    + "See <https://qiskit.github.io/qiskit-addon-mthree/apidocs/utils> for details.",
+    + "See https://qiskit-extensions.github.io/mthree/apidocs/utils.html for details.",
 )
 def final_measurement_mapping(circuit: QuantumCircuit) -> dict[int, int]:
     """Return the final measurement mapping for the circuit.

qiskit/providers/__init__.py

@@ -160,7 +160,7 @@ steps for writing a provider are:
    interacting with a running job.
 
 For a simple example of a provider, see the
-`qiskit-aqt-provider <https://github.com/qiskit-community/qiskit-aqt-provider>`__
+`qiskit-aqt-provider <https://github.com/Qiskit-Partners/qiskit-aqt-provider>`__
 
 Provider
 --------
@@ -664,7 +664,7 @@ that abstract away the mechanics of getting the best result efficiently, to
 concentrate on higher level applications using these outputs.
 
 For example, if your backends were well suited to leverage
-`mthree <https://github.com/Qiskit/qiskit-addon-mthree>`__ measurement
+`mthree <https://github.com/Qiskit-Partners/mthree/>`__ measurement
 mitigation to improve the quality of the results, you could implement a
 provider-specific :class:`~.Sampler` implementation that leverages the
 ``M3Mitigation`` class internally to run the circuits and return

qiskit/quantum_info/states/statevector.py

@@ -476,7 +476,7 @@ class Statevector(QuantumState, TolerancesMixin):
         pauli_phase = (-1j) ** pauli.phase if pauli.phase else 1
 
         if x_mask + z_mask == 0:
-            return pauli_phase * np.linalg.norm(self.data) ** 2
+            return pauli_phase * np.linalg.norm(self.data)
 
         if x_mask == 0:
             return pauli_phase * expval_pauli_no_x(self.data, self.num_qubits, z_mask)

qiskit/transpiler/passes/optimization/consolidate_blocks.py

@@ -12,11 +12,9 @@
 
 """Replace each block of consecutive gates by a single Unitary node."""
 from __future__ import annotations
-from math import pi
 
 from qiskit.synthesis.two_qubit import TwoQubitBasisDecomposer
-from qiskit.circuit.library.standard_gates import CXGate, CZGate, iSwapGate, ECRGate, RXXGate
-
+from qiskit.circuit.library.standard_gates import CXGate, CZGate, iSwapGate, ECRGate
 from qiskit.transpiler.basepasses import TransformationPass
 from qiskit.transpiler.passmanager import PassManager
 from qiskit._accelerate.consolidate_blocks import consolidate_blocks
@@ -29,7 +27,6 @@ KAK_GATE_NAMES = {
     "cz": CZGate(),
     "iswap": iSwapGate(),
     "ecr": ECRGate(),
-    "rxx": RXXGate(pi / 2),
 }
 
 
@@ -73,6 +70,7 @@ class ConsolidateBlocks(TransformationPass):
         if basis_gates is not None:
             self.basis_gates = set(basis_gates)
         self.force_consolidate = force_consolidate
+
         if kak_basis_gate is not None:
             self.decomposer = TwoQubitBasisDecomposer(kak_basis_gate)
         elif basis_gates is not None:
@@ -81,12 +79,8 @@ class ConsolidateBlocks(TransformationPass):
                 self.decomposer = TwoQubitBasisDecomposer(
                     KAK_GATE_NAMES[kak_gates.pop()], basis_fidelity=approximation_degree or 1.0
                 )
-            elif "rzx" in basis_gates:
-                self.decomposer = TwoQubitBasisDecomposer(
-                    CXGate(), basis_fidelity=approximation_degree or 1.0
-                )
             else:
-                self.decomposer = None
+                self.decomposer = TwoQubitBasisDecomposer(CXGate())
         else:
             self.decomposer = TwoQubitBasisDecomposer(CXGate())
 
@@ -109,7 +103,6 @@ class ConsolidateBlocks(TransformationPass):
         consolidate_blocks(
             dag,
             self.decomposer._inner_decomposer,
-            self.decomposer.gate.name,
             self.force_consolidate,
             target=self.target,
             basis_gates=self.basis_gates,

qiskit/transpiler/passes/optimization/inverse_cancellation.py

@@ -19,7 +19,6 @@ from qiskit.circuit import Gate
 from qiskit.dagcircuit import DAGCircuit
 from qiskit.transpiler.basepasses import TransformationPass
 from qiskit.transpiler.exceptions import TranspilerError
-from qiskit.transpiler.passes.utils import control_flow
 
 from qiskit._accelerate.inverse_cancellation import inverse_cancellation
 
@@ -75,7 +74,6 @@ class InverseCancellation(TransformationPass):
 
         super().__init__()
 
-    @control_flow.trivial_recurse
     def run(self, dag: DAGCircuit):
         """Run the InverseCancellation pass on `dag`.
 

qiskit/transpiler/passes/synthesis/high_level_synthesis.py

@@ -382,7 +382,7 @@ class HighLevelSynthesis(TransformationPass):
 
             # If the synthesis changed the operation (i.e. it is not None), store the result.
             if synthesized is not None:
-                synthesized_nodes[node._node_id] = (synthesized, synthesized_context)
+                synthesized_nodes[node] = (synthesized, synthesized_context)
 
             # If the synthesis did not change anything, just update the qubit tracker.
             elif not processed:
@@ -407,9 +407,8 @@ class HighLevelSynthesis(TransformationPass):
         outer_to_local = context.to_local_mapping()
 
         for node in dag.topological_op_nodes():
-
-            if op_tuple := synthesized_nodes.get(node._node_id, None):
-                op, op_context = op_tuple
+            if node in synthesized_nodes:
+                op, op_context = synthesized_nodes[node]
 
                 if isinstance(op, Operation):
                     out.apply_operation_back(op, node.qargs, node.cargs)
@@ -814,7 +813,6 @@ class HighLevelSynthesis(TransformationPass):
             dag._has_calibration_for(node)
             or len(node.qargs) < self._min_qubits
             or node.is_directive()
-            or (self._instruction_supported(node.name, qubits) and not node.is_control_flow())
         ):
             return True
 
@@ -832,12 +830,15 @@ class HighLevelSynthesis(TransformationPass):
             # If all the above constraints hold, and it's already supported or the basis translator
             # can handle it, we'll leave it be.
             and (
+                self._instruction_supported(node.name, qubits)
                 # This uses unfortunately private details of `EquivalenceLibrary`, but so does the
                 # `BasisTranslator`, and this is supposed to just be temporary til this is moved
                 # into Rust space.
-                self._equiv_lib is not None
-                and equivalence.Key(name=node.name, num_qubits=node.num_qubits)
-                in self._equiv_lib.keys()
+                or (
+                    self._equiv_lib is not None
+                    and equivalence.Key(name=node.name, num_qubits=node.num_qubits)
+                    in self._equiv_lib.keys()
+                )
             )
         )
 

qiskit/transpiler/passes/synthesis/hls_plugins.py

@@ -263,12 +263,11 @@ Pauli Evolution Synthesis
       - Targeted connectivity
     * - ``"rustiq"``
       - :class:`~.PauliEvolutionSynthesisRustiq`
-      - use the synthesis method from `Rustiq circuit synthesis library 
-        <https://github.com/smartiel/rustiq-core>`_
+      - use a diagonalizing Clifford per Pauli term
       - all-to-all
     * - ``"default"``
       - :class:`~.PauliEvolutionSynthesisDefault`
-      - use a diagonalizing Clifford per Pauli term
+      - use ``rustiq_core`` synthesis library
       - all-to-all
 
 .. autosummary::
@@ -376,7 +375,7 @@ Multiplier Synthesis
       - Description
     * - ``"cumulative"``
       - :class:`.MultiplierSynthesisH18`
-      - depending on the :class:`.HalfAdderGate` used
+      - depending on the :class:`.AdderGate` used
       - a cumulative adder based on controlled adders
     * - ``"qft"``
       - :class:`.MultiplierSynthesisR17`

qiskit/transpiler/preset_passmanagers/generate_preset_pass_manager.py

@@ -479,11 +479,10 @@ def _parse_basis_gates(basis_gates, backend, inst_map, skip_target):
             if inst not in standard_gates and inst not in default_gates:
                 warnings.warn(
                     category=DeprecationWarning,
-                    message=f"Providing non-standard gates ({inst}) through the ``basis_gates`` "
-                    "argument is deprecated for both ``transpile`` and ``generate_preset_pass_manager`` "
-                    "as of Qiskit 1.3.0. "
+                    message="Providing custom gates through the ``basis_gates`` argument is deprecated "
+                    "for both ``transpile`` and ``generate_preset_pass_manager`` as of Qiskit 1.3.0. "
                     "It will be removed in Qiskit 2.0. The ``target`` parameter should be used instead. "
-                    "You can build a target instance using ``Target.from_configuration()`` and provide "
+                    "You can build a target instance using ``Target.from_configuration()`` and provide"
                     "custom gate definitions with the ``custom_name_mapping`` argument.",
                 )
                 skip_target = True

{qiskit-1.3.0.dist-info → qiskit-1.3.0rc1.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: qiskit
-Version: 1.3.0
+Version: 1.3.0rc1
 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
@@ -37,6 +37,12 @@ Requires-Dist: python-dateutil>=2.8.0
 Requires-Dist: stevedore>=3.0.0
 Requires-Dist: typing-extensions
 Requires-Dist: symengine<0.14,>=0.11
+Provides-Extra: all
+Requires-Dist: qiskit[crosstalk-pass,csp-layout-pass,qasm3-import,visualization]; extra == "all"
+Provides-Extra: crosstalk-pass
+Requires-Dist: z3-solver>=4.7; extra == "crosstalk-pass"
+Provides-Extra: csp-layout-pass
+Requires-Dist: python-constraint>=1.4; extra == "csp-layout-pass"
 Provides-Extra: qasm3-import
 Requires-Dist: qiskit-qasm3-import>=0.1.0; extra == "qasm3-import"
 Provides-Extra: visualization
@@ -45,12 +51,6 @@ Requires-Dist: pydot; extra == "visualization"
 Requires-Dist: Pillow>=4.2.1; extra == "visualization"
 Requires-Dist: pylatexenc>=1.4; extra == "visualization"
 Requires-Dist: seaborn>=0.9.0; extra == "visualization"
-Provides-Extra: crosstalk-pass
-Requires-Dist: z3-solver>=4.7; extra == "crosstalk-pass"
-Provides-Extra: csp-layout-pass
-Requires-Dist: python-constraint>=1.4; extra == "csp-layout-pass"
-Provides-Extra: all
-Requires-Dist: qiskit[crosstalk-pass,csp-layout-pass,qasm3-import,visualization]; extra == "all"
 
 # Qiskit
 
@@ -120,13 +120,13 @@ we use `measure_all(inplace=False)` to get a copy of the circuit in which all th
 qc_measured = qc_example.measure_all(inplace=False)
 
 # 3. Execute using the Sampler primitive
-from qiskit.primitives import StatevectorSampler
-sampler = StatevectorSampler()
-job = sampler.run([qc_measured], shots=1000)
+from qiskit.primitives.sampler import Sampler
+sampler = Sampler()
+job = sampler.run(qc_measured, shots=1000)
 result = job.result()
-print(f" > Counts: {result[0].meas.get_counts()}")
+print(f" > Quasi probability distribution: {result.quasi_dists}")
 ```
-Running this will give an outcome similar to `{'000': 497, '111': 503}` which is `000` 50% of the time and `111` 50% of the time up to statistical fluctuations.
+Running this will give an outcome similar to `{0: 0.497, 7: 0.503}` which is `000` 50% of the time and `111` 50% of the time up to statistical fluctuations.
 To illustrate the power of Estimator, we now use the quantum information toolbox to create the operator $XXY+XYX+YXX-YYY$ and pass it to the `run()` function, along with our quantum circuit. Note the Estimator requires a circuit _**without**_ measurement, so we use the `qc_example` circuit we created earlier.
 
 ```python
@@ -135,17 +135,17 @@ from qiskit.quantum_info import SparsePauliOp
 operator = SparsePauliOp.from_list([("XXY", 1), ("XYX", 1), ("YXX", 1), ("YYY", -1)])
 
 # 3. Execute using the Estimator primitive
-from qiskit.primitives import StatevectorEstimator
-estimator = StatevectorEstimator()
-job = estimator.run([(qc_example, operator)], precision=1e-3)
+from qiskit.primitives import Estimator
+estimator = Estimator()
+job = estimator.run(qc_example, operator, shots=1000)
 result = job.result()
-print(f" > Expectation values: {result[0].data.evs}")
+print(f" > Expectation values: {result.values}")
 ```
 
 Running this will give the outcome `4`. For fun, try to assign a value of +/- 1 to each single-qubit operator X and Y 
 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.
+Using the Qiskit-provided `qiskit.primitives.Sampler` and `qiskit.primitives.Estimator` 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.
@@ -160,7 +160,7 @@ qc_transpiled = transpile(qc_example, basis_gates = ['cz', 'sx', 'rz'], coupling
 ### Executing your code on real quantum hardware
 
 Qiskit provides an abstraction layer that lets users run quantum circuits on hardware from any vendor that provides a compatible interface. 
-The best way to use Qiskit is with a runtime environment that provides optimized implementations of `sampler` and `estimator` for a given hardware platform. This runtime may involve using pre- and post-processing, such as optimized transpiler passes with error suppression, error mitigation, and, eventually, error correction built in. A runtime implements `qiskit.primitives.BaseSamplerV2` and `qiskit.primitives.BaseEstimatorV2` interfaces. For example,
+The best way to use Qiskit is with a runtime environment that provides optimized implementations of `sampler` and `estimator` for a given hardware platform. This runtime may involve using pre- and post-processing, such as optimized transpiler passes with error suppression, error mitigation, and, eventually, error correction built in. A runtime implements `qiskit.primitives.BaseSampler` and `qiskit.primitives.BaseEstimator` interfaces. For example,
 some packages that provide implementations of a runtime primitive implementation are:
 
 * https://github.com/Qiskit/qiskit-ibm-runtime

{qiskit-1.3.0.dist-info → qiskit-1.3.0rc1.dist-info}/RECORD

@@ -1,6 +1,6 @@
-qiskit/VERSION.txt,sha256=PIXGbQbDHfDGURrRi36Fdvz452oBHFwou9ZsV_PthR4,7
+qiskit/VERSION.txt,sha256=9ZVK4HfUDY65X5uAyfXYCem-YxD-V1MuRapLURHiVL4,10
 qiskit/__init__.py,sha256=rw44R_7d2DNPDAhHntvpEYC-uH61EZnOI3Lcwpa74w8,7629
-qiskit/_accelerate.pyd,sha256=NyLufjN2MROLZYn9zVh_0kkvBMc80X76Wwh448hQO18,8510464
+qiskit/_accelerate.pyd,sha256=pzQ32GKTFM856LEZCEP9Le2C7DDjxQfw7fWQPtzNgBA,8514048
 qiskit/_numpy_compat.py,sha256=EV1RihNRJnvWzjb57z8sjMbv9EeRPzk8Mnegzw7ItR0,2888
 qiskit/exceptions.py,sha256=UamBNQmDJTx6ruzmj7iXgcsrBcvkfE-bZ4TH2-K_ngw,5772
 qiskit/user_config.py,sha256=IKxY7cK1EX-GqkvPE4Lsss1NMoEcYie6Qq8hkNOtLJA,10371
@@ -70,7 +70,7 @@ qiskit/circuit/controlflow/for_loop.py,sha256=kbZsuk0KNYA9HOTi8t1qCfm25oGURPyRsk
 qiskit/circuit/controlflow/if_else.py,sha256=0-PlHuxzAhECIj1XeLQU87_FzqZrGmmTikjZAbfVXtE,23047
 qiskit/circuit/controlflow/switch_case.py,sha256=zCkhdTMqd6mvW0KIsBkV19Fr84myEj_mf3J28tp_2TI,18171
 qiskit/circuit/controlflow/while_loop.py,sha256=gH5f1JC_JIakpk_k7cdVGXP93vxEpLfVXhDoo1_UCwo,6210
-qiskit/circuit/library/__init__.py,sha256=rxhN71i-4DS4KXrhqlZpLxyvQCQ6NmkD7rSVAz0LVGQ,16553
+qiskit/circuit/library/__init__.py,sha256=x3K1T5vOAqiDsh1f4Zy4N9nzkNyWzXEQH3U-4CMRAo8,15941
 qiskit/circuit/library/blueprintcircuit.py,sha256=V5BwicE0HKj4XFxA8pbFPIS60MeJB5xFUfcHnRIs5HY,10218
 qiskit/circuit/library/fourier_checking.py,sha256=kQYdvHUO12pXlaeBRqav3sct_lxkRFF2U168PFmK8Pk,6410
 qiskit/circuit/library/graph_state.py,sha256=ArLTXMRMAO1R194XErqZJnvcy0wV17n4H10pbe-xqOM,6282
@@ -96,10 +96,10 @@ qiskit/circuit/library/arithmetic/polynomial_pauli_rotations.py,sha256=Y3O2Um343
 qiskit/circuit/library/arithmetic/quadratic_form.py,sha256=ZQqeIkHJw_rlzVaClGrBW0DgMymab7NcPlCopLVNy78,8288
 qiskit/circuit/library/arithmetic/weighted_adder.py,sha256=AUohqtGV0IR2reZU29YSDVo6kSMJoqncZNCEhBudvqM,13166
 qiskit/circuit/library/arithmetic/adders/__init__.py,sha256=gHzRfBcGYvNiydkYuf42czLLnHmAaWeHUYaJ-Z07Hg8,761
-qiskit/circuit/library/arithmetic/adders/adder.py,sha256=UIpiyOK7nDKUqC4y9UE0vNzJ3n18eBCj079vIMIeNjU,6879
-qiskit/circuit/library/arithmetic/adders/cdkm_ripple_carry_adder.py,sha256=fLJkQDhvHW1Xcvww8DuDa8_NBy8-cKAz52BBgGU7vko,7583
-qiskit/circuit/library/arithmetic/adders/draper_qft_adder.py,sha256=EWGCrS1DQYq-6tDjQRgWYpJ0Se3JSWBssLEyHCAInHk,6168
-qiskit/circuit/library/arithmetic/adders/vbe_ripple_carry_adder.py,sha256=U5OJAso7s4Y0oUuS4D18eZ7vmUC704eazVdyUBNpF2c,5038
+qiskit/circuit/library/arithmetic/adders/adder.py,sha256=RSAKw1mftpUuUFsGPWV4x7_d3tN4BdjYJi33dXvvzyU,6874
+qiskit/circuit/library/arithmetic/adders/cdkm_ripple_carry_adder.py,sha256=3HRsIx1n9H1Xi2rUqo1oNVd4Nhc4G4PaQBvLtCYLYtc,7579
+qiskit/circuit/library/arithmetic/adders/draper_qft_adder.py,sha256=LEWsXBo20GpHYRu0TkZj4R_mYfF-3DX8KEJr9xBGwL8,6164
+qiskit/circuit/library/arithmetic/adders/vbe_ripple_carry_adder.py,sha256=vgQ5UEqbuVEEE7v3NElb24qTaolMChc5l7VCSwePjJk,5034
 qiskit/circuit/library/arithmetic/multipliers/__init__.py,sha256=Cw2e2xFpYZb1mB2bKiU38BAuZWIKfB7HdOVmqA3mrOY,689
 qiskit/circuit/library/arithmetic/multipliers/hrs_cumulative_multiplier.py,sha256=BVYzcLL34f7KLW_2L61VBtuh9LIfXlmfW7JW6cAL4xs,6995
 qiskit/circuit/library/arithmetic/multipliers/multiplier.py,sha256=_bhW2WOM_Z-GB5RDNWMkGWecundkqAocZsjibP8Jqrk,7159
@@ -293,7 +293,7 @@ qiskit/primitives/primitive_job.py,sha256=IhDsqtP3eYHi8ekW4ITM5EttrmQqm3qNYTeE7e
 qiskit/primitives/sampler.py,sha256=xQ7ys2fssrpvQNM4ppVr6pQ4Wsn33gIY838BljIeGb0,6023
 qiskit/primitives/statevector_estimator.py,sha256=7BabLm-RQNW9loEC7ygdhcQHJDGZ1DRhItsZYt1rZrc,7274
 qiskit/primitives/statevector_sampler.py,sha256=YNcbqCHMFwf1G-XwHNJBUBIlB_t92ECGMjG8-YmuVj0,11285
-qiskit/primitives/utils.py,sha256=cFFsOEDRK8y0X7i_qcmshoDen3ufgPoUVo6u8VI744Y,8593
+qiskit/primitives/utils.py,sha256=tzEPj0ddxLI0swA3jPOh_ANN9TjCn1oYRmBl7zGTwac,8594
 qiskit/primitives/base/__init__.py,sha256=HZji4i_Lrf9KqcSufJwSNqe8Wt-c1RWmKzFeRNt8vxo,784
 qiskit/primitives/base/base_estimator.py,sha256=kpEXcE2Lx3YqVRxlBctjJI_T1RYnaapk3kMW7vd7VQ8,9016
 qiskit/primitives/base/base_primitive.py,sha256=TT7g3oFy9iIpzbeZxMLculQFBY9labxViTxbRQDtr-I,1314
@@ -315,7 +315,7 @@ qiskit/primitives/containers/pub_result.py,sha256=OQV7fy2W6ZeuZkVT56FjUFQXHoG7Y7
 qiskit/primitives/containers/sampler_pub.py,sha256=LQgkp3X_ERyrYTSwX_cecqLVWZU4v0lkT5tUoDbOmTg,6860
 qiskit/primitives/containers/sampler_pub_result.py,sha256=fkMyYsQPwDD-6FVfeVk06E2m81DyXjm5tZHju7y0wrk,2864
 qiskit/primitives/containers/shape.py,sha256=JQTms4horYzCNyR_HhEvLxvMyvV-zcDu9jwzNCOfthU,3995
-qiskit/providers/__init__.py,sha256=wCz2V5ehsu1R0Kgr0y3y9EQgu1yxUkaM57oQKh6IbPg,36271
+qiskit/providers/__init__.py,sha256=Dh1IR6jnyW-0JQHIr9S8MQwHyIC1c_T7-cZ9REZxpWc,36267
 qiskit/providers/backend.py,sha256=fgWGmdrCYJgYnnneZKcUYjkjH8NRskib_TBhqNDPRcg,26091
 qiskit/providers/backend_compat.py,sha256=ylcPvMWgjzxBsWjKxRfEJ8jwXIupqr3o1i-McjpmwYU,20138
 qiskit/providers/exceptions.py,sha256=-bvWhJW0KXjIamvZP3xyUnlGovIr_eoFO5hQxy2_zQE,1214
@@ -497,7 +497,7 @@ qiskit/quantum_info/states/measures.py,sha256=BoULnQ-1d9_bHzH6X79wtP7zTxkeVKgV3v
 qiskit/quantum_info/states/quantum_state.py,sha256=ErmVJR0Quw5X00UAtvxsADd-vbWIycAA6gUcLRyOdPc,18277
 qiskit/quantum_info/states/random.py,sha256=OUZXAZ9qYhbB9LogfAPhSrBphwapK9aI44xerJqWKlo,5219
 qiskit/quantum_info/states/stabilizerstate.py,sha256=-StDch_tIIiD-z1zZJwD1aKvdHXHzy9tJiLAB_hq1UU,30486
-qiskit/quantum_info/states/statevector.py,sha256=CFI_VR_4FQXqLSZ6lU8Hm2CWZG4JGOBhleowAJPrWnU,37769
+qiskit/quantum_info/states/statevector.py,sha256=9fK9PVkdBxduv5S49Dej4ugsot8goaDe72LFqWT26P4,37764
 qiskit/quantum_info/states/utils.py,sha256=cujjjFSIzNjvRdZyCyJerf9K5aa0g95ebN1tx8Nbteg,9005
 qiskit/result/__init__.py,sha256=7KjootVBUTZFwdbpUMzxBfbcnNioU3w9-wGK1C7sHXk,1849
 qiskit/result/counts.py,sha256=ti18MUnObmfoTMpQoCiObwyCOFL9UWCJIsDquJj23M4,8418
@@ -666,12 +666,12 @@ qiskit/transpiler/passes/optimization/collect_multiqubit_blocks.py,sha256=bFqmRq
 qiskit/transpiler/passes/optimization/commutation_analysis.py,sha256=3-dyfsqf4QOr0ZdNfAYwiDvFCFT6mtrH0M9rs0U4nIg,1837
 qiskit/transpiler/passes/optimization/commutative_cancellation.py,sha256=2z1ZOQAdshjhdTANPqXTy-ojx9F1SSCbqGxq_ucnHI8,3356
 qiskit/transpiler/passes/optimization/commutative_inverse_cancellation.py,sha256=IkvZoTUm5xsR3_YWZIufoZxP0XSuyBKnkFrEEGcGvks,5693
-qiskit/transpiler/passes/optimization/consolidate_blocks.py,sha256=MspJuijgrp4PyoTolmMxYNu553mfxpGbDSkhB-_1Tz0,5759
+qiskit/transpiler/passes/optimization/consolidate_blocks.py,sha256=-pU6tQTwGXrcLvHmb4A1sNNDWA5AOt6lGCT5xd83XyU,5496
 qiskit/transpiler/passes/optimization/cx_cancellation.py,sha256=0e-7eMwdhy4NG6YllXUosWecPm1UwMQYngi-hyuuxak,2401
 qiskit/transpiler/passes/optimization/echo_rzx_weyl_decomposition.py,sha256=U-6Da8e2sh9oR7BghBcntnsnuB3BIDDMEZEtu59cUyE,7280
 qiskit/transpiler/passes/optimization/elide_permutations.py,sha256=k7CrGy5iKs15uI97GUCJOQKpBxzCk7sr9X8bNaxN-HE,4146
 qiskit/transpiler/passes/optimization/hoare_opt.py,sha256=xdSqEmWinuAVkgBGIiFNS-PB7NnzkSFwN-h_BugZOgE,16711
-qiskit/transpiler/passes/optimization/inverse_cancellation.py,sha256=T_wrRl2TY_fp0kWXunap0AQwUV5-nR93OPOsTgDi_zQ,3619
+qiskit/transpiler/passes/optimization/inverse_cancellation.py,sha256=LzBw1FzMgj5WeSnRjSxa0wqYBanvDYQLKV3un5kYdxU,3527
 qiskit/transpiler/passes/optimization/normalize_rx_angle.py,sha256=AbnCL0yvtCp-4O1O8lpFzj8fSzMZ3QYG6gjmJI7uHAE,6404
 qiskit/transpiler/passes/optimization/optimize_1q_commutation.py,sha256=uwoaomez83bG7CgG078cJO55EIe5qjXEIESG4hjqAJU,10583
 qiskit/transpiler/passes/optimization/optimize_1q_decomposition.py,sha256=YgzGFQw_D1aCDtCHGbmq7GHm9KLCx9SWXIaDYaND7WE,10205
@@ -731,8 +731,8 @@ qiskit/transpiler/passes/scheduling/scheduling/base_scheduler.py,sha256=oh_1Gb6G
 qiskit/transpiler/passes/scheduling/scheduling/set_io_latency.py,sha256=FmQSvPbI67L1MvF4A1tbM3Z_8r_7bx6exAyt2Iy-uVw,2918
 qiskit/transpiler/passes/synthesis/__init__.py,sha256=Q18fvaIkZ1PXp680Y53DkatyPg81zNVrdUp_hTJ7k_c,945
 qiskit/transpiler/passes/synthesis/aqc_plugin.py,sha256=y3eoBqsHfugseAa2wYvY-5eWF1GME_TOWnHke9z8NTI,5496
-qiskit/transpiler/passes/synthesis/high_level_synthesis.py,sha256=ISzAhwsYLHCZHEzwPqFjOpPCPEfbi5mrjoaEEVgNrSU,41439
-qiskit/transpiler/passes/synthesis/hls_plugins.py,sha256=7R07fcLdk9rzNH9wuQpN6sgIfYH7XvEhiwp2JTMxzco,59814
+qiskit/transpiler/passes/synthesis/high_level_synthesis.py,sha256=VruZtdMvxcwF2chiuJvFkaHIWm6LpZVSdD9pvHFU9Bg,41435
+qiskit/transpiler/passes/synthesis/hls_plugins.py,sha256=ng5Hqtdwd-qySwb8kU4_Feq53-C_NUJS2KTFmu5onCo,59730
 qiskit/transpiler/passes/synthesis/linear_functions_synthesis.py,sha256=Sit6NoTlFXNBDrDxlyMar9ro7VunRJQxWb5NeG2JTZc,1448
 qiskit/transpiler/passes/synthesis/plugin.py,sha256=7yE9-J2CkSRmxsdpMkSkEDZ7lTonsXUeWfj-IQEJNM8,31540
 qiskit/transpiler/passes/synthesis/solovay_kitaev_synthesis.py,sha256=_Fq3gVuzTUu-ezCtyp3mBQ1tOMrW96igGcsgybXSD8s,11349
@@ -758,7 +758,7 @@ qiskit/transpiler/passes/utils/unroll_forloops.py,sha256=mkjucqYOXyfJpCT3dtXUMJe
 qiskit/transpiler/preset_passmanagers/__init__.py,sha256=DIC_jvndc-sN6x3F7mag-TPV67QN5QqCS3AC2qvuqsw,2831
 qiskit/transpiler/preset_passmanagers/builtin_plugins.py,sha256=g-EO8nNDuvtAkSL-fWxju9-ETmJinL2_JfEhSFBbRs0,45014
 qiskit/transpiler/preset_passmanagers/common.py,sha256=WIyb4sDZdfWTonF-ApLK6v3c_Cz8XihBCH0mpWMUrnw,27171
-qiskit/transpiler/preset_passmanagers/generate_preset_pass_manager.py,sha256=seWSKTlj-kV1NtwbD_Usk9QUhHq3T8_aifUXJBtf8Ik,31516
+qiskit/transpiler/preset_passmanagers/generate_preset_pass_manager.py,sha256=YVrIzj-viNuX8r2igm5u8Y7iT_4RVtMyk2m5brJrrLo,31475
 qiskit/transpiler/preset_passmanagers/level0.py,sha256=-X8y92rTBnvYlbXnWcFgwkF78FZK9Gn2Z9Pd9h0dvfA,4390
 qiskit/transpiler/preset_passmanagers/level1.py,sha256=Cxw99_TL8px-pavkr_XRkMFi9z8F5xnXuDiKRCTbFQE,4926
 qiskit/transpiler/preset_passmanagers/level2.py,sha256=cSOrYsVVJC5DJpjnJ4lNRtkZe_lKH4w385lsb8bogWU,4850
@@ -828,9 +828,9 @@ qiskit/visualization/timeline/types.py,sha256=jtpipQWUpahayNPQYKUst4GG6BqauovO0q
 qiskit/visualization/timeline/plotters/__init__.py,sha256=Klg9a1cSUIQhc815g8OpnD5vO1hcI51L9KlFfKzcuRg,588
 qiskit/visualization/timeline/plotters/base_plotter.py,sha256=taRkL2ZbyorRUEf6nJS8egdzKW2eznQ3w5oBLtMG_U8,1805
 qiskit/visualization/timeline/plotters/matplotlib.py,sha256=lqqNH3-bdf1F1cS2mDla9dLr5qEOeIFuqVl9Rhdg-Dw,7086
-qiskit-1.3.0.dist-info/LICENSE.txt,sha256=pUbmRuPr1gJTTTWZu2c8UmNSntz-pDdKfGR-86NRkok,11619
-qiskit-1.3.0.dist-info/METADATA,sha256=o8anqt5GQCu18d25OYafBPLJw9JDqilYm94fsf_uQ10,13162
-qiskit-1.3.0.dist-info/WHEEL,sha256=wJnV1hFq2E5q4TvostNGn3-ixLXKp09vo4QOYNspKEA,95
-qiskit-1.3.0.dist-info/entry_points.txt,sha256=5Xf0jdIYmLoQN2KoTrdTAfJm9FSd0-w4O0fckxQl7KQ,5669
-qiskit-1.3.0.dist-info/top_level.txt,sha256=_vjFXLv7qrHyJJOC2-JXfG54o4XQygW9GuQPxgtSt9Q,7
-qiskit-1.3.0.dist-info/RECORD,,
+qiskit-1.3.0rc1.dist-info/LICENSE.txt,sha256=pUbmRuPr1gJTTTWZu2c8UmNSntz-pDdKfGR-86NRkok,11619
+qiskit-1.3.0rc1.dist-info/METADATA,sha256=qTFOF4eMK6wtWHaSaXDozCkQAr36AoFEYF-EZMuMJuc,13099
+qiskit-1.3.0rc1.dist-info/WHEEL,sha256=4IQ1P53m-xeOuBBShI63tOno6crr8d99DEYgfjkru7o,95
+qiskit-1.3.0rc1.dist-info/entry_points.txt,sha256=5Xf0jdIYmLoQN2KoTrdTAfJm9FSd0-w4O0fckxQl7KQ,5669
+qiskit-1.3.0rc1.dist-info/top_level.txt,sha256=_vjFXLv7qrHyJJOC2-JXfG54o4XQygW9GuQPxgtSt9Q,7
+qiskit-1.3.0rc1.dist-info/RECORD,,

{qiskit-1.3.0.dist-info → qiskit-1.3.0rc1.dist-info}/WHEEL

@@ -1,5 +1,5 @@
 Wheel-Version: 1.0
-Generator: setuptools (75.6.0)
+Generator: setuptools (75.3.0)
 Root-Is-Purelib: false
 Tag: cp39-abi3-win32