Approximate encoded permutations and piecewise quantum adders — mentioned by Strilanc

Fri, 29 May 2020 19:51:03 GMT

In hardware this would be called a carry save adder [1]. One interesting fact about carry save adders is that the carry part of the register can be extended in order to avoid any carrying between words for very long periods of time. Instead of using 53 bits to represent 52 bits, use 60 bits, and now you can perform 256 sequential additions with no carrying between words before the carry part saturates and needs to be handled. Somewhat surprisingly, it's even possible to use this construction in the context of a quantum computation [2][3]. The reason it's surprising is because tacking on…

Paper and discussion history. A mention is not an endorsement.

Approximate encoded permutations and piecewise quantum adders · HackerPapers discussions

Approximate encoded permutations and piecewise quantum adders — mentioned by Strilanc