Bounding and simulating contextual correlations in quantum theory

• URL: http://arxiv.org/abs/2010.04751v3
• Date: Fri, 4 Jun 2021 16:52:58 GMT
• Title: Bounding and simulating contextual correlations in quantum theory
• Authors: Armin Tavakoli, Emmanuel Zambrini Cruzeiro, Roope Uola and Alastair A. Abbott
• Abstract summary: We introduce a hierarchy of semidefinite relaxations of the set of quantum correlations in generalised contextuality scenarios. We use it to determine the maximal quantum violation of several noncontextuality inequalities whose maximum violations were previously unknown. We then go further and use it to prove that certain preparation-contextual correlations cannot be explained with pure states.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce a hierarchy of semidefinite relaxations of the set of quantum correlations in generalised contextuality scenarios. This constitutes a simple and versatile tool for bounding the magnitude of quantum contextuality. To illustrate its utility, we use it to determine the maximal quantum violation of several noncontextuality inequalities whose maximum violations were previously unknown. We then go further and use it to prove that certain preparation-contextual correlations cannot be explained with pure states, thereby showing that mixed states are an indispensable resource for contextuality. In the second part of the paper, we turn our attention to the simulation of preparation-contextual correlations in general operational theories. We introduce the information cost of simulating preparation contextuality, which quantifies the additional, otherwise forbidden, information required to simulate contextual correlations in either classical or quantum models. In both cases, we show that the simulation cost can be efficiently bounded using a variant of our hierarchy of semidefinite relaxations, and we calculate it exactly in the simplest contextuality scenario of parity-oblivious multiplexing.

Related papers

• Characterizing Contextuality via Rank Separation with Applications to Cloning [0.0]
  Quantum contextuality is a key nonclassical feature essential for understanding advantages in quantum computation and communication. We introduce a new framework to study contextuality based solely on information processing statistics. We show that quantum contextuality provides the resource in optimal phase-covariant and universal cloning schemes.
  arXiv  Detail & Related papers  (2024-06-27T17:56:04Z)
• No-broadcasting characterizes operational contextuality [0.0]
  We show that the possibility of demonstrating contextuality is exactly characterized by non-commutativity. We also show how techniques from broadcasting can be used to simplify known foundational results in contextuality.
  arXiv  Detail & Related papers  (2024-06-11T14:33:06Z)
• Disentangled Representation Learning with Transmitted Information Bottleneck [57.22757813140418]
  We present textbfDisTIB (textbfTransmitted textbfInformation textbfBottleneck for textbfDisd representation learning), a novel objective that navigates the balance between information compression and preservation.
  arXiv  Detail & Related papers  (2023-11-03T03:18:40Z)
• Counterfactual Debiasing for Generating Factually Consistent Text Summaries [46.88138136539263]
  We construct causal graphs for abstractive text summarization and identify the intrinsic causes of the factual inconsistency. We propose a debiasing framework, named CoFactSum, to alleviate the causal effects of these biases by counterfactual estimation. Experiments on two widely-used summarization datasets demonstrate the effectiveness of CoFactSum.
  arXiv  Detail & Related papers  (2023-05-18T06:15:45Z)
• Contextuality as a Precondition for Quantum Entanglement [0.0]
  We prove that entanglement in a nonlocal scenario can arise only if there is preparation and measurement contextuality. As a direct consequence, our result allows us to translate any inequality for testing preparation and measurement contextuality into an entanglement test.
  arXiv  Detail & Related papers  (2022-09-20T18:36:34Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Using a resource theoretic perspective to witness and engineer quantum generalized contextuality for prepare-and-measure scenarios [0.0]
  We employ the resource theory of generalized contextuality as a tool for analyzing the structure of prepare-and-measure scenarios. We argue that this framework simplifies proofs of quantum contextuality in complex scenarios.
  arXiv  Detail & Related papers  (2021-02-20T23:06:03Z)
• Quantum simulation of gauge theory via orbifold lattice [47.28069960496992]
  We propose a new framework for simulating $textU(k)$ Yang-Mills theory on a universal quantum computer. We discuss the application of our constructions to computing static properties and real-time dynamics of Yang-Mills theories.
  arXiv  Detail & Related papers  (2020-11-12T18:49:11Z)
• Characterising and bounding the set of quantum behaviours in contextuality scenarios [0.0]
  This work defines contextuality scenarios, along with the polytope of general contextual behaviours. We formulate novel semidefinite programming relaxations for bounding these sets of quantum contextual behaviours. Most significantly, to circumvent the inadequacy of pure states and projective measurements, we present a novel unitary operator based semidefinite relaxation technique.
  arXiv  Detail & Related papers  (2020-10-12T17:00:07Z)
• RatE: Relation-Adaptive Translating Embedding for Knowledge Graph Completion [51.64061146389754]
  We propose a relation-adaptive translation function built upon a novel weighted product in complex space. We then present our Relation-adaptive translating Embedding (RatE) approach to score each graph triple.
  arXiv  Detail & Related papers  (2020-10-10T01:30:30Z)

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.