Variational Quantum Linear Solver-based Combination Rules in Dempster–Shafer Theory
Dempster–Shafer Theory (DST), as a method of handling uncertain information, is widely used in decisionmaking and information fusion. But the issue of exponential computational complexity limits its real-time application. Since quantum computers with its natural parallel computing capability can theoretically achieve speedup, an HHL-based algorithm for implementing DST operations on quantum circuits has been proposed. However, the algorithm is impossible to be implemented with high accuracy due to the limited performance of quantum computers in the current noisy intermediate-scale quantum (NISQ) era. In response to that, we utilize an up-to-date scheme Variational Quantum Linear Solver (VQLS) to conduct DST operations by solving the linear system. Besides, VQLS further reveals the structural consistency of DST with quantum computation, which enables faster circuit configuration and computation. In this paper, we first realize the transformation in belief functions by VQLS and then extends it to a methods of implementing combination rules. Simulated under a realistic classification task, the feasibility and accuracy of the proposed VQLS-based method are verified. The new VQLS-based method proposed is able to achieve combination rules at a lower error level with fewer quantum resources, which is more suitable for the NISQ era.
Code (1)
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Single-component gradient rules for variational quantum algorithms
Many near-term quantum computing algorithms are conceived as variational quantum algorithms, in which parameterized quantum circuits are optimized in a hybrid quantum-classical setup. Examples are variational quantum eig…
Improvement in Variational Quantum Algorithms by Measurement Simplification
Variational Quantum Algorithms (VQAs) are expected to be promising algorithms with quantum advantages that can be run at quantum computers in the close future. In this work, we review simple rules in basic quantum circui…
Quantum Machine LearningVariational quantum and neural quantum states algorithms for the linear complementarity problem
Variational quantum algorithms (VQAs) are promising hybrid quantum-classical methods designed to leverage the computational advantages of quantum computing while mitigating the limitations of current noisy intermediate-s…
Toward Neural Network Simulation of Variational Quantum Algorithms
Variational quantum algorithms (VQAs) utilize a hybrid quantum-classical architecture to recast problems of high-dimensional linear algebra as ones of stochastic optimization. Despite the promise of leveraging near- to i…
Neural Network simulationStochastic OptimizationVariational Monte CarloVariational Quantum Linear Solver enhanced Quantum Support Vector Machine
Quantum Support Vector Machines (QSVM) play a vital role in using quantum resources for supervised machine learning tasks, such as classification. However, current methods are strongly limited in terms of scalability on …