Bounding conditional entropy of bipartite states with Bell operators

• URL: http://arxiv.org/abs/2410.01646v2
• Date: Tue, 8 Oct 2024 09:48:15 GMT
• Title: Bounding conditional entropy of bipartite states with Bell operators
• Authors: Jan Horodecki, Piotr Mironowicz,
• Abstract summary: We investigate the relationship between CVNE and the violation of Bell inequalities. By bridging the gap between Bell inequalities and CVNE, our research enhances understanding of the quantum properties of entangled systems.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum information theory explores numerous properties that surpass classical paradigms, offering novel applications and benefits. Among these properties, negative conditional von Neumann entropy (CVNE) is particularly significant in entangled quantum systems, serving as an indicator of potential advantages in various information-theoretic tasks, despite its indirect observability. In this paper, we investigate the relationship between CVNE and the violation of Bell inequalities. Our goal is to establish upper bounds on CVNE through semi-definite programming applied to entangled qubits and qutrits, utilizing selected Bell operators. Our findings reveal that a semi-device-independent certification of negative CVNE is achievable and could be practically beneficial. We further explore two types of robustness: robustness against detection efficiency loopholes, measured by relative violation, and robustness against white noise and imperfections in state preparation, measured by critical visibility. Additionally, we analyze parametrized families of Bell inequalities to identify optimal parameters for different robustness criteria. This study demonstrates that different Bell inequalities exhibit varying degrees of robustness depending on the desired properties, such as the type of noise resistance or the target level of negative CVNE. By bridging the gap between Bell inequalities and CVNE, our research enhances understanding of the quantum properties of entangled systems and offers insights for practical quantum information processing tasks.

Related papers

• Exponential entanglement advantage in sensing correlated noise [16.70008024600165]
  We propose a new form of exponential quantum advantage in the context of sensing correlated noise. We show that entanglement can lead to an exponential enhancement in the sensitivity for estimating a small parameter. Our work thus opens a novel pathway towards achieving entanglement-based sensing advantage.
  arXiv  Detail & Related papers  (2024-10-08T10:15:21Z)
• Robust self-testing of the $m-$partite maximally entangled state and observables [0.0]
  We propose a simple and efficient self-testing protocol that certifies the state and observables based on the optimal quantum violation of the Svetlichny inequality. Our method leverages an elegant sum-of-squares approach to derive the optimal quantum value of the Svetlichny functional, devoid of assuming the dimension of the quantum system.
  arXiv  Detail & Related papers  (2024-08-20T11:03:37Z)
• Enhancing collective entanglement witnesses through correlation with state purity [0.0]
  This paper analyzes the adverse impact of white noise on collective quantum measurements. It suggests correlating the outcomes of these measurements with quantum state purity.
  arXiv  Detail & Related papers  (2023-12-08T10:39:45Z)
• Certified Robustness of Quantum Classifiers against Adversarial Examples through Quantum Noise [68.1992787416233]
  We show that adding quantum random rotation noise can improve robustness in quantum classifiers against adversarial attacks. We derive a certified robustness bound to enable quantum classifiers to defend against adversarial examples.
  arXiv  Detail & Related papers  (2022-11-02T05:17:04Z)
• 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)
• Experimental violations of Leggett-Garg's inequalities on a quantum computer [77.34726150561087]
  We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems. Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
  arXiv  Detail & Related papers  (2021-09-06T14:35:15Z)
• Towards solving the BCS Hamiltonian gap in Near-Term Quantum Computers [0.0]
  We obtain the gap of a BCS Hamiltonian using a NISQ framework. We show how to approximate the gap within one standard deviation, even with the presence of noise.
  arXiv  Detail & Related papers  (2021-05-31T13:01:23Z)
• Efficient and robust certification of genuine multipartite entanglement in noisy quantum error correction circuits [58.720142291102135]
  We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME) We prove that the detection of entanglement in a linear number of bipartitions by a number of measurements scales linearly, suffices to certify GME. We apply our method to the noisy readout of stabilizer operators of the distance-three topological color code and its flag-based fault-tolerant version.
  arXiv  Detail & Related papers  (2020-10-06T18:00:07Z)
• Optimal Provable Robustness of Quantum Classification via Quantum Hypothesis Testing [14.684867444153625]
  Quantum machine learning models have the potential to offer speedups and better predictive accuracy compared to their classical counterparts. These quantum algorithms, like their classical counterparts, have been shown to be vulnerable to input perturbations. These can arise either from noisy implementations or, as a worst-case type of noise, adversarial attacks.
  arXiv  Detail & Related papers  (2020-09-21T17:55:28Z)
• Foreseeing the Benefits of Incidental Supervision [83.08441990812636]
  This paper studies whether we can, in a single framework, quantify the benefits of various types of incidental signals for a given target task without going through experiments. We propose a unified PAC-Bayesian motivated informativeness measure, PABI, that characterizes the uncertainty reduction provided by incidental supervision signals.
  arXiv  Detail & Related papers  (2020-06-09T20:59:42Z)
• Quantum noise protects quantum classifiers against adversaries [120.08771960032033]
  Noise in quantum information processing is often viewed as a disruptive and difficult-to-avoid feature, especially in near-term quantum technologies. We show that by taking advantage of depolarisation noise in quantum circuits for classification, a robustness bound against adversaries can be derived. This is the first quantum protocol that can be used against the most general adversaries.
  arXiv  Detail & Related papers  (2020-03-20T17:56:14Z)

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.