Two processors jointly provide a real-time service which can be completed by exactly one processor. Assuming each processor is allowed to announce only a one-bit information in a distributed way to decide which one should process the job, inevitably some of the jobs will get lost if only classical resources are used. An example of this distributed system problems in real life can be found in baseball. Assume Alice and Bob are two outfielders in a baseball game. When the batter hits an outfield fly ball, they run toward the ball and try to make a catch. At the same time, depending on their confidence, Alice and Bob announce their intention to catch the ball by shouting "I'll get it". However, when both of them want to catch the ball, they will collide, fall down, and drop the ball. Or, in order not to collide with each other, sometimes neither of them will attempt to catch the ball and the ball will drop. Worse yet, if the ball drops, they will blame each other for having made the same decision. In this paper, we show the system dependability can be enhanced if those processors share quantum entanglement
Two processors jointly provide a real-time service which can be completed by exactly one processor. Assuming each processor is allowed to announce only a one-bit information in a distributed way to decide which one should process the job, inevitably some of the jobs will get lost if only classical resources are used. An example of this distributed system problems in real life can be found in baseball. Assume Alice and Bob are two outfielders in a baseball game. When the batter hits an outfield fly ball, they run toward the ball and try to make a catch. At the same time, depending on their confidence, Alice and Bob announce their intention to catch the ball by shouting "I'll get it". However, when both of them want to catch the ball, they will collide, fall down, and drop the ball. Or, in order not to collide with each other, sometimes neither of them will attempt to catch the ball and the ball will drop. Worse yet, if the ball drops, they will blame each other for having made the same decision. In this paper, we show the system dependability can be enhanced if those processors share quantum entanglement
Alice and Bob play beach volleyball as teammates. When the opponent starts to serve, they both run toward the ball and show their intentions by shouting "It's mine". However, sometimes they collide with each other and sometimes neither of them attempts to receive the ball. In both cases they will blame each other for having made the same decisions. This can be formulated as a dependability problem as follows. Two processors jointly provide a real-time service which can be completed by exactly one processor. Assuming each processor is allowed to announce only one-bit information to decide which one to process the job, inevitably some of the jobs will get lost if only classical resources are used. In this paper, we show if these two processors share quantum entanglement, not only the system dependability can be enhanced; the faulty processor can also be identified.
The main objective of this paper is to provide illustrative examples of distributed computing problems for which it is possible to design tight lower bounds for quantum algorithms without having to manipulate concepts from quantum mechanics, at all. As a case study, we address the following class of 2-player problems. Alice (resp., Bob) receives a boolean x (resp., y) as input, and must return a boolean a (resp., b) as output. A game between Alice and Bob is defined by a pair (?, f) of boolean functions. The objective of Alice and Bob playing game (?, f) is, for every pair (x, y) of inputs, to output values a and b, respectively, satisfying ?(a, b) = f(x, y), in absence of any communication between the two players, but in presence of shared resources. The ability of the two players to solve the game then depends on the type of resources they share. It is known that, for the so-called CHSH game, i.e., for the game a ? b = x ? y, the ability for the players to use entangled quantum bits (qubits) helps. We show that, apart from the CHSH game, quantum correlations do not help, in the sense that, for every game not equivalent to the CHSH game, there exists a classical protocol (using shared randomness) whose probability of success is at least as large as the one of any protocol using quantum resources. This result holds for both worst case and average case analysis. It is achieved by considering a model stronger than quantum correlations, the non-signaling model, which subsumes quantum mechanics, but is far easier to handle.
This paper explores the potential of quantum entanglement for enabling distributed reasoning paradigms that transcend the limitations of classical physics. The core claim is that leveraging entanglement allows for parallel and fault-tolerant computation, offering a fundamentally new approach to distributed systems. The proposed mechanism involves encoding information into entangled particles and utilizing the correlations between their entangled states for information processing. This approach inherently facilitates simultaneous computation across multiple nodes and provides intrinsic resilience against node failures. We outline a framework for distributed reasoning based on this principle, highlighting its advantages over traditional distributed systems and addressing key challenges in scalability and practical implementation. The research investigates the theoretical foundations of entanglement-based distributed reasoning and proposes a novel architecture for achieving high-performance, robust computations. This work represents a significant step towards realizing quantum-enhanced distributed computing capabilities.
Quantum processors are increasingly used as accelerators inside high-performance computing (HPC) workflows. A workflow runtime decides which quantum circuits to run, how to group them into provider jobs, and what to repeat after a failed attempt. Many search problems split into independent parts, but the runtime can use that structure only when the workflow exposes the parts and a validity check for each one. SemQBench measures what a runtime gains from this visibility. It compares seven execution policies for the same search problem, including two controls without amplitude amplification. The policies change one runtime choice at a time: whether to amplify, whether partial results may be combined across runs, whether the parts share one circuit, and what a retry keeps. We run them on the 20-qubit IQM Garnet processor using 106 distinct circuits in three jobs, and report circuit executions, active device time, and provider jobs separately before combining them in a cost model. Amplifying the problem as one whole circuit shows no statistically clear gain over random sampling and uses 6.7-104× more active device time. Exposing the parts and collecting valid partial results across a fixed batch of runs cuts the executions needed for 95% completion confidence by 2.20-4.00×, and this policy is never worse than the other amplified policies in executions, device time, or jobs; it is selected in 99 of 108 overhead settings. Fewer executions do not always mean less device time: on one workload, executions fall from thirteen to four while active device time rises from 7.44 to 9.81 μs. Exposing problem structure therefore gives the runtime a strong default policy and the measurements needed to decide when the simpler unamplified option is cheaper.
Real life situations where there are strategies to be chosen in order to obtain a profit can be reproduced by games, so game theory is a way to describe the evolution of possible scenarios where players can select a scheme of play. Game theory takes importance in many areas, such as people decisions making, where their choices do affect others benefit (Davis, 1970; Myerson, 1991). It is to remark that the principles of game theory were initiated by trying to understand the behavior of economic strategies, however Von Neumann presented the concept of modern game theory in 1944 (Von Neumann & Morgenstern, 1947). Quantum mechanics is a tool that creates another point of view for the traditional game theory due to multiple strategies offered for the players, whom possibilities are numerously expanded in contrast of classical ones (Eisert & Wilkens, 2000). There are also games where the player who uses quantum strategies, enhances his payoffs or even always wins against a player who only uses classical moves (Meyer, 1999). It is to remark that there are plenty of applications for quantum game theory such as quantum cryptography and computation, economics and biology (Piotrowski & Sladkowski, 2003; Hanauske et al.,2009). The Battle of the Sexes game is a largely analyzed problem, based on two players: Alice and Bob and their choice about an activity for a Saturday night with each other. It is pretty important to remark that both want the best possible payoff in the decision, so the game can be developed normally, otherwise it would not be our case. Alice, really loves Opera, but wants to be with Bob; Bob likes Football but he wants to have Alice’s company along the activity. This game has a lot of applications in real life scenarios such as the spread of some type of genes from a reproduction between two organisms (Dawkins, 2006); another interesting application is neuroeconomics (Montague & Berns, 2002), where brain studies have been done in order to incite neurons to choose either to “work” for a reward or to “shirk” (Glimcher, 2003).