Note

This page was generated from tutorials/algorithms/01_algorithms_introduction.ipynb.

# An Introduction to Algorithms in Qiskit¶

This is an introduction to algorithms in Qiskit and provides a high-level overview to help understand the various aspects of the functionality to get started. Other tutorials will provide more in-depth material, on given algorithms, and ways to use them etc.

## How is the algorithm library structured?¶

Qiskit provides a number of Algorithms and they are grouped by category according to the task they can perform. For instance `Minimum Eigensolvers`

to find the smallest eigen value of an operator, for example ground state energy of a chemistry Hamiltonian or a solution to an optimization problem when expressed as an Ising Hamiltonian. There are `Time Evolvers`

for the time evolution of quantum systems and `Amplitude Estimators`

for value estimation that can be used say in financial applications. The full set of categories can be seen in the Algorithms documentation link above.

Algorithms are configurable and often part of the configuration will be in the form of smaller building blocks, of which different instances of the building block type can be given. For instance with `VQE`

, the Variational Quantum Eigensolver, it takes a trial wavefunction, in the form of a `QuantumCircuit`

and a classical optimizer among other things.

Let’s take a look at an example to construct a VQE instance. Here `TwoLocal`

is the variational form (trial wavefunction), a parameterized circuit which can be varied, and `SLSQP`

a classical optimizer. These are created as separate instances and passed to VQE when it is constructed. Trying, for example, a different classical optimizer, or variational form is simply a case of creating an instance of the one you want and passing it into VQE.

```
[1]:
```

```
from qiskit.algorithms.optimizers import SLSQP
from qiskit.circuit.library import TwoLocal
num_qubits = 2
ansatz = TwoLocal(num_qubits, "ry", "cz")
optimizer = SLSQP(maxiter=1000)
```

Let’s draw the ansatz so we can see it’s a `QuantumCircuit`

where θ[0] through θ[7] will be the parameters that are varied as VQE optimizer finds the minimum eigenvalue. We’ll come back to the parameters later in a working example below.

```
[2]:
```

```
ansatz.decompose().draw("mpl", style="iqx")
```

```
[2]:
```

But more is needed before we can run the algorithm so let’s get to that next.

## How to run an algorithm?¶

Algorithms rely on the primitives to evaluate expectation values or sample circuits. The primitives can be based on a simulator or real device and can be used interchangeably in the algorithms, as they all implement the same interface.

In the VQE, we have to evaluate expectation values, so for example we can use the `qiskit.primitives.Estimator`

which is shipped with the default Qiskit Terra installation.

```
[3]:
```

```
from qiskit.primitives import Estimator
estimator = Estimator()
```

This estimator uses an exact, statevector simulation to evaluate the expectation values. We can also use a shot-based and noisy simulators or real backends instead. For more information of the simulators you can check out Qiskit Aer and for the actual hardware Qiskit IBM Runtime.

With all the ingredients ready, we can now instantiate the VQE:

```
[4]:
```

```
from qiskit.algorithms.minimum_eigensolvers import VQE
vqe = VQE(estimator, ansatz, optimizer)
```

Now we can call the compute_mininum_eigenvalue() method. The latter is the interface of choice for the application modules, such as Nature and Optimization, in order that they can work interchangeably with any algorithm within the specific category.

## A complete working example¶

Let’s put what we have learned from above together and create a complete working example. VQE will find the minimum eigenvalue, i.e. minimum energy value of a Hamiltonian operator and hence we need such an operator for VQE to work with. Such an operator is given below. This was originally created by the Nature application module as the Hamiltonian for an H2 molecule at 0.735A interatomic distance. It’s a sum of Pauli terms as below, but for now I am not going to say anything further about it since the goal is to run the algorithm, but further information on operators can be found in other tutorials.

```
[5]:
```

```
from qiskit.quantum_info import SparsePauliOp
H2_op = SparsePauliOp.from_list([
("II", -1.052373245772859),
("IZ", 0.39793742484318045),
("ZI", -0.39793742484318045),
("ZZ", -0.01128010425623538),
("XX", 0.18093119978423156)
])
```

So let’s run VQE and print the result object it returns.

```
[6]:
```

```
result = vqe.compute_minimum_eigenvalue(H2_op)
print(result)
```

