Towards Quantum Optimised Malware Containment

• URL: http://arxiv.org/abs/2604.26692v1
• Date: Wed, 29 Apr 2026 13:59:01 GMT
• Title: Towards Quantum Optimised Malware Containment
• Abstract summary: The containment of malware in computing networks may be naturally formulated as a network influence minimisation problem.<n>We propose a hybrid quantum approach which combines Quantum Amplitude Estimation (QAE) and Grover Minimum Finding (GMF)<n>We present a formal problem definition, describe the construction of the corresponding quantum oracles, and analyse the resulting complexity improvements.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The containment of malware in computing networks may be naturally formulated as a network influence minimisation problem, in which one seeks to limit the expected spread of an infection while balancing the operational cost of disabling network connections. Classical approaches often rely on Monte Carlo simulation of stochastic diffusion processes and greedy optimisation over candidate edge removals, resulting in significant computational overhead due to repeated influence evaluations. In this work, we propose a hybrid quantum approach which combines Quantum Amplitude Estimation (QAE) and Grover Minimum Finding (GMF) to provide quadratic improvements in both the estimation and optimisation components of the problem. Specifically, QAE replaces classical Monte Carlo simulation, reducing the sampling complexity of influence estimation from $O(1/\varepsilon^2)$ to $O(1/\varepsilon)$ for a target additive error $\varepsilon \ll 1$, while GMF reduces the number of candidate evaluations required to identify optimal edge removals from $O(|E_C|)$ to $O(\sqrt{|E_C|})$. We present a formal problem definition, describe the construction of the corresponding quantum oracles, and analyse the resulting complexity improvements under standard oracle assumptions. Preliminary experiments, including classical simulation of QAE and small-scale execution of Grover search on real quantum hardware, support the expected theoretical scaling. While practical implementation at scale requires fault-tolerant quantum devices, our results demonstrate that quantum algorithms offer a promising long-term direction for accelerating stochastic network optimisation problems such as malware containment.

Related papers

• Quantum-Based Optimization of Gas Throughput in Natural Gas Transmission Networks Under Hydraulic Constraints Using QAOA [0.27998963147546135]
  maximizing gas throughput in transmission networks under hydraulic and operational constraints is a problem whose complexity grows exponentially with network size.<n>This paper addresses the graph-based optimization problem by optimizing nodal-pressure assignments under the Panhandle-B hydraulic equation.<n>We show that meaningful gas-network optimization behavior can be obtained using considerably shallower QAOA circuits than initially expected.
  arXiv  Detail & Related papers  (2026-09-01T07:26:34Z)
• Scalable Lindblad Noise Learning via Stochastic Tensor-Network Simulation [48.887627688666974]
  Learning dissipation rates in large-scale open quantum systems is a major obstacle for near-term quantum technologies.<n>Here, we propose a scalable noise-learning framework for Lindblad dissipation rates that combines a simulation method, the Jump Method (TJM)<n>We demonstrate the approach on two noise models in the Ising model, in which independent dissipation rates are learned for each site up to $N_mathrmsite=16$.<n>This combination of scalable numerics and rigorous theoretical guarantees positions TJM-based noise learning as a practical foundation for characterizing dissipation in large quantum devices.
  arXiv  Detail & Related papers  (2026-08-25T15:07:11Z)
• Fault tolerant computation of the static structure factor and finite size effects [43.936586633107396]
  We develop a quantum post-processing strategy for the leading two-body finite-size correction.<n>After one-body shell effects are reduced by twist averaging, the dominant residual error is controlled by long-wavelength density fluctuations.<n>We also introduce adaptive global and local binary search procedures for identifying the infrared fitting window used to reconstruct the two-body finite size error correction.
  arXiv  Detail & Related papers  (2026-06-26T05:31:08Z)
• Quantum iterative approach to the Traveling Salesman Problem [0.6741942263052466]
  The Traveling Salesman Problem (TSP) is a classical NP-hard problem in optimization, where determining the shortest route among a set of cities becomes computationally prohibitive as the problem size increases.<n>This work explores quantum computing as an alternative approach to address this complexity.<n>Route costs are encoded as quantum phases, enabling QPE to efficiently evaluate them, while Amplitude Amplification, implemented via the Grover-Long algorithm, iteratively refines the solution space toward the optimal route.
  arXiv  Detail & Related papers  (2026-06-10T09:21:15Z)
• A scalable quantum-enhanced greedy algorithm for maximum independent set problems [0.0]
  We investigate a hybrid quantum-classical algorithm for solving the Maximum Independent Set problem on regular graphs.<n>We implement the algorithm on a 20 qubit IQM superconducting device to find independent sets in graphs with thousands of nodes.
  arXiv  Detail & Related papers  (2026-01-29T16:14:48Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Hybrid quantum-classical algorithm for near-optimal planning in POMDPs [39.682133213072554]
  Reinforcement learning (RL) provides a principled framework for decision-making in partially observable environments.<n>Recent advances demonstrate that inference on sparse Bayesian networks can be accelerated using quantum rejection sampling combined with amplitude amplification.<n>We introduce Quantum Bayesian Reinforcement Learning (QBRL), a hybrid quantum-classical look-ahead algorithm for model-based RL in partially observable environments.
  arXiv  Detail & Related papers  (2025-07-24T17:42:30Z)
• Quantum-Classical Hybrid Quantized Neural Network [8.382617481718643]
  We present a novel Quadratic Binary Optimization (QBO) model for quantized neural network training, enabling the use of arbitrary activation and loss functions.<n>We employ the Quantum Gradient Conditional Descent (QCGD) algorithm, which leverages quantum computing to directly solve the QCBO problem.
  arXiv  Detail & Related papers  (2025-06-23T02:12:36Z)
• Branch-and-bound digitized counterdiabatic quantum optimization [39.58317527488534]
  Branch-and-bound algorithms effectively solve convex optimization problems, relying on the relaxation the objective function to obtain tight lower bounds.<n>We propose a branch-and-bound digitized counterdiabatic quantum optimization (BB-DCQO) algorithm that addresses the relaxation difficulties.
  arXiv  Detail & Related papers  (2025-04-21T18:19:19Z)
• Practical Application of the Quantum Carleman Lattice Boltzmann Method in Industrial CFD Simulations [44.99833362998488]
  This work presents a practical numerical assessment of a hybrid quantum-classical approach to CFD based on the Lattice Boltzmann Method (LBM)<n>We evaluate this method on three benchmark cases featuring different boundary conditions, periodic, bounceback, and moving wall.<n>Our results confirm the validity of the approach, achieving median error fidelities on the order of $10-3$ and success probabilities sufficient for practical quantum state sampling.
  arXiv  Detail & Related papers  (2025-04-17T15:41:48Z)
• Subspace-Based Local Compilation of Variational Quantum Circuits for Large-Scale Quantum Many-Body Simulation [0.0]
  This paper proposes a hybrid quantum-classical algorithm for compiling the time-evolution operator. It achieves a 95% reduction in circuit depth compared to Trotterization while maintaining accuracy. We estimate the gate count needed to execute the quantum simulations using the LSVQC on near-term quantum computing architectures.
  arXiv  Detail & Related papers  (2024-07-19T09:50:01Z)
• Analyzing Prospects for Quantum Advantage in Topological Data Analysis [35.423446067065576]
  We analyze and optimize an improved quantum algorithm for topological data analysis. We show that super-quadratic quantum speedups are only possible when targeting a multiplicative error approximation. We argue that quantum circuits with tens of billions of Toffoli can solve seemingly classically intractable instances.
  arXiv  Detail & Related papers  (2022-09-27T17:56:15Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.