Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2601.21139

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

Sinan Bugu

quant-phSubmitted Jan 29, 2026• Announced Jan 30, 2026• 1 citation
v1 · Jan 29, 2026v2 · Jul 21, 2026
arXivHTMLPDF

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

Learning to Coordinate via Quantum Entanglement in Multi-Agent Reinforcement Learning

John Gardiner, Orlando Romero, Brendan Tivnan +2 more

The inability to communicate poses a major challenge to coordination in multi-agent reinforcement learning (MARL). Prior work has explored correlating local policies via shared randomness, sometimes in the form of a correlation device, as a mechanism to assist in decentralized decision-making. In contrast, this work introduces the first framework for training MARL agents to exploit shared quantum entanglement as a coordination resource, which permits a larger class of communication-free correlated policies than shared randomness alone. This is motivated by well-known results in quantum physics which posit that, for certain single-round cooperative games with no communication, shared quantum entanglement enables strategies that outperform those that only use shared randomness. In such cases, we say that there is quantum advantage. Our framework is based on a novel differentiable policy parameterization that enables optimization over quantum measurements, together with a novel policy architecture that decomposes joint policies into a quantum coordinator and decentralized local actors. To illustrate the effectiveness of our proposed method, we first show that we can learn, purely from experience, strategies that attain quantum advantage in single-round games that are treated as black box oracles. We then demonstrate how our machinery can learn policies with quantum advantage in an illustrative multi-agent sequential decision-making problem formulated as a decentralized partially observable Markov decision process (Dec-POMDP).

cs.MACross-listedarXiv:2602.08965•Feb 10, 2026•4 citations

Entanglement improves coordination in distributed systems

Francisco Ferreira da Silva, Stephanie Wehner

Coordination in distributed systems is often hampered by communication latency, which degrades performance. Quantum entanglement offers fundamentally stronger correlations than classically achievable without communication. Crucially, these correlations manifest instantaneously upon measurement, irrespective of the physical distance separating the systems. We investigate the application of shared entanglement to a dual-work optimization problem in a distributed system comprising two servers. The system must process both a continuously available, preemptible baseline task and incoming customer requests arriving in pairs. System performance is characterized by the trade-off between baseline task throughput and customer waiting time. We present a rigorous analytical model demonstrating that when the baseline task throughput function is strictly convex, rewarding longer uninterrupted processing periods, entanglement-assisted routing strategies achieve Pareto-superior performance compared to optimal communication-free classical strategies. We prove this advantage through queueing-theoretic analysis, non-local game formulation, and computational certification of classical bounds. Our results identify distributed scheduling and coordination as a novel application domain for near-term entanglement-based quantum networks.

quant-pharXiv:2602.04588•Physical Review A•Feb 5, 2026•2 citations

Testing Quantum Advantage in High-Frequency Trading with Market-Derived Nonlocal Games

Daiwei Zhu, Brendan Pankovich, Alireza Marefat Khah +4 more

Non-classical correlations enabled by entanglement could be exploited for distributed coordination tasks with communication constraints such as high-frequency trading in fragmented markets. However, previous studies have largely specified the game and its payoff structure theoretically, using toy market models without testing how well these models reflect observed market behavior. Here, we introduce market-derived nonlocal games, in which historical order-book data and backtests of joint actions determine the game's inputs and payoffs, rather than a prespecified idealized model. We start from classical trading strategies based on market considerations, using quantum correlations only to coordinate the agents' decisions. We compute exact classical optima and quantum upper bounds for the payoff. For games with a possible quantum advantage, we introduce an optimization algorithm to find explicit entangled strategies and end-to-end backtest them on historical data. We demonstrate the approach in a two-agent, three-stock cross-venue arbitrage setting. The game derived from the observed market data shows no resolved quantum-classical gap at the measured interaction scales. Controlled variations in liquidity competition and cross-stock repricing then show how the approach identifies regimes supporting quantum advantage, constructs explicit strategies, and tests whether their advantage survives end-to-end backtesting on modified historical market data.

arXiv:2611.16113•Nov 11, 2026•0 citations

Quantum Coordination without Conditioning under Restricted Information

Faisal Shah Khan

We study which joint probability distributions can be implemented by distributed systems when agents have restricted information. Classical local operations cannot implement all distributions that are achievable with full conditioning on history. We show that shared quantum states can overcome this limitation even when using only separable states. In particular, separable states that are diagonal in a fixed basis allow certain joint distributions to be implemented through local measurements without requiring agents to condition on an inaccessible latent variable. These distributions cannot be implemented by classical local rules under the same information constraints. However, quantum implementations cannot reproduce fully adaptive dependence on past outcomes when those outcomes are observationally indistinguishable. Quantum state preparation therefore provides a partial operational substitute for perfect recall under restricted information.

quant-pharXiv:2604.27173•May 1, 2026•0 citations

Quantum Coordination and Nonlocal Games: Theory and Applications

Husein Natur, Uzi Pereg

Coordination is a fundamental primitive in communication and information theory, in which distributed systems must collectively generate correlated behavior rather than merely exchange messages. In quantum networks, the nature of entanglement, quantum measurements, and nonclassical correlations introduces coordination possibilities unavailable classically. This article reviews recent advances in coordination over classical and quantum communication networks, focusing on empirical and strong coordination in multi-user settings. We consider the implications of coordination for nonlocal games, showing how it provides a natural framework for understanding the correlations that enable spatially separated players to improve their probability of winning. We present a unified framework for coordination using classical or quantum communication and pre-shared correlation resources. The review covers simulation of both entanglement and separable correlations across a variety of network architectures, including two-node, cascade, broadcast, and multiple-access networks. We study the operational differences between empirical and strong coordination, and the tradeoffs between communication and correlation resources, such as pre-shared randomness and entanglement. Coordination plays a major role in device-independent quantum key distribution (DI-QKD) schemes, in which parties can generate a secret key even if the devices used in the process have been prepared by an adversary. Furthermore, we examine the role of coordination in quantum repeaters, where distributed entanglement serves as a resource for long-distance quantum communication. The review highlights connections between coordination theory and applications such as distributed quantum systems, quantum internet architectures, and future communication networks.

quant-pharXiv:2608.09540•Aug 11, 2026•0 citations

The Limited Communication Theorem: Entanglement-Induced Environmental Expansion Beyond the Correlation Boundary

Joshua Ericksen

This paper asks a question the quantum information literature has not addressed: what happens to the rest of the world when quantum coordination activates? When two parties coordinate using shared entanglement, the standard analysis stops at their joint measurement outcomes. This paper goes further — it formalizes what a third-party observer, one completely excluded from the quantum state, experiences in the downstream environment. The answer: environmental consequences that no classical physics can explain, and in the strongest case, consequences that are identical to what the observer would experience if the parties had secretly communicated. The paper introduces the excluded observer interface model, defines environmental divergence as an operational measure, and proves a leakage-performance separation theorem: quantum coordination simultaneously exceeds the classical performance ceiling while leaking zero information about local conditions to the excluded observer — breaking the classical Pareto frontier between coordination performance and operational security. Demonstrated across the CHSH game (Δ_TV = 0.104, distinguishable from communication) and the Mermin-Peres Magic Square game (Δ_TV = 0.111, indistinguishable from communication, ε = 0). This is Paper 1 in a four-paper series: Paper 1 (this paper) — Existence. Proves the excluded observer's environment diverges from classical baselines. Paper 2 — Structure. Extends the framework into complex-valued information geometry, demonstrating that the excluded observer's information space acquires a CP¹ structure and that complex phase tracking becomes operationally necessary for predictive consistency in multi-outcome environments. Zenodo DOI 10.5281/zenodo.18944106. Paper 3 — Detection. Shifts the observer partition inward, deriving a sequential detection architecture for the coordinating party to detect marginal bias using only local statistics. Proves the protocol is information-theoretically optimal (saturates the Shannon capacity bound). Zenodo DOI 10.5281/zenodo.19056735. Paper 4 — Action. Derives the organizational decision-theoretic consequences: optimal hierarchy depth as a computable function of adversary coordination quality, decision window, and stakes magnitude. The result generalizes beyond quantum coordination to any scenario with external time pressure, communication friction, and unforeseen disruption. Zenodo DOI 10.5281/zenodo.19057065.

•Mar 4, 2026•0 citations
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.
The inability to communicate poses a major challenge to coordination in multi-agent reinforcement learning (MARL). Prior work has explored correlating local policies via shared randomness, sometimes in the form of a correlation device, as a mechanism to assist in decentralized decision-making. In contrast, this work introduces the first framework for training MARL agents to exploit shared quantum entanglement as a coordination resource, which permits a larger class of communication-free correlated policies than shared randomness alone. This is motivated by well-known results in quantum physics which posit that, for certain single-round cooperative games with no communication, shared quantum entanglement enables strategies that outperform those that only use shared randomness. In such cases, we say that there is quantum advantage. Our framework is based on a novel differentiable policy parameterization that enables optimization over quantum measurements, together with a novel policy architecture that decomposes joint policies into a quantum coordinator and decentralized local actors. To illustrate the effectiveness of our proposed method, we first show that we can learn, purely from experience, strategies that attain quantum advantage in single-round games that are treated as black box oracles. We then demonstrate how our machinery can learn policies with quantum advantage in an illustrative multi-agent sequential decision-making problem formulated as a decentralized partially observable Markov decision process (Dec-POMDP).
Coordination in distributed systems is often hampered by communication latency, which degrades performance. Quantum entanglement offers fundamentally stronger correlations than classically achievable without communication. Crucially, these correlations manifest instantaneously upon measurement, irrespective of the physical distance separating the systems. We investigate the application of shared entanglement to a dual-work optimization problem in a distributed system comprising two servers. The system must process both a continuously available, preemptible baseline task and incoming customer requests arriving in pairs. System performance is characterized by the trade-off between baseline task throughput and customer waiting time. We present a rigorous analytical model demonstrating that when the baseline task throughput function is strictly convex, rewarding longer uninterrupted processing periods, entanglement-assisted routing strategies achieve Pareto-superior performance compared to optimal communication-free classical strategies. We prove this advantage through queueing-theoretic analysis, non-local game formulation, and computational certification of classical bounds. Our results identify distributed scheduling and coordination as a novel application domain for near-term entanglement-based quantum networks.
Non-classical correlations enabled by entanglement could be exploited for distributed coordination tasks with communication constraints such as high-frequency trading in fragmented markets. However, previous studies have largely specified the game and its payoff structure theoretically, using toy market models without testing how well these models reflect observed market behavior. Here, we introduce market-derived nonlocal games, in which historical order-book data and backtests of joint actions determine the game's inputs and payoffs, rather than a prespecified idealized model. We start from classical trading strategies based on market considerations, using quantum correlations only to coordinate the agents' decisions. We compute exact classical optima and quantum upper bounds for the payoff. For games with a possible quantum advantage, we introduce an optimization algorithm to find explicit entangled strategies and end-to-end backtest them on historical data. We demonstrate the approach in a two-agent, three-stock cross-venue arbitrage setting. The game derived from the observed market data shows no resolved quantum-classical gap at the measured interaction scales. Controlled variations in liquidity competition and cross-stock repricing then show how the approach identifies regimes supporting quantum advantage, constructs explicit strategies, and tests whether their advantage survives end-to-end backtesting on modified historical market data.
We study which joint probability distributions can be implemented by distributed systems when agents have restricted information. Classical local operations cannot implement all distributions that are achievable with full conditioning on history. We show that shared quantum states can overcome this limitation even when using only separable states. In particular, separable states that are diagonal in a fixed basis allow certain joint distributions to be implemented through local measurements without requiring agents to condition on an inaccessible latent variable. These distributions cannot be implemented by classical local rules under the same information constraints. However, quantum implementations cannot reproduce fully adaptive dependence on past outcomes when those outcomes are observationally indistinguishable. Quantum state preparation therefore provides a partial operational substitute for perfect recall under restricted information.
Coordination is a fundamental primitive in communication and information theory, in which distributed systems must collectively generate correlated behavior rather than merely exchange messages. In quantum networks, the nature of entanglement, quantum measurements, and nonclassical correlations introduces coordination possibilities unavailable classically. This article reviews recent advances in coordination over classical and quantum communication networks, focusing on empirical and strong coordination in multi-user settings. We consider the implications of coordination for nonlocal games, showing how it provides a natural framework for understanding the correlations that enable spatially separated players to improve their probability of winning. We present a unified framework for coordination using classical or quantum communication and pre-shared correlation resources. The review covers simulation of both entanglement and separable correlations across a variety of network architectures, including two-node, cascade, broadcast, and multiple-access networks. We study the operational differences between empirical and strong coordination, and the tradeoffs between communication and correlation resources, such as pre-shared randomness and entanglement. Coordination plays a major role in device-independent quantum key distribution (DI-QKD) schemes, in which parties can generate a secret key even if the devices used in the process have been prepared by an adversary. Furthermore, we examine the role of coordination in quantum repeaters, where distributed entanglement serves as a resource for long-distance quantum communication. The review highlights connections between coordination theory and applications such as distributed quantum systems, quantum internet architectures, and future communication networks.
This paper asks a question the quantum information literature has not addressed: what happens to the rest of the world when quantum coordination activates? When two parties coordinate using shared entanglement, the standard analysis stops at their joint measurement outcomes. This paper goes further — it formalizes what a third-party observer, one completely excluded from the quantum state, experiences in the downstream environment. The answer: environmental consequences that no classical physics can explain, and in the strongest case, consequences that are identical to what the observer would experience if the parties had secretly communicated. The paper introduces the excluded observer interface model, defines environmental divergence as an operational measure, and proves a leakage-performance separation theorem: quantum coordination simultaneously exceeds the classical performance ceiling while leaking zero information about local conditions to the excluded observer — breaking the classical Pareto frontier between coordination performance and operational security. Demonstrated across the CHSH game (Δ_TV = 0.104, distinguishable from communication) and the Mermin-Peres Magic Square game (Δ_TV = 0.111, indistinguishable from communication, ε = 0). This is Paper 1 in a four-paper series: Paper 1 (this paper) — Existence. Proves the excluded observer's environment diverges from classical baselines. Paper 2 — Structure. Extends the framework into complex-valued information geometry, demonstrating that the excluded observer's information space acquires a CP¹ structure and that complex phase tracking becomes operationally necessary for predictive consistency in multi-outcome environments. Zenodo DOI 10.5281/zenodo.18944106. Paper 3 — Detection. Shifts the observer partition inward, deriving a sequential detection architecture for the coordinating party to detect marginal bias using only local statistics. Proves the protocol is information-theoretically optimal (saturates the Shannon capacity bound). Zenodo DOI 10.5281/zenodo.19056735. Paper 4 — Action. Derives the organizational decision-theoretic consequences: optimal hierarchy depth as a computable function of adversary coordination quality, decision window, and stakes magnitude. The result generalizes beyond quantum coordination to any scenario with external time pressure, communication friction, and unforeseen disruption. Zenodo DOI 10.5281/zenodo.19057065.