```
{ 'aux_operators_evaluated': None,
'cost_function_evals': 73,
'eigenvalue': -1.8572748864606905,
'optimal_circuit': <qiskit.circuit.library.n_local.two_local.TwoLocal object at 0x7ff0d0997d60>,
'optimal_parameters': { ParameterVectorElement(θ[0]): 1.3227517246773428,
ParameterVectorElement(θ[1]): -2.5516110821360956,
ParameterVectorElement(θ[2]): -3.4218022613955656,
ParameterVectorElement(θ[7]): -2.021146970187607,
ParameterVectorElement(θ[4]): 0.17285789596991147,
ParameterVectorElement(θ[5]): 4.090230523635553,
ParameterVectorElement(θ[6]): -1.4761539918378213,
ParameterVectorElement(θ[3]): 1.895659776300137},
'optimal_point': array([ 1.32275172, -2.55161108, -3.42180226, 1.89565978, 0.1728579 ,
4.09023052, -1.47615399, -2.02114697]),
'optimal_value': -1.8572748864606905,
'optimizer_evals': None,
'optimizer_result': <qiskit.algorithms.optimizers.optimizer.OptimizerResult object at 0x7ff0d0a27190>,
'optimizer_time': 0.7744030952453613}
```

From the above result we can see the number of cost function (=energy) evaluations the optimizer took until it found the minimum eigenvalue of \(\approx -1.85727\) which is the electronic ground state energy of the given H2 molecule. The optimal parameters of the ansatz can also be seen which are the values that were in the ansatz at the minimum value.

## Updating the primitive inside VQE¶

To close off let’s also change the estimator primitive inside the a VQE. Maybe you’re satisfied with the simulation results and now want to use a shot-based simulator, or run on hardware!

In this example we’re changing to a shot-based estimator, still using Qiskit Terra’s reference primitive. However you could replace the primitive by e.g. Qiskit Aer’s estimator (`qiskit_aer.primitives.Estimator`

) or even a real backend (`qiskit_ibm_runtime.Estimator`

).

For noisy loss functions, the SPSA optimizer typically performs well, so we also update the optimizer. See also the noisy VQE tutorial for more details on shot-based and noisy simulations.

```
[7]:
```

```
from qiskit.algorithms.optimizers import SPSA
estimator = Estimator(options={"shots": 1000})
vqe.estimator = estimator
vqe.optimizer = SPSA(maxiter=100)
result = vqe.compute_minimum_eigenvalue(operator=H2_op)
print(result)
```

```
{ 'aux_operators_evaluated': None,
'cost_function_evals': 200,
'eigenvalue': -1.8570929321040268,
'optimal_circuit': <qiskit.circuit.library.n_local.two_local.TwoLocal object at 0x7ff0ce934b50>,
'optimal_parameters': { ParameterVectorElement(θ[0]): -1.0343177174268234,
ParameterVectorElement(θ[1]): 6.510954481235911,
ParameterVectorElement(θ[2]): 2.3878078221748846,
ParameterVectorElement(θ[7]): 4.1832411771345575,
ParameterVectorElement(θ[4]): -3.281286805820526,
ParameterVectorElement(θ[5]): 3.2585867308970164,
ParameterVectorElement(θ[6]): 1.3200470361884045,
ParameterVectorElement(θ[3]): 0.9039313924493656},
'optimal_point': array([-1.03431772, 6.51095448, 2.38780782, 0.90393139, -3.28128681,
3.25858673, 1.32004704, 4.18324118]),
'optimal_value': -1.8570929321040268,
'optimizer_evals': None,
'optimizer_result': <qiskit.algorithms.optimizers.optimizer.OptimizerResult object at 0x7ff0ce953e80>,
'optimizer_time': 1.0229580402374268}
```

Note: We do not fix the random seed in the simulators here, so re-running gives slightly varying results.

This concludes this introduction to algorithms in Qiskit. Please check out the other algorithm tutorials in this series for both broader as well as more in depth coverage of the algorithms.

```
[8]:
```

```
import qiskit.tools.jupyter
%qiskit_version_table
%qiskit_copyright
```

### Version Information

Qiskit Software | Version |
---|---|

`qiskit-terra` | 0.24.1 |

`qiskit-aer` | 0.12.0 |

`qiskit-ibmq-provider` | 0.20.2 |

`qiskit` | 0.43.1 |

`qiskit-nature` | 0.6.2 |

`qiskit-finance` | 0.3.4 |

`qiskit-optimization` | 0.5.0 |

`qiskit-machine-learning` | 0.6.1 |

System information | |

Python version | 3.8.16 |

Python compiler | GCC 11.3.0 |

Python build | default, Jan 11 2023 00:28:51 |

OS | Linux |

CPUs | 2 |

Memory (Gb) | 6.7812042236328125 |

Fri Jun 09 12:46:28 2023 UTC |

### This code is a part of Qiskit

© Copyright IBM 2017, 2023.

This code is licensed under the Apache License, Version 2.0. You may

obtain a copy of this license in the LICENSE.txt file in the root directory

of this source tree or at http://www.apache.org/licenses/LICENSE-2.0.

Any modifications or derivative works of this code must retain this

copyright notice, and modified files need to carry a notice indicating

that they have been altered from the originals.

```
[ ]:
```

```
```