| page_type | languages | products | description | urlFragment | ||
|---|---|---|---|---|---|---|
sample |
|
|
This sample describes three simple quantum algorithms. |
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.
- The Microsoft Quantum Development Kit.
To run the sample, use the dotnet run command from your terminal. Example: dotnet run --n-qubits 4
- BernsteinVazirani.qs: Q# code implementing the Bernstein-Vazirani algorithm for this sample.
- DeutschJozsa.qs: Q# code implementing Deutsch-Jozsa algorithm for this sample.
- HiddenShift.qs: Q# code implementing hidden shift algorithm for this sample.
- Program.qs: Q# entry point to interact with and print out results of the test cases for this sample.
- SimpleAlgorithms.csproj: Main Q# project for the sample.