Strict hierarchy between parallel, sequential, and indefinite-causal-order strategies for channel discrimination

• URL: http://arxiv.org/abs/2011.08300v2
• Date: Wed, 17 Nov 2021 11:40:39 GMT
• Title: Strict hierarchy between parallel, sequential, and indefinite-causal-order strategies for channel discrimination
• Authors: Jessica Bavaresco, Mio Murao, Marco T\'ulio Quintino
• Abstract summary: 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.
• Score: 3.222802562733787
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present an instance of a task of minimum-error discrimination of two qubit-qubit quantum channels for which a sequential strategy outperforms any parallel strategy. We then 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. Our proof technique employs a general method of computer-assisted proofs. We also provide a systematic method for finding pairs of channels that showcase this phenomenon, demonstrating that the hierarchy between the strategies is not exclusive to our main example.

Related papers

• A Provably Efficient Option-Based Algorithm for both High-Level and Low-Level Learning [54.20447310988282]
  We present a meta-algorithm alternating between regret minimization algorithms instanced at different (high and low) temporal abstractions. At the higher level, we treat the problem as a Semi-Markov Decision Process (SMDP), with fixed low-level policies, while at a lower level, inner option policies are learned with a fixed high-level policy.
  arXiv  Detail & Related papers  (2024-06-21T13:17:33Z)
• Noise Contrastive Estimation-based Matching Framework for Low-Resource Security Attack Pattern Recognition [49.536368818512116]
  Tactics, Techniques and Procedures (TTPs) represent sophisticated attack patterns in the cybersecurity domain. We formulate the problem in a different learning paradigm, where the assignment of a text to a TTP label is decided by the direct semantic similarity between the two. We propose a neural matching architecture with an effective sampling-based learn-to-compare mechanism.
  arXiv  Detail & Related papers  (2024-01-18T19:02:00Z)
• 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)
• Safe Multi-agent Learning via Trapping Regions [89.24858306636816]
  We apply the concept of trapping regions, known from qualitative theory of dynamical systems, to create safety sets in the joint strategy space for decentralized learning. We propose a binary partitioning algorithm for verification that candidate sets form trapping regions in systems with known learning dynamics, and a sampling algorithm for scenarios where learning dynamics are not known.
  arXiv  Detail & Related papers  (2023-02-27T14:47:52Z)
• 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)
• Optimal Strategies of Quantum Metrology with a Strict Hierarchy [3.706744588098214]
  We identify the ultimate precision limit of different families of strategies, including the parallel, the sequential, and the indefinite-causal-order strategies. We provide an efficient algorithm that determines an optimal strategy within the family of strategies under consideration.
  arXiv  Detail & Related papers  (2022-03-18T06:14:56Z)
• 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)
• Learning explanations that are hard to vary [75.30552491694066]
  We show that averaging across examples can favor memorization and patchwork' solutions that sew together different strategies. We then propose and experimentally validate a simple alternative algorithm based on a logical AND.
  arXiv  Detail & Related papers  (2020-09-01T10:17:48Z)

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.