Non-causal computation
- Baumeler, Ämin Facoltà di scienze informatiche, Università della Svizzera italiana, Svizzera
- Wolf, Stefan Facoltà indipendente di Gandria, Switzerland
-
02.07.2017
Published in:
- Entropy. - 2017, vol. 19, no. 7, p. 326-334
English
Computation models such as circuits describe sequences of computation steps that are carried out one after the other. In other words, algorithm design is traditionally subject to the restriction imposed by a fixed causal order. We address a novel computing paradigm beyond quantum computing, replacing this assumption by mere logical consistency: We study non-causal circuits, where a fixed time structure within a gate is locally assumed whilst the global causal structure between the gates is dropped. We present examples of logically consistent non-causal circuits outperforming all causal ones; they imply that suppressing loops entirely is more restrictive than just avoiding the contradictions they can give rise to. That fact is already known for correlations as well as for communication, and we here extend it to computation.
- Language
-
- English
- Classification
- Computer science and technology
- License
- License undefined
- Identifiers
-
- RERO DOC 328269
- DOI 10.3390/e19070326
- ARK ark:/12658/srd1319039
- Persistent URL
- https://n2t.net/ark:/12658/srd1319039
Statistics
Document views: 33
File downloads:
- Baumeler_E_2017.pdf: 26