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:2604.27173

Quantum Coordination without Conditioning under Restricted Information

Faisal Shah Khan

quant-phSubmitted Apr 29, 2026• Announced May 1, 2026• 0 citations• Revised May 6, 2026 (v2)
v1 · Apr 29, 2026v2 · May 6, 2026v3 · Jun 20, 2026
arXivHTMLPDF

Abstract

We study coordination under restricted information, where classical local models fail to implement certain correlated distributions because agents cannot condition on past history. We show that quantum systems overcome this limitation even when using only separable states. Both classically diagonal encodings (shared latent variables) and separable states with noncommuting local structure (quantum discord) enable the implementation of joint distributions that are unattainable by any classical local rules under the same information constraints. The quantum advantage arises from enabling latent-variable coordination without requiring agents to condition on the latent variable itself -- a construction that succeeds where no classical local model can. Separable states with nonzero quantum discord provide an alternative mechanism for realizing such coordination. At the same time, quantum models remain strictly limited by the information structure: unlike perfect recall, they cannot reproduce fully adaptive dependence on realized past outcomes that are observationally indistinguishable. Thus, quantum correlations serve as a partial substitute for perfect recall.

Comments
v2: Fixed and cleaned bibliography (removed erroneous citation, improved consistency, added recent references). Minor typographical improvements. Extension of arXiv:2505.08917. Quantum systems (even using only separable states) can implement latent-variable correlations unattainable by classical local models under restricted information via the global Born rule

Related papers

Quantum Nonlocality in the Presence of Superselection Rules and Data Hiding Protocols

Frank Verstraete, J. I. Cirac

We consider a quantum system subject to superselection rules, for which certain restrictions apply to the quantum operations that can be implemented. It is shown how the notion of quantum nonlocality has to be redefined in the presence of superselection rules: there exist separable states that cannot be prepared locally and exhibit some form of nonlocality. Moreover, the notion of local distinguishability in the presence of classical communication has to be altered. This can be used to perform quantum information tasks that are otherwise impossible. In particular, this leads to the introduction of perfect quantum data hiding protocols, for which quantum communication (eventually in the form of a separable but nonlocal state) is needed to unlock the secret.

arXiv:quant-ph/0302039•Physical Review Letters•Jul 2, 2003•106 citations

Accessible Quantum Correlations Under Complexity Constraints

Álvaro Yángüez, Noam Avidan, Jan Kochanowski +1 more

Quantum systems may contain underlying correlations which are inaccessible to computationally bounded observers. We capture this distinction through a framework that analyses bipartite states only using efficiently implementable quantum channels. This leads to a complexity-constrained max-divergence and a corresponding computational min-entropy. The latter quantity recovers the standard operational meaning of the conditional min-entropy: in the fully quantum case, it quantifies the largest overlap with a maximally entangled state attainable via efficient operations on the conditional subsystem. For classical-quantum states, it further reduces to the optimal guessing probability of a computationally bounded observer with access to side information. Lastly, in the absence of side information, the computational min-entropy simplifies to a computational notion of the operator norm. We then establish strong separations between the information-theoretic and complexity-constrained notions of min-entropy. For pure states, there exist highly entangled families of states with extremal min-entropy whose efficiently accessible entanglement in terms of computational min-entropy is exponentially suppressed. For mixed states, the separation is even sharper: the information-theoretic conditional min-entropy can be highly negative while the complexity-constrained quantity remains nearly maximal. Under the cryptographic Learning with Errors hardness assumption, we construct efficiently preparable states exhibiting both separations, even when their preparation circuits are fully known. Overall, our results demonstrate that computational constraints can fundamentally limit the quantum correlations that are observable in practice.

quant-pharXiv:2604.15540•Apr 20, 2026•1 citation

Structure of quantum measurements implementable with one round of classical communication

Arthur C. R. Dutra, Ties-A. Ohst, H. Chau Nguyen +1 more

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 measurement 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.

arXiv:2510.09381•Reports on Progress in Physics•Mar 1, 2026•3 citations

Adaptive Local Measurements For Quantum Learning Can Exponentially Outperform Nonadaptive Global Measurements

Alireza Goldar, Zhen Qin, Zhihui Zhu +2 more

