Towards a More Efficient Representation of Functions in Quantum and Reversible Computing

DOI

10.2991/eusflat-19.2019.10How to use a DOI?

Keywords

reversible computing modular computing quantum computing

Abstract

Many practical problems necessitate faster and faster computations. Simple physical estimates show that eventually, to move beyond a limit caused by the speed of light restrictions on communication speed, we will need to use quantum -- or, more generally, reversible -- computing. Thus, we need to be able to transform the existing algorithms into a reversible form. Such transformation schemes exist. However, such schemes are not very efficient. Indeed, in general, when we write an algorithm, we composed it of several pre-existing modules. It would be nice to be able to similarly compose a reversible version of our algorithm from reversible versions of these moduli -- but the existing transformation schemes cannot do it, they require that we, in effect, program everything ``from scratch''. It is therefore desirable to come up with alternative transformations, transformation that transform compositions into compositions and thus, transform a modular program in an efficient way -- by utilizing transformed moduli. Such transformations are proposed in this paper.

Copyright

© 2019, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Oscar Galindo
AU  - Laxman Bokati
AU  - Vladik Kreinovich
PY  - 2019/08
DA  - 2019/08
TI  - Towards a More Efficient Representation of Functions in Quantum and Reversible Computing
BT  - Proceedings of the 11th Conference of the European Society for Fuzzy Logic and Technology (EUSFLAT 2019)
PB  - Atlantis Press
SP  - 66
EP  - 71
SN  - 2589-6644
UR  - https://doi.org/10.2991/eusflat-19.2019.10
DO  - 10.2991/eusflat-19.2019.10
ID  - Galindo2019/08
ER  -