Strategies for single-shot discrimination of process matrices

• URL: http://arxiv.org/abs/2210.14575v1
• Date: Wed, 26 Oct 2022 09:14:58 GMT
• Title: Strategies for single-shot discrimination of process matrices
• Authors: Paulina Lewandowska, {\L}ukasz Pawela and Zbigniew Pucha{\l}a
• Abstract summary: This work examines the problem of single-shot discrimination between process matrices. We provide an exact expression for the optimal probability of correct distinction. We prove that no matter which strategy you choose, the probability of distinguishing two process matrices being a quantum comb is the same.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The topic of causality has recently gained traction quantum information research. This work examines the problem of single-shot discrimination between process matrices which are an universal method defining a causal structure. We provide an exact expression for the optimal probability of correct distinction. In addition, we present an alternative way to achieve this expression by using the convex cone structure theory. We also express the discrimination task as semidefinite programming. Due to that, we have created the SDP calculating the distance between process matrices and we quantify it in terms of the trace norm. As a valuable by-product, the program finds an optimal realization of the discrimination task. We also find two classes of process matrices which can be distinguished perfectly. Our main result, however, is a consideration of the discrimination task for process matrices corresponding to quantum combs. We study which strategy, adaptive or non-signalling, should be used during the discrimination task. We proved that no matter which strategy you choose, the probability of distinguishing two process matrices being a quantum comb is the same.

Related papers

• Discretize Relaxed Solution of Spectral Clustering via a Non-Heuristic Algorithm [77.53604156112144]
  We develop a first-order term to bridge the original problem and discretization algorithm. Since the non-heuristic method is aware of the original graph cut problem, the final discrete solution is more reliable.
  arXiv  Detail & Related papers  (2023-10-19T13:57:38Z)
• Semidefinite Programming versus Burer-Monteiro Factorization for Matrix Sensing [17.149804263692452]
  Two main approaches for solving matrix sensing are based on semidefinite programming (SDP) and Burer-Monteiro (B-M) factorization. In this paper, we shed light on some major differences between these two methods.
  arXiv  Detail & Related papers  (2022-08-15T23:21:16Z)
• Bounding Counterfactuals under Selection Bias [60.55840896782637]
  We propose a first algorithm to address both identifiable and unidentifiable queries. We prove that, in spite of the missingness induced by the selection bias, the likelihood of the available data is unimodal.
  arXiv  Detail & Related papers  (2022-07-26T10:33:10Z)
• Asymmetric Scalable Cross-modal Hashing [51.309905690367835]
  Cross-modal hashing is a successful method to solve large-scale multimedia retrieval issue. We propose a novel Asymmetric Scalable Cross-Modal Hashing (ASCMH) to address these issues. Our ASCMH outperforms the state-of-the-art cross-modal hashing methods in terms of accuracy and efficiency.
  arXiv  Detail & Related papers  (2022-07-26T04:38:47Z)
• Making Linear MDPs Practical via Contrastive Representation Learning [101.75885788118131]
  It is common to address the curse of dimensionality in Markov decision processes (MDPs) by exploiting low-rank representations. We consider an alternative definition of linear MDPs that automatically ensures normalization while allowing efficient representation learning. We demonstrate superior performance over existing state-of-the-art model-based and model-free algorithms on several benchmarks.
  arXiv  Detail & Related papers  (2022-07-14T18:18:02Z)
• 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)
• Understanding Implicit Regularization in Over-Parameterized Single Index Model [55.41685740015095]
  We design regularization-free algorithms for the high-dimensional single index model. We provide theoretical guarantees for the induced implicit regularization phenomenon.
  arXiv  Detail & Related papers  (2020-07-16T13:27:47Z)
• Coverage probability in wireless networks with determinantal scheduling [1.4502611532302039]
  We propose a new class of algorithms for randomly scheduling network transmissions. We show that, similarly to Aloha, they are also subject to elegant analysis of the coverage probabilities and transmission attempts.
  arXiv  Detail & Related papers  (2020-06-09T04:05:50Z)
• The Benefits of Pairwise Discriminators for Adversarial Training [1.7188280334580193]
  We introduce a family of objectives by leveraging pairwise discriminators, and show that only the generator needs to converge. We provide sufficient conditions for local convergence; characterize the capacity balance that should guide the discriminator and generator choices. We show that practical methods derived from our approach can better generate higher-resolution images.
  arXiv  Detail & Related papers  (2020-02-20T08:43:59Z)
• Discrimination of POVMs with rank-one effects [62.997667081978825]
  This work provides an insight into the problem of discrimination of positive operator valued measures with rank-one effects. We compare two possible discrimination schemes: the parallel and adaptive ones. We provide an explicit algorithm which allows us to find this adaptive scheme.
  arXiv  Detail & Related papers  (2020-02-13T11:34:50Z)

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.