Related papers: Constraining the doability of relativistic quantum…

Quantum operations are the most widely used tool in the theory of quantum information processing, representing elementary transformations of quantum states that are composed to form complex quantum circuits. The class of quantum…

The hilbert-space structure of quantum mechanics is related to the causal structure of space-time. The usual measurement hypotheses apparently preclude nonlinear or stochastic quantum evolution. By admitting a difference in the calculus of…

We consider the reversible processes between two one-to-one correlated measurement outcomes which underly both problem-solving and quantum nonlocality. In the former case the two outcomes are the setting and the solution of the problem, in…

In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…

Quantum theory is a probabilistic theory with fixed causal structure. General relativity is a deterministic theory but where the causal structure is dynamic. It is reasonable to expect that quantum gravity will be a probabilistic theory…

From the existence of an efficient quantum algorithm for factoring, it is likely that quantum computation is intrinsically more powerful than classical computation. At present, the best upper bound known for the power of quantum computation…

Causal nonseparability refers to processes where events take place in a coherent superposition of different causal orders. These may be the key resource for experimental violations of causal inequalities and have been recently identified as…

In this paper we present and analyze an information-theoretic task that consists in learning a bit of information by spatially moving the "target" particle that encodes it. We show that, on one hand, the task can be solved with the use of…

This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…

There has been a body of works deriving the complex Hilbert space structure of quantum theory from axioms/principles/postulates to deepen our understanding about quantum theory and to reveal ways to go beyond it to resolve foundational…

A central question for causal inference is to decide whether a set of correlations fit a given causal structure. In general, this decision problem is computationally infeasible and hence several approaches have emerged that look for…

The idea that events obey a definite causal order is deeply rooted in our understanding of the world and at the basis of the very notion of time. But where does causal order come from, and is it a necessary property of nature? We address…

Causal consistency is one of the most adopted consistency criteria for distributed implementations of data structures. It ensures that operations are executed at all sites according to their causal precedence. We address the issue of…

Recently, there has been extensive research on the capabilities of biologically plausible algorithms. In this work, we show how one of such algorithms, called predictive coding, is able to perform causal inference tasks. First, we show how…

Large scale numerical experiments are commonplace today in theoretical physics. The high performance algorithms described herein are the most compact, efficient methods known for representing and analyzing systems modeled well by sets or…

Quantum mechanics is widely regarded as a complete theory, yet we argue it is a tractable projection of a deeper, computationally-inaccessible classical variational structure. By analyzing the coupled partial differential equations of the…

Computational models typically assume that operations are applied in a fixed sequential order. In recent years several works have looked at relaxing this assumption, considering computations without any fixed causal structure and showing…

The constraints arising for a general set of causal relations, both classically and quantumly, are still poorly understood. As a step in exploring this question, we consider a coherently controlled superposition of "direct-cause" and…

Causality serves as an abstract notion of time for concurrent systems. A computation is causal, or simply valid, if each observation of a computation event is preceded by the observation of its causes. The present work establishes that this…

An operational approach to the study of computation based on correlations considers black-boxes with one-bit inputs and outputs, controlled by a limited classical computer capable only of performing sums modulo-2. In this setting, it was…