Detecting entanglement of unknown states by violating the Clauser-Horne-Shimony-Holt inequality

• URL: http://arxiv.org/abs/2302.00148v1
• Date: Tue, 31 Jan 2023 23:49:55 GMT
• Title: Detecting entanglement of unknown states by violating the Clauser-Horne-Shimony-Holt inequality
• Authors: J. Cort\'es-Vega, J. F. Barra, L. Pereira, and A. Delgado
• Abstract summary: Entangled states play a fundamental role in Quantum Mechanics and are at the core of many contemporary applications. We propose a method to detect the entanglement of unknown two-qubit quantum states.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Entangled states play a fundamental role in Quantum Mechanics and are at the core of many contemporary applications, such as quantum communication and quantum computing. Therefore, determining whether a state is entangled or not is an important task. Here, we propose a method to detect the entanglement of unknown two-qubit quantum states. Our method is based on the violation of the Clauser-Horne-Shimony-Holt inequality. This maximizes the value of the inequality even when \lp{it} contains an unknown quantum state. The method iteratively generates local measurement settings that lead to increasing values of the inequality. We show by numerical simulations for pure and mixed states that our algorithm exceeds the classical limit of 2 after a few iterations.

Related papers

• Data Processing Inequality for The Quantum Guesswork [4.956709222278243]
  Non-orthogonal quantum states cannot be distinguished with absolute certainty. Quantum guesswork has emerged as a crucial measure in assessing the distinguishability of non-orthogonal quantum states.
  arXiv  Detail & Related papers  (2024-07-22T19:42:16Z)
• Tight concentration inequalities for quantum adversarial setups exploiting permutation symmetry [0.5242869847419834]
  We show that our one-sided concentration inequalities for a quantum state require the $N$-qudit system to be permutation invariant. We numerically demonstrate the tightness of our bounds in simple quantum information processing tasks.
  arXiv  Detail & Related papers  (2024-03-18T12:20:46Z)
• Simulating Entanglement beyond Quantum Steering [15.808504285017948]
  We quantify the resource content of such states in terms of how much shared randomness is needed to simulate their behavior. We rigorously show that the shared randomness cost is unbounded even for some two-qubit unsteerable states.
  arXiv  Detail & Related papers  (2023-02-17T18:52:33Z)
• Sparse random Hamiltonians are quantumly easy [105.6788971265845]
  A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. This paper shows that, for most random Hamiltonians, the maximally mixed state is a sufficiently good trial state. Phase estimation efficiently prepares states with energy arbitrarily close to the ground energy.
  arXiv  Detail & Related papers  (2023-02-07T10:57:36Z)
• Experimental demonstration of optimal unambiguous two-out-of-four quantum state elimination [52.77024349608834]
  A core principle of quantum theory is that non-orthogonal quantum states cannot be perfectly distinguished with single-shot measurements. Here we implement a quantum state elimination measurement which unambiguously rules out two of four pure, non-orthogonal quantum states.
  arXiv  Detail & Related papers  (2022-06-30T18:00:01Z)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• Canonically consistent quantum master equation [68.8204255655161]
  We put forth a new class of quantum master equations that correctly reproduce the state of an open quantum system beyond the infinitesimally weak system-bath coupling limit. Our method is based on incorporating the knowledge of the reduced steady state into its dynamics.
  arXiv  Detail & Related papers  (2022-05-25T15:22:52Z)
• 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)
• Separability and entanglement in superpositions of quantum states [0.0]
  We study the superpositions of a pure entangled state and a pure product state, when the amplitudes corresponding to the states appearing in any superposition are nonzero. All such superpositions produce only entangled states if the initial entangled state has Schmidt rank three or higher. We find that conditional inseparability of superpositions help in identifying strategies for conclusive local discrimination of shared quantum ensembles.
  arXiv  Detail & Related papers  (2021-08-04T19:48:29Z)
• Quantum Discrimination of Two Noisy Displaced Number States [68.2727599930504]
  We first consider the quantum discrimination of two noiseless displaced number states. We then address the problem of discriminating between two noisy displaced number states.
  arXiv  Detail & Related papers  (2020-12-09T16:56:16Z)
• Entanglement as upper bounded for the nonlocality of a general two-qubit system [16.676050048472963]
  We systematically investigate the relationship between entanglement and nonlocality of a general two-qubit system. We find that the nonlocality of two different two-qubit states can be optimally stimulated by the same nonlocality test setting.
  arXiv  Detail & Related papers  (2020-04-17T16:42:27Z)

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.