A number of quantum-based protocols exists for distributed parties to share correlated information, including distributed entanglement, and quantum key distribution, where the shared information or bits, are determined probabilistically. Such correlated information or bits can be used for security applications such as encryption, but in this paper, we show how such correlated information or bits, with the use of a priori agreed action-tables, can be used for probabilistic coordination schemes among multiple parties, which we term abstractly as agents (e.g., agents could be processes running on different computers across the Internet, different computer nodes, robots, or vehicles). We identify the properties of such a coordination approach, including fairness and built-in quantum security. We also outline a number of applications of such a coordination approach.
