Skip to content
This repository has been archived by the owner on Aug 21, 2024. It is now read-only.

Latest commit

 

History

History

RippleCarryAdder

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.
  • Part IV covers building an in-place quantum subtractor.
  • Part V covers addition and subtraction modulo 2ᴺ.

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 Q# iterations and Q# conditional branching documentation.