qiskit 1.3.0__cp39-abi3-manylinux_2_17_i686.manylinux2014_i686.whl → 1.3.0rc1__cp39-abi3-manylinux_2_17_i686.manylinux2014_i686.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

@@ -3,8 +3,8 @@ qiskit/__init__.py,sha256=MHSxG7bMhoESBIzoz9DdWdolCdPTwnwHJ80zjWMoRd4,7483
 qiskit/_numpy_compat.py,sha256=ZlnDTF2KBTKcVF489ZuxoBk6r9KLsMuhAlozFhOn0a8,2815
 qiskit/version.py,sha256=MiraFeJt5GQEspFyvP3qJedHen2C1e8dNEttzg0u7YU,2498
 qiskit/user_config.py,sha256=I7QCF9W2IDpleWunxDjgYGySsVUlq57gfj_137o0Dac,10109
-qiskit/_accelerate.abi3.so,sha256=1ETuvqC0Mh97xKHckYNilFebp8kV2Mp0ARijRNfHYsY,10316256
-qiskit/VERSION.txt,sha256=ZNI_hY71Gw-Zbklm1OJ8A3G0N-LSeHiQsfetItTsVmM,6
+qiskit/_accelerate.abi3.so,sha256=R0NtvvfCmXrIU9GTpdnno-gpu9KTR4hVO4r89WjPJEE,10320852
+qiskit/VERSION.txt,sha256=oF8wcE1KomvaQ5YkAnT5Eqcilzx2jXMriqOqa8SgqQA,9
 qiskit/transpiler/passmanager_config.py,sha256=u0Ag_6ygdUjsBFksd0ptbEdkPH7aZ4ORmcJ8aqqhKDg,10487
 qiskit/transpiler/passmanager.py,sha256=mxdKQQkV9ZJ1tB1TFbqlkex_0B8HItILGzk6CNFikzE,20399
 qiskit/transpiler/instruction_durations.py,sha256=sXX_-jbf6I5R4cHpBBheQaTaRRa4b24Fp7E750AhrC0,11236
@@ -19,7 +19,7 @@ qiskit/transpiler/preset_passmanagers/level1.py,sha256=15OG8az6JecM-3CjyFNgIrTL8
 qiskit/transpiler/preset_passmanagers/level0.py,sha256=emrcxdh3Rnv5pyAo5WuMJlY3tfz6WnkKJlGao7vSYAI,4277
 qiskit/transpiler/preset_passmanagers/level3.py,sha256=t6WoVq84nfZo3SHSqbkEfXkw91akYevsVivh-r25r8I,4919
 qiskit/transpiler/preset_passmanagers/common.py,sha256=_y0ABya647oTEbl8s8EcnXr8bInYVztN7BCnB5iFjRk,26522
-qiskit/transpiler/preset_passmanagers/generate_preset_pass_manager.py,sha256=oxkjpVKJ0Dup3eKhn4LRXCFGlqnmoERc28C_pC2xKDE,30890
+qiskit/transpiler/preset_passmanagers/generate_preset_pass_manager.py,sha256=P7-8j2mbdWrqwDhPNCy-va_Q9Lzhc8jUUUs4FLkO9CM,30850
 qiskit/transpiler/preset_passmanagers/__init__.py,sha256=i6t27h2cHewTwN6g8JAyR98obTTP9Aimzqdl2SRdiwQ,2758
 qiskit/transpiler/preset_passmanagers/level2.py,sha256=Bt0EAyreXQb5cxAR6JF_4XoieaJVwi2qO5UyxYSHZiY,4731
 qiskit/transpiler/preset_passmanagers/plugin.py,sha256=sxSLs-dwSfPgILjvtRTb4NHqzg_7AQKuRtAMDw4Sd08,14919
@@ -51,10 +51,10 @@ qiskit/transpiler/passes/routing/algorithms/types.py,sha256=9yX3_8JFvA4T5_tXWb3T
 qiskit/transpiler/passes/synthesis/aqc_plugin.py,sha256=SDgHqcCHR0hON50ckSHQDrVnBzOc-I7hYibE6r6oaB8,5343
 qiskit/transpiler/passes/synthesis/solovay_kitaev_synthesis.py,sha256=xM0KHNaH8N9-tn5rhC5tAGc5-faID8GvVFbH6HCqnsE,11052
 qiskit/transpiler/passes/synthesis/unitary_synthesis.py,sha256=0Y97BlIvXgR1-PoQscwGHFiYDR8fyT2S1R9DMLQa-30,45663
