This study proposed the hierarchy of quantum kernel networks by combing multi quantum networks with smoothed particle hydrodynamics (SPH). The Lagrangian quantum network model was further developed based on an improved quantum multilayer perceptron (QMLP). A sequential hybrid quantum-classical framework was constructed to ensure robust particle gradient-based optimization and mitigate barren plateaus for computational particle dynamics. This approach combines smoothing kernels with quantum learning, establishing a novel quantum intelligent particle paradigm. The framework was validated through some benchmarks on multifarious quantum neural networks, static multi-level vortex reconstructions and transient scalar advective transports. Numerical results show that while elementary quantum circuits struggle with generalization in unstructured domains, the hybrid crossed-QMLP matches the fitting accuracy of classical SPH in quantum optimized space. Despite current limitations in computational efficiency and hardware implementation, this work paves the way for a new investigation on quantum-particle approach by mapping unstructured Lagrangian particle topologies into integrated quantum networks.
This study proposed the hierarchy of quantum kernel networks by combing multi quantum networks with smoothed particle hydrodynamics (SPH). The Lagrangian quantum network model was further developed based on an improved quantum multilayer perceptron (QMLP). A sequential hybrid quantum-classical framework was constructed to ensure robust particle gradient-based optimization and mitigate barren plateaus for computational particle dynamics. This approach combines smoothing kernels with quantum learning, establishing a novel quantum intelligent particle paradigm. The framework was validated through some benchmarks on multifarious quantum neural networks, static multi-level vortex reconstructions and transient scalar advective transports. Numerical results show that while elementary quantum circuits struggle with generalization in unstructured domains, the hybrid crossed-QMLP matches the fitting accuracy of classical SPH in quantum optimized space. Despite current limitations in computational efficiency and hardware implementation, this work paves the way for a new investigation on quantum-particle approach by mapping unstructured Lagrangian particle topologies into integrated quantum networks.
With the limitations of current noisy intermediate scale quantum (NISQ) devices, there is a need for hybrid quantum-classical learning models to operate more efficiently within existing hardware constraints. The design of cost-effective hybrid quantum-classical learning systems is therefore imperative for various applications, including biosignal processing in the healthcare sector. This motivates the investigation into the reduction of computational complexity of a hybrid quantumclassical neural network. We propose a new hybrid model combining a quantum neural network (QNN) with a binary neural network (BNN), known as quBNN, with the aim to reduce model complexity. For benchmarking, we consider a classical multilayer perceptron (MLP) and a standard nonbinarised version of quBNN that combines a QNN with an MLP, named as quilp. We evaluated all models on a multi-class dataset containing multimodal biosignals. We find that quMLP can outperform the classical MLP with minimal additional complexity, while quBNN maintains performance comparable with the classical MLP, with reduced computational complexity. We apply pruning and quantisation techniques to the QNN within the proposed quBNN model, aiming to further reduce its complexity. This compression yields substantial reductions in parameter and quantum gate count when compiled for quantum hardware, albeit with performance degradation.
Quantum machine learning (QML) is promising for potential speedups and improvements in conventional machine learning (ML) tasks (e.g., classification/regression). The search for ideal QML models is an active research field. This includes identification of efficient classical-to-quantum data encoding scheme, construction of parametric quantum circuits (PQC) with optimal expressivity and entanglement capability, and efficient output decoding scheme to minimize the required number of measurements, to name a few. However, most of the empirical/numerical studies lack a clear path towards scalability. Any potential benefit observed in a simulated environment may diminish in practical applications due to the limitations of noisy quantum hardware (e.g., under decoherence, gate-errors, and crosstalk). We present a scalable quantum-classical hybrid deep neural network (DeepQMLP) architecture inspired by classical deep neural network architectures. In DeepQMLP, stacked shallow Quantum Neural Network (QNN) models mimic the hidden layers of a classical feed-forward multi-layer perceptron network. Each QNN layer produces a new and potentially rich representation of the input data for the next layer. This new representation can be tuned by the parameters of the circuit. Shallow QNN models experience less decoherence, gate errors, etc. which make them (and the network) more resilient to quantum noise. We present numerical studies on a variety of classification problems to show the trainability of DeepQMLP. We also show that DeepQMLP performs reasonably well on unseen data and exhibits greater resilience to noise over QNN models that use a deep quantum circuit. DeepQMLP provided up to 25.3% lower loss and 7.92% higher accuracy during inference under noise than QMLP.
This study established a quantum-classical hybrid framework that integrates quantum computing paradigm with meshfree finite particle method. By harnessing quantum superposition and entanglement, it hybridized the critical computational kernels (termed as quantum finite particle method). A resource-efficient quantum computational strategy on multi-partitioned zones was proposed, which leverages a fixed small-scale quantum circuit as a fundamental processing unit to handle inner product for arbitrarily sized arrays. This approach employs iterative nesting of the quantum-core operation to accommodate varying input dimensions while maintaining hardware feasibility throughout. Motivated with developed quantum framework, the novel numerical discretization for hybrid quantum computational particle dynamics can be derived commonly and applied in fluid flows. Through a sequence of numerical experiments purposefully, the proposed numerical model was thoroughly validated and analyzed. Results demonstrate that integrating quantum computing to hybridize conventional linear combinations of particle dynamics serves as a novel computing paradigm. By further extending into the numerical investigation of viscoelastic, highly elastic, and purely elastic fluids under high Weissenberg number conditions, the applicability of simulation framework is broadened. Despite bottlenecks in quantum hardware and computational efficiency on this process, these advances offer critical insights for transitioning quantum-enhanced fluid simulation to practical engineering applications.
The use of quantum neural networks for machine learning is a paradigm that has recently attracted considerable interest. Under certain conditions, these models approximate the distributions of their datasets using truncated Fourier series. Owing to the trigonometric nature of this fit, angle-embedded quantum neural networks may have difficulty fitting nonharmonic features in a given dataset. Moreover, the interpretability of hybrid neural networks remains a challenge. In this study, we introduce an interpretable class of hybrid quantum neural networks that pass the inputs of the dataset in parallel to (a) a classical multi-layered perceptron and (b) a variational quantum circuit, after which the 2 outputs are linearly combined. The quantum neural network creates a smooth sinusoidal foundation based on the training set, and the classical perceptrons fill the nonharmonic gaps in the landscape. We demonstrate this claim using 2 synthetic datasets sampled from periodic distributions with added protrusions as noise. The training results indicate that parallel hybrid network architecture can improve solution optimality on periodic datasets with additional noise.
Quantum computing and artificial intelligence (AI) are converging into a distinct research frontier commonly referred to as quantum-enhanced artificial intelligence, or quantum machine learning (QML). This paper presents a conceptual and integrative review of how principles from quantum physics superposition, entanglement, and interference can be embedded into machine learning pipelines to reshape computational paradigms for classification, optimization, and representation learning. Using a structured narrative-review methodology, the study synthesizes theoretical foundations, algorithmic building blocks (quantum feature maps, variational quantum circuits, quantum kernel methods), and application domains spanning drug discovery, finance, materials science, and natural language processing. The review develops a hybrid quantum-classical architecture model and a complexity-comparison framework contrasting classical algorithms with their quantum counterparts, including Grover's search and Shor's factoring algorithm. Findings indicate that while theoretical speedups are well established, practical quantum advantage on noisy intermediate-scale quantum (NISQ) hardware remains constrained by decoherence, barren plateaus, and limited qubit connectivity. The paper contributes a synthesized taxonomy of quantum-enhanced AI methods and an evidence-based research agenda emphasizing error mitigation, hardware-aware ansatz design, and hybrid workload partitioning. The discussion further situates these developments within the broader trajectory of next-generation computing, arguing that near-term value will accrue primarily through hybrid quantum-classical systems rather than fully quantum pipelines. Implications for researchers, industry practitioners, and policymakers are discussed, alongside limitations inherent to a literature-synthesis approach.
We present a quantum computing algorithm for the smoothed particle hydrodynamics (SPH) method. We use a normalization procedure to encode the SPH operators and domain discretization in a quantum register. We then perform the SPH summation via an inner product of quantum registers. Using a one-dimensional function, we test the approach in a classical sense for the kernel sum and first and second derivatives of a one-dimensional function, using both the Gaussian and Wendland kernel functions, and compare various register sizes against analytical results. Error convergence is exponentially fast in the number of qubits. We extend the method to solve the one-dimensional advection and diffusion partial differential equations, which are commonly encountered in fluids simulations. This work provides a foundation for a more general SPH algorithm, eventually leading to highly efficient simulations of complex engineering problems on gate-based quantum computers.