Can measurements chosen adaptively, in response to earlier outcomes, be exponentially more informative than measurements fixed in advance? In many quantum settings, adaptivity helps at most polynomially; known exponential advantages require coherent measurements across copies or restricted measurements. We show an exponential advantage measuring one copy at a time, with no quantum memory kept between state copies, even when the nonadaptive learner may perform arbitrary global measurements on each copy. We construct explicit families of multi-qubit states in which a scalar parameter is encoded in one of exponentially many candidate observables, with an auxiliary marker indicating which one. An adaptive protocol identifies the relevant observable and then measures it using only single-qubit measurements and one round of adaptation. At fixed accuracy, it needs logarithmically many copies as the qubit count grows, whereas every nonadaptive protocol needs exponentially many. The same mechanism yields an exponential gap in local asymptotic minimax mean squared error constants, tight up to the exponential base. The states are separable and classical in label-dependent product bases; no entanglement or other nonclassical correlations are required. The gap comes from measurement incompatibility: the candidate observables cannot be measured jointly, so a fixed measurement must divide its information budget among them, while adaptivity selects the informative one. Accordingly, the separation disappears when the candidate observables commute, and cannot occur with fully observed classical samples. Measurement incompatibility thus emerges as a resource for quantum learning, distinct from entanglement and quantum memory, that classical feedback alone can exploit.

quant-pharXiv:2610.38922•Oct 30, 2026•0 citations

Quantum superposition of causal structures as a universal resource for local implementation of nonlocal quantum operations

Pratik Ghosal, Arkaprabha Ghosal, Debarshi Das +1 more

Spatial separation restricts the set of locally implementable quantum operations on distributed multipartite quantum systems. We propose that indefinite causal structure arising due to quantum superposition of different space-time geometries can be used as an independent universal resource for local implementation of any quantum operation on spatially distributed quantum systems. Consequently, all such quantum tasks that are not accomplishable by local operations and classical communication (LOCC) only also become locally accomplishable. We show that exploiting indefinite causal structure as the sole resource, it is possible to perfectly teleport the state of one agent's subsystem to the other distant laboratory in such a way that the agent at the distant laboratory can have access to the whole initially shared state in his or her laboratory and can perform any global quantum operation on the joint state locally. We further find that, after the teleportation process, the resource---indefinite causal structure of the space-time does not get consumed. Hence, after implementing the desired quantum operation the state of the first agent's subsystem can be teleported back to its previous laboratory using the same resource. We show that this two-way teleportation is not always necessary for locally executing all nonlocal quantum tasks that are not realizable by LOCC only. Without invoking any kind of teleportation, we present a protocol for perfect local discrimination of the set of four Bell states that exploits indefinite causal structure as the sole resource. As immediate upshots, we present some more examples of such nonlocal tasks as local discrimination of the set of states exhibiting ``quantum nonlocality without entanglement'' and activation of bound entangled states that are also achievable by our proposed protocol incorporating indefinite causal structure as a resource.

arXiv:2209.12925•Physical Review A•Feb 15, 2023•10 citations

Witnessing Quantum Bayesian Inference beyond Classical Learning

Francesco Buscemi

Can an agent's predictions reveal whether its reasoning is based on a classical or a quantum model? Using known results on matrix factorizations, here we show that quantum Bayesian retrodiction can produce one-step-ahead forecasts incompatible with every classical Bayesian explanation based on learning about a fixed but unknown sampling law from conditionally independent observations. The separation has a sharp threshold in the number of outcomes: for any measurement with at most four outcomes, the quantum predictions admit a classical realization, irrespective of the prior state and the finite Hilbert-space dimension, whereas a five-outcome measurement on a single qubit already violates an explicit classical bound. This bound holds for arbitrary classical latent states, prior probabilities, and sampling laws, and involves only the agent's initial and updated predictions. Thus, in this setting, quantum Bayesian retrodiction is strictly more expressive than classical Bayesian learning, and this difference can be witnessed without observing or specifying the agent's internal description.

