Discrimination of quantum states under locality constraints in the many-copy setting

• URL: http://arxiv.org/abs/2011.13063v2
• Date: Mon, 28 Aug 2023 14:39:53 GMT
• Title: Discrimination of quantum states under locality constraints in the many-copy setting
• Authors: Hao-Chung Cheng, Andreas Winter and Nengkun Yu
• Abstract summary: We prove that the optimal average error probability always decays exponentially in the number of copies. We show an infinite separation between the separable (SEP) and PPT operations by providing a pair of states constructed from an unextendible product basis (UPB) On the technical side, we prove this result by providing a quantitative version of the well-known statement that the tensor product of UPBs is a UPB.
• Score: 18.79968161594709
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study quantum hypothesis testing between orthogonal states under restricted local measurements in the many-copy scenario. For testing arbitrary multipartite entangled pure state against its orthogonal complement state via the local operation and classical communication (LOCC) operation, we prove that the optimal average error probability always decays exponentially in the number of copies. Second, we provide a sufficient condition for the LOCC operations to achieve the same performance as the positive-partial-transpose (PPT) operations. We further show that testing a maximally entangled state against its orthogonal complement and testing extremal Werner states both fulfill the above-mentioned condition. Hence, we determine the explicit expressions for the optimal average error probability, the optimal trade-off between the type-I and type-II errors, and the associated Chernoff, Stein, Hoeffding, and strong converse exponents. Then, we show an infinite asymptotic separation between the separable (SEP) and PPT operations by providing a pair of states constructed from an unextendible product basis (UPB). The quantum states can be distinguished perfectly by PPT operations, while the optimal error probability, with SEP operations, admits an exponential lower bound. On the technical side, we prove this result by providing a quantitative version of the well-known statement that the tensor product of UPBs is a UPB.

Related papers

• Generalized quantum asymptotic equipartition [11.59751616011475]
  We prove that all operationally relevant divergences converge to the quantum relative entropy between two sets of quantum states. In particular, both the smoothed min-relative entropy between two sequential processes of quantum channels can be lower bounded by the sum of the regularized minimum output channel divergences. We apply our generalized AEP to quantum resource theories and provide improved and efficient bounds for entanglement distillation, magic state distillation, and the entanglement cost of quantum states and channels.
  arXiv  Detail & Related papers  (2024-11-06T16:33:16Z)
• Entanglement cost of discriminating quantum states under locality constraints [7.0937306686264625]
  We show that a pure state can be optimally discriminated against any other state with the assistance of a single Bell state. This study advances our understanding of the pivotal role played by entanglement in quantum state discrimination, serving as a crucial element in unlocking quantum data hiding against locally constrained measurements.
  arXiv  Detail & Related papers  (2024-02-28T16:16:50Z)
• Quantum hypothesis testing between qubit states with parity [7.586817293358619]
  Two types of decision errors in a Quantum hypothesis testing (QHT) can occur. We show that the minimal probability of type-II error occurs when the null hypothesis is accepted when it is false. We replace one of the two pure states with a maximally mixed state, and similarly characterize the behavior of the minimal probability of type-II error.
  arXiv  Detail & Related papers  (2022-12-04T08:30:25Z)
• Asymptotically Unbiased Instance-wise Regularized Partial AUC Optimization: Theory and Algorithm [101.44676036551537]
  One-way Partial AUC (OPAUC) and Two-way Partial AUC (TPAUC) measures the average performance of a binary classifier. Most of the existing methods could only optimize PAUC approximately, leading to inevitable biases that are not controllable. We present a simpler reformulation of the PAUC problem via distributional robust optimization AUC.
  arXiv  Detail & Related papers  (2022-10-08T08:26:22Z)
• Super-exponential distinguishability of correlated quantum states [0.0]
  A super-exponential decrease for both types of error probabilities is only possible in the trivial case. We show that a qualitatively different behaviour can occur when there is correlation between the samples.
  arXiv  Detail & Related papers  (2022-03-30T17:49:19Z)
• A Quantum Optimal Control Problem with State Constrained Preserving Coherence [68.8204255655161]
  We consider a three-level $Lambda$-type atom subjected to Markovian decoherence characterized by non-unital decoherence channels. We formulate the quantum optimal control problem with state constraints where the decoherence level remains within a pre-defined bound.
  arXiv  Detail & Related papers  (2022-03-24T21:31:34Z)
• Comparing Probability Distributions with Conditional Transport [63.11403041984197]
  We propose conditional transport (CT) as a new divergence and approximate it with the amortized CT (ACT) cost. ACT amortizes the computation of its conditional transport plans and comes with unbiased sample gradients that are straightforward to compute. On a wide variety of benchmark datasets generative modeling, substituting the default statistical distance of an existing generative adversarial network with ACT is shown to consistently improve the performance.
  arXiv  Detail & Related papers  (2020-12-28T05:14:22Z)
• Bose-Einstein condensate soliton qubit states for metrological applications [58.720142291102135]
  We propose novel quantum metrology applications with two soliton qubit states. Phase space analysis, in terms of population imbalance - phase difference variables, is also performed to demonstrate macroscopic quantum self-trapping regimes.
  arXiv  Detail & Related papers  (2020-11-26T09:05:06Z)
• Amortized Conditional Normalized Maximum Likelihood: Reliable Out of Distribution Uncertainty Estimation [99.92568326314667]
  We propose the amortized conditional normalized maximum likelihood (ACNML) method as a scalable general-purpose approach for uncertainty estimation. Our algorithm builds on the conditional normalized maximum likelihood (CNML) coding scheme, which has minimax optimal properties according to the minimum description length principle. We demonstrate that ACNML compares favorably to a number of prior techniques for uncertainty estimation in terms of calibration on out-of-distribution inputs.
  arXiv  Detail & Related papers  (2020-11-05T08:04:34Z)
• Asymptotic relative submajorization of multiple-state boxes [0.0]
  Pairs of states are the basic objects in the resource theory of asymmetric distinguishability (Wang and Wilde, 2019), where free operations are arbitrary quantum channels that are applied to both states. We consider boxes of a fixed finite number of states and study an extension of the relative submajorization preorder to such objects. This preorder characterizes error probabilities in the case of testing a composite null hypothesis against a simple alternative hypothesis, as well as certain error probabilities in state discrimination.
  arXiv  Detail & Related papers  (2020-07-22T08:29:52Z)
• 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)

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.