Unitary channel discrimination beyond group structures: Advantages of sequential and indefinite-causal-order strategies

• URL: http://arxiv.org/abs/2105.13369v3
• Date: Fri, 13 May 2022 13:14:50 GMT
• Title: Unitary channel discrimination beyond group structures: Advantages of sequential and indefinite-causal-order strategies
• Authors: Jessica Bavaresco, Mio Murao, Marco T\'ulio Quintino
• Abstract summary: 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.
• Score: 3.222802562733787
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: For minimum-error channel discrimination tasks that involve only unitary channels, we show that sequential strategies may outperform the parallel ones. Additionally, we show that general strategies that involve indefinite causal order are also advantageous for this task. However, for the task of discriminating a uniformly distributed set of unitary channels that forms a group, we show that parallel strategies are, indeed, optimal, even when compared to general strategies. We also show that strategies based on the quantum switch cannot outperform sequential strategies in the discrimination of unitary channels. Finally, we derive an absolute upper bound for the maximal probability of successfully discriminating any set of unitary channels with any number of copies for the most general strategies that are suitable for channel discrimination. Our bound is tight since it is saturated by sets of unitary channels forming a group k-design.

Related papers

• From Similarity to Superiority: Channel Clustering for Time Series Forecasting [61.96777031937871]
  We develop a novel and adaptable Channel Clustering Module ( CCM) CCM dynamically groups channels characterized by intrinsic similarities and leverages cluster information instead of individual channel identities. CCM can boost the performance of CI and CD models by an average margin of 2.4% and 7.2% on long-term and short-term forecasting, respectively.
  arXiv  Detail & Related papers  (2024-03-31T02:46:27Z)
• 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)
• Composite Classical and Quantum Channel Discrimination [6.553031877558699]
  We study the problem of binary composite channel discrimination in the asymmetric setting, where the hypotheses are given by fairly arbitrary sets of channels. We show that there can be an advantage to channel discrimination strategies with composite hypotheses for classical channels, unlike in general general simple hypotheses.
  arXiv  Detail & Related papers  (2023-03-03T15:31:38Z)
• Group-covariant extreme and quasi-extreme channels [0.0]
  We introduce a systematic approach that enables us to construct exactly those extreme channels that are covariant with respect to a finite discrete group or a compact connected Lie group. We formalize the problem of constructing and classifying group-covariant generalized extreme channels, thereby yielding an algorithmic approach to solving, which we express as pseudocode.
  arXiv  Detail & Related papers  (2022-10-07T10:43:19Z)
• Rethinking Clustering-Based Pseudo-Labeling for Unsupervised Meta-Learning [146.11600461034746]
  Method for unsupervised meta-learning, CACTUs, is a clustering-based approach with pseudo-labeling. This approach is model-agnostic and can be combined with supervised algorithms to learn from unlabeled data. We prove that the core reason for this is lack of a clustering-friendly property in the embedding space.
  arXiv  Detail & Related papers  (2022-09-27T19:04:36Z)
• Weakly-supervised Action Localization via Hierarchical Mining [76.00021423700497]
  Weakly-supervised action localization aims to localize and classify action instances in the given videos temporally with only video-level categorical labels. We propose a hierarchical mining strategy under video-level and snippet-level manners, i.e., hierarchical supervision and hierarchical consistency mining. We show that HiM-Net outperforms existing methods on THUMOS14 and ActivityNet1.3 datasets with large margins by hierarchically mining the supervision and consistency.
  arXiv  Detail & Related papers  (2022-06-22T12:19:09Z)
• Parallelization of Adaptive Quantum Channel Discrimination in the Non-Asymptotic Regime [11.538345159297839]
  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.
  arXiv  Detail & Related papers  (2022-06-16T17:52:49Z)
• Channel-wise Knowledge Distillation for Dense Prediction [73.99057249472735]
  We propose to align features channel-wise between the student and teacher networks. We consistently achieve superior performance on three benchmarks with various network structures.
  arXiv  Detail & Related papers  (2020-11-26T12:00:38Z)
• Strict hierarchy between parallel, sequential, and indefinite-causal-order strategies for channel discrimination [3.222802562733787]
  We present an instance of minimum-error discrimination of two qubit-qubit quantum channels for which a sequential strategy outperforms any parallel strategy. We establish two new classes of strategies for channel discrimination that involve indefinite causal order and show that there exists a strict hierarchy among the performance of all four strategies.
  arXiv  Detail & Related papers  (2020-11-16T21:49:43Z)
• Towards Robust Fine-grained Recognition by Maximal Separation of Discriminative Features [72.72840552588134]
  We identify the proximity of the latent representations of different classes in fine-grained recognition networks as a key factor to the success of adversarial attacks. We introduce an attention-based regularization mechanism that maximally separates the discriminative latent features of different classes.
  arXiv  Detail & Related papers  (2020-06-10T18:34:45Z)
• The Devil is in the Channels: Mutual-Channel Loss for Fine-Grained Image Classification [67.79883226015824]
  Key for solving fine-grained image categorization is finding discriminate and local regions that correspond to subtle visual traits. In this paper, we show it is possible to cultivate subtle details without the need for overly complicated network designs or training mechanisms. The proposed loss function, termed as mutual-channel loss (MC-Loss), consists of two channel-specific components.
  arXiv  Detail & Related papers  (2020-02-11T09:12:45Z)

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.