You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on Jan 12, 2024. It is now read-only.
Describe the solution you'd like
A ripple-carry adder using the ApplyAnd or ApplyLowDepthAnd operations as described in Fig. 1 in Halving the cost of quantum addition.
Describe alternatives you've considered
Updating RippleCarryAdderD to use ApplyAnd.
Hey, is this issue about replacing the CCNOT gates with ApplyAnd in RippleCarryAdderD or implementing the circuit given in Fig. 1 which does not compute the Carry out bit?
I suppose that RippleCarryAdderD could be updated. However, it's not just replacing existing CCNOT since the current implementation used two CCNOT for each Carry, where only one is necessary. It also should support a Carry bit, unlike the figure in the paper.
Also one can make use of newer Q# features such as within / apply.
Describe the solution you'd like
A ripple-carry adder using the
ApplyAnd
orApplyLowDepthAnd
operations as described in Fig. 1 in Halving the cost of quantum addition.Describe alternatives you've considered
Updating
RippleCarryAdderD
to useApplyAnd
.Implementation plan
Development in branch
feature/adder
RippleCarryAdderD
RippleCarryAdderD update #358 Refactoring improved adder implementation #359The text was updated successfully, but these errors were encountered: