ComposedOp#
- class qiskit.opflow.list_ops.ComposedOp(oplist, coeff=1.0, abelian=False)[source]#
Bases :
ListOp
Deprecated: A class for lazily representing compositions of Operators. Often Operators cannot be efficiently composed with one another, but may be manipulated further so that they can be composed later. This class holds logic to indicate that the Operators in
oplist
are meant to be composed, and therefore if they reach a point in which they can be, such as after conversion to QuantumCircuits or matrices, they can be reduced by composition.ObsolĂšte depuis la version 0.24.0: The class
qiskit.opflow.list_ops.composed_op.ComposedOp
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:
oplist (List[OperatorBase]) â The Operators being composed.
coeff (complex | ParameterExpression) â A coefficient multiplying the operator
abelian (bool) â Indicates whether the Operators in
oplist
are known to mutually commute.
Attributes
- INDENTATION = ' '#
- abelian#
Whether the Operators in
oplist
are known to commute with one another.- Renvoie:
A bool indicating whether the
oplist
is Abelian.
- coeff#
The scalar coefficient multiplying the Operator.
- Renvoie:
The coefficient.
- coeffs#
Return a list of the coefficients of the operators listed. Raises exception for nested Listops.
- combo_fn#
The function defining how to combine
oplist
(or Numbers, or NumPy arrays) to produce the Operatorâs underlying function. For example, SummedOpâs combination function is to add all of the Operators inoplist
.- Renvoie:
The combination function.
- distributive#
- grad_combo_fn#
The gradient of
combo_fn
.
- instance_id#
Return the unique instance id.
- num_qubits#
- oplist#
The list of
OperatorBases
defining the underlying function of this Operator.- Renvoie:
The Operators defining the ListOp
- parameters#
- settings#
Return settings.
Methods
- 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é:
- 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).ListOpâs eval recursively evaluates each Operator in
oplist
, and combines the results using the recombination functioncombo_fn
.- ParamĂštres:
front (str | dict | ndarray | OperatorBase | Statevector | None) â The bitstring, dict of bitstrings (with values being coefficients), or StateFn to evaluated by the Operatorâs underlying function.
- Renvoie:
The output of the
oplist
Operatorsâ evaluation function, combined with thecombo_fn
. 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.- LĂšve:
NotImplementedError â Raised if called for a subclass which is not distributive.
TypeError â Operators with mixed hierarchies, such as a ListOp containing both PrimitiveOps and ListOps, are not supported.
NotImplementedError â Attempting to call ListOpâs eval from a non-distributive subclass.
- Type renvoyé:
- non_distributive_reduce()[source]#
Reduce without attempting to expand all distributive compositions.
- Renvoie:
The reduced Operator.
- Type renvoyé:
- reduce()[source]#
Try collapsing the Operator structure, usually after some type of conversion, e.g. trying to add Operators in a SummedOp or delete needless IGates in a CircuitOp. If no reduction is available, just returns self.
- Renvoie:
The reduced
OperatorBase
.- Type renvoyé:
- to_circuit()[source]#
Returns the quantum circuit, representing the composed operator.
- Renvoie:
The circuit representation of the composed operator.
- LĂšve:
OpflowError â for operators where a single underlying circuit can not be obtained.
- 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é: