| page_type | sample | ||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| languages |
|
||||||||||||||||||||||
| products |
|
||||||||||||||||||||||
| description | This sample shows how to use Q# to decompose reversible logic into quantum operations. | ||||||||||||||||||||||
| jupyter |
|
This sample demonstrates:
- How to use Q# to decompose permutations into quantum operations.
- How to apply decomposed permutations in algorithms such as hidden shift.
- The Microsoft Quantum Development Kit.
This sample can be run in a number of different ways, depending on your preferred environment.
At a terminal, run the following command:
python host.pyAt a terminal, run the following command:
dotnet runOpen the folder containing this sample in Visual Studio ("Open a local folder"
from the Getting Started screen or "File → Open → Folder..." from the menu bar)
and set ReversibleLogicSynthesis.csproj as the startup project.
Press Start in Visual Studio to run the sample.
- ReversibleLogicSynthesis.qs: Main Q# code for this sample.
- host.py: Python host program to call into the Q# sample.
- ReversibleLogicSynthesis.csproj: Main Q# project for the sample.