Generalized quantum process discrimination problems

• URL: http://arxiv.org/abs/2104.09759v4
• Date: Sat, 19 Feb 2022 07:31:25 GMT
• Title: Generalized quantum process discrimination problems
• Authors: Kenji Nakahira, Kentaro Kato
• Abstract summary: 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.
• Score: 2.538209532048866
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study a broad class of quantum process discrimination problems that can handle many optimization strategies such as the Bayes, Neyman-Pearson, and unambiguous strategies, where each process can consist of multiple time steps and can have an internal memory. Given a collection of candidate processes, our task is to find a discrimination strategy, which may be adaptive and/or entanglement-assisted, that maximizes a given objective function subject to given constraints. Our problem can be formulated as a convex problem. Its Lagrange dual problem with no duality gap and necessary and sufficient conditions for an optimal solution are derived. We also 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. A minimax strategy for a process discrimination problem is also discussed. As applications of our results, we provide some problems in which an adaptive strategy is not necessary for optimal discrimination. We also present an example of single-shot channel discrimination for which an analytical solution can be obtained.

Related papers

• Learning Multiple Initial Solutions to Optimization Problems [52.9380464408756]
  Sequentially solving similar optimization problems under strict runtime constraints is essential for many applications. We propose learning to predict emphmultiple diverse initial solutions given parameters that define the problem instance. We find significant and consistent improvement with our method across all evaluation settings and demonstrate that it efficiently scales with the number of initial solutions required.
  arXiv  Detail & Related papers  (2024-11-04T15:17:19Z)
• Optimizing Solution-Samplers for Combinatorial Problems: The Landscape of Policy-Gradient Methods [52.0617030129699]
  We introduce a novel theoretical framework for analyzing the effectiveness of DeepMatching Networks and Reinforcement Learning methods. Our main contribution holds for a broad class of problems including Max-and Min-Cut, Max-$k$-Bipartite-Bi, Maximum-Weight-Bipartite-Bi, and Traveling Salesman Problem. As a byproduct of our analysis we introduce a novel regularization process over vanilla descent and provide theoretical and experimental evidence that it helps address vanishing-gradient issues and escape bad stationary points.
  arXiv  Detail & Related papers  (2023-10-08T23:39:38Z)
• Strategies for single-shot discrimination of process matrices [0.0]
  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.
  arXiv  Detail & Related papers  (2022-10-26T09:14:58Z)
• A Constrained Optimization Approach to Bilevel Optimization with Multiple Inner Minima [49.320758794766185]
  We propose a new approach, which convert the bilevel problem to an equivalent constrained optimization, and then the primal-dual algorithm can be used to solve the problem. Such an approach enjoys a few advantages including (a) addresses the multiple inner minima challenge; (b) fully first-order efficiency without Jacobian computations.
  arXiv  Detail & Related papers  (2022-03-01T18:20:01Z)
• Learning Proximal Operators to Discover Multiple Optima [66.98045013486794]
  We present an end-to-end method to learn the proximal operator across non-family problems. We show that for weakly-ized objectives and under mild conditions, the method converges globally.
  arXiv  Detail & Related papers  (2022-01-28T05:53:28Z)
• Navigating to the Best Policy in Markov Decision Processes [68.8204255655161]
  We investigate the active pure exploration problem in Markov Decision Processes. Agent sequentially selects actions and, from the resulting system trajectory, aims at the best as fast as possible.
  arXiv  Detail & Related papers  (2021-06-05T09:16:28Z)
• Diversity in Kemeny Rank Aggregation: A Parameterized Approach [3.6603644500568806]
  A recent trend in artificial intelligence, called solution diversity, has focused on the development of notions of optimality. In this work, we investigate the impact of this combination in the field of Kemeny Rank Aggregation. Our main results work both when considering the traditional setting of aggregation over linearly ordered votes, and in the more general setting where votes are partially ordered.
  arXiv  Detail & Related papers  (2021-05-19T21:50:03Z)
• Quantum process discrimination with restricted strategies [2.030567625639093]
  We present a general formulation of the task of finding the maximum success probability for discriminating quantum processes. We derive necessary and sufficient conditions for an optimal restricted strategy to be optimal within the set of all strategies. This finding has the potential to provide a deeper insight into the discrimination performance of various restricted strategies.
  arXiv  Detail & Related papers  (2021-04-19T04:02:51Z)
• Learning the Solution Manifold in Optimization and Its Application in Motion Planning [4.177892889752434]
  We learn manifold on the variable such as the variable such model represents an infinite set of solutions. In our framework, we reduce problem estimation by using this importance. We apply to motion-planning problems, which involve the optimization of high-dimensional parameters.
  arXiv  Detail & Related papers  (2020-07-24T08:05:36Z)
• Convergence of adaptive algorithms for weakly convex constrained optimization [59.36386973876765]
  We prove the $mathcaltilde O(t-1/4)$ rate of convergence for the norm of the gradient of Moreau envelope. Our analysis works with mini-batch size of $1$, constant first and second order moment parameters, and possibly smooth optimization domains.
  arXiv  Detail & Related papers  (2020-06-11T17:43:19Z)
• Discriminative Learning via Adaptive Questioning [6.378513792050356]
  We consider the problem of designing an adaptive sequence of questions that optimally classify a candidate's ability into one of several categories or discriminative grades. A candidate's ability is modeled as an unknown parameter, which, together with the difficulty of the question asked, determines the likelihood with which s/he is able to answer a question correctly.
  arXiv  Detail & Related papers  (2020-04-11T16:50:00Z)

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.