qml.estimator.templates.TrotterVibronic

class TrotterVibronic(vibronic_ham, num_steps, order, phase_grad_precision=None, coeff_precision=None, wires=None)[source]

Bases: ResourceOperator

An operation representing the Suzuki-Trotter product approximation for the complex matrix exponential of a real-space vibronic Hamiltonian.

The Suzuki-Trotter product formula provides a method to approximate the matrix exponential of Hamiltonian expressed as a linear combination of terms which in general do not commute. Consider the Hamiltonian \(H = \Sigma^{N}_{j=0} O_{j}\): the product formula is constructed using symmetrized products of the terms in the Hamiltonian. The symmetrized products of order \(m \in [1, 2, 4, ..., 2k]\) with \(k \in \mathbb{N}\) are given by:

\[\begin{split}\begin{align} S_{1}(t) &= \Pi_{j=0}^{N} \ e^{i t O_{j}} \\ S_{2}(t) &= \Pi_{j=0}^{N} \ e^{i \frac{t}{2} O_{j}} \cdot \Pi_{j=N}^{0} \ e^{i \frac{t}{2} O_{j}} \\ &\vdots \\ S_{m}(t) &= S_{m-2}(p_{m}t)^{2} \cdot S_{m-2}((1-4p_{m})t) \cdot S_{m-2}(p_{m}t)^{2}, \end{align}\end{split}\]

where the coefficient is \(p_{m} = 1 / (4 - \sqrt[m - 1]{4})\). The \(m^{\text{th}}\) order, \(n\)-step Suzuki-Trotter approximation is then defined as:

\[e^{iHt} \approx \left [S_{m}(t / n) \right ]^{n}.\]

For more details see J. Math. Phys. 32, 400 (1991).

Parameters:
  • vibronic_ham (VibronicHamiltonian) – a real-space vibronic Hamiltonian to be approximately exponentiated

  • num_steps (int) – number of Trotter steps to perform

  • order (int) – order of the approximation, must be 1 or an even number

  • phase_grad_precision (float | None) – precision for the phase gradient calculation

  • coeff_precision (float | None) – precision for the loading of coefficients

  • wires (list[int] | None) – the wires on which the operator acts.

Resources:

The resources are defined according to the recursive formula presented above. The number of times an operator \(e^{itO_{j}}\) is applied depends on the number of Trotter steps (n) and the order of the approximation (m) and is given by:

\[C_{O_j} = 2 * n \cdot 5^{\frac{m}{2} - 1}.\]

Furthermore, because of the symmetric form of the recursive formula, the first and last terms get grouped. This reduces the counts for those terms to:

\[\begin{split}\begin{align} C_{O_{0}} &= n \cdot 5^{\frac{m}{2} - 1} + 1, \\ C_{O_{N}} &= n \cdot 5^{\frac{m}{2} - 1}. \end{align}\end{split}\]

The resources for a single step expansion of real-space vibronic Hamiltonian are calculated based on arXiv:2411.13669.

See also

TrotterProduct

Example

The resources for this operation are computed using:

>>> import pennylane.estimator as qre
>>> num_steps, order = (10, 2)
>>> vibronic_ham = qre.VibronicHamiltonian(num_modes=2, num_states=4, grid_size=4, taylor_degree=2)
>>> res = qre.estimate(qre.TrotterVibronic(vibronic_ham, num_steps, order))
>>> print(res)
--- Resources: ---
 Total wires: 85
    algorithmic wires: 10
    allocated wires: 75
         zero state: 75
         any state: 0
 Total gates : 1.332E+5
  'Toffoli': 2.320E+4,
  'T': 749,
  'CNOT': 4.144E+4,
  'X': 1.456E+3,
  'Z': 1,
  'S': 1,
  'Hadamard': 6.638E+4

resource_keys

resource_params

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

resource_keys = {'coeff_precision', 'num_steps', 'order', 'phase_grad_precision', 'vibronic_ham'}
resource_params

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

Returns:

A dictionary containing the resource parameters:
  • vibronic_ham (VibronicHamiltonian): a real-space vibronic Hamiltonian to be approximately exponentiated

  • num_steps (int): number of Trotter steps to perform

  • order (int): order of the approximation, must be 1 or even

  • phase_grad_precision (float): precision for the phase gradient calculation

  • coeff_precision (float): precision for the loading of coefficients

Return type:

dict

resource_decomp(vibronic_ham, num_steps, ...)

Returns a list representing the resources of the operator.

resource_rep(vibronic_ham, num_steps, order)

Returns a compressed representation containing only the parameters of the Operator that are needed to compute a resource estimation.

classmethod resource_decomp(vibronic_ham, num_steps, order, phase_grad_precision, coeff_precision)[source]

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.

Parameters:
  • vibronic_ham (VibronicHamiltonian) – a real space vibronic Hamiltonian to be approximately exponentiated

  • num_steps (int) – number of Trotter steps to perform

  • order (int) – order of the approximation, must be 1 or even

  • phase_grad_precision (float | None) – precision for the phase gradient calculation

  • coeff_precision (float | None) – precision for the loading of coefficients

Resources:

The resources are defined according to the recursive formula presented above. The number of times an operator, \(e^{itO_{j}}\), is applied depends on the number of Trotter steps (n) and the order of the approximation (m) and is given by:

\[C_{O_j} = 2 * n \cdot 5^{\frac{m}{2} - 1}.\]

Furthermore, because of the symmetric form of the recursive formula, the first and last terms get grouped. This reduces the counts for those terms to:

\[\begin{split}\begin{align} C_{O_{0}} &= n \cdot 5^{\frac{m}{2} - 1} + 1, \\ C_{O_{N}} &= n \cdot 5^{\frac{m}{2} - 1}. \end{align}\end{split}\]

The resources for a single step expansion of real-space vibronic Hamiltonian are calculated based on arXiv:2411.13669.

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(vibronic_ham, num_steps, order, phase_grad_precision=None, coeff_precision=None)[source]

Returns a compressed representation containing only the parameters of the Operator that are needed to compute a resource estimation.

Parameters:
  • vibronic_ham (VibronicHamiltonian) – a real space vibronic Hamiltonian to be approximately exponentiated

  • num_steps (int) – number of Trotter steps to perform

  • order (int) – order of the approximation, must be 1 or even

  • phase_grad_precision (float | None) – precision for the phase gradient calculation

  • coeff_precision (float | None) – precision for the loading of coefficients

Returns:

the operator in a compressed representation

Return type:

CompressedResourceOp

Contents

Using PennyLane

Release news

Development

API

Internals