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:2103.11364 · Entropy

Schrödinger’s Ballot: Quantum Information and the Violation of Arrow’s Impossibility Theorem

Xin Sun, Feifei He, Mirek Sopek, Meiyun Guo

Published Aug 20, 2021• 2 citations
arXivHTMLPDF

Abstract

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 unsatisfied about the proof presented in Bao and Halpern's work. Moreover, the definition of Quantum Independence of Irrelevant Alternatives (QIIA) in Bao and Halpern's work seems not appropriate to us. We give a better definition of QIIA, which properly captures the idea of the independence of irrelevant alternatives, and a detailed proof of the violation of Arrow's Impossibility Theorem in the quantum setting with the modified definition.

DOI
10.3390/e23081083

Related papers

Quantum voting and violation of Arrow's impossibility theorem

Ning Bao, Nicole Yunger Halpern

A quantum voting system is proposed in the tradition of quantum game theory. It is shown that this system violates the quantum analogy of Arrow's impossibility theorem, which makes claims about dictatorship in a classical electoral system.

arXiv:1501.00458•Physical Review A•Jun 5, 2017•37 citations

Quantum Information: an invitation for mathematicians

David Pérez-García, Fernando Etayo, Mario Fioravanti +1 more

Quantum Information is the science that aims to use the unusual behavior of the microscopic world, governed by the laws of Quantum Mechanics, in order to improve the way in which we compute or communicate information. Though the first ideas in this direction come from the early 80’s, it is in the last decade when Quantum Information has suffered an spectacular development. It is impossible to resume in a paper like this one the importance and complexity of the field. Therefore, I will limit to briefly explain some of the initial ideas (considered classical by now), and to briefly suggest some of the modern lines of research. By the nature of this exposition, I have decided to avoid rigor and to concentrate more in ideas and intuitions. Anyhow, I have tried to provide with enough references, in such a way that an interested reader could find there proper theorems and proofs.

AIP conference proceedings•Jan 1, 2009•0 citations

Implementation and Analysis of Quantum Majority Rules under Noisy Conditions

Gal Amit, Yuval Idan, Michael Suleymanov +2 more

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 theorem. We evaluate this QMR constitution analytically on classical profile data and implement its final measurement stage as a quantum circuit, running on both noiseless simulators and noisy IBM quantum hardware to map how realistic noise deforms the resulting societal ranking distribution. Moderate-high single-qubit noise does not change the qualitative behavior of QMR, whereas strong noise shifts the distribution toward other dominant winners than the classical one. We quantify this behavior using winner-agreement rates, Condorcet-winner flip rates, and Jensen-Shannon divergence between societal ranking distributions. In a second, exploratory component, we demonstrate an explicitly entanglement-based variant of the QMR constitution that serves as a testbed for multi-voter quantum correlations under noise, which we refer to as the QMR2-inspired variant. There, GHZ-type and separable superpositions over opposite rankings have the same expectation values but respond very differently to noise. Taken together, these two components connect the abstract QMR constitution to concrete implementations on noisy intermediate-scale quantum (NISQ) devices and highlight design considerations for future quantum voting protocols.

quant-pharXiv:2512.02813•Scientific Reports•Dec 3, 2025•0 citations

Quantum Voting and Violation of Gibbard-Satterthwaite's Impossibility Theorem

Ethan Dickey, Aidan Casey

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 Arrow's and Gibbard-Satterthwaite's Impossibility Theorems, which pose challenges in designing ideal voting systems. Enter the domain of quantum computing: recent advancements have introduced the concept of quantum voting systems, which have many potential applications including in security and blockchain. Building on recent works that bypass Arrow's Impossibility Theorem using quantum voting systems, our research extends Quantum Condorcet Voting (QCV) to counter the Gibbard-Satterthwaite Impossibility Theorem in a quantum setting. To show this, we introduce a quantum-specific notion of truthfulness, extend ideas like incentive compatibility and the purpose of onto to the quantum domain, and introduce new tools to map social welfare functions to social choice functions in this domain.

arXiv:2309.02593•Sep 5, 2023•1 citation

Comment on "A short impossibility proof of quantum bit commitment"

Guang Ping He

In a recent letter (Phys. Lett. A 377 (2013) 1076, arXiv:0905.3801), the authors presented an impossibility proof of quantum bit commitment, which attempted to cover all possible protocols that involve both quantum and classical information. Here we show that there are many errors in the proof, thus it fails to exhaust all conceivable protocols.

