Towards an efficient implementation of Dempster–Shafer: \(\alpha \)-junction fusion rules on quantum circuits

Quantum computing has become a promising area of research due to its ability to go beyond classical capability in various applications, including information theory. One such application is in the Dempster–Shafer theory, which has mathematically correspondence to quantum computation. In particular, quantum algorithms have the potential to efficiently process evidence evidenced in most information fusion rules. This study proposes a method based on a specific evidence combination rule, known as the \(\alpha \) $\alpha$ -junctions, on quantum circuits using the variational quantum linear solver. The geometrical features and matrix decomposition of \(\alpha \) $\alpha$ -junction operators allow an efficient implementation on quantum circuits, resulting in greater accuracy, and practically it can be compared to previous methods in Dempster–Shafer theory.