Deutsch Algorithm

The Deutsch algorithm is one of the earliest and simplest examples showing that quantum computation can outperform classical computation. Historically, it provides the first clear instance of a quantum query advantage: a quantum computer can determine a global property of a function with fewer queries than any classical approach.

Prerequisites

  • Knowledge of linear algebra

  • Knowledge of complex numbers

Teaching Episodes

Learning outcomes

By the end of this module, learners should know:

  • Describe the problem solved by Deutsch algorithm and its classical query complexity.

  • Explain how superposition, interference and phase kickback enable the classification of the oracle.

  • Execute Deutsch algorithm step by step for a given oracle.

  • Calculate and interpret the measurement outcome to determine whether the function is constant or balanced.

See also

Credit

FIXME

Don’t forget to check out additional course materials from here

License

Note

To module authors: For code you may use any OSI-approved license as mentioned in https://spdx.org/licenses/, such as Apache License 2.0, GNU GPLv3, MIT. Please make sure to update the deed above and LICENSE.code file accordingly.