PauliOp#
- class qiskit.opflow.primitive_ops.PauliOp(*args, **kwargs)[source]#
Bases :
PrimitiveOp
Deprecated: Class for Operators backed by Terra’s
Pauli
module.Obsolète depuis la version 0.24.0: The class
qiskit.opflow.primitive_ops.pauli_op.PauliOp
is deprecated as of qiskit-terra 0.24.0. It will be removed no earlier than 3 months after the release date. For code migration guidelines, visit https://qisk.it/opflow_migration.- Paramètres:
primitive – The Pauli which defines the behavior of the underlying function.
coeff – A coefficient multiplying the primitive.
- Lève:
TypeError – invalid parameters.
Attributes
- INDENTATION = ' '#
- coeff#
The scalar coefficient multiplying the Operator.
- Renvoie:
The coefficient.
- instance_id#
Return the unique instance id.
- num_qubits#
- parameters#
- primitive: Pauli#
The primitive defining the underlying function of the Operator.
- Renvoie:
The primitive object.
- settings#
Return operator settings.
Methods
- add(other)[source]#
Return Operator addition of self and other, overloaded by
+
.- Paramètres:
other (OperatorBase) – An
OperatorBase
with the same number of qubits as self, and in the same “Operator”, “State function”, or “Measurement” category as self (i.e. the same type of underlying function).- Renvoie:
An
OperatorBase
equivalent to the sum of self and other.- Type renvoyé:
- adjoint()[source]#
Return a new Operator equal to the Operator’s adjoint (conjugate transpose), overloaded by
~
. For StateFns, this also turns the StateFn into a measurement.- Renvoie:
An
OperatorBase
equivalent to the adjoint of self.- Type renvoyé:
- compose(other, permutation=None, front=False)[source]#
Return Operator Composition between self and other (linear algebra-style: A@B(x) = A(B(x))), overloaded by
@
.Note: You must be conscious of Quantum Circuit vs. Linear Algebra ordering conventions. Meaning, X.compose(Y) produces an X∘Y on qubit 0, but would produce a QuantumCircuit which looks like
-[Y]-[X]-
Because Terra prints circuits with the initial state at the left side of the circuit.
- Paramètres:
other (OperatorBase) – The
OperatorBase
with which to compose self.permutation (List[int] | None) –
List[int]
which defines permutation on other operator.front (bool) – If front==True, return
other.compose(self)
.
- Renvoie:
An
OperatorBase
equivalent to the function composition of self and other.- Type renvoyé:
- equals(other)[source]#
Evaluate Equality between Operators, overloaded by
==
. Only returns True if self and other are of the same representation (e.g. a DictStateFn and CircuitStateFn will never be equal, even if their vector representations are equal), their underlying primitives are equal (this means for ListOps, OperatorStateFns, or EvolvedOps the equality is evaluated recursively downwards), and their coefficients are equal.- Paramètres:
other (OperatorBase) – The
OperatorBase
to compare to self.- Renvoie:
A bool equal to the equality of self and other.
- Type renvoyé:
- eval(front=None)[source]#
Evaluate the Operator’s underlying function, either on a binary string or another Operator. A square binary Operator can be defined as a function taking a binary function to another binary function. This method returns the value of that function for a given StateFn or binary string. For example,
op.eval('0110').eval('1110')
can be seen as querying the Operator’s matrix representation by row 6 and column 14, and will return the complex value at those « indices. » Similarly for a StateFn,op.eval('1011')
will return the complex value at row 11 of the vector representation of the StateFn, as all StateFns are defined to be evaluated from Zero implicitly (i.e. it is as if.eval('0000')
is already called implicitly to always « indexing » from column 0).If
front
is None, the matrix-representation of the operator is returned.- Paramètres:
front (str | Dict[str, complex] | ndarray | OperatorBase | Statevector | None) – The bitstring, dict of bitstrings (with values being coefficients), or StateFn to evaluated by the Operator’s underlying function, or None.
- Renvoie:
The output of the Operator’s evaluation function. If self is a
StateFn
, the result is a float or complex. If self is an Operator (PrimitiveOp, ComposedOp, SummedOp, EvolvedOp,
etc.), the result is a StateFn. Iffront
is None, the matrix-representation of the operator is returned, which is aMatrixOp
for the operators and aVectorStateFn
for state-functions. If either self or front contain properListOps
(not ListOp subclasses), the result is an n-dimensional list of complex or StateFn results, resulting from the recursive evaluation by each OperatorBase in the ListOps.- Type renvoyé:
- permute(permutation)[source]#
Permutes the sequence of Pauli matrices.
- Paramètres:
permutation (List[int]) – A list defining where each Pauli should be permuted. The Pauli at index j of the primitive should be permuted to position permutation[j].
- Renvoie:
A new PauliOp representing the permuted operator. For operator (X ^ Y ^ Z) and indices=[1,2,4], it returns (X ^ I ^ Y ^ Z ^ I).
- Lève:
OpflowError – if indices do not define a new index for each qubit.
- Type renvoyé:
- primitive_strings()[source]#
Return a set of strings describing the primitives contained in the Operator. For example,
{'QuantumCircuit', 'Pauli'}
. For hierarchical Operators, such asListOps
, this can help illuminate the primitives represented in the various recursive levels, and therefore which conversions can be applied.
- tensor(other)[source]#
Return tensor product between self and other, overloaded by
^
. Note: You must be conscious of Qiskit’s big-endian bit printing convention. Meaning, X.tensor(Y) produces an X on qubit 0 and an Y on qubit 1, or X⨂Y, but would produce a QuantumCircuit which looks like-[Y]- -[X]-
Because Terra prints circuits and results with qubit 0 at the end of the string or circuit.
- Paramètres:
other (OperatorBase) – The
OperatorBase
to tensor product with self.- Renvoie:
An
OperatorBase
equivalent to the tensor product of self and other.- Type renvoyé:
- to_matrix(massive=False)[source]#
Return NumPy representation of the Operator. Represents the evaluation of the Operator’s underlying function on every combination of basis binary strings. Warn if more than 16 qubits to force having to set
massive=True
if such a large vector is desired.- Renvoie:
The NumPy
ndarray
equivalent to this Operator.- Type renvoyé:
- to_pauli_op(massive=False)[source]#
Returns a sum of
PauliOp
s equivalent to this Operator.- Type renvoyé:
- to_spmatrix()[source]#
Returns SciPy sparse matrix representation of the Operator.
- Renvoie:
CSR sparse matrix representation of the Operator.
- Lève:
ValueError – invalid parameters.
- Type renvoyé:
spmatrix