Robustness of contextuality under different types of noise as quantifiers for parity-oblivious multiplexing tasks

• URL: http://arxiv.org/abs/2406.12773v2
• Date: Wed, 02 Oct 2024 12:24:29 GMT
• Title: Robustness of contextuality under different types of noise as quantifiers for parity-oblivious multiplexing tasks
• Authors: Amanda M. Fonseca, Vinicius P. Rossi, Roberto D. Baldijão, John H. Selby, Ana Belén Sainz,
• Abstract summary: We use analytical and numerical tools to estimate robustness of contextuality in POM scenarios under different types of noise. We obtain a general relation between robustness of contextuality to depolarisation and the success rate in any $n$-to-1 POM scenario.
• Score: 0.0
• License:
• Abstract: Generalised contextuality is the notion of nonclassicality powering up a myriad of quantum tasks, among which is the celebrated case of a two-party information processing task where classical information is compressed in a quantum channel, the parity-oblivious multiplexing (POM) task. The success rate is the standard quantifier of resourcefulness for this task, while robustness-based quantifiers are as operationally motivated and have known general properties. In this work, we leverage analytical and numerical tools to estimate robustness of contextuality in POM scenarios under different types of noise. We conclude that for the 3-to-1 case robustness of contextuality to depolarisation, as well as a minimisation of robustness of contextuality to dephasing over all bases, are good quantifiers for the nonclassical advantage of this scenario. Moreover, we obtain a general relation between robustness of contextuality to depolarisation and the success rate in any $n$-to-1 POM scenario and show how it can be used to bound the number of bits encoded in this task.

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)
• Quantization of Large Language Models with an Overdetermined Basis [73.79368761182998]
  We introduce an algorithm for data quantization based on the principles of Kashin representation. Our findings demonstrate that Kashin Quantization achieves competitive or superior quality in model performance.
  arXiv  Detail & Related papers  (2024-04-15T12:38:46Z)
• Unifying (Quantum) Statistical and Parametrized (Quantum) Algorithms [65.268245109828]
  We take inspiration from Kearns' SQ oracle and Valiant's weak evaluation oracle. We introduce an extensive yet intuitive framework that yields unconditional lower bounds for learning from evaluation queries.
  arXiv  Detail & Related papers  (2023-10-26T18:23:21Z)
• RobustMQ: Benchmarking Robustness of Quantized Models [54.15661421492865]
  Quantization is an essential technique for deploying deep neural networks (DNNs) on devices with limited resources. We thoroughly evaluated the robustness of quantized models against various noises (adrial attacks, natural corruptions, and systematic noises) on ImageNet. Our research contributes to advancing the robust quantization of models and their deployment in real-world scenarios.
  arXiv  Detail & Related papers  (2023-08-04T14:37:12Z)
• One-Shot Distributed Source Simulation: As Quantum as it Can Get [16.75857332621569]
  Distributed source simulation is the task where two (or more) parties share some randomness correlated and use local communication to convert this into some target correlation. We do this by introducing one-shot operational quantities and correlation measures that characterize them. In doing so, we consider technical points in one-shot network information theory and generalize the support lemma to the classical-quantum setting.
  arXiv  Detail & Related papers  (2023-01-11T04:33:46Z)
• Synergies between Disentanglement and Sparsity: Generalization and Identifiability in Multi-Task Learning [79.83792914684985]
  We prove a new identifiability result that provides conditions under which maximally sparse base-predictors yield disentangled representations. Motivated by this theoretical result, we propose a practical approach to learn disentangled representations based on a sparsity-promoting bi-level optimization problem.
  arXiv  Detail & Related papers  (2022-11-26T21:02:09Z)
• 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)
• Adversarial Robustness with Semi-Infinite Constrained Learning [177.42714838799924]
  Deep learning to inputs perturbations has raised serious questions about its use in safety-critical domains. We propose a hybrid Langevin Monte Carlo training approach to mitigate this issue. We show that our approach can mitigate the trade-off between state-of-the-art performance and robust robustness.
  arXiv  Detail & Related papers  (2021-10-29T13:30:42Z)
• 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)
• Bounding and simulating contextual correlations in quantum theory [0.0]
  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.
  arXiv  Detail & Related papers  (2020-10-09T18:19:09Z)
• Operational quantification of continuous-variable quantum resources [6.308539010172309]
  We introduce a general method of quantifying resources for continuous-variable quantum systems based on the measure. We show that the robustness constitutes a well-behaved, bona fide resource quantifier in any convex resource theory.
  arXiv  Detail & Related papers  (2020-09-23T18:00:03Z)

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.