Structure of quantum measurements implementable with one round of classical communication

• URL: http://arxiv.org/abs/2510.09381v1
• Date: Fri, 10 Oct 2025 13:37:02 GMT
• Title: Structure of quantum measurements implementable with one round of classical communication
• Abstract summary: We show how to distinguish between adaptive and non-adaptive measurements strategies.<n>We discuss explicit instances of state ensembles where non-projective measurements provide an advantage.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Measurements that can be implemented via local operations and classical communication (LOCC) constitute a class of operations that is available in future quantum networks in which parties share entangled resource states. We characterise the different classes of measurements implementable with LOCC, where communication is restricted to a single round with a fixed direction. In particular, using the framework of constrained separability problems, we provide a complete characterisation of the class of LOCC measurements that require one round of classical communication with a limit on the transmitted information. Furthermore, we show how to distinguish between adaptive and non-adaptive measurements strategies. Using our techniques we present examples where the success probability of state discrimination depends on the direction of communication as well as on the message size. We also discuss explicit instances of state ensembles where non-projective measurements provide an advantage and where adaptive measurement strategies lead to improved success rates when compared to all non-adaptive strategies.

Related papers

• Strategic Feature Selection [62.74494413516484]
  We study strategic classification through feature selection and its interaction with ridge regularization.<n>We provide a fine-grained characterization of the performance of a feature subset under optimal regularization.<n>Motivated by this characterization, we develop a practical algorithm for jointly choosing the feature set and the level of ridge regularization.
  arXiv  Detail & Related papers  (2026-06-17T09:47:15Z)
• Nonclassical traits in multi-copy state discrimination [0.4525084953138771]
  We consider minimum error discrimination of multi-copy states, where instead of preparing a single system we assume that multiple instances of the same state are prepared.<n>By comparing the average success probabilities in quantum and classical cases, we find a qubit strategy that outperforms all the bit strategies.
  arXiv  Detail & Related papers  (2026-04-29T13:13:21Z)
• Entanglement assisted communication complexity measured by distinguishability [0.6299766708197883]
  We investigate the quantum advantage that can arise in typical two-party communication scenarios.<n>We show that entanglement-assisted communication, both classical and quantum, can outperform classical communication.
  arXiv  Detail & Related papers  (2026-03-19T16:33:35Z)
• Communication-constrained nonlocal correlations [0.0]
  Communication-based proposals highlight the role of communication in ruling out unphysical theories.<n>We employ the general information-theoretic framework to derive new operational constraints preventing such unphysical behaviors.
  arXiv  Detail & Related papers  (2026-03-09T16:56:50Z)
• Event-Triggered Gossip for Distributed Learning [61.70659996356528]
  We develop a new event-triggered gossip framework for distributed learning to reduce inter-node communication.<n>We analyze bf71.61% with only a marginal performance loss, compared with the conventional full-text-of-the-art distributed learning methods.
  arXiv  Detail & Related papers  (2026-02-22T10:13:43Z)
• Practical Advantage of Classical Communication in Entanglement Detection [3.3058905316005744]
  Entanglement is the cornerstone of quantum communication, yet conventional detection relies solely on local measurements.<n>We present a unified theoretical and experimental framework demonstrating that one-way local operations and classical communication (1-LOCC) can significantly outperform purely local measurements in detecting high-dimensional quantum entanglement.
  arXiv  Detail & Related papers  (2025-04-14T01:33:20Z)
• Learning to Cooperate and Communicate Over Imperfect Channels [27.241873614561538]
  We consider a cooperative multi-agent system where the agents act and exchange information in a decentralized manner using a limited and unreliable channel. Our method allows agents to dynamically adapt how much information to share by sending messages of different sizes. We show that our approach outperforms approaches without adaptive capabilities in a novel cooperative digit-prediction environment.
  arXiv  Detail & Related papers  (2023-11-24T12:15:48Z)
• Codes for entanglement-assisted classical communication [1.7188280334580197]
  Entanglement-assisted classical communication (EACC) aims to enhance communication systems using entanglement as an additional resource. We introduce a new EACC scheme capable of correcting a fixed number of erasures/errors. It can be adjusted to the available amount of entanglement and sends classical information over a quantum channel.
  arXiv  Detail & Related papers  (2023-10-30T17:44:33Z)
• Cognitive Semantic Communication Systems Driven by Knowledge Graph: Principle, Implementation, and Performance Evaluation [74.38561925376996]
  Two cognitive semantic communication frameworks are proposed for the single-user and multiple-user communication scenarios. An effective semantic correction algorithm is proposed by mining the inference rule from the knowledge graph. For the multi-user cognitive semantic communication system, a message recovery algorithm is proposed to distinguish messages of different users.
  arXiv  Detail & Related papers  (2023-03-15T12:01:43Z)
• On Leave-One-Out Conditional Mutual Information For Generalization [122.2734338600665]
  We derive information theoretic generalization bounds for supervised learning algorithms based on a new measure of leave-one-out conditional mutual information (loo-CMI) Contrary to other CMI bounds, our loo-CMI bounds can be computed easily and can be interpreted in connection to other notions such as classical leave-one-out cross-validation. We empirically validate the quality of the bound by evaluating its predicted generalization gap in scenarios for deep learning.
  arXiv  Detail & Related papers  (2022-07-01T17:58:29Z)
• Adaptive advantage in entanglement-assisted communications [0.0]
  Entanglement-assisted classical communication protocols usually consist of two successive rounds. We show that adaptive protocols improve the success probability in Random Access Codes. We briefly discuss extension of these ideas to scenarios involving quantum communication.
  arXiv  Detail & Related papers  (2022-03-10T13:54:02Z)
• Adapting Segmentation Networks to New Domains by Disentangling Latent Representations [14.050836886292869]
  Domain adaptation approaches have come into play to transfer knowledge acquired on a label-abundant source domain to a related label-scarce target domain. We propose a novel performance metric to capture the relative efficacy of an adaptation strategy compared to supervised training.
  arXiv  Detail & Related papers  (2021-08-06T09:43:07Z)
• Quasi-Equivalence Discovery for Zero-Shot Emergent Communication [63.175848843466845]
  We present a novel problem setting and the Quasi-Equivalence Discovery algorithm that allows for zero-shot coordination (ZSC) We show that these two factors lead to unique optimal ZSC policies in referential games. QED can iteratively discover the symmetries in this setting and converges to the optimal ZSC policy.
  arXiv  Detail & Related papers  (2021-03-14T23:42:37Z)
• CosSGD: Nonlinear Quantization for Communication-efficient Federated Learning [62.65937719264881]
  Federated learning facilitates learning across clients without transferring local data on these clients to a central server. We propose a nonlinear quantization for compressed gradient descent, which can be easily utilized in federated learning. Our system significantly reduces the communication cost by up to three orders of magnitude, while maintaining convergence and accuracy of the training process.
  arXiv  Detail & Related papers  (2020-12-15T12:20:28Z)
• Communication-Efficient and Distributed Learning Over Wireless Networks: Principles and Applications [55.65768284748698]
  Machine learning (ML) is a promising enabler for the fifth generation (5G) communication systems and beyond. This article aims to provide a holistic overview of relevant communication and ML principles, and thereby present communication-efficient and distributed learning frameworks with selected use cases.
  arXiv  Detail & Related papers  (2020-08-06T12:37:14Z)
• Learning Structured Communication for Multi-agent Reinforcement Learning [104.64584573546524]
  This work explores the large-scale multi-agent communication mechanism under a multi-agent reinforcement learning (MARL) setting. We propose a novel framework termed as Learning Structured Communication (LSC) by using a more flexible and efficient communication topology.
  arXiv  Detail & Related papers  (2020-02-11T07:19: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.