Q#: Simple Quantum Algorithms

This sample describes three simple quantum algorithms: the Bernstein–Vazirani quantum algorithm to learn a parity function, the Deutsch–Jozsa quantum algorithm to distinguish constant Boolean functions from balanced ones, and the hidden shift quantum algorithm that identifies a shift pattern between so-called bent functions.

These programs have been slightly modified from the source to be run in Python Notebooks on the Strangeworks platform. Notably, declaring namespaces is not required in Notebooks.