Titlebook: Reversible Computation; 5th International Co Gerhard W. Dueck,D. Michael Miller Conference proceedings 2013 Springer-Verlag Berlin Heidelbe

agenda

figment

我沒有強迫

osteoclasts

Time-Symmetric Machinese transition function. The direction in time is adjusted by a weak transformation of the phase-space, that is, an involution. So, these machines themselves cannot distinguish whether they run forward or backward in time. From this viewpoint, finite state machines and pushdown machines are studied in

中國紀(jì)念碑

Forsake

maroon

起來了

Reducing the Depth of Quantum Circuits Using Additional Circuit Linesn terms of a reversible circuit followed by a mapping into a corresponding quantum realization. During this process, the number of lines and the quantum costs of the resulting circuits have mainly been considered as optimization objectives thus far. However, beyond that also the depth of a quantum c

coalition

步履蹣跚

Time-Symmetric Machines detail. In essence, it turns out that there are reversible machines which are not time-symmetric, but equivalent time-symmetric machines can effectively be constructed. The notion of time-symmetry is discussed, several examples are given, and further results concerning unary inputs and descriptional complexity issues are shown.