The Multi-round Process Matrix

• URL: http://arxiv.org/abs/2005.04204v2
• Date: Tue, 19 Jan 2021 11:49:04 GMT
• Title: The Multi-round Process Matrix
• Authors: Timoth\'ee Hoffreumon, Ognyan Oreshkov
• Abstract summary: We develop an extension of the process matrix framework for correlations between quantum operations with no causal order. We show that in the multi-round case there are novel manifestations of causal nonseparability that are not captured by a naive application of the standard PM formalism.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We develop an extension of the process matrix (PM) framework for correlations between quantum operations with no causal order that allows multiple rounds of information exchange for each party compatibly with the assumption of well-defined causal order of events locally. We characterise the higher-order process describing such correlations, which we name the multi-round process matrix (MPM), and formulate a notion of causal nonseparability for it that extends the one for standard PMs. We show that in the multi-round case there are novel manifestations of causal nonseparability that are not captured by a naive application of the standard PM formalism: we exhibit an instance of an operator that is both a valid PM and a valid MPM, but is causally separable in the first case and can violate causal inequalities in the second case due to the possibility of using a side channel.

Related papers

• Local-Data-Hiding and Causal Inseparability: Probing Indefinite Causal Structures with Cryptographic Primitives [0.0]
  Recent studies suggest the possibility of indefiniteness in causal structure, which emerges as a novel information primitive. We show that agents embedded in an indefinite causal structure can outperform their counterparts operating in a definite causal background. We report an intriguing super-activation phenomenon, where two quantum processes, each individually not useful for the LBH task, become useful when used together.
  arXiv  Detail & Related papers  (2024-07-30T04:54:03Z)
• Generalizable Chain-of-Thought Prompting in Mixed-task Scenarios with Large Language Models [68.05046964022844]
  Large language models (LLMs) have unveiled remarkable reasoning capabilities by exploiting chain-of-thought (CoT) prompting. We propose GeM-CoT, a Generalizable CoT prompting mechanism in Mixed-task scenarios where the type of input questions is unknown. With this technical design, GeM-CoT simultaneously enjoys superior generalization capabilities and remarkable performances on 10 public reasoning tasks and 23 BBH tasks.
  arXiv  Detail & Related papers  (2023-10-10T15:10:03Z)
• On Imperfect Recall in Multi-Agent Influence Diagrams [57.21088266396761]
  Multi-agent influence diagrams (MAIDs) are a popular game-theoretic model based on Bayesian networks. We show how to solve MAIDs with forgetful and absent-minded agents using mixed policies and two types of correlated equilibrium. We also describe applications of MAIDs to Markov games and team situations, where imperfect recall is often unavoidable.
  arXiv  Detail & Related papers  (2023-07-11T07:08:34Z)
• Multipartite entanglement theory with entanglement-nonincreasing operations [91.3755431537592]
  We extend the resource theory of entanglement for multipartite systems beyond the standard framework of local operations and classical communication. We demonstrate that in this adjusted framework, the transformation rates between multipartite states are fundamentally dictated by the bipartite entanglement entropies of the respective quantum states.
  arXiv  Detail & Related papers  (2023-05-30T12:53:56Z)
• 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)
• Semi-Device-Independent Certification of Causal Nonseparability with Trusted Quantum Inputs [0.0]
  Remarkably, some processes, termed causally nonseparable, are incompatible with a definite causal order. We explore a form of certification of causal nonseparability in a semi-device-independent scenario. We show that certain causally nonseparable processes which cannot violate any causal inequality, including the canonical example of the quantum switch, can generate noncausal correlations.
  arXiv  Detail & Related papers  (2021-07-22T18:14:04Z)
• A Fully Problem-Dependent Regret Lower Bound for Finite-Horizon MDPs [117.82903457289584]
  We derive a novel problem-dependent lower-bound for regret in finite-horizon Markov Decision Processes (MDPs) We show that our lower-bound is considerably smaller than in the general case and it does not scale with the minimum action gap at all. We show that this last result is attainable (up to $poly(H)$ terms, where $H$ is the horizon) by providing a regret upper-bound based on policy gaps for an optimistic algorithm.
  arXiv  Detail & Related papers  (2021-06-24T13:46:09Z)
• Permutation Invariant Policy Optimization for Mean-Field Multi-Agent Reinforcement Learning: A Principled Approach [128.62787284435007]
  We propose the mean-field proximal policy optimization (MF-PPO) algorithm, at the core of which is a permutation-invariant actor-critic neural architecture. We prove that MF-PPO attains the globally optimal policy at a sublinear rate of convergence. In particular, we show that the inductive bias introduced by the permutation-invariant neural architecture enables MF-PPO to outperform existing competitors.
  arXiv  Detail & Related papers  (2021-05-18T04:35:41Z)
• Simple and maximally robust processes with no classical common-cause or direct-cause explanation [0.0]
  We analyze the minimum requirements for a quantum process to fail to admit a CCDC explanation. We present "simple" processes, which we prove to be the most robust ones against general noise. We also present a semi-definite hierarchy that can detect and quantify the non-classical CCDC programminges of every non-classical CCDC process.
  arXiv  Detail & Related papers  (2021-01-27T19:00:05Z)
• A no-go theorem for superpositions of causal orders [0.0]
  Quantum control implies that a controlling system carries the which-order information. Can the order of two events be in a pure superposition, uncorrelated with any other system? A pure superposition of any pair of Markovian, unitary processes with equal local dimensions and different causal orders is not a valid process.
  arXiv  Detail & Related papers  (2020-08-14T06:29:05Z)
• SMT-based Safety Verification of Parameterised Multi-Agent Systems [78.04236259129524]
  We study the verification of parameterised multi-agent systems (MASs) In particular, we study whether unwanted states, characterised as a given state formula, are reachable in a given MAS.
  arXiv  Detail & Related papers  (2020-08-11T15:24:05Z)

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.