Skip to main contentIBM Quantum Documentation
You are viewing the API reference for an old version of Qiskit SDK. Switch to latest version

IterativeAmplitudeEstimation

IterativeAmplitudeEstimation(epsilon_target, alpha, confint_method='beta', min_ratio=2, quantum_instance=None, sampler=None)

GitHub(opens in a new tab)

Bases: qiskit.algorithms.amplitude_estimators.amplitude_estimator.AmplitudeEstimator

The Iterative Amplitude Estimation algorithm.

This class implements the Iterative Quantum Amplitude Estimation (IQAE) algorithm, proposed in [1]. The output of the algorithm is an estimate that, with at least probability 1α1 - \alpha, differs by epsilon to the target value, where both alpha and epsilon can be specified.

It differs from the original QAE algorithm proposed by Brassard [2] in that it does not rely on Quantum Phase Estimation, but is only based on Grover’s algorithm. IQAE iteratively applies carefully selected Grover iterations to find an estimate for the target amplitude.

References

[1]: Grinko, D., Gacon, J., Zoufal, C., & Woerner, S. (2019).

Iterative Quantum Amplitude Estimation. arXiv:1912.05559(opens in a new tab).

[2]: Brassard, G., Hoyer, P., Mosca, M., & Tapp, A. (2000).

Quantum Amplitude Amplification and Estimation. arXiv:quant-ph/0005055(opens in a new tab).

The output of the algorithm is an estimate for the amplitude a, that with at least probability 1 - alpha has an error of epsilon. The number of A operator calls scales linearly in 1/epsilon (up to a logarithmic factor).

Parameters

  • epsilon_target (float) – Target precision for estimation target a, has values between 0 and 0.5
  • alpha (float) – Confidence level, the target probability is 1 - alpha, has values between 0 and 1
  • confint_method (str) – Statistical method used to estimate the confidence intervals in each iteration, can be ‘chernoff’ for the Chernoff intervals or ‘beta’ for the Clopper-Pearson intervals (default)
  • min_ratio (float) – Minimal q-ratio (Ki+1/KiK_{i+1} / K_i) for FindNextK
  • quantum_instance (QuantumInstance |Backend | None) – Pending deprecation: Quantum Instance or Backend
  • sampler (BaseSampler | None) – A sampler primitive to evaluate the circuits.

Raises

  • AlgorithmError – if the method to compute the confidence intervals is not supported
  • ValueError – If the target epsilon is not in (0, 0.5]
  • ValueError – If alpha is not in (0, 1)
  • ValueError – If confint_method is not supported

Methods

construct_circuit

IterativeAmplitudeEstimation.construct_circuit(estimation_problem, k=0, measurement=False)

Construct the circuit QkA0\mathcal{Q}^k \mathcal{A} |0\rangle.

The A operator is the unitary specifying the QAE problem and Q the associated Grover operator.

Parameters

  • estimation_problem (EstimationProblem) – The estimation problem for which to construct the QAE circuit.
  • k (int) – The power of the Q operator.
  • measurement (bool) – Boolean flag to indicate if measurements should be included in the circuits.

Return type

QuantumCircuit

Returns

The circuit implementing QkA0\mathcal{Q}^k \mathcal{A} |0\rangle.

estimate

IterativeAmplitudeEstimation.estimate(estimation_problem)

Run the amplitude estimation algorithm on provided estimation problem.

Parameters

estimation_problem (EstimationProblem) – The estimation problem.

Return type

IterativeAmplitudeEstimationResult

Returns

An amplitude estimation results object.

Raises

  • ValueError – A quantum instance or Sampler must be provided.
  • AlgorithmError – Sampler job run error.

Attributes

epsilon_target

Returns the target precision epsilon_target of the algorithm.

Return type

float

Returns

The target precision (which is half the width of the confidence interval).

quantum_instance

Pending deprecation; Get the quantum instance.

Return type

QuantumInstance | None

Returns

The quantum instance used to run this algorithm.

sampler

Get the sampler primitive.

Return type

BaseSampler | None

Returns

The sampler primitive to evaluate the circuits.

Was this page helpful?
Report a bug or request content on GitHub.