Parallelization of Adaptive Quantum Channel Discrimination in the Non-Asymptotic Regime

• URL: http://arxiv.org/abs/2206.08350v2
• Date: Wed, 17 Jan 2024 03:17:47 GMT
• Title: Parallelization of Adaptive Quantum Channel Discrimination in the Non-Asymptotic Regime
• Authors: Bjarne Bergh, Nilanjana Datta, Robert Salzmann, Mark M. Wilde
• Abstract summary: We investigate the performance of parallel and adaptive quantum channel discrimination strategies for a finite number of channel uses. We extend this result to the non-asymptotic regime with finitely many channel uses by explicitly constructing a parallel strategy for any given adaptive strategy.
• Score: 11.538345159297839
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We investigate the performance of parallel and adaptive quantum channel discrimination strategies for a finite number of channel uses. It has recently been shown that, in the asymmetric setting with asymptotically vanishing type I error probability, adaptive strategies are asymptotically not more powerful than parallel ones. We extend this result to the non-asymptotic regime with finitely many channel uses, by explicitly constructing a parallel strategy for any given adaptive strategy, and bounding the difference in their performances, measured in terms of the decay rate of the type II error probability per channel use. We further show that all parallel strategies can be optimized over in time polynomial in the number of channel uses, and hence our result can also be used to obtain a poly-time-computable asymptotically tight upper bound on the performance of general adaptive strategies.

Related papers

• Infinite Dimensional Asymmetric Quantum Channel Discrimination [8.056359341994941]
  We study asymmetric binary channel discrimination, for qantum channels acting on separable spaces. We show that under finiteness of the geometric R'enyi divergence between the two channels for some $alpha > 1$, adaptive strategies offer no advantage over parallel ones.
  arXiv  Detail & Related papers  (2023-08-24T17:56:19Z)
• Offline Policy Optimization in RL with Variance Regularizaton [142.87345258222942]
  We propose variance regularization for offline RL algorithms, using stationary distribution corrections. We show that by using Fenchel duality, we can avoid double sampling issues for computing the gradient of the variance regularizer. The proposed algorithm for offline variance regularization (OVAR) can be used to augment any existing offline policy optimization algorithms.
  arXiv  Detail & Related papers  (2022-12-29T18:25:01Z)
• Using adaptiveness and causal superpositions against noise in quantum metrology [0.0]
  We derive new bounds on achievable precision in the most general adaptive quantum metrological scenarios. The bounds are proven to be saturable and equivalent to the known parallel scheme bounds in the limit of large number of channel uses.
  arXiv  Detail & Related papers  (2022-12-15T19:43:24Z)
• Sequential Quantum Channel Discrimination [19.785872350085878]
  We consider the sequential quantum channel discrimination problem using adaptive and non-adaptive strategies. We show that both types of error probabilities decrease to zero exponentially fast. We conjecture that the achievable rate region is not larger than that achievable with POVMs.
  arXiv  Detail & Related papers  (2022-10-20T08:13:39Z)
• Unitary channel discrimination beyond group structures: Advantages of sequential and indefinite-causal-order strategies [3.222802562733787]
  For minimum-error channel discrimination tasks, we show that sequential strategies may outperform the parallel ones. For the task of discriminating a uniformly distributed set of unitary channels that forms a group, we show that parallel strategies are, indeed, optimal. We also show that strategies based on the quantum switch cannot outperform sequential strategies in the discrimination of unitary channels.
  arXiv  Detail & Related papers  (2021-05-27T18:00:06Z)
• Usefulness of adaptive strategies in asymptotic quantum channel discrimination [43.7637825272776]
  We investigate the usefulness of adaptive methods in the framework of binary hypothesis testing. There is a fundamental distinction between adaptive and non-adaptive strategies with respect to the channel uses. We show that adaptive strategies with classical feedback do not increase the discrimination power of the channel beyond non-adaptive product input strategies.
  arXiv  Detail & Related papers  (2020-11-12T18:40:47Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)
• Slice Sampling for General Completely Random Measures [74.24975039689893]
  We present a novel Markov chain Monte Carlo algorithm for posterior inference that adaptively sets the truncation level using auxiliary slice variables. The efficacy of the proposed algorithm is evaluated on several popular nonparametric models.
  arXiv  Detail & Related papers  (2020-06-24T17:53:53Z)
• Is Temporal Difference Learning Optimal? An Instance-Dependent Analysis [102.29671176698373]
  We address the problem of policy evaluation in discounted decision processes, and provide Markov-dependent guarantees on the $ell_infty$error under a generative model. We establish both and non-asymptotic versions of local minimax lower bounds for policy evaluation, thereby providing an instance-dependent baseline by which to compare algorithms.
  arXiv  Detail & Related papers  (2020-03-16T17:15:28Z)
• Adaptivity of Stochastic Gradient Methods for Nonconvex Optimization [71.03797261151605]
  Adaptivity is an important yet under-studied property in modern optimization theory. Our algorithm is proved to achieve the best-available convergence for non-PL objectives simultaneously while outperforming existing algorithms for PL objectives.
  arXiv  Detail & Related papers  (2020-02-13T05:42:27Z)

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.