quant-pharXiv:2610.09293•Oct 8, 2026•1 citation
We study coordination under restricted information, where classical local models fail to implement certain correlated distributions because agents cannot condition on past history. We show that quantum systems overcome this limitation even when using only separable states. Both classically diagonal encodings (shared latent variables) and separable states with noncommuting local structure (quantum discord) enable the implementation of joint distributions that are unattainable by any classical local rules under the same information constraints. The quantum advantage arises from enabling latent-variable coordination without requiring agents to condition on the latent variable itself -- a construction that succeeds where no classical local model can. Separable states with nonzero quantum discord provide an alternative mechanism for realizing such coordination. At the same time, quantum models remain strictly limited by the information structure: unlike perfect recall, they cannot reproduce fully adaptive dependence on realized past outcomes that are observationally indistinguishable. Thus, quantum correlations serve as a partial substitute for perfect recall.
We consider a quantum system subject to superselection rules, for which certain restrictions apply to the quantum operations that can be implemented. It is shown how the notion of quantum nonlocality has to be redefined in the presence of superselection rules: there exist separable states that cannot be prepared locally and exhibit some form of nonlocality. Moreover, the notion of local distinguishability in the presence of classical communication has to be altered. This can be used to perform quantum information tasks that are otherwise impossible. In particular, this leads to the introduction of perfect quantum data hiding protocols, for which quantum communication (eventually in the form of a separable but nonlocal state) is needed to unlock the secret.
Quantum systems may contain underlying correlations which are inaccessible to computationally bounded observers. We capture this distinction through a framework that analyses bipartite states only using efficiently implementable quantum channels. This leads to a complexity-constrained max-divergence and a corresponding computational min-entropy. The latter quantity recovers the standard operational meaning of the conditional min-entropy: in the fully quantum case, it quantifies the largest overlap with a maximally entangled state attainable via efficient operations on the conditional subsystem. For classical-quantum states, it further reduces to the optimal guessing probability of a computationally bounded observer with access to side information. Lastly, in the absence of side information, the computational min-entropy simplifies to a computational notion of the operator norm. We then establish strong separations between the information-theoretic and complexity-constrained notions of min-entropy. For pure states, there exist highly entangled families of states with extremal min-entropy whose efficiently accessible entanglement in terms of computational min-entropy is exponentially suppressed. For mixed states, the separation is even sharper: the information-theoretic conditional min-entropy can be highly negative while the complexity-constrained quantity remains nearly maximal. Under the cryptographic Learning with Errors hardness assumption, we construct efficiently preparable states exhibiting both separations, even when their preparation circuits are fully known. Overall, our results demonstrate that computational constraints can fundamentally limit the quantum correlations that are observable in practice.
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 measurement 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.
Can measurements chosen adaptively, in response to earlier outcomes, be exponentially more informative than measurements fixed in advance? In many quantum settings, adaptivity helps at most polynomially; known exponential advantages require coherent measurements across copies or restricted measurements. We show an exponential advantage measuring one copy at a time, with no quantum memory kept between state copies, even when the nonadaptive learner may perform arbitrary global measurements on each copy. We construct explicit families of multi-qubit states in which a scalar parameter is encoded in one of exponentially many candidate observables, with an auxiliary marker indicating which one. An adaptive protocol identifies the relevant observable and then measures it using only single-qubit measurements and one round of adaptation. At fixed accuracy, it needs logarithmically many copies as the qubit count grows, whereas every nonadaptive protocol needs exponentially many. The same mechanism yields an exponential gap in local asymptotic minimax mean squared error constants, tight up to the exponential base. The states are separable and classical in label-dependent product bases; no entanglement or other nonclassical correlations are required. The gap comes from measurement incompatibility: the candidate observables cannot be measured jointly, so a fixed measurement must divide its information budget among them, while adaptivity selects the informative one. Accordingly, the separation disappears when the candidate observables commute, and cannot occur with fully observed classical samples. Measurement incompatibility thus emerges as a resource for quantum learning, distinct from entanglement and quantum memory, that classical feedback alone can exploit.
Spatial separation restricts the set of locally implementable quantum operations on distributed multipartite quantum systems. We propose that indefinite causal structure arising due to quantum superposition of different space-time geometries can be used as an independent universal resource for local implementation of any quantum operation on spatially distributed quantum systems. Consequently, all such quantum tasks that are not accomplishable by local operations and classical communication (LOCC) only also become locally accomplishable. We show that exploiting indefinite causal structure as the sole resource, it is possible to perfectly teleport the state of one agent's subsystem to the other distant laboratory in such a way that the agent at the distant laboratory can have access to the whole initially shared state in his or her laboratory and can perform any global quantum operation on the joint state locally. We further find that, after the teleportation process, the resource---indefinite causal structure of the space-time does not get consumed. Hence, after implementing the desired quantum operation the state of the first agent's subsystem can be teleported back to its previous laboratory using the same resource. We show that this two-way teleportation is not always necessary for locally executing all nonlocal quantum tasks that are not realizable by LOCC only. Without invoking any kind of teleportation, we present a protocol for perfect local discrimination of the set of four Bell states that exploits indefinite causal structure as the sole resource. As immediate upshots, we present some more examples of such nonlocal tasks as local discrimination of the set of states exhibiting ``quantum nonlocality without entanglement'' and activation of bound entangled states that are also achievable by our proposed protocol incorporating indefinite causal structure as a resource.
Can an agent's predictions reveal whether its reasoning is based on a classical or a quantum model? Using known results on matrix factorizations, here we show that quantum Bayesian retrodiction can produce one-step-ahead forecasts incompatible with every classical Bayesian explanation based on learning about a fixed but unknown sampling law from conditionally independent observations. The separation has a sharp threshold in the number of outcomes: for any measurement with at most four outcomes, the quantum predictions admit a classical realization, irrespective of the prior state and the finite Hilbert-space dimension, whereas a five-outcome measurement on a single qubit already violates an explicit classical bound. This bound holds for arbitrary classical latent states, prior probabilities, and sampling laws, and involves only the agent's initial and updated predictions. Thus, in this setting, quantum Bayesian retrodiction is strictly more expressive than classical Bayesian learning, and this difference can be witnessed without observing or specifying the agent's internal description.