Hidden-Field Coordination Reveals Payoff-Free Quantum Correlation Structure in Decentralized Coordination

• URL: http://arxiv.org/abs/2601.21139v1
• Date: Thu, 29 Jan 2026 00:46:23 GMT
• Title: Hidden-Field Coordination Reveals Payoff-Free Quantum Correlation Structure in Decentralized Coordination
• Authors: Sinan Bugu,
• Abstract summary: We study decentralized multi-agent coordination where agents must correlate actions against an unobserved field and cannot communicate.<n>We introduce the Hidden-Field Coordination model, which enforces identical information access and no-signaling constraints across strategies.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study decentralized multi-agent coordination where agents must correlate actions against an unobserved field and cannot communicate. To isolate correlation geometry from payoff optimization, we introduce the Hidden-Field Coordination (HFC) model, which enforces identical information access and no-signaling constraints across strategies. Using information-theoretic diagnostics, we compare classical shared-randomness baselines with an entanglement-mediated strategy based on multipartite W states and a strictly local Spontaneous Leader Election rule. Within the restricted symmetric shared-latent baseline studied here, increasing total correlation is achieved primarily by driving actions toward alignment (copying), which also increases pairwise coincidence (collisions). By contrast, the quantum strategy realizes a collision-suppressing coordination regime: it preserves global dependence while reducing pairwise coincidence below the independent (product) baseline induced by the common marginal distribution. This produces a geometric separation in the joint-action distribution. Classical baselines concentrate probability near the diagonal of action equality, whereas the entanglement-mediated mapping occupies an offset-diagonal region associated with relational roles. Accordingly, the entanglement signature in this setting is not higher correlation magnitude; total-correlation differentials can be negative relative to the classical copying optimum. Instead, it reflects a change in dependence geometry that supports robust anti-coordination.

Related papers

• Stability and Generalization of Push-Sum Based Decentralized Optimization over Directed Graphs [55.77845440440496]
  Push-based decentralized communication enables optimization over communication networks, where information exchange may be asymmetric.<n>We develop a unified uniform-stability framework for the Gradient Push (SGP) algorithm.<n>A key technical ingredient is an imbalance-aware generalization bound through two quantities.
  arXiv  Detail & Related papers  (2026-02-24T05:32:03Z)
• From Local Nonclassicality to Entanglement: A Convexity Law for Single-Excitation Dynamics [0.5541461456285174]
  We prove a simple dynamical law for excitation-preserving interactions.<n>The sum of local Wigner negativities is upper-bounded by a fixed budget set by the initially excited state.<n>The predicted trajectory of the summed local negativity provides a practical hardware metric.
  arXiv  Detail & Related papers  (2025-11-13T16:40:44Z)
• Unifying Information-Theoretic and Pair-Counting Clustering Similarity [51.660331450043806]
  Clustering similarity measures are typically organized into two principal families, pair-counting and information-theoretic.<n>Here, we develop an analytical framework that unifies these families through two complementary perspectives.
  arXiv  Detail & Related papers  (2025-11-04T21:13:32Z)
• Fundamental limits to contrast reversal of self-fidelity correlations [0.0]
  In measurement design, it is common to engineer anti-contrast readouts.<n>We ask whether two evolutions can be made uniformly opposite over a broad input ensemble.<n>We adopt the Pearson correlation coefficient as a device-agnostic measure of global opposition between two evolutions.
  arXiv  Detail & Related papers  (2025-09-30T15:07:28Z)
• Joint Cooperative and Non-Cooperative Localization in WSNs with Distributed Scaled Proximal ADMM Algorithms [11.088311601906284]
  Cooperative and non-cooperative localization arise together in wireless sensor networks.<n>We develop the Scaled Proximal Direction Method of Multipliers for Joint Cooperative and Non-Cooperative localization.
  arXiv  Detail & Related papers  (2025-09-21T14:32:53Z)
• Spectral Algorithms in Misspecified Regression: Convergence under Covariate Shift [0.2578242050187029]
  spectral algorithms are a class of regularization methods originating from inverse problems.<n>In this paper, we investigate the convergence properties of spectral algorithms under covariate shift.<n>We provide a theoretical analysis of the more challenging misspecified case, in which the target function does not belong to the kernel reproducing Hilbert space (RKHS)
  arXiv  Detail & Related papers  (2025-09-05T13:42:27Z)
• Offline Multi-agent Reinforcement Learning via Score Decomposition [51.23590397383217]
  offline cooperative multi-agent reinforcement learning (MARL) faces unique challenges due to distributional shifts.<n>This work is the first work to explicitly address the distributional gap between offline and online MARL.
  arXiv  Detail & Related papers  (2025-05-09T11:42:31Z)
• Generalization Bounds of Surrogate Policies for Combinatorial Optimization Problems [53.03951222945921]
  We analyze smoothed (perturbed) policies, adding controlled random perturbations to the direction used by the linear oracle.<n>Our main contribution is a generalization bound that decomposes the excess risk into perturbation bias, statistical estimation error, and optimization error.<n>We illustrate the scope of the results on applications such as vehicle scheduling, highlighting how smoothing enables both tractable training and controlled generalization.
  arXiv  Detail & Related papers  (2024-07-24T12:00:30Z)
• Collaborative Heterogeneous Causal Inference Beyond Meta-analysis [68.4474531911361]
  We propose a collaborative inverse propensity score estimator for causal inference with heterogeneous data. Our method shows significant improvements over the methods based on meta-analysis when heterogeneity increases.
  arXiv  Detail & Related papers  (2024-04-24T09:04:36Z)
• Generalizable Heterogeneous Federated Cross-Correlation and Instance Similarity Learning [60.058083574671834]
  This paper presents a novel FCCL+, federated correlation and similarity learning with non-target distillation. For heterogeneous issue, we leverage irrelevant unlabeled public data for communication. For catastrophic forgetting in local updating stage, FCCL+ introduces Federated Non Target Distillation.
  arXiv  Detail & Related papers  (2023-09-28T09:32:27Z)
• Dealing with Non-Stationarity in Multi-Agent Reinforcement Learning via Trust Region Decomposition [52.06086375833474]
  Non-stationarity is one thorny issue in multi-agent reinforcement learning. We introduce a $delta$-stationarity measurement to explicitly model the stationarity of a policy sequence. We propose a trust region decomposition network based on message passing to estimate the joint policy divergence.
  arXiv  Detail & Related papers  (2021-02-21T14:46:50Z)
• Correlance and Discordance: Computable Measures of Nonlocal Correlation [0.0]
  We present six new measures of nonlocal correlation for discrete multipartite quantum systems. Correlance is exactly computable for all pure and mixed states. Statance and probablance are not yet computable.
  arXiv  Detail & Related papers  (2020-01-09T06:18:07Z)

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.