adjacency matrix 1algorithmic social choice 1computational complexity 1condorcet-consistent voting 1graph theory 1pspace-completeness 1quantum information 1quantum-like states 1qubit construction 1regular graphs 1voting theory 1
From the 2 of 3 linked papers with an AI index.
3 papers
quant-ph2026
Programmable Quantum-Like bits from Signed Regular Graphs
Ethan Dickey, Abhijeet Vyas, Sabre Kais
The paper shows how single quantum‑like bits can be built from the eigenvectors of adjacency matrices of regular signed graphs, providing conditions for creating equal superpositio…
cs.GT2026
Stable Voting is PSPACE-Complete
Ethan Dickey, Alexandros Psomas, Athina Terzoglou
The paper proves that determining the winner under the Stable Voting and Simple Stable Voting rules is PSPACE‑complete.
quant-ph2026
Universal Complex Quantum-Like Bits from Hermitian Weighted Graphs
Ethan Dickey, Sabre Kais
We study when block-coupled regular graphs can realize prescribed complex quantum-like (QL) bit states as exact synchronized eigenstates. Two regular subgraphs and supp…