-qiskit/transpiler/passes/synthesis/hls_plugins.py,sha256=cuQ6-6qDfks_oA8afqvP3u3hIw6fRXzi7-swGrPf9L0,58255
+qiskit/transpiler/passes/synthesis/hls_plugins.py,sha256=WqMhSA0kBXjMgE7weLNp-JqKnvTQJiOrDyX-VtfP8Aw,58172
 qiskit/transpiler/passes/synthesis/__init__.py,sha256=VYO9Sl_SJyoZ_bLronrkvK9u8kL-LW9G93LbWyWNEaM,925
 qiskit/transpiler/passes/synthesis/linear_functions_synthesis.py,sha256=Q1r-52HMETK_7iWTMmJKGU39rNws-MrmGDHh7TgQVj4,1407
-qiskit/transpiler/passes/synthesis/high_level_synthesis.py,sha256=rTORc72gdQhty_0XE8VMESznuRbNiDdAp2O4QfCZl74,40585
+qiskit/transpiler/passes/synthesis/high_level_synthesis.py,sha256=BMXJQAoNovO28dfCk7Yx0oR5cKZjOYJIDF-gEHoItoI,40580
 qiskit/transpiler/passes/synthesis/plugin.py,sha256=LnvGzGJ8Q5gSPKSJNmJ7fvnUub8lzG5iGGTqOTODpes,30806
 qiskit/transpiler/passes/layout/vf2_layout.py,sha256=hVV8XZgFsaYKdlqKg-CQE8fQwJVOoRZXR99GtUBgqmA,11968
 qiskit/transpiler/passes/layout/sabre_layout.py,sha256=Scf_SwBHKfkCeR7VxV2qKSoIOjQlETuEwFfsJOpE4ZE,22883
@@ -84,11 +84,11 @@ qiskit/transpiler/passes/optimization/collect_2q_blocks.py,sha256=IVQDvs70ZPzlX5
 qiskit/transpiler/passes/optimization/collect_cliffords.py,sha256=IYxqCHBu7ZsdLQ2VQT4nOeP60IFgwE5Wt7G_qA_7xRE,3572
 qiskit/transpiler/passes/optimization/collect_linear_functions.py,sha256=w0mhG9kwBMkdlyZrOX_oLtCknd-wAOUATpotNM-sgV0,2941
 qiskit/transpiler/passes/optimization/commutative_inverse_cancellation.py,sha256=JSo2J9PIXKmr44_zQ5_z3q8N3zsytUq-_0TLDk2jvmc,5553
-qiskit/transpiler/passes/optimization/inverse_cancellation.py,sha256=V9jj9BQlt5KfkwfPwjxExTlpme3UI0XD-AkbwjSfMzw,3524
+qiskit/transpiler/passes/optimization/inverse_cancellation.py,sha256=2noeu1bmqDcZeKCwCsGJ2mt7trcNo6JNBxaotgY2qCM,3434
 qiskit/transpiler/passes/optimization/remove_reset_in_zero_state.py,sha256=xE5ok4OOLQ8idRN534W8Rev1E6QWeTZgcHVZ-tWPaYI,1247
 qiskit/transpiler/passes/optimization/reset_after_measure_simplification.py,sha256=2PZ_1lheWvq8Y9ualZjn-qIzHH6dnX2BMUtjOir-efs,2011
 qiskit/transpiler/passes/optimization/optimize_1q_commutation.py,sha256=svyl0lMrgv0nGm5F59Yc-fgQXuJ2SngNmi_v6t6iZMQ,10315
