In: Cellular and Molecular Bioengineering, 2015, vol. 8, no. 2, p. 258-266
|
In: Entropy, 2019, vol. 21, no. 2, p. 104
In view of the importance of quantum non-locality in cryptography, quantum computation, and communication complexity, it is crucial to decide whether a given correlation exhibits non-locality or not. As proved by Pitowski, this problem is NP- complete, and is thus computationally intractable unless NP is equal to P. In this paper, we first prove that the Euclidean distance of given...
|
In: Entropy, 2017, vol. 19, no. 7, p. 326-334
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...
|