Ordering the processes with indefinite causal order
- URL: http://arxiv.org/abs/2106.08976v3
- Date: Thu, 3 Mar 2022 16:07:50 GMT
- Title: Ordering the processes with indefinite causal order
- Authors: Stanislav Filatov, Marcis Auzinsh
- Abstract summary: We show a method of describing processes with indefinite causal order (ICO) by a definite causal order.
We do so by relabeling the processes that take place in the circuit in accordance with the basis of measurement of control qubit.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-sa/4.0/
- Abstract: We show a method of describing processes with indefinite causal order (ICO)
by a definite causal order. We do so by relabeling the processes that take
place in the circuit in accordance with the basis of measurement of control
qubit. Causal nonseparability is alleviated at a cost of nonlocality of the
acting processes. This result highlights the key role of superposition in
creating the paradox of ICO. We also draw attention to the issue of growing
incompatibility of language in its current form (especially the logical
structures it embodies) with the quantum logic.
Related papers
- Mitigating Misleading Chain-of-Thought Reasoning with Selective Filtering [59.495717939664246]
Large language models have manifested remarkable capabilities by leveraging chain-of-thought (CoT) reasoning techniques to solve intricate questions.
We propose a novel approach called the selective filtering reasoner (SelF-Reasoner) that assesses the entailment relationship between the question and the candidate reasoning chain.
SelF-Reasoner improves the fine-tuned T5 baseline consistently over the ScienceQA, ECQA, and LastLetter tasks.
arXiv Detail & Related papers (2024-03-28T06:28:35Z) - Premise Order Matters in Reasoning with Large Language Models [57.18850969634412]
We show that large language models (LLMs) are surprisingly brittle to the ordering of the premises.
We observe that LLMs achieve the best performance when the premise order aligns with the context required in intermediate reasoning steps.
arXiv Detail & Related papers (2024-02-14T04:50:18Z) - Nonparametric Partial Disentanglement via Mechanism Sparsity: Sparse
Actions, Interventions and Sparse Temporal Dependencies [58.179981892921056]
This work introduces a novel principle for disentanglement we call mechanism sparsity regularization.
We propose a representation learning method that induces disentanglement by simultaneously learning the latent factors.
We show that the latent factors can be recovered by regularizing the learned causal graph to be sparse.
arXiv Detail & Related papers (2024-01-10T02:38:21Z) - Reassessing the advantage of indefinite causal orders for quantum metrology [0.0]
In this work, we argue that some of these advantages in fact do not hold if a fairer comparison is made.
We consider a framework that allows for a proper comparison between the performance of different classes of indefinite causal order processes.
arXiv Detail & Related papers (2023-12-19T14:03:40Z) - Reassessing thermodynamic advantage from indefinite causal order [0.0]
Indefinite causal order is a key feature involved in the study of quantum higher order transformations.
We show that indefinite causal order is not necessary for the reported increase in free energy and ergotropy.
arXiv Detail & Related papers (2022-08-05T14:41:49Z) - Consistent circuits for indefinite causal order [0.0]
A number of quantum processes have been proposed which are logically consistent, yet feature a cyclic causal structure.
Here we provide a method to construct a process with an exotic causal structure in a way that ensures, and makes clear why, it is consistent.
We show how several standard examples of exotic processes, including ones that violate causal inequalities, are among the class of processes that can be generated in this way.
arXiv Detail & Related papers (2022-06-20T23:15:52Z) - Existence of processes violating causal inequalities on time-delocalised
subsystems [0.0]
It is possible to exist quantum and classical processes in which the operations performed by separate parties do not occur in a well-defined causal order.
We show that realisations on time-delocalised subsystems exist for all unitary extensions of tripartite processes.
arXiv Detail & Related papers (2022-01-27T22:34:02Z) - Efficient PAC Reinforcement Learning in Regular Decision Processes [99.02383154255833]
We study reinforcement learning in regular decision processes.
Our main contribution is to show that a near-optimal policy can be PAC-learned in time in a set of parameters.
arXiv Detail & Related papers (2021-05-14T12:08:46Z) - Quantum chicken-egg dilemmas: Delayed-choice causal order and the
reality of causal non-separability [0.0]
We show that causally indefinite processes can be realised with schemes where C serves only as a classical flag.
We demonstrate that quantum mechanics allows for phenomena where C can deterministically decide whether A comes before B or vice versa.
arXiv Detail & Related papers (2020-08-18T12:03:31Z) - From Checking to Inference: Actual Causality Computations as
Optimization Problems [79.87179017975235]
We present a novel approach to formulate different notions of causal reasoning, over binary acyclic models, as optimization problems.
We show that both notions are efficiently automated. Using models with more than $8000$ variables, checking is computed in a matter of seconds, with MaxSAT outperforming ILP in many cases.
arXiv Detail & Related papers (2020-06-05T10:56:52Z) - On estimating the entropy of shallow circuit outputs [49.1574468325115]
Estimating the entropy of probability distributions and quantum states is a fundamental task in information processing.
We show that entropy estimation for distributions or states produced by either log-depth circuits or constant-depth circuits with gates of bounded fan-in and unbounded fan-out is at least as hard as the Learning with Errors problem.
arXiv Detail & Related papers (2020-02-27T15:32:08Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.