arXiv:1306.5357•Jun 22, 2013•0 citations

WHAT IS QUANTUM INFORMATION?

K. Hess, Walter Philipp, Manuel Aschwanden

The main purpose of this review is to deal with questions related to the nature of quantum information and particularly with quantum entanglement as an important component of quantum information and computing. We will not discuss here quantum computer algorithms, like the algorithm by Shor, or their advantages and disadvantages. We only cover the material that lies at the foundations of quantum information and computing and epistemological questions. We attempt to connect the famous debate between Einstein and Bohr on quantum entanglement to some of the latest work on qubits and quantum computing and to the mathematical theorems that form the basis of these discussions, particularly the theorem of Bell. We present a critical analysis of this material and hope that this will give the reader a better understanding of what can be said with certainty about the nature of quantum information.

International Journal of Quantum Information•Aug 1, 2006•11 citations
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 unsatisfied about the proof presented in Bao and Halpern's work. Moreover, the definition of Quantum Independence of Irrelevant Alternatives (QIIA) in Bao and Halpern's work seems not appropriate to us. We give a better definition of QIIA, which properly captures the idea of the independence of irrelevant alternatives, and a detailed proof of the violation of Arrow's Impossibility Theorem in the quantum setting with the modified definition.
Quantum Information is the science that aims to use the unusual behavior of the microscopic world, governed by the laws of Quantum Mechanics, in order to improve the way in which we compute or communicate information. Though the first ideas in this direction come from the early 80’s, it is in the last decade when Quantum Information has suffered an spectacular development. It is impossible to resume in a paper like this one the importance and complexity of the field. Therefore, I will limit to briefly explain some of the initial ideas (considered classical by now), and to briefly suggest some of the modern lines of research. By the nature of this exposition, I have decided to avoid rigor and to concentrate more in ideas and intuitions. Anyhow, I have tried to provide with enough references, in such a way that an interested reader could find there proper theorems and proofs.
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 theorem. We evaluate this QMR constitution analytically on classical profile data and implement its final measurement stage as a quantum circuit, running on both noiseless simulators and noisy IBM quantum hardware to map how realistic noise deforms the resulting societal ranking distribution. Moderate-high single-qubit noise does not change the qualitative behavior of QMR, whereas strong noise shifts the distribution toward other dominant winners than the classical one. We quantify this behavior using winner-agreement rates, Condorcet-winner flip rates, and Jensen-Shannon divergence between societal ranking distributions. In a second, exploratory component, we demonstrate an explicitly entanglement-based variant of the QMR constitution that serves as a testbed for multi-voter quantum correlations under noise, which we refer to as the QMR2-inspired variant. There, GHZ-type and separable superpositions over opposite rankings have the same expectation values but respond very differently to noise. Taken together, these two components connect the abstract QMR constitution to concrete implementations on noisy intermediate-scale quantum (NISQ) devices and highlight design considerations for future quantum voting protocols.
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 Arrow's and Gibbard-Satterthwaite's Impossibility Theorems, which pose challenges in designing ideal voting systems. Enter the domain of quantum computing: recent advancements have introduced the concept of quantum voting systems, which have many potential applications including in security and blockchain. Building on recent works that bypass Arrow's Impossibility Theorem using quantum voting systems, our research extends Quantum Condorcet Voting (QCV) to counter the Gibbard-Satterthwaite Impossibility Theorem in a quantum setting. To show this, we introduce a quantum-specific notion of truthfulness, extend ideas like incentive compatibility and the purpose of onto to the quantum domain, and introduce new tools to map social welfare functions to social choice functions in this domain.
The main purpose of this review is to deal with questions related to the nature of quantum information and particularly with quantum entanglement as an important component of quantum information and computing. We will not discuss here quantum computer algorithms, like the algorithm by Shor, or their advantages and disadvantages. We only cover the material that lies at the foundations of quantum information and computing and epistemological questions. We attempt to connect the famous debate between Einstein and Bohr on quantum entanglement to some of the latest work on qubits and quantum computing and to the mathematical theorems that form the basis of these discussions, particularly the theorem of Bell. We present a critical analysis of this material and hope that this will give the reader a better understanding of what can be said with certainty about the nature of quantum information.