Content deleted Content added
No edit summary |
|||
Line 1:
{{short description|Model of computation in which all processes are time-reversible}}
'''Reversible computing''' is any [[model of computation]] where the [[computational process]], to some extent, is [[time-reversible]]. In a model of computation that uses [[deterministic]] [[State transition system|transitions]] from one state of the abstract machine to another, a necessary condition for reversibility is that the [[Binary relation|relation]] of the [[Map (mathematics)|mapping]] from states to their successors must be [[injective function|one-to-one]]. Reversible computing is a form of [[unconventional computing]].
Due to the [[Unitarity (physics)|unitarity]] of [[quantum mechanics]], [[quantum circuit]]s are reversible, as long as they do not "[[Wave function collapse|collapse]]" the [[quantum state]]s they operate on.
| |||