Are all reversible computations tidy?
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...
| Main Author: | |
|---|---|
| Format: | Journal article |
| Published: |
2004
|
| _version_ | 1826275417967820800 |
|---|---|
| author | Maroney, O |
| author_facet | Maroney, O |
| author_sort | Maroney, O |
| collection | OXFORD |
| description | 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 logically reversible, and therefore produce auxiliary qbits during their operation. We show that there are classes of quantum computation for which Bennett's procedure cannot be implemented. For some of these computations there may exist another method for which the computation may be "tidied". However, we also show there are quantum computations for which there is no possible method for tidying the auxiliary qbits. Not all reversible quantum computations can be made "tidy". This represents a fundamental additional energy burden to quantum computations. This paper extends results in \cite{Mar01}. |
| first_indexed | 2024-03-06T22:58:24Z |
| format | Journal article |
| id | oxford-uuid:6138d606-edb2-4e87-909f-6a67d248ba7b |
| institution | University of Oxford |
| last_indexed | 2024-03-06T22:58:24Z |
| publishDate | 2004 |
| record_format | dspace |
| spelling | oxford-uuid:6138d606-edb2-4e87-909f-6a67d248ba7b2022-03-26T17:58:26ZAre all reversible computations tidy?Journal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:6138d606-edb2-4e87-909f-6a67d248ba7bSymplectic Elements at Oxford2004Maroney, OIt 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 logically reversible, and therefore produce auxiliary qbits during their operation. We show that there are classes of quantum computation for which Bennett's procedure cannot be implemented. For some of these computations there may exist another method for which the computation may be "tidied". However, we also show there are quantum computations for which there is no possible method for tidying the auxiliary qbits. Not all reversible quantum computations can be made "tidy". This represents a fundamental additional energy burden to quantum computations. This paper extends results in \cite{Mar01}. |
| spellingShingle | Maroney, O Are all reversible computations tidy? |
| title | Are all reversible computations tidy? |
| title_full | Are all reversible computations tidy? |
| title_fullStr | Are all reversible computations tidy? |
| title_full_unstemmed | Are all reversible computations tidy? |
| title_short | Are all reversible computations tidy? |
| title_sort | are all reversible computations tidy |
| work_keys_str_mv | AT maroneyo areallreversiblecomputationstidy |