qml.PauliRot¶

class
PauliRot
(theta, pauli_word, wires=None, do_queue=True, id=None)[source]¶ Bases:
pennylane.operation.Operation
Arbitrary Pauli word rotation.
\[RP(\theta, P) = \exp(i \frac{\theta}{2} P)\]Details:
Number of wires: Any
Number of parameters: 1
Gradient recipe: \(\frac{d}{d\theta}f(RP(\theta)) = \frac{1}{2}\left[f(RP(\theta +\pi/2))  f(RP(\theta\pi/2))\right]\) where \(f\) is an expectation value depending on \(RP(\theta)\).
Note
If the
PauliRot
gate is not supported on the targeted device, PennyLane will decompose the gate usingRX
,Hadamard
,RZ
andCNOT
gates. Parameters
theta (float) – rotation angle \(\theta\)
pauli_word (string) – the Pauli word defining the rotation
wires (Sequence[int] or int) – the wire the operation acts on
do_queue (bool) – Indicates whether the operator should be immediately pushed into the Operator queue (optional)
id (str or None) – String representing the operation (optional)
Example
>>> dev = qml.device('default.qubit', wires=1) >>> @qml.qnode(dev) ... def example_circuit(): ... qml.PauliRot(0.5, 'X', wires=0) ... return qml.expval(qml.PauliZ(0)) >>> print(example_circuit()) 0.8775825618903724
Attributes
If inverse is requested, this is the name of the original operator to be inverted.
The target operation for controlled gates.
Control wires of the operator.
Eigenvalues of an instantiated operator.
Gradient recipe for the parametershift method.
Integer hash that uniquely represents the operator.
Dictionary of nontrainable variables that this operation depends on.
Custom string to label a specific operator instance.
Boolean determining if the inverse of the operation was requested.
Matrix representation of an instantiated operator in the computational basis.
Name of the operator.
Number of trainable parameters that the operator depends on.
Trainable parameters that the operator depends on.
The parameters required to implement a singlequbit gate as an equivalent
Rot
gate, up to a global phase.Wires that the operator acts on.

base_name
¶ If inverse is requested, this is the name of the original operator to be inverted.

basis
= None¶ The target operation for controlled gates. target operation. If not
None
, should take a value of"X"
,"Y"
, or"Z"
.For example,
X
andCNOT
havebasis = "X"
, whereasControlledPhaseShift
andRZ
havebasis = "Z"
. Type
str or None

control_wires
¶ Control wires of the operator.
For operations that are not controlled, this is an empty
Wires
object of length0
. Returns
The control wires of the operation.
 Return type

do_check_domain
= False¶

eigvals
¶ Eigenvalues of an instantiated operator. Note that the eigenvalues are not guaranteed to be in any particular order.
Warning
The
eigvals
property is deprecated and will be removed in an upcoming release. Please useqml.eigvals
instead.Example:
>>> U = qml.RZ(0.5, wires=1) >>> U.eigvals >>> array([0.968912420.24740396j, 0.96891242+0.24740396j])
 Returns
eigvals representation
 Return type
array

grad_method
= 'A'¶

grad_recipe
= None¶ Gradient recipe for the parametershift method.
This is a tuple with one nested list per operation parameter. For parameter \(\phi_k\), the nested list contains elements of the form \([c_i, a_i, s_i]\) where \(i\) is the index of the term, resulting in a gradient recipe of
\[\frac{\partial}{\partial\phi_k}f = \sum_{i} c_i f(a_i \phi_k + s_i).\]If
None
, the default gradient recipe containing the two terms \([c_0, a_0, s_0]=[1/2, 1, \pi/2]\) and \([c_1, a_1, s_1]=[1/2, 1, \pi/2]\) is assumed for every parameter. Type
tuple(Union(list[list[float]], None)) or None

has_matrix
= True¶

hash
¶ Integer hash that uniquely represents the operator.
 Type
int

hyperparameters
¶ Dictionary of nontrainable variables that this operation depends on.
 Type
dict

id
¶ Custom string to label a specific operator instance.

inverse
¶ Boolean determining if the inverse of the operation was requested.

matrix
¶ Matrix representation of an instantiated operator in the computational basis.
Warning
The
matrix
property is deprecated and will be removed in an upcoming release. Please useqml.matrix
instead.Example:
>>> U = qml.RY(0.5, wires=1) >>> U.matrix >>> array([[ 0.96891242+0.j, 0.24740396+0.j], [ 0.24740396+0.j, 0.96891242+0.j]])
 Returns
matrix representation
 Return type
array

name
¶ Name of the operator.

num_params
= 1¶ Number of trainable parameters that the operator depends on.
 Type
int

num_wires
= 1¶

parameter_frequencies
= [(1,)]¶

parameters
¶ Trainable parameters that the operator depends on.

single_qubit_rot_angles
¶ The parameters required to implement a singlequbit gate as an equivalent
Rot
gate, up to a global phase. Returns
A list of values \([\phi, \theta, \omega]\) such that \(RZ(\omega) RY(\theta) RZ(\phi)\) is equivalent to the original operation.
 Return type
tuple[float, float, float]
Methods
adjoint
()Create an operation that is the adjoint of this one.
compute_decomposition
(theta, wires, pauli_word)Representation of the operator as a product of other operators (static method).
compute_diagonalizing_gates
(*params, wires, …)Sequence of gates that diagonalize the operator in the computational basis (static method).
compute_eigvals
(theta, pauli_word)Eigenvalues of the operator in the computational basis (static method).
compute_matrix
(theta, pauli_word)Representation of the operator as a canonical matrix in the computational basis (static method).
compute_sparse_matrix
(*params, **hyperparams)Representation of the operator as a sparse matrix in the computational basis (static method).
compute_terms
(*params, **hyperparams)Representation of the operator as a linear combination of other operators (static method).
Representation of the operator as a product of other operators.
Sequence of gates that diagonalize the operator in the computational basis.
expand
()Returns a tape that has recorded the decomposition of the operator.
Generator of an operator that is in singleparameterform.
Eigenvalues of the operator in the computational basis (static method).
get_matrix
([wire_order])Representation of the operator as a matrix in the computational basis.
get_parameter_shift
(idx)Multiplier and shift for the given parameter, based on its gradient recipe.
inv
()Inverts the operator.
label
([decimals, base_label, cache])A customizable string representation of the operator.
queue
([context])Append the operator to the Operator queue.
sparse_matrix
([wire_order])Representation of the operator as a sparse matrix in the computational basis.
terms
()Representation of the operator as a linear combination of other operators.

adjoint
()[source]¶ Create an operation that is the adjoint of this one.
Adjointed operations are the conjugated and transposed version of the original operation. Adjointed ops are equivalent to the inverted operation for unitary gates.
 Parameters
do_queue – Whether to add the adjointed gate to the context queue.
 Returns
The adjointed operation.

static
compute_decomposition
(theta, wires, pauli_word)[source]¶ Representation of the operator as a product of other operators (static method). :
\[O = O_1 O_2 \dots O_n.\]See also
 Parameters
theta (float) – rotation angle \(\theta\)
pauli_word (string) – the Pauli word defining the rotation
wires (Iterable, Wires) – the wires the operation acts on
 Returns
decomposition into lower level operations
 Return type
list[Operator]
Example:
>>> qml.PauliRot.compute_decomposition(1.2, "XY", wires=(0,1)) [Hadamard(wires=[0]), RX(1.5707963267948966, wires=[1]), MultiRZ(1.2, wires=[0, 1]), Hadamard(wires=[0]), RX(1.5707963267948966, wires=[1])]

static
compute_diagonalizing_gates
(*params, wires, **hyperparams)¶ Sequence of gates that diagonalize the operator in the computational basis (static method).
Given the eigendecomposition \(O = U \Sigma U^{\dagger}\) where \(\Sigma\) is a diagonal matrix containing the eigenvalues, the sequence of diagonalizing gates implements the unitary \(U\).
The diagonalizing gates rotate the state into the eigenbasis of the operator.
See also
 Parameters
params (list) – trainable parameters of the operator, as stored in the
parameters
attributewires (Iterable[Any], Wires) – wires that the operator acts on
hyperparams (dict) – nontrainable hyperparameters of the operator, as stored in the
hyperparameters
attribute
 Returns
list of diagonalizing gates
 Return type
list[Operator]

static
compute_eigvals
(theta, pauli_word)[source]¶ Eigenvalues of the operator in the computational basis (static method).
If
diagonalizing_gates
are specified and implement a unitary \(U\), the operator can be reconstructed as\[O = U \Sigma U^{\dagger},\]where \(\Sigma\) is the diagonal matrix containing the eigenvalues.
Otherwise, no particular order for the eigenvalues is guaranteed.
See also
eigvals()
 Returns
eigenvalues
 Return type
tensor_like
Example
>>> qml.PauliRot.compute_eigvals(torch.tensor(0.5), "X") tensor([0.96890.2474j, 0.9689+0.2474j])

static
compute_matrix
(theta, pauli_word)[source]¶ Representation of the operator as a canonical matrix in the computational basis (static method).
The canonical matrix is the textbook matrix representation that does not consider wires. Implicitly, this assumes that the wires of the operator correspond to the global wire order.
See also
matrix()
 Parameters
theta (tensor_like or float) – rotation angle
pauli_word (str) – string representation of Pauli word
 Returns
canonical matrix
 Return type
tensor_like
Example
>>> qml.PauliRot.compute_matrix(0.5, 'X') [[9.6891e01+4.9796e18j 2.7357e172.4740e01j] [2.7357e172.4740e01j 9.6891e01+4.9796e18j]]

static
compute_sparse_matrix
(*params, **hyperparams)¶ Representation of the operator as a sparse matrix in the computational basis (static method).
The canonical matrix is the textbook matrix representation that does not consider wires. Implicitly, this assumes that the wires of the operator correspond to the global wire order.
See also
 Parameters
params (list) – trainable parameters of the operator, as stored in the
parameters
attributehyperparams (dict) – nontrainable hyperparameters of the operator, as stored in the
hyperparameters
attribute
 Returns
matrix representation
 Return type
scipy.sparse.coo.coo_matrix

static
compute_terms
(*params, **hyperparams)¶ Representation of the operator as a linear combination of other operators (static method).
\[O = \sum_i c_i O_i\]See also
 Parameters
params (list) – trainable parameters of the operator, as stored in the
parameters
attributehyperparams (dict) – nontrainable hyperparameters of the operator, as stored in the
hyperparameters
attribute
 Returns
list of coefficients and list of operations
 Return type
tuple[list[tensor_like or float], list[Operation]]

decomposition
()¶ Representation of the operator as a product of other operators.
\[O = O_1 O_2 \dots O_n\]A
DecompositionUndefinedError
is raised if no representation by decomposition is defined.See also
 Returns
decomposition of the operator
 Return type
list[Operator]

diagonalizing_gates
()¶ Sequence of gates that diagonalize the operator in the computational basis.
Given the eigendecomposition \(O = U \Sigma U^{\dagger}\) where \(\Sigma\) is a diagonal matrix containing the eigenvalues, the sequence of diagonalizing gates implements the unitary \(U\).
The diagonalizing gates rotate the state into the eigenbasis of the operator.
A
DiagGatesUndefinedError
is raised if no representation by decomposition is defined.See also
 Returns
a list of operators
 Return type
list[Operator] or None

expand
()¶ Returns a tape that has recorded the decomposition of the operator.
 Returns
quantum tape
 Return type

generator
()[source]¶ Generator of an operator that is in singleparameterform.
For example, for operator
\[U(\phi) = e^{i\phi (0.5 Y + Z\otimes X)}\]we get the generator
>>> U.generator() (0.5) [Y0] + (1.0) [Z0 X1]
The generator may also be provided in the form of a dense or sparse Hamiltonian (using
Hermitian
andSparseHamiltonian
respectively).The default value to return is
None
, indicating that the operation has no defined generator.

get_eigvals
()¶ Eigenvalues of the operator in the computational basis (static method).
If
diagonalizing_gates
are specified and implement a unitary \(U\), the operator can be reconstructed as\[O = U \Sigma U^{\dagger},\]where \(\Sigma\) is the diagonal matrix containing the eigenvalues.
Otherwise, no particular order for the eigenvalues is guaranteed.
Note
When eigenvalues are not explicitly defined, they are computed automatically from the matrix representation. Currently, this computation is not differentiable.
A
EigvalsUndefinedError
is raised if the eigenvalues have not been defined and cannot be inferred from the matrix representation.See also
 Returns
eigenvalues
 Return type
tensor_like

get_matrix
(wire_order=None)¶ Representation of the operator as a matrix in the computational basis.
If
wire_order
is provided, the numerical representation considers the position of the operator’s wires in the global wire order. Otherwise, the wire order defaults to the operator’s wires.If the matrix depends on trainable parameters, the result will be cast in the same autodifferentiation framework as the parameters.
A
MatrixUndefinedError
is raised if the matrix representation has not been defined.See also
 Parameters
wire_order (Iterable) – global wire order, must contain all wire labels from the operator’s wires
 Returns
matrix representation
 Return type
tensor_like

get_parameter_shift
(idx)¶ Multiplier and shift for the given parameter, based on its gradient recipe.
 Parameters
idx (int) – parameter index within the operation
 Returns
list of multiplier, coefficient, shift for each term in the gradient recipe
 Return type
list[[float, float, float]]
Note that the default value for
shift
is None, which is replaced by the default shift \(\pi/2\).

inv
()¶ Inverts the operator.
This method concatenates a string to the name of the operation, to indicate that the inverse will be used for computations.
Any subsequent call of this method will toggle between the original operation and the inverse of the operation.
 Returns
operation to be inverted
 Return type
Operator

label
(decimals=None, base_label=None, cache=None)[source]¶ A customizable string representation of the operator.
 Parameters
decimals=None (int) – If
None
, no parameters are included. Else, specifies how to round the parameters.base_label=None (str) – overwrite the nonparameter component of the label
cache=None (dict) – dictionary that caries information between label calls in the same drawing
 Returns
label to use in drawings
 Return type
str
Example:
>>> op = qml.PauliRot(0.1, "XYY", wires=(0,1,2)) >>> op.label() 'RXYY' >>> op.label(decimals=2) 'RXYY\n(0.10)' >>> op.label(base_label="PauliRot") 'PauliRot\n(0.10)'

queue
(context=<class 'pennylane.queuing.QueuingContext'>)¶ Append the operator to the Operator queue.

sparse_matrix
(wire_order=None)¶ Representation of the operator as a sparse matrix in the computational basis.
If
wire_order
is provided, the numerical representation considers the position of the operator’s wires in the global wire order. Otherwise, the wire order defaults to the operator’s wires.Note
The wire_order argument is currently not implemented, and using it will raise an error.
A
SparseMatrixUndefinedError
is raised if the sparse matrix representation has not been defined.See also
 Parameters
wire_order (Iterable) – global wire order, must contain all wire labels from the operator’s wires
 Returns
matrix representation
 Return type
scipy.sparse.coo.coo_matrix

terms
()¶ Representation of the operator as a linear combination of other operators.
\[O = \sum_i c_i O_i\]A
TermsUndefinedError
is raised if no representation by terms is defined.See also
 Returns
list of coefficients \(c_i\) and list of operations \(O_i\)
 Return type
tuple[list[tensor_like or float], list[Operation]]
Contents
Using PennyLane
Development
API
Downloads