Resource theory of causal connection
Bibliographic record
Abstract
The capacity of distant parties to send signals to one another is a fundamental requirement in many information-processing tasks. Such ability is determined by the causal structure connecting the parties, and more generally, by the intermediate processes carrying signals from one laboratory to another. Here we build a fully fledged resource theory of causal connection for all multi-party communication scenarios, encompassing those where the parties operate in a definite causal order and also where the order is indefinite. We define and characterize the set of free processes and three different sets of free transformations thereof, resulting in three distinct resource theories of causal connection. In the causally ordered setting, we identify the most resourceful processes in the bipartite and tripartite scenarios. In the general setting, instead, our results suggest that there is no global most valuable resource. We establish the signalling robustness as a resource monotone of causal connection and provide tight bounds on it for many pertinent sets of processes. Finally, we introduce a resource theory of causal non-separability, and show that it is – in contrast to the case of causal connection – unique. Together our results offer a flexible and comprehensive framework to quantify and transform general quantum processes, as well as insights into their multi-layered causal connection structures.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".