Reversible computing: Difference between revisions

Revision as of 19:03, 24 January 2025

Revision as of 00:49, 25 January 2025

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|righttransitions]] 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 on which they operate.<ref name="Williams">{{cite book |author=Williams |first=Colin P. |title=Explorations in Quantum Computing |publisher=[[Springer Science+Business Media|Springer]] |year=2011 |isbn=978-1-84628-887-6 |pages=25–29}}</ref>