Are all reversible computations tidy?
O. J. E. Maroney

TL;DR
This paper investigates whether all quantum reversible computations can be made resource-efficient by tidying auxiliary qubits, revealing fundamental limitations compared to classical cases.
Contribution
It demonstrates that unlike classical reversible computations, some quantum computations cannot be tidied, highlighting a fundamental energy cost in quantum computing.
Findings
Some quantum computations cannot be tidied using Bennett's method.
Certain quantum computations lack any method for tidying auxiliary qubits.
Not all reversible quantum computations are resource-efficient.
Abstract
It has long been known that to minimise the heat emitted by a deterministic computer during it's operation it is necessary to make the computation act in a logically reversible manner\cite{Lan61}. Such logically reversible operations require a number of auxiliary bits to be stored, maintaining a history of the computation, and which allows the initial state to be reconstructed by running the computation in reverse. These auxiliary bits are wasteful of resources and may require a dissipation of energy for them to be reused. A simple procedure due to Bennett\cite{Ben73} allows these auxiliary bits to be "tidied", without dissipating energy, on a classical computer. All reversible classical computations can be made tidy in this way. However, this procedure depends upon a classical operation ("cloning") that cannot be generalised to quantum computers\cite{WZ82}. Quantum computations must be…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Mechanics and Applications · Quantum Computing Algorithms and Architecture · Quantum Information and Cryptography
