Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 99 tok/s
Gemini 2.5 Pro 43 tok/s Pro
GPT-5 Medium 28 tok/s
GPT-5 High 35 tok/s Pro
GPT-4o 94 tok/s
GPT OSS 120B 476 tok/s Pro
Kimi K2 190 tok/s Pro
2000 character limit reached

The Quantum Advantage in Decentralized Control (2207.12075v2)

Published 25 Jul 2022 in eess.SY, cs.SY, and math.OC

Abstract: It is known in the context of decentralised control that there exist control strategies consistent with the requirements of a given information structure, yet physically unimplementable through any amount of passive common randomness. This imposes a natural set of limitations on what is achievable through common randomness in both cooperative and competitive settings. We show that it is possible to breach these limitations with the use of quantum-physical architectures. In particular, we present a class of stochastic strategies that leverage quantum entanglement to produce strategic distributions which compose a strict superclass of strategies implemented through passive common randomness. We investigate numerically, the `quantum advantage' offered by this new class over a parametric family of cooperative decision problems with static information structure. We demonstrate through variations across the parametric family that fundamental decision theoretic elements such as information and the cost determine the manifestation of quantum advantage in a given control problem. Our work motivates a novel decision and control paradigm with an enlarged space of control policies achievable by means of quantum architectures.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (27)
  1. Common randomness and distributed control: A counterexample. Systems and Control Letters, 2007.
  2. An optimizer’s approach to stochastic control problems with nonclassical information structures. IEEE Transactions on Automatic Control, 60(4):937–949, 2015.
  3. Dimitri P. Bertsekas. Dynamic Programming and Optimal Control, Vol. 1. Athena Scientific, 2nd edition, November 2000.
  4. H. S. Witsenhausen. A counterexample in stochastic optimum control. SIAM Journal on Control, 6:131, 1968.
  5. Y.C. Ho. Team decision theory and information structures. Proceedings of the IEEE, 68(6):644–654, 1980.
  6. Information structures in optimal decentralized control. In Decision and Control (CDC), 2012 IEEE 51st Annual Conference on, pages 1291–1306. IEEE, 2012.
  7. Vivek S. Borkar. A convex analytic approach to markov decision processes. Probability Theory and Related Fields, 78:583–602, August 1988.
  8. Alan S. Manne. Linear programming and sequential decisions. Management Science, 6(3):259 –267, April 1960.
  9. A linear programming relaxation for stochastic control problems with non-classical information patterns. In 2015 54th IEEE Conference on Decision and Control (CDC), pages 5743–5748. IEEE, 2015.
  10. Witsenhausen’s counterexample: A view from optimal transport theory. In 50th IEEE Conference on Decision and Control and European Control Conference (CDC-ECC), 2011.
  11. Linear programming-based converses for finite blocklength lossy joint source-channel coding. IEEE Transactions on Information Theory, 63(11):7066–7094, 2017.
  12. Improved finite blocklength converses for Slepian-Wolf coding via linear programming. IEEE Transactions on Information Theory, 65(4):2423–2441, 2019.
  13. Shannon meets von Neumann: A minimax theorem for channel coding in the presence of a jammer. IEEE Transactions on Information Theory, 66(5):2842–2859, 2020.
  14. William Matthews. A linear program for the finite block length converse of Polyanskiy–Poor–Verdú via nonsignaling codes. IEEE Transactions on Information Theory, 58(12):7036–7044, 2012.
  15. Proposed experiment to test local hidden-variable theories. Phys. Rev. Lett., 23:880–884, Oct 1969.
  16. Geometry of information structures, strategic measures and associated stochastic control topologies. Probability Surveys, 19(none):450 – 532, 2022.
  17. Nonlocal correlations as an information-theoretic resource. Phys. Rev. A, 71:022101, Feb 2005.
  18. Chuang Isaac L. Nielsen Michael A. Quantum computation and quantum information. Cambridge University Press, 2004.
  19. Masaki Owari David Avis, Sonoko Moriyama. From bell inequalities to tsirelson’s theorem: A survey. IEICE Trans. on Fundamentals, E92-A:1254–1267, 2009.
  20. B.S. Cirel’son. Lett. Math. Phys., 4:93, 1980.
  21. B.S. Cirel’son. J. Sov. Math., 36:557, 1987.
  22. Quantum advantage in binary teams and the coordination dilemma: Part II. to be submitted, 2023.
  23. M.M. Wolf R.F. Werner. All multipartite bell-correlation inequalities for two dichotomic observables per site. Phy. Rev. A, 64, 2001.
  24. WILLIAM SLOFSTRA. The set of quantum correlations is not closed. Forum of Mathematics, Pi, 7:e1, 2019.
  25. Geometry of the set of quantum correlations. Phys. Rev. A, 97:022104, Feb 2018.
  26. No quantum realization of extremal no-signaling boxes. Phys. Rev. Lett., 117, 2016.
  27. John Preskill. Lecture notes for physics 229: Quantum information and computation. California Institute of Technology, 16:37–40, 1998.
Citations (7)
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.