AbstractComputation 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. View Full-Text
Share & Cite This Article
Baumeler, Ä.; Wolf, S. Non-Causal Computation. Entropy 2017, 19, 326.
Baumeler Ä, Wolf S. Non-Causal Computation. Entropy. 2017; 19(7):326.Chicago/Turabian Style
Baumeler, Ämin; Wolf, Stefan. 2017. "Non-Causal Computation." Entropy 19, no. 7: 326.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.