Reversible Computation by Unknown

Author:Unknown
Language: eng
Format: epub
ISBN: 9783030524821
Publisher: Springer International Publishing

is the computation of applied to with the value of the registers’ intermediate contents made explicitly.

We conclude with simple examples of SRL programs that use ancillary registers. Specifically, a register is said to be a “zero-ancilla” whenever we assume that its initial value is 0; when its initial value is different, we are just not interested in the behaviour of the program.

Lemma 1 (Integer-Negation)

If is used as a zero-ancilla then:

(2)

inverts the sign of the value in .

Proof

Let . It is easy to see that:

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.