-qiskit/transpiler/passes/optimization/consolidate_blocks.py,sha256=nEDNl8wbg95eAhD_TpZRvYLk7GwNfSr5S7bWoJgQFNM,5610
+qiskit/transpiler/passes/optimization/consolidate_blocks.py,sha256=bzKn4TmdHDJ_z0PgPKvVhVCdZ7o59oGOBG7J3enGKl4,5354
 qiskit/transpiler/passes/optimization/remove_diagonal_gates_before_measure.py,sha256=liy5ZuFNO8PgmX4dZyRsXGOKxVJ6g24PnQP1h2Jr2Ws,1407
 qiskit/transpiler/passes/optimization/template_optimization.py,sha256=biZ_UD1AJcpZ9bLknXumMgk1KGui7i-ZkeyKD2B7aFU,6733
 qiskit/transpiler/passes/optimization/commutative_cancellation.py,sha256=2IA7m3K-iIV9xMUpUyOiGlpu2JCA6w0dTXJZBAa8ZrQ,3274
@@ -373,7 +373,7 @@ qiskit/quantum_info/operators/utils/double_commutator.py,sha256=fXW2YPgzPyzHOSbP
 qiskit/quantum_info/operators/utils/__init__.py,sha256=E-Z7NJUaWRxqJN1lcYdDqSupLLKE1QUejl9ttQ8_04U,704
 qiskit/quantum_info/operators/utils/anti_commutator.py,sha256=mn8j5qsW4ZRED8OMcZX76-HCJoxOWPj_KsTwUUBe8_k,977
 qiskit/quantum_info/states/utils.py,sha256=Trw5T6EX3FHpjgKoQm6788wZwe4JtFJIvD4V-MA0Qwg,8758
-qiskit/quantum_info/states/statevector.py,sha256=t1g8uhLhuKxXImWJuH2Fp3KyyLML8Z9mU8sA1o_j4tE,36811
+qiskit/quantum_info/states/statevector.py,sha256=SzC5VI6yx7JLfS4HnrNTfBYV2kfj4jPxcjRMgUXQfTw,36806
 qiskit/quantum_info/states/random.py,sha256=oxQWWdCpZVxTnbrBUfdRodVKhRhhFD-pW4zcxUt5dM0,5062
 qiskit/quantum_info/states/quantum_state.py,sha256=v__EAFkAu2aJwafAfaVDce5_525fTkTrTaJdrdQhAr0,17774
 qiskit/quantum_info/states/__init__.py,sha256=Zepc7tCs93UIRVkLJYks3FH3pCoIe48f-rVtQ0X6qoQ,897
@@ -471,7 +471,7 @@ qiskit/qobj/converters/pulse_instruction.py,sha256=w73IzHQpxFAn55jMeNdk2JTV7K2ga
 qiskit/qobj/converters/__init__.py,sha256=Akm9I--eCKJngKWrNe47Jx9mfZhH7TPMhpVq_lICmXs,691
 qiskit/qobj/converters/lo_config.py,sha256=UczPUYOm820G-vm1YXjSFAlRsMI4WndnkNZCPu-ty9Q,6912
 qiskit/primitives/statevector_sampler.py,sha256=7IkvHKw0sPsuKPzjHb_b4TyA0ONc0Uabh3M505TX0hY,10993
-qiskit/primitives/utils.py,sha256=32gJvSOdFOh08DLlUBvZ2js4ijkrKk2vBGHViZHd20s,8346
+qiskit/primitives/utils.py,sha256=d5B2RvCa_vN7wFvpTbEpyxBZ7LiIq262tXXe6IR5MUs,8347
 qiskit/primitives/backend_sampler.py,sha256=7V3-oWVNWS-UUQp2aI19NKFHgD-q1Y9qudmu-YNQA1Y,8272
 qiskit/primitives/statevector_estimator.py,sha256=JwxjQQQG0kH6r457E8AMTM3veQmpvomsjH6eEfBOyrI,7100
 qiskit/primitives/backend_estimator.py,sha256=gYRa8EpGF9uEikthCpaCgRxYPrc3XE_6lJj2PPbdHcQ,19128
@@ -574,7 +574,7 @@ qiskit/circuit/library/graph_state.py,sha256=bOCAj8qsC7k-OS6qWkhUH8nBBd2I5uKOkrz
 qiskit/circuit/library/phase_oracle.py,sha256=n2QVk7hELNiDWOGWLWh7kquMDIVTIHIoEWuHydXIv4E,6665
 qiskit/circuit/library/overlap.py,sha256=JTSg9L6lMKL4xnatIWnQupb8GJYJrDV-DM8wXJsjjhU,7085
 qiskit/circuit/library/fourier_checking.py,sha256=h81zaCc4AWF3luFyy8stGoU-UWcubP-Srqs92duqDQw,6252
-qiskit/circuit/library/__init__.py,sha256=jo55p9TvRYOO-qlNanHILFsYF1gryw5J8d5zuW7n9kA,15885
+qiskit/circuit/library/__init__.py,sha256=AUVh1_a8ia9OHV09MGakHrKXpQYLV9lxT4o-kRCFvHU,15300
 qiskit/circuit/library/pauli_evolution.py,sha256=K5z629DK2KRqeAVTQ7yRHLO1VPXegV0gI-GE0ejFRBg,6584
 qiskit/circuit/library/grover_operator.py,sha256=MhGiVhTMmwTwgqNexe2KZWe7BH8oAIQSkWJtiDaBc6A,28185
 qiskit/circuit/library/hidden_linear_function.py,sha256=WMqwqNUFAp3aFWPi20GmU17zkUQ013QPT1dTQIs1vLE,5540
@@ -606,11 +606,11 @@ qiskit/circuit/library/arithmetic/multipliers/multiplier.py,sha256=ie_IV_oX4axsj
 qiskit/circuit/library/arithmetic/multipliers/__init__.py,sha256=vRtcHF2PRcyK_lfBQFqsWlpeaGwkcK3PK1KeduHvfOE,672
 qiskit/circuit/library/arithmetic/multipliers/hrs_cumulative_multiplier.py,sha256=oJIWVc2wFLz-GbU06jurKU3xcyxWdd7AbsH7SVMu0-c,6850
 qiskit/circuit/library/arithmetic/multipliers/rg_qft_multiplier.py,sha256=fhFUM0wTyK8X8CLDQEKs05Ezzos5uS_kybCoj9zSeuw,6215
-qiskit/circuit/library/arithmetic/adders/draper_qft_adder.py,sha256=bUV7q1nbQoftKVjX0D-HcW_kyJqWrJpP8muXnV7SeRU,6039
-qiskit/circuit/library/arithmetic/adders/vbe_ripple_carry_adder.py,sha256=hSk8Yis542uIJl7xn4UsdVYWUBG0Igvf4eFYxiGdG3M,4943
+qiskit/circuit/library/arithmetic/adders/draper_qft_adder.py,sha256=LSSf_JNjtslMGYDfoykZzrZcp-Cu2EqgG_rTyfRIiE4,6035
+qiskit/circuit/library/arithmetic/adders/vbe_ripple_carry_adder.py,sha256=h0A_2Q8Ixw8QcxOYboVAhhd7XVqES0AoxU4Rlx6BWwA,4939
 qiskit/circuit/library/arithmetic/adders/__init__.py,sha256=PRrSLxGAtAMm-9L6UIFnL3ta0NSYUIhEklpf_i9bE5s,743
-qiskit/circuit/library/arithmetic/adders/cdkm_ripple_carry_adder.py,sha256=6_t_r2qB9Ancp24EnrZ8bOB0k9W-_akT7rcRDmPz-CE,7460
-qiskit/circuit/library/arithmetic/adders/adder.py,sha256=nE-I8_yAB7_CLSIIm_LcRH-_r72wVnd5N9JnlSilc9Q,6669
+qiskit/circuit/library/arithmetic/adders/cdkm_ripple_carry_adder.py,sha256=MdHBDzhXIg5G0ePIFCVlBAAIr_inngSp4i2ElDukRvI,7456
+qiskit/circuit/library/arithmetic/adders/adder.py,sha256=nXr5arh1aX2Vkh_IVD3bY3KAd336_kCojDc_wpmzRo4,6664
 qiskit/circuit/library/n_local/two_local.py,sha256=DNgYjVcSvm5OpCSGj4CNOsn3CnBKyUCVUESDJvPmN4E,17004
 qiskit/circuit/library/n_local/n_local.py,sha256=cgVfChYh6JDOgSzKW2JpKS8zwUIHqLLt2oGVyoGgPPQ,60739
 qiskit/circuit/library/n_local/efficient_su2.py,sha256=VODdAqmnqR0vMR-6mnhwUUvjo3DeFxCHcOqb76Jp7Qc,15270
