Skip to content
Branch: master
Find file History
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
..
Failed to load latest commit information.
README.md
ReferenceImplementation.qs
RippleCarryAdder.csproj
RippleCarryAdder.ipynb
RippleCarryAdder.sln
Tasks.qs
TestSuiteRunner.cs
Tests.qs

README.md

Welcome!

This kata explores ripple-carry addition on a quantum computer.

  • The simplest quantum adder, covered in part I, closely mirrors its classical counterpart, using the same basic components and the same algorithm.
  • Part II explores building an in-place adder.
  • A more complex version of an in-place adder covered in part III of the kata uses a different algorithm to reduce the number of ancillary qubits needed.
  • Finally, part IV covers building an in-place quantum subtractor.

You can run the RippleCarryAdder kata as a Jupyter Notebook!

Theory

Q#

It is recommended to complete the BasicGates kata before this one to get familiar with the basic gates used in quantum computing. The list of basic gates available in Q# can be found at Microsoft.Quantum.Intrinsic.

For the syntax of flow control statements in Q#, see the Q# documentation.

You can’t perform that action at this time.