Local simultaneous state discrimination

• URL: http://arxiv.org/abs/2111.01209v1
• Date: Mon, 1 Nov 2021 19:03:37 GMT
• Title: Local simultaneous state discrimination
• Authors: Christian Majenz, Maris Ozols, Christian Schaffner, Mehrdad Tahmasbi
• Abstract summary: Quantum state discrimination is one of the most fundamental problems studied in quantum information theory. In this work, we introduce a new variant of this task: Local Simultaneous State Discrimination. While interesting in its own right, this problem also arises in quantum cryptography.
• Score: 17.243339961137647
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum state discrimination is one of the most fundamental problems studied in quantum information theory. Applications range from channel coding to metrology and cryptography. In this work, we introduce a new variant of this task: Local Simultaneous State Discrimination (LSSD). While previous distributed variants of the discrimination problem always allowed some communication between the parties to come up with a joint answer, the parties in LSSD cannot communicate and have to simultaneously answer correctly. This simultaneity implies, e.g., that for classical states, the problem does not trivialize to a non-distributed distinguishing task. While interesting in its own right, this problem also arises in quantum cryptography. After introducing the problem, we give a number of characterization results. We give examples showing that i) the optimal strategy for local discrimination need not coincide with the optimal strategy for LSSD, even for classical states, ii) an additional entangled resource can increase the optimal success probability in LSSD, and iii) stronger-than-quantum non-signalling resources can allow for a higher success probability in some cases, compared to strategies using entanglement. Finally, we show that finding the optimal strategy in (classical) 3-party LSSD is NP-hard.

Related papers

• Generalized Schrödinger Bridge Matching [54.171931505066]
  Generalized Schr"odinger Bridge (GSB) problem setup is prevalent in many scientific areas both within and without machine learning. We propose Generalized Schr"odinger Bridge Matching (GSBM), a new matching algorithm inspired by recent advances. We show that such a generalization can be cast as solving conditional optimal control, for which variational approximations can be used.
  arXiv  Detail & Related papers  (2023-10-03T17:42:11Z)
• Non-destructive Local Discrimination of Entangled Quantum States [5.44412471005479]
  We show a gap between local and nonlocal strategies in a quantum state discrimination task under a non-destructiveness condition. For a set of maximally entangled states, the success probability of the proposed task using local operations and classical communications is completely suppressed. We construct a non-destructive and adaptive strategy to achieve perfect discrimination of maximally entangled states.
  arXiv  Detail & Related papers  (2023-08-30T13:46:18Z)
• Local Inaccessibility of Random Classical Information : Conditional Nonlocality demands Entanglement [0.0]
  Discrimination of quantum states under local operations and classical communication (LOCC) is an intriguing question. We introduce a framework for input-dependent local quantum state discrimination, which we call local random authentication (LRA) The results highlight a completely new aspect of the interplay between the security of information in a network and quantum entanglement under the LOCC paradigm.
  arXiv  Detail & Related papers  (2023-07-17T12:58:46Z)
• MaxMatch: Semi-Supervised Learning with Worst-Case Consistency [149.03760479533855]
  We propose a worst-case consistency regularization technique for semi-supervised learning (SSL) We present a generalization bound for SSL consisting of the empirical loss terms observed on labeled and unlabeled training data separately. Motivated by this bound, we derive an SSL objective that minimizes the largest inconsistency between an original unlabeled sample and its multiple augmented variants.
  arXiv  Detail & Related papers  (2022-09-26T12:04:49Z)
• Optimal Algorithms for Decentralized Stochastic Variational Inequalities [113.43047601775453]
  This work concentrates on the decentralized setting, which is increasingly important but not well understood. We present lower bounds for both communication and local iterations and construct optimal algorithms that match these lower bounds. Our algorithms are the best among the available not only in the decentralized case, but also in the deterministic and non-distributed literature.
  arXiv  Detail & Related papers  (2022-02-06T13:14:02Z)
• Experimental multi-state quantum discrimination through a Quantum network [63.1241529629348]
  We have experimentally implemented two discrimination schemes in a minimum-error scenario based on a receiver featured by a network structure and a dynamical processing of information. The first protocol achieves binary optimal discrimination, while the second one provides a novel approach to multi-state quantum discrimination, relying on the dynamical features of the network-like receiver.
  arXiv  Detail & Related papers  (2021-07-21T09:26:48Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• Generalized quantum process discrimination problems [2.538209532048866]
  We study a broad class of quantum process discrimination problems that can handle many optimization strategies. Our task is to find a discrimination strategy, which may be adaptive and/or entanglement-assisted, that maximizes a given objective function. We show that if a problem has a certain symmetry and at least one optimal solution exists, then there also exists an optimal solution with the same type of symmetry.
  arXiv  Detail & Related papers  (2021-04-20T04:46:57Z)
• 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)
• Reinforcement Learning with Neural Networks for Quantum Multiple Hypothesis Testing [8.006109507455038]
  Reinforcement learning with neural networks (RLNN) has recently demonstrated great promise for many problems. We use RLNN to find locally-adaptive measurement strategies that are experimentally feasible. We provide a new example which, to our knowledge, is the simplest known state set exhibiting a significant gap between local and collective protocols.
  arXiv  Detail & Related papers  (2020-10-16T18:49:23Z)
• Resource Allocation via Model-Free Deep Learning in Free Space Optical Communications [119.81868223344173]
  The paper investigates the general problem of resource allocation for mitigating channel fading effects in Free Space Optical (FSO) communications. Under this framework, we propose two algorithms that solve FSO resource allocation problems.
  arXiv  Detail & Related papers  (2020-07-27T17:38:51Z)

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.