Reversible Quantum Computing: How we can preserve everything in a computation –Beginner Introduction
>> Tuesday, March 01, 2011
(When I was in high school, I was baffled by Arthur C. Clark’s science fictions which led me to read on very basic quantum computing stuff like the contraction of visible length with light-speed. Now, with my auditing of “Reversible Quantum Computing” and thanks to Amr’s excellent explanations I try to understand the beauty of this interesting field. This post and the posts to come in the future are to introduce my thoughts on this area, especially applied to distributed systems, and I hope will also help a non-physicist or non-quantum mechanics person to understand them)
Disclaimer: As I said earlier, I’m an absolute beginner for this area. These posts are to give at least some idea of the beauty of this field to newcomers. If you are an expert you will see these posts boring but you are welcome to comment and fix my errors
Reversibility is an interesting concept even in the
Now what is the benefit of reversibility? As I mentioned earlier, this enables the ability to go back and forth in a program. This is a huge advantage in computing. There are lots of literature already in this subject ( I will discuss some of this in future posts). At any given point of time you have enough information to back-track to previous state. And may be branch from there to a new direction. One of the most important advantages of reversible computing is the ability to conserve power. Since you are not erasing any of the information you will not lose any of the energy in the system and ultimately you end up having a system which doesn’t waste any power (theoretically, at least).
If you want to know more read the original paper from Toffoli on Reversible Computing.