@@ -775,7 +775,7 @@ qiskit/qasm/libs/dummy/stdgates.inc,sha256=P-k26UtYNXkqZMHknr4ExkGXIgS3Q71AcmqCK
 qiskit/providers/backend_compat.py,sha256=E_vtTyuTWVmQzMNtoT0Dj8wOc9IVOll6nUfr9ahhomA,19666
 qiskit/providers/providerutils.py,sha256=yz5irsmPJAFcbiZsWi24Yp96SWQUIUuisK3r3AqcEhQ,3872
 qiskit/providers/exceptions.py,sha256=cXxlril0FQI0suiLBUlBQmtBAzhFrvEZRAo5iV4CFFM,1169
-qiskit/providers/__init__.py,sha256=jzxclSA7PaP6bdMO_Qvqg0kSHIXQqxtGY6jnbSOqYxw,35468
+qiskit/providers/__init__.py,sha256=ZpN-CdBhJhc8Uq7CoWmVC4xetxfWVcp2WxaRsnta4Qc,35464
 qiskit/providers/job.py,sha256=bl452OQlamT98hbHNI6l9F6pFoLayMvR4M49p_pYq80,5048
 qiskit/providers/backend.py,sha256=id2-Zw-FTZELRaPCQUltgqHnB_u8YHnsdhWAeXb4emM,25424
 qiskit/providers/provider.py,sha256=he8imx5J_XiElFfaWPbjDYPx2xuTR54G9l84iRFQ-mA,3182
@@ -828,9 +828,9 @@ qiskit/providers/fake_provider/backends_v1/fake_7q_pulse/fake_7q_pulse_v1.py,sha
 qiskit/providers/fake_provider/utils/backend_converter.py,sha256=YPogiOaB1GfDVKbI4cZYYo2OHyYVMjj1zclJ_A3JnEU,6677
 qiskit/providers/fake_provider/utils/__init__.py,sha256=qVHEcGCFq7OsK-gv3C5mKmPZ1xnAgshrVMT6FMgRaBc,511
 qiskit/providers/fake_provider/utils/json_decoder.py,sha256=vm5bogS834RJ-zChlipPuhlbVfROuqdsn1dPCFRm1gI,3506
-qiskit-1.3.0.dist-info/top_level.txt,sha256=_vjFXLv7qrHyJJOC2-JXfG54o4XQygW9GuQPxgtSt9Q,7
-qiskit-1.3.0.dist-info/RECORD,,
-qiskit-1.3.0.dist-info/LICENSE.txt,sha256=IXrBXbzaJ4LgBPUVKIbYR5iMY2eqoMT8jDVTY8Ib0iQ,11416
-qiskit-1.3.0.dist-info/entry_points.txt,sha256=5Xf0jdIYmLoQN2KoTrdTAfJm9FSd0-w4O0fckxQl7KQ,5669
-qiskit-1.3.0.dist-info/METADATA,sha256=PK2oVEBWOMAprG23iYxs88LBans3HdIh35cJUOf_iQg,12940
-qiskit-1.3.0.dist-info/WHEEL,sha256=IZbIVxqAiF9pdpAY3hv4kiUNhDK2qOhw2_dp-_gT7ew,143
+qiskit-1.3.0rc1.dist-info/top_level.txt,sha256=_vjFXLv7qrHyJJOC2-JXfG54o4XQygW9GuQPxgtSt9Q,7
+qiskit-1.3.0rc1.dist-info/RECORD,,
+qiskit-1.3.0rc1.dist-info/LICENSE.txt,sha256=IXrBXbzaJ4LgBPUVKIbYR5iMY2eqoMT8jDVTY8Ib0iQ,11416
+qiskit-1.3.0rc1.dist-info/entry_points.txt,sha256=5Xf0jdIYmLoQN2KoTrdTAfJm9FSd0-w4O0fckxQl7KQ,5669
+qiskit-1.3.0rc1.dist-info/METADATA,sha256=UVN5eR3xeqOk1K41cLSRwjBB4BObCtc4Q95D67au2_w,12877
+qiskit-1.3.0rc1.dist-info/WHEEL,sha256=Xobv8QdYCw2Y0U97q1b6dyVussU32VwxX92CsxH2TwY,143

{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-manylinux_2_17_i686
 Tag: cp39-abi3-manylinux2014_i686