Minimal-error quantum state discrimination versus robustness of entanglement:More indistinguishability with less entanglement

• URL: http://arxiv.org/abs/2402.05074v1
• Date: Wed, 7 Feb 2024 18:27:49 GMT
• Title: Minimal-error quantum state discrimination versus robustness of entanglement:More indistinguishability with less entanglement
• Authors: Debarupa Saha, Kornikar Sen, Chirag Srivastava, and Ujjwal Sen
• Abstract summary: We relate the distinguishability of quantum states with their robustness of the entanglement, where the robustness of any resource quantifies how tolerant it is to noise. We identify upper and lower bounds on the probability of discriminating the states, appearing in an arbitrary multiparty ensemble. We numerically explore how tight the bounds are by examining the global discrimination probability of states selected from Haar-uniformly generated ensembles of two two-qubit states.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We relate the the distinguishability of quantum states with their robustness of the entanglement, where the robustness of any resource quantifies how tolerant it is to noise. In particular, we identify upper and lower bounds on the probability of discriminating the states, appearing in an arbitrary multiparty ensemble, in terms of their robustness of entanglement and the probability of discriminating states of the closest separable ensemble. These bounds hold true, irrespective of the dimension of the constituent systems the number of parties involved, the size of the ensemble, and whether the measurement strategies are local or global. Additional lower bounds on the same quantity is determined by considering two special cases of two-state multiparty ensembles, either having equal entanglement or at least one of them being separable. The case of equal entanglement reveals that it is always easier to discriminate the entangled states than the ones in the corresponding closest separable ensemble, a phenomenon which we refer as "More indistinguishability with less entanglement". Furthermore, we numerically explore how tight the bounds are by examining the global discrimination probability of states selected from Haar-uniformly generated ensembles of two two-qubit states. We find that for two-element ensembles of unequal entanglements, the minimum of the two entanglements must possess a threshold value for the ensemble to exhibit "More indistinguishability with less entanglement".

Related papers

• Quantile Multi-Armed Bandits with 1-bit Feedback [40.22079522118723]
  We study a variant of best-arm identification involving elements of risk sensitivity and communication constraints. We propose an algorithm that utilizes noisy binary search as a subroutine, allowing the learner to estimate quantile rewards through 1-bit feedback.
  arXiv  Detail & Related papers  (2025-02-10T17:03:33Z)
• Multipartite Embezzlement of Entanglement [44.99833362998488]
  Embezzlement of entanglement refers to the task of extracting entanglement from an entanglement resource via local operations and without communication. We show that finite-dimensional approximations of multipartite embezzling states form multipartite embezzling families. We discuss our results in the context of quantum field theory and quantum many-body physics.
  arXiv  Detail & Related papers  (2024-09-11T22:14:22Z)
• Almost device-independent certification of GME states with minimal measurements [41.94295877935867]
  Device-independent certification of quantum states allows the characterization of quantum states present inside a device. A major problem in this regard is to certify quantum states using minimal resources. We consider the multipartite quantum steering scenario with an arbitrary number of parties but only one of which is trusted in the sense that the measurements performed by the trusted party are known.
  arXiv  Detail & Related papers  (2024-02-28T17:54:55Z)
• 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)
• On the Complexity of Multi-Agent Decision Making: From Learning in Games to Partial Monitoring [105.13668993076801]
  A central problem in the theory of multi-agent reinforcement learning (MARL) is to understand what structural conditions and algorithmic principles lead to sample-efficient learning guarantees. We study this question in a general framework for interactive decision making with multiple agents. We show that characterizing the statistical complexity for multi-agent decision making is equivalent to characterizing the statistical complexity of single-agent decision making.
  arXiv  Detail & Related papers  (2023-05-01T06:46:22Z)
• Entanglement witness and multipartite quantum state discrimination [0.0]
  We consider multipartite quantum state discrimination and show that the minimum-error discrimination by separable measurements is closely related to the concept of entanglement witness. Based on the properties of entanglement witness, we establish some necessary and/or sufficient conditions on minimum-error discrimination by separable measurements.
  arXiv  Detail & Related papers  (2023-01-13T07:35:41Z)
• Beyond the entanglement of qubit pair in a mixed state [0.0]
  Given a multipartite quantum system that consists of two-level particles (qubits), one may or may not have access to all the subsystems. Monogamy constraints, reported in this letter, are relations between well known entanglement measures such as one-tangle, two-tangles and three-tangles of an N-qubit pure state.
  arXiv  Detail & Related papers  (2021-11-15T15:22:23Z)
• 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)
• Unextendible entangled bases and more nonlocality with less entanglement [0.0]
  We show that the phenomenon of more nonlocality with less entanglement can be observed for two qubits, while still being at the single-copy level. The results are potentially useful for secure quantum communication technologies with an optimal amount of resources.
  arXiv  Detail & Related papers  (2021-03-16T15:33:44Z)
• 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)
• Gaussian Process States: A data-driven representation of quantum many-body physics [59.7232780552418]
  We present a novel, non-parametric form for compactly representing entangled many-body quantum states. The state is found to be highly compact, systematically improvable and efficient to sample. It is also proven to be a universal approximator' for quantum states, able to capture any entangled many-body state with increasing data set size.
  arXiv  Detail & Related papers  (2020-02-27T15:54:44Z)
• Quantifying the unextendibility of entanglement [13.718093420358827]
  Entanglement is a striking feature of quantum mechanics, and it has a key property called unextendibility. We present a framework for quantifying and investigating the unextendibility of general bipartite quantum states.
  arXiv  Detail & Related papers  (2019-11-18T05:22:36Z)

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.