Related papers: Quantum voting and its physical interpretation
We propose a quantum voting system, in the spirit of quantum games such as the quantum Prisoner's Dilemma. Our scheme enables a constitution to violate a quantum analog of Arrow's Impossibility Theorem. Arrow's Theorem is a claim proved…
In the realm of algorithmic economics, voting systems are evaluated and compared by examining the properties or axioms they satisfy. While this pursuit has yielded valuable insights, it has also led to seminal impossibility results such as…
It is shown that, since an ultrafilter over an operator-algebraically finite (i.e. isomorphic to the lattice of projectors of a finite Von Neumann algebra) quantum logic is not necessarily principal, Arrow's Impossibility Theorem doesn't…
Quantum voting protocols aim to offer ballot secrecy and publicly verifiable tallies using physical guarantees from quantum mechanics, rather than relying solely on computational hardness. This article surveys whether such quantum voting…
Arrow's Impossibility Theorem establishes bounds on what we can require from voting systems. Given satisfaction of a small collection of "fairness" axioms, it shows votes can only exist as dictatorships in which one voter determines all…
In this paper we study Arrow's Impossibility Theorem in the quantum setting. Our work is based on the work of Bao and Halpern, in which it is proved that the quantum analogue of Arrow's Impossibility Theorem is not valid. However, we feel…
Arrow's Impossibility Theorem states that any constitution which satisfies Independence of Irrelevant Alternatives (IIA) and Unanimity and is not a Dictator has to be non-transitive. In this paper we study quantitative versions of Arrow…
A common way of stating the non-cloning theorem -- one of distinguishing characteristics of quantum theory -- is that one cannot make a copy of an arbitrary unknown quantum state. Even though this theorem is an important part of the ongoing…
A century on from the development of quantum theory, the interpretation of a quantum state is still discussed. If a physicist claims to have produced a system with a particular wave function, does this represent directly a physical wave of…
Arrow's Theorem concerns a fundamental problem in social choice theory: given the individual preferences of members of a group, how can they be aggregated to form rational group preferences? Arrow showed that in an election between three or…
We consider the problem of a particular kind of quantum correlation that arises in some two-party games. In these games, one player is presented with a question they must answer, yielding an outcome of either 'win' or 'lose'. Molina and…
Quantum voting, inspired by quantum game theory, provides a framework in which the quantum majority rule (QMR) constitution of Bao and Yunger Halpern [Phys. Rev. A 95, 062306 (2017)] violates the quantum analogue of Arrow's impossibility…
Traditional cryptography is under huge threat along of the evolution of quantum information and computing. In this paper, we propose a new post-quantum voting scheme based on physical laws by using encrypted no-key protocol to transmit…
Go has long been considered as a testbed for artificial intelligence. By introducing certain quantum features, such as superposition and collapse of wavefunction, we experimentally demonstrate a quantum version of Go by using correlated…
Arrow's Impossibility Theorem is a seminal result of Social Choice Theory that demonstrates the impossibility of ranked-choice decision-making processes to jointly satisfy a number of intuitive and seemingly desirable constraints. The…
Quantum theory provides an extremely accurate description of fundamental processes in physics. It thus seems likely that the theory is applicable beyond the, mostly microscopic, domain in which it has been tested experimentally. Here we…
Quantum Decision Theory, advanced earlier by the authors, and illustrated for lotteries with gains, is generalized to the games containing lotteries with gains as well as losses. The mathematical structure of the approach is based on the…
The possible existence of closed timelike curves (CTCs) draws attention to fundamental questions about what is physically possible and what is not. An example is the "no cloning theorem" in quantum mechanics, which states that no physical…
The Gibbard-Satterthwaite theorem states that no unanimous and non-dictatorial voting rule is strategyproof. We revisit voting rules and consider a weaker notion of strategyproofness called not obvious manipulability that was proposed by…
In this paper, we show that Quantum Mechanics does not admit ontological models, in the sense that the quantum state of a system cannot correspond to a set of physical states representing the independent reality of the system. We show, via…