Code examples: Overview

The Deutsch-Josza algorithm is a simple example of a quantum algorithm that can be used to speed up a search

 In this example we show how a quantum full adder is created and how this adder acts on superposition states.

Grover's algorithm  solves the problem of an unstructured search. It is a quantum algorithm for finding the input value of an oracle function.

In this example we will give a simple example of quantum error correction, where we encode one logical qubit using three physical qubits. Note that the proposed encoding is not sufficient to correct all single qubit errors: this specific example only allows for correction of so-called single bit-flip errors.

Classification is a form of machine learning in which labels are assigned to data, often with respect to other data. Here we show a basic example of classification based on quantum algorithms.

This notebook is part 1 in a series of 3 notebooks on classification of data using quantum algorithms.

This notebook is part 2 in a series of 3 notebooks on classification of data using quantum algorithms.

This notebook is part 3 in a series of 3 notebooks on classification of data using quantum algorithms.

Step by step explanation how to use the API and SDK.

For quantum devices the measurement error is significant with respect to other sources of errors. We can reduce the effect of measurement errors using measurement error mitigation.

This notebook explains how to perform the Grover Search algorithm on a quantum computer.

In this notebook, we showcase different tools to improve the qubits' readout fidelity, using mid-circuit measurement tools (MCMs).

In this notebook, we use the Starmon-5 backend in Quantum Inspire to implement the superdense coding algorithm.