qml.estimator.ops.RZ

class RZ(precision=None, wires=None)

Bases: ResourceOperator

Resource class for the RZ gate.

Parameters:

• precision (float | None) – The error threshold for the Clifford + T decomposition of this operation. The default value is None which corresponds to using the precision stated in the ResourceConfig.

• wires (Any or Wires | None) – The wires the operation acts on.

Resources:

A single qubit rotation gate can be approximately synthesised from Clifford and T gates. The resources are approximating the gate with a series of T gates. The expected T-count is taken from the “Simulation Results” section of Efficient Synthesis of Universal Repeat-Until-Success Circuits. The cost is given as:

\[T_{count} \approx 1.149 \times log_{2}(\frac{1}{\epsilon}) + 9.2\]

See also

The corresponding PennyLane operation RZ.

Example

The resources for this operation are computed using:

>>> qml.estimator.RZ.resource_decomp(precision=1e-4)
[(24 x T)]

Attributes

num_wires
resource_keys
resource_params	Returns a dictionary containing the minimal information needed to compute the resources.

num_wires = 1

resource_keys = {'precision'}

resource_params

Returns a dictionary containing the minimal information needed to compute the resources.

Returns:

A dictionary containing the resource parameters:

• precision (float | None): the number of qubits the operation is controlled on

Return type:

dict

Methods

adjoint_resource_decomp(target_resource_params)	Returns a list representing the resources for the adjoint of the operator.
controlled_resource_decomp(num_ctrl_wires, ...)	Returns a list representing the resources for a controlled version of the operator.
pow_resource_decomp(pow_z, ...)	Returns a list representing the resources for an operator raised to a power.
resource_decomp([precision])	Returns a list representing the resources of the operator.
resource_rep([precision])	Returns a compressed representation containing only the parameters of the operator that are needed to compute the resources.

classmethod adjoint_resource_decomp(target_resource_params)

Returns a list representing the resources for the adjoint of the operator.

Parameters:

target_resource_params (dict) – A dictionary containing the resource parameters of the target operator.

Resources:

The adjoint of a single qubit rotation changes the sign of the rotation angle, thus the resources of the adjoint operation result in the original operation.

Returns:

A list of GateCount objects, where each object represents a specific quantum gate and the number of times it appears in the decomposition.

Return type:

list[GateCount]

classmethod controlled_resource_decomp(num_ctrl_wires, num_zero_ctrl, target_resource_params)

Returns a list representing the resources for a controlled version of the operator.

Parameters:

• num_ctrl_wires (int) – the number of qubits the operation is controlled on

• num_zero_ctrl (int) – the number of control qubits, that are controlled when in the \(|0\rangle\) state

• target_resource_params (dict) – A dictionary containing the resource parameters of the target operator.

classmethod pow_resource_decomp(pow_z, target_resource_params)

Returns a list representing the resources for an operator raised to a power.

Parameters:

• pow_z (int) – the power that the operator is being raised to

• target_resource_params (dict) – A dictionary containing the resource parameters of the target operator.

Resources:

Taking arbitrary powers of a single qubit rotation produces a sum of rotations. The resources simplify to just one total single qubit rotation.

Returns:

A list of GateCount objects, where each object represents a specific quantum gate and the number of times it appears in the decomposition.

Return type:

list[GateCount]

classmethod resource_decomp(precision=None)

Returns a list representing the resources of the operator. Each object represents a quantum gate and the number of times it occurs in the decomposition.

Resources:

A single qubit rotation gate can be approximately synthesised from Clifford and T gates. The resources are approximating the gate with a series of T gates. The expected T-count is taken from the “Simulation Results” section of Efficient Synthesis of Universal Repeat-Until-Success Circuits. The cost is given as:

\[T_{count} \approx 1.149 \times log_{2}(\frac{1}{\epsilon}) + 9.2\]

Parameters:

precision (float) – error threshold for the Clifford + T decomposition of this operation

Returns:

A list of GateCount objects, where each object represents a specific quantum gate and the number of times it appears in the decomposition.

Return type:

list[GateCount]

classmethod resource_rep(precision=None)

Returns a compressed representation containing only the parameters of the operator that are needed to compute the resources.

Parameters:

precision (float | None) – The error threshold for the Clifford + T decomposition of this operation.

Returns:

A compressed representation of the operator.

Return type:

CompressedResourceOp

code/api/pennylane.estimator.ops.RZ

 

Download Python script

 

Download Notebook

 

View on GitHub