arXiv subjects

Ämin Baumeler

Publications and source records attributed to Ämin Baumeler.

At least 19 recordsLinked to original sources

arXiv2026

Reply to the Comment on "The Axiom of Choice and the No-Signalling Principle"

We clarify the meaning of a probabilistic no-signalling strategy in Ref [Proc. R. Soc. A 481, 20240601]. For every fixed input, the deterministic strategy constructed using the Axiom of Choice can indeed be represented by a Dirac probability distribution over the outputs. The relevant distinction arises when one considers the complete process from input to output, with the input itself sampled according to a probability distribution. In this case, the input and output spaces must be measurable and the dependence of the conditional output distribution on the input must also be measurable. Equivalently, the conditional distributions must form a Markov kernel. The Axiom-of-Choice strategy fails precisely this measurability requirement.

quant-ph↗

arXiv2025

Graphical Tests of Causality

Bell inequalities limit the possible observations of non-communicating parties. Here, we present analogous inequalities for any number of communicating parties under the causal constraints of static causal order, definite causal order, and bi-causal order. All derived inequalities are remarkably simple. They correspond to upper bounds on the winning chance in graphical games: Given a specific directed graph over the parties, the parties are challenged to communicate along a randomly chosen arc. In the case of definite causal order, every game that we find is specified by a kefalopoda digraph. Based on this we define weakly causal correlations as those that satisfy all kefalopoda inequalities. We show that the problem of deciding whether some correlations are weakly causal is solvable in polynomial time in the number of parties.

quant-ph↗

arXiv2025

No quantum advantage for violating fixed-order inequalities?

In standard quantum theory, the causal relations between operations are fixed. One can relax this notion by allowing for dynamical arrangements, where operations may influence the causal relations of future operations, as certified by violation of fixed-order inequalities, e.g., the k-cycle inequalities. Another, non-causal, departure further relaxes these limitations, and is certified by violations of causal inequalities. In this paper, we explore the interplay between dynamic and indefinite causality. We study the k-cycle inequalities and show that the quantum switch violates these inequalities without exploiting its indefinite nature. We further introduce non-adaptive strategies, which effectively remove the dynamical aspect of any process, and show that the k-cycle inequalities become novel causal inequalities; violating k-cycle inequalities under the restriction of non-adaptive strategies requires non-causal setups. The quantum switch is known to be incapable of violating causal inequalities, and it is believed that a device-independent certification of its causal indefiniteness requires extended setups incorporating spacelike separation. This work reopens the possibility for a device-independent certification of the quantum switch in isolation via fixed-order inequalities instead of causal inequalities. The inequalities we study here, however, turn out to be unsuitable for such a device-independent certification. In this work, we initiate the question posed by the title. This question, however, remains unanswered.

quant-ph↗

arXiv2025

Flow of dynamical causal structures with an application to correlations

Causal models capture cause-effect relations both qualitatively - via the graphical causal structure - and quantitatively - via the model parameters. They offer a powerful framework for analyzing and constructing processes. Here, we introduce a tool - the flow of causal structures - to visualize and explore the dynamical aspect of classical-deterministic processes, arguably like those present in general relativity. The flow describes all possible ways in which the causal structure of a process can evolve. We also present an algorithm to construct its supergraph - the superflow - from the causal structure only, without invoking the model parameters. As an application, we show that if all leaves of a flow are trivial, then the corresponding process produces causal correlations only, i.e., correlations where future data cannot influence past events. This strengthens the result that processes, where every directed cycle in their causal structure is chordless, establish causal correlations only. We also discuss the main difficulties for the quantum generalization of the present algorithms.

quant-ph↗

arXiv2025

The Möbius game and other Bell tests for relativity

We derive multiparty games that, if the winning chance exceeds a certain limit, prove the incompatibility of the parties' causal relations with any partial order. This, in turn, means that the parties exert a back-action on the causal relations; the causal relations are dynamical. The games turn out to be representable by directed graphs, for instance by an orientation of the Möbius ladder. We discuss these games as device-independent tests of spacetime's dynamical nature in general relativity. To do so, we design relativistic settings where, in the Minkowski spacetime, the winning chance is bound to the limits. In contrast, we find otherwise tame processes with classical control of causal order that win the games deterministically. These suggest a violation of the bounds in gravitational implementations. We obtain these games by uncovering a "pairwise central symmetry" of the correlations in question. This symmetry allows us to recycle the facets of the acyclic subgraph polytope studied by Grötschel, Jünger, and Reinelt in the mid-80s for combinatorial optimization. In addition, we derive multiparty games in a scenario where the polytope dimension grows only linearly in the number of parties. Here, exceeding the limits not only proves the dynamical nature of the causal relations, but also that the correlations are incompatible with any global causal order.

gr-qc↗

arXiv2025

The Möbius Game: A Quantum-Inspired Test of General Relativity

We present a tight inequality to test the dynamical nature of spacetime. A general-relativistic violation of that inequality certifies change of curvature, in the same sense as a quantum-mechanical violation of a Bell inequality certifies a source of entanglement. The inequality arises from a minimal generalization of the Bell setup. It represents a limit on the winning chance of a collaborative multi-agent game played on the Möbius graph. A long version of this Letter including other games and how these games certify the dynamical character of the celebrated quantum switch is accessible as arXiv:2309.15752 [gr-qc].

gr-qc↗

arXiv2025

Quantum computation with indefinite causal structures

One way to study the physical plausibility of closed timelike curves (CTCs) is to examine their computational power. This has been done for Deutschian CTCs (D-CTCs) and post-selection CTCs (P-CTCs), with the result that they allow for the efficient solution of problems in PSPACE and PP, respectively. Since these are extremely powerful complexity classes, which are not expected to be solvable in reality, this can be taken as evidence that these models for CTCs are pathological. This problem is closely related to the nonlinearity of this models, which also allows for example cloning quantum states, in the case of D-CTCs, or distinguishing non-orthogonal quantum states, in the case of P-CTCs. In contrast, the process matrix formalism allows one to model indefinite causal structures in a linear way, getting rid of these effects, and raising the possibility that its computational power is rather tame. In this paper we show that process matrices correspond to a linear particular case of P-CTCs, and therefore that its computational power is upperbounded by that of PP. We show, furthermore, a family of processes that can violate causal inequalities but nevertheless can be simulated by a causally ordered quantum circuit with only a constant overhead, showing that indefinite causality is not necessarily hard to simulate.

quant-ph↗

arXiv2024

Indefinite causal order in boxworld theories

An astonishing feature of higher-order quantum theory is that it can accommodate indefinite causal order. In the simplest bipartite setting, there exist signaling correlations for which it is fundamentally impossible to ascribe a definite causal order for the parties' actions. Moreover, the assumptions required to arrive at such a statement (local quantum transformations and well-behaved probabilities) result in a nontrivial set of correlations, whose boundary is, to date, uncharacterized. In this work, we investigate indefinite causal order in boxworld theories. We construct a higher-order theory whose descriptor is the generalized bit (gbit) - the natural successor of the classical bit and quantum qubit. By fixing the local transformations in boxworld and asking about the global causal structure, we find that we trivially recover the full set of two-way signaling correlations. In light of this, we motivate and propose two physical principles in order to limit the set of achievable correlations: nonsignaling preservation and no signaling without system exchange. We find that a higher-order boxworld theory that respects these physical principles leads to (i) a nontrivial set of achievable correlations and (ii) a violation of some causal inequalities that is higher than what can be achieved in higher-order quantum theory. These results lead us to conjecture that the set of correlations of our higher-order boxworld theory is an outer approximation to the set of correlations produced by higher-order quantum theory.

quant-ph↗

arXiv2023

Admissible Causal Structures and Correlations

It is well-known that if one assumes quantum theory to hold locally, then processes with indefinite causal order and cyclic causal structures become feasible. Here, we study qualitative limitations on causal structures and correlations imposed by local quantum theory. For one, we find a necessary graph theoretic criterion--the "siblings-on-cycles" property--for a causal structure to be admissible: Only such causal structures admit a realization consistent with local quantum theory. We conjecture that this property is moreover sufficient. This conjecture is motivated by an explicit construction of quantum causal models, and supported by numerical calculations. We show that these causal models, in a restricted setting, are indeed consistent. For another, we identify two sets of causal structures that, in the classical-deterministic case, give rise to causal and non-causal correlations respectively.

quant-ph↗

arXiv2023

Trading causal order for locality

Quantum theory admits ensembles of quantum nonlocality without entanglement (QNLWE). These ensembles consist of seemingly classical states (they are perfectly distinguishable and non-entangled) that cannot be perfectly discriminated with local operations and classical communication (LOCC). Here, we analyze QNLWE from a causal perspective, and show how to perfectly discriminate some of these ensembles using local operations and classical communication without definite causal order. Specifically, three parties with access to an instance of indefinite causal order-the AF/BW process-can perfectly discriminate the states in a QNLWE ensemble--the SHIFT ensemble--with local operations. Hence, this type of quantum nonlocality disappears at the expense of definite causal order while retaining classical communication. Our results thereby leverage the fact that LOCC is a conjunction of three constraints: local operations, classical communication, and definite causal order. Moreover, we show how multipartite generalizations of the AF/BW process are transformed into multiqubit ensembles that exhibit QNLWE. Such ensembles are of independent interest for cryptographic protocols and for the study of separable quantum operations unachievable with LOCC.

quant-ph↗

arXiv2022

The Axiom of Choice and the No-Signaling Principle

We show that the axiom of choice, a basic yet controversial postulate of set theory, leads to revise the standard understanding of one of the pillars of our best physical theories, namely the no-signaling principle. While it is well known that probabilistic no-signaling resources (such as quantum non-locality) are stronger than deterministic ones, we show-by invoking the axiom of choice-the opposite: Functional (deterministic) no-signaling resources can be stronger than probabilistic ones. To prove this, we devise a Bell-like game that shows a systematic advantage of functional no-signaling with respect to any probabilistic no-signaling resource.

quant-ph↗

arXiv2022

Thermodynamics as Combinatorics: A Toy Theory

We discuss a simple toy model which allows, in a natural way, for deriving central facts from thermodynamics such as its fundamental laws, including Carnot's version of the second principle. Our viewpoint represents thermodynamic systems as binary strings, and it links their temperature to their Hamming weight. From this, we can reproduce the possibility of negative temperatures, the notion of equilibrium as the coïncidence of two notions of temperature - statistical versus structural -, as well as the zeroth law of thermodynamics (transitivity of the thermal-equilibrium relation), which we find to be redundant, as other authors, yet at the same time not to be universally valid.

quant-ph↗

arXiv2022

Unlimited non-causal correlations and their relation to non-locality

Non-causal correlations certify the lack of a definite causal order among localized space-time regions. In stark contrast to scenarios where a single region influences its own causal past, some processes that distribute non-causal correlations satisfy a series of natural desiderata: logical consistency, linear and reversible dynamics, and computational tameness. Here, we present such processes among arbitrary many regions where each region influences every other but itself, and show that the above desiderata are altogether insufficient to limit the amount of "acausality" of non-causal correlations. This leaves open the identification of a principle that forbids non-causal correlations. Our results exhibit qualitative and quantitative parallels with the non-local correlations due to Ardehali and Svetlichny.

quant-ph↗

arXiv2021

Equivalence of Grandfather and Information Antinomy Under Intervention

Causal loops, e.g., in time travel, come with two main problems. Most prominently, the grandfather antinomy describes the potentiality to inconsistencies: a problem of logical nature. The other problem is called information antinomy and is lesser known. Yet, it describes a variant of the former: There are not too few consistent solutions -- namely none -- but too many. At a first glance, the information antinomy does not seem as problematic as the grandfather antinomy, because there is no apparent logical contradiction. In this work we show that, however, both problems are equivalent under interventions: If parties can intervene in such a way that the information antinomy arises, then they can also intervene to generate a contradiction, and vice versa.

quant-ph↗

arXiv2020

Algebraic and geometric properties of local transformations

Some properties of physical systems can be characterized from their correlations. In that framework, subsystems are viewed as abstract devices that receive measurement settings as inputs and produce measurement outcomes as outputs. The labeling convention used to describe these inputs and outputs does not affect the physics; and relabelings are easily implemented by rewiring the input and output ports of the devices. However, a more general class of operations can be achieved by using correlated preprocessing and postprocessing of the inputs and outputs. In contrast to relabelings, some of these operations irreversibly lose information about the underlying device. Other operations are reversible, but modify the number of cardinality of inputs and/or outputs. In this work, we single out the set of deterministic local maps as the one satisfying two equivalent constructions: an operational definition from causality, and an axiomatic definition reminiscent of the definition of quantum completely positive trace-preserving maps. We then study the algebraic properties of that set. Surprisingly, the study of these fundamental properties has deep and practical applications. First, the invariant subspaces of these transformations directly decompose the space of correlations/Bell inequalities into nonsignaling, signaling and normalization components. This impacts the classification of Bell and causal inequalities, and the construction of assemblages/witnesses in steering scenarios. Second, the left and right invertible deterministic local operations provide an operational generalization of the liftings introduced by Pironio [J. Math. Phys., 46(6):062112 (2005)]. Not only Bell-local, but also causal inequalities can be lifted; liftings also apply to correlation boxes in a variety of scenarios.

quant-ph↗

arXiv2019

The Free Energy of a General Computation

Starting from Landauer's slogan "information is physical," we revise and modify Landauer's principle stating that the erasure of information has a minimal price in the form of a certain quantity of free energy. We establish a direct link between the erasure cost and the work value of a piece of information, and show that the former is essentially the length of the string's best compression by a reversible computation. We generalize the principle by deriving bounds on the free energy to be invested for --- or gained from, for that matter --- a general computation. We then revisit the second law of thermodynamics and compactly rephrase it (assuming the Church/Turing/Deutsch hypothesis that physical reality can be simulated by a universal Turing machine): Time evolutions are logically reversible --- "the future fully remembers the past (but not necessarily vice versa)." We link this view to previous formulations of the second law, and we argue that it has a particular feature that suggests its "logico-informational" nature, namely simulation resilience: If a computation faithfully simulates a physical process violating the law --- then that very computation procedure violates it as well.

quant-ph↗

arXiv2019

Reversible time travel with freedom of choice

General relativity allows for the existence of closed time-like curves, along which a material object could travel back in time and interact with its past self. This possibility raises the question whether certain initial conditions, or more generally local operations, lead to inconsistencies and should thus be forbidden. Here we consider the most general deterministic dynamics connecting classical degrees of freedom defined on a set of bounded space-time regions, requiring that it is compatible with arbitrary operations performed in the local regions. We find that any such dynamics can be realised through reversible interactions. We further find that consistency with local operations is compatible with non-trivial time travel: Three parties can interact in such a way to be all both in the future and in the past of each other, while being free to perform arbitrary local operations.

gr-qc↗

arXiv2019

Experimental two-way communication with one photon

Superposition of two or more states is one of the fundamental concepts of quantum mechanics and provides the basis for several advantages quantum information processing offers. In this work, we experimentally demonstrate that quantum superposition permits two-way communication between two distant parties that can exchange only one particle once, an impossible task in classical physics. This is achieved by preparing a single photon in a coherent superposition of the two parties' locations. Furthermore, we show that this concept allows the parties to perform secure quantum communication, where the transmitted bits and even the direction of communication remain private. These important features can lead to the development of new quantum communication schemes, which are simultaneously secure and resource-efficient.

quant-ph↗