The use of quantum computing as an efficient alternative to classical computing is rapidly evolving in diverse engineering applications to solve complex numerical problems. As its application becomes increasingly prominent in the future, its use should be complemented by validation and practical recommendations. This paper provides practical recommendations regarding the accuracy and efficiency of quantum computing for solving diverse types of Bayesian networks for bridge evaluation and maintenance, including basic and fuzzy-based networks. The methodology for solving the considered networks, development of quantum circuits, and accuracy of the results (quantum computing versus simulator and classical computing) were examined. Research findings indicate the feasibility of quantum computing for solving small-scale bridge Bayesian networks (error of 6% approximately), whereas the accuracy of solutions for solving complex networks using available open-access quantum computers is compromised owing to the limited number of available attempts and the compound effect of quantum error (error up to 37% approximately). Practical recommendations were provided to practitioners and future research needs are identified.
The use of quantum computing as an efficient alternative to classical computing is rapidly evolving in diverse engineering applications to solve complex numerical problems. As its application becomes increasingly prominent in the future, its use should be complemented by validation and practical recommendations. This paper provides practical recommendations regarding the accuracy and efficiency of quantum computing for solving diverse types of Bayesian networks for bridge evaluation and maintenance, including basic and fuzzy-based networks. The methodology for solving the considered networks, development of quantum circuits, and accuracy of the results (quantum computing versus simulator and classical computing) were examined. Research findings indicate the feasibility of quantum computing for solving small-scale bridge Bayesian networks (error of 6% approximately), whereas the accuracy of solutions for solving complex networks using available open-access quantum computers is compromised owing to the limited number of available attempts and the compound effect of quantum error (error up to 37% approximately). Practical recommendations were provided to practitioners and future research needs are identified.
Quantum computing has emerged as a transformative paradigm, leveraging principles of quantum mechanics to tackle computationally intractable problems. This manuscript explores the potential of quantum computing for solving complex engineering problems—specifically optimization, simulation, and data analysis tasks—using technologies and methodologies available up to 2022. We examine both gate-based and quantum annealing approaches, outline experimental frameworks, and compare performance against classical counterparts. Results from simulated benchmark problems demonstrate promising speedups in select cases, though practical adoption is constrained by hardware limitations such as qubit coherence times and noise. The study concludes by highlighting avenues for integrating hybrid quantum-classical workflows in engineering, along with a discussion of current constraints and future directions. Over the past decade, research efforts have focused on understanding how quantum phenomena like superposition and entanglement can be harnessed to realize computational advantages for specific problem classes. In particular, combinatorial optimization problems—ubiquitous in engineering design and logistics—offer fertile ground for quantum algorithms such as the Quantum Approximate Optimization Algorithm (QAOA) and quantum annealing. Additionally, quantum simulation techniques, including the Variational Quantum Eigensolver (VQE), promise to accelerate the modeling of physical systems at the molecular and materials level, potentially informing the design of next-generation structural and functional materials. Beyond raw algorithmic performance, this paper carefully assesses the end‑to‑end workflow, accounting for overheads in problem encoding, error mitigation, and classical post‑processing. We also present a detailed analysis of resource utilization—quantified by qubit counts, circuit depths, and annealing schedules—highlighting trade‑offs between solution quality and execution time. Ultimately, our findings underscore that, while pure quantum speedups remain rare in 2022, hybrid approaches harnessing both quantum and classical resources can yield practical benefits for small‑to‑medium scale engineering tasks. This expanded evaluation provides a roadmap for researchers and practitioners interested in applying quantum computing to real‑world engineering challenges.
Quantum-enhanced optimization is a burgeoning field with the potential to revolutionize various computational tasks, particularly those involving complex data structures like Bayesian networks. This paper explores the application of quantum optimization algorithms to Bayesian network inference, aiming to enhance efficiency and accuracy. We investigate the integration of quantum annealing and quantum approximate optimization algorithms to address the inherent computational challenges associated with Bayesian network modeling. This work presents a novel methodology for leveraging quantum mechanics to accelerate the process of parameter estimation and structure exploration within Bayesian networks. The core claim is that this integration will yield significant improvements in inference performance compared to classical methods, especially for large and complex networks. This paper details the theoretical framework, experimental validation, and initial results demonstrating the feasibility and potential impact of this approach.
Abstract In multi-agent systems, Bayesian networks are pivotal for inference and decision-making under uncertainty, yet they face significant challenges, such as high computational complexity and slow decision speed. Quantum computing, leveraging superposition and entanglement, offers potential advantages for solving certain complex problems. Therefore, exploring Bayesian networks within the quantum multi-agent framework promises enhanced inference and decision-making capabilities. While quantum Bayesian networks for inference have been extensively studied, quantum dynamic Bayesian networks for inference and quantum decision networks for decision-making remain underexplored. In the noisy intermediate-scale quantum (NISQ) era, quantum computers struggle to process the long-term temporal structures of dynamic Bayesian networks due to limited resources. To address this, we propose a recursive quantum-classical hybrid Bayesian network inference method, which decomposes dynamic Bayesian networks into smaller subnetworks along the time series. Each subnetwork is represented by a reduced-scale quantum circuit, and the forward and backward operators are computed recursively, enabling efficient filtering and smoothing inference. In addition, we propose an optimal decision-making method based on quantum decision networks, which maps utility values to quantum probabilities and identifies the optimal action by determining the quantum state corresponding to the maximum expected probability. We validate the effectiveness of these algorithms using the IonQ quantum simulator and compare their performance with classical methods. The results demonstrate that our proposed quantum algorithms can effectively perform inference and decision-making tasks well on NISQ devices. The proposed methods provide a foundation for collaborative inference and decision-making within the quantum multi-agent framework.
Abstract Unmanned systems play a crucial role in modern cyber-physical systems, supporting applications in defense, surveillance, and commercial operations. As these systems grow in scale and complexity, their reliability becomes increasingly challenging to assess due to intricate dependencies among components and subsystems. Traditional system reliability analysis using classical Bayesian networks struggle with computational scalability, limiting their applicability in large-scale systems. This study explores quantum Bayesian networks (QBNs) as a novel approach for reliability analysis and prediction in unmanned systems. A quantum circuit-based Bayesian network model is developed to represent component dependencies, leveraging quantum computing advantages such as superposition and entanglement. The methodology is applied to the communication system of an unmanned surface vessel using IBM’s Qiskit and executed on a supercomputer using quantum simulators. Results demonstrate the potential of quantum computing to enhance reliability and risk assessments, offering a scalable solution for applications relating to complex systems.
This thesis explores the intersection of Bayesian inference and quantum computing, with a particular focus on developing and analyzing quantum approaches to probabilistic modeling. The motivation arises from the limitations of classical inference methods, which often become intractable when applied to high-dimensional distributions and complex Bayesian networks. By leveraging quantum algorithms, the work investigates how probabilistic reasoning can benefit from computational speedups, scalability, and more efficient handling of uncertainty.The implementation targets canonical benchmark problems—the Sprinkler Network and the Asia Network—where both classical and quantum Bayesian inference techniques are applied and compared. Using Qiskit, the thesis demonstrates how quantum circuits can encode probabilistic models through parameterized rotations and controlled operations, and how posterior distributions can be computed by sampling and amplitude amplification. Comparative experiments systematically evaluate the accuracy, variance, and scalability of quantum Bayesian inference against classical baselines, highlighting trade-offs between precision and shot counts while exploring the potential for quadratic speedups.The results show that although present-day hardware constraints, such as limited qubit counts and noise, restrict large-scale deployment, quantum implementations already display strong promise for complex probabilistic reasoning tasks. Importantly, the conclusions underscore the role of quantum Bayesian networks as a pathway toward practical quantum-enhanced machine learning.
In this work, we study the application of quantum computing to complex engineering simulations and decisions. Using these quantum algorithms like Quantum Approximate Optimization Algorithm (QAOA), Variational Quantum Eigensolver (VQE), Quantum Support Vector Machine (QSVM) and Grover’s Algorithm, we will optimize computational efficiency, accuracy and diversity of solutions in engineering. It was performed with a comparative analysis with classical algorithms based on performance metrics such as accuracy of solution, execution time, and optimality of the decision. Analysis of experimental results showed QAOA produces a 92.3% solution accuracy, higher than that (88.6%) of classical simulated annealing and (85.4%) genetic algorithms. Similarly, VQE achieved 27% reduction in execution time versus the classical equivalent and QSVM achieved 94.1% classification accuracy on engineering pattern recognition tasks. Grover’s Algorithm also resulted in a 3.7x faster search efficiency in decision oriented simulation. Finally, the study shows that quantum inspired models can perform efficiently on large scale and highly complex engineering problems. These findings provide a major leap in realizing the capability to harness quantum technologies for real time, scalable decision making in structural analysis, lifecycle management and intelligent system design. Such results make way for future developments of hybrid quantum classical computing frameworks that could be deployed in industry.