Q-PACT : Quantum-Parallel Agentic Coordination Toolkit

Sourodeep Kundu

Published Jan 7, 2026• 0 citations

Abstract

Abstract The convergence of quantum optimization and autonomous agentic reasoning defines a new computational frontier in large-scale resource coordination. This work introduces Q-PACT, a Quantum-Parallel Agentic Coordination Toolkit that unifies quantum optimization, fairness-driven orchestration, and adaptive multi-agent intelligence into a reproducible hybrid framework. Q-PACT addresses a key limitation in distributed and cloud-based quantum infrastructures; inefficient, inequitable scheduling of scarce quantum resources among competing agents and tasks. The proposed architecture formulates multi-agent scheduling as a Quadratic Unconstrained Binary Optimization (QUBO) model, solved through a heterogeneous pipeline integrating quantum annealing (D-Wave), variational optimization (QAOA on IonQ/Azure), and classical meta-heuristics. A noise-aware encoder, solver-adapter layer, and agentic manager collaborate to maintain fairness, adaptability, and load balance, while the QML-AURA subsystem continuously refines solver hyperparameters through feedback-driven variational learning. Q-PACT’s hybrid orchestration layer enables dynamic re-optimization, fault-tolerant fallback execution, and secure artifact exchange across distributed backends, achieving resilience under the noise and queueing constraints of NISQ-era hardware. Empirical evaluations demonstrate significant improvements in makespan reduction, workload variance, and energy minimization compared with classical heuristics, establishing the viability of quantum-assisted agentic scheduling at scale. By bridging quantum optimization paradigms, multi-agent systems, and fairness-aware orchestration, Q-PACT provides a foundational blueprint for the next generation of autonomous, cloud-integrated, and quantum-enabled coordination systems.

DOI: 10.21203/rs.3.rs-8492548/v1

Related papers

QUANTUM-ENABLED CLOUD INTELLIGENCE EXPLORING POST CLASSICAL OPTIMIZATION FOR DATA CENTRIC AI

Elangovan Sivalingam

The exponential growth of data-driven systems has outpaced the computational capacity of conventional cloud infrastructures, demanding new paradigms of intelligence and optimization. This research introduces a quantum-enabled cloud intelligence framework that integrates post-classical optimization methods with data-centric artificial intelligence pipelines. The study investigates how quantum-inspired and hybrid quantum–classical models can enhance large-scale optimization, feature extraction, and decision processes within distributed cloud environments. By coupling quantum approximate optimization algorithms (QAOA) and variational quantum circuits (VQC) with classical data analytics layers, the framework achieves reduced computational latency, improved convergence for high-dimensional problems, and enhanced interpretability of AI-driven outcomes. A prototype quantum-cloud orchestration layer is developed to dynamically allocate quantum resources through cloud APIs, enabling adaptive workload balancing across heterogeneous architectures. Empirical results from simulation and hybrid execution demonstrate significant performance gains over classical baselines in terms of both efficiency and solution quality. Beyond performance metrics, the study emphasizes ethical and sustainable computing principles, ensuring that quantum acceleration aligns with transparent, explainable, and accountable AI operations. The outcomes position quantum-enabled cloud intelligence as a foundational technology for the next generation of data-centric optimization and cognitive automation.

INTERNATIONAL JOURNAL OF NOVEL TRENDS AND INNOVATIONJan 1, 20250 citations

QCOEM: Quantum Cloud Orchestration with Evolutionary Multi-Objective Optimization

Tam N. Pham, Hoa T. Nguyen, Quan Le-Trung

Quantum cloud platforms need to dynamically orchestrate workloads across heterogeneous quantum computation backends whose noise profiles, qubit topologies, and queues vary over time. Existing orchestrators use noise-agnostic heuristics that ignore backend-specific errors, causing reduced execution fidelity, load imbalance, and frequent rescheduling. To address these challenges, we propose QCOEM - a Quantum Cloud Orchestration framework that leverages Evolutionary algorithms for Multi-objective optimization of quantum task scheduling. We compare NSGA-II and NSGA-III for jointly minimizing mean completion time, execution error rate, and load imbalance. To select schedules from a non-convex Pareto front, we apply an Augmented Achievement Scalarization Function (AASF) as a preference-based decision rule that maps the Pareto set to a single dispatchable schedule aligned with user priorities. Our extensive performance evaluation in a heterogeneous quantum cloud environment shows zero task rescheduling and about 30% higher mean fidelity than noise-agnostic heuristics, while maintaining bounded scheduling overhead. The experiment results indicate that our QCOEM framework can deliver stable, high-fidelity execution and lightweight resource management for quantum cloud computing.

cs.DCCross-listedarXiv:2607.25358IEEE ... International Conference on Cloud ComputingJul 29, 20260 citations

Optimizing Distributed Systems With Quantum Computing

Manish Patil, Shraddha Sanjay Mhetre

As systems become more complex and large-scale, there is a need for more effective scheduling algorithms to maximize resource usage and minimize job completion times. The older methods of scheduling like First-Come-First-Serve (FCFS) and Round Robin (RR), although easier to compute, tend to perform poorly in dynamic scenarios because they cannot manage intricate constraints and multi-objective optimization efficiently. As traditional methods approach their limit of performance, quantum computing presents a potentially fruitful avenue for conquering combinatorial challenges based on its ability to examine many states at once. This work proposes a quantum-aided scheduling framework that employs Quadratic Unconstrained Binary Optimization (QUBO) formulations and quantum solvers for the purpose of improving job scheduling in distributed environments. The original contribution is the marrying of quantum optimization (with IBM Qiskit's QAOA and D-Wave's hybrid solvers) with traditional distributed computing frameworks such as Apache Spark. Google Cluster Workload Traces are employed to mimic real-world situations, and jobs are described by CPU, memory requirements, and arrival times. Once the scheduling problem has been formulated into a QUBO model, quantum algorithms produce the optimized job-to-machine assignments. The outcomes are compared against baseline classical schedulers on performance metrics including make span, throughput, and resource utilization. The experiment demonstrates that quantum-assisted scheduling significantly improves makespan and enhances resource utilization, particularly under high workloads. It also provides evidence of the feasibility of integrating quantum solvers with existing big data infrastructures.

International Journal of Advances in Signal and Image SciencesSep 25, 20250 citations

An Optimized Quantum Computing Integration Approach for Multi-Cloud Environments: Architecture Design for Efficiency, Security, and Intelligent Workload Management

Dr. Natsuki Ono, Dr. Riku Ando

The integration of quantum computing into multi-cloud environments represents a transformative paradigm in distributed computing, offering substantial improvements in computational efficiency, security resilience, and adaptive workload orchestration. However, the heterogeneous nature of cloud infrastructures, combined with the nascent and resource-sensitive characteristics of quantum systems, introduces significant architectural, operational, and security challenges. This paper proposes an optimized quantum computing integration approach designed specifically for multi-cloud ecosystems, emphasizing scalable architecture design, intelligent workload distribution, and enhanced cryptographic security mechanisms.The study synthesizes foundational quantum computing principles with contemporary multi-cloud orchestration strategies to develop a hybrid architectural framework. The proposed model leverages quantum-enhanced optimization techniques, including quantum approximate optimization principles, to dynamically allocate computational tasks across distributed cloud nodes. Additionally, it integrates quantum-safe security protocols to mitigate emerging cyber threats in cloud environments. Prior research highlights the relevance of such integration, particularly in solving complex optimization problems and enhancing system-level security (Brown & White, 2022; Cao et al., 2020).A structured literature synthesis reveals that while cloud computing and quantum computing have individually matured, their convergence remains underexplored in practical deployment contexts. This paper addresses this gap by introducing an architecture that supports adaptive workload balancing, quantum-classical hybrid execution layers, and secure inter-cloud communication channels. The findings indicate that quantum-enhanced orchestration can significantly reduce computational latency and improve resource utilization efficiency in multi-cloud systems.

European Journal of Emerging Cloud and Quantum ComputingJul 1, 20260 citations

Q-OS: A System-Level Operating Framework for Quantum-Enhanced AI Workload Management in Future Computing

Mahesh Babu Chittem, Ashok Kumar Pradhan

The convergence of Quantum Computing (QC) and Artificial Intelligence (AI) is reshaping computational paradigms, creating the need for a new class of system software capable of managing hybrid workloads. This paper presents Q-OS, a Quantum-Aware Operating System designed to orchestrate hybrid quantum-classical AI pipelines across cloud and edge environments. Q-OS introduces three novel system components: a Quantum Scheduling Kernel that intelligently allocates portions of AI workloads (such as optimization or sampling) to quantum co-processors; a Quantum Resource Virtualization Layer that abstracts quantum devices as logical accelerators; and a Quantum-AI Compiler Interface that dynamically maps AI operations from frameworks such as TensorFlow and PyTorch into executable quantum kernels. Experimental evaluations using hybrid workloads-including large language model inference (The Pile dataset), quantum-classical generative adversarial networks (CelebA dataset), and reinforcement learning control (OpenAI Gym)-demonstrate that Q-OS achieves up to 32% reduction in end-to-end latency and 27 % improvement in energy efficiency compared to classical distributed systems. The results indicate that Q-OS establishes a scalable foundation for the next generation of intelligent computing infrastructures, bridging quantum and AI ecosystems for real-world deployment.

International Conference on Emerging Systems and Intelligent Computing (ESIC)Feb 7, 20260 citations

Quantum-Assisted Agentic Learning: QAOA-Based Trust-Aware Coordination for Reliable Distributed Intelligence

Kishor Kumar Gajula, Smitha Karnewar

Distributed intelligent systems rely on many autonomous agents that train a shared model on their own data, and a single faulty or malicious agent can corrupt that model. This paper proposes Quantum-Assisted Agentic Learning (QAAL), in which a coordinator agent perceives the agreement between agents' updates, keeps a trust memory of each agent, and plans which agents to aggregate by solving a quadratic unconstrained binary optimisation (QUBO) problem with a constraint-preserving quantum approximate optimisation algorithm (QAOA). QAAL was evaluated in simulation with 12 agents, non-IID data, random dropouts and three Byzantine attacks on two classification tasks, against FedAvg, coordinate-wise median, trimmed mean and Multi-Krum. With 4 of 12 agents faulty, QAAL reached 83.4% mean accuracy versus 55.2% for FedAvg and 72.5% for trimmed mean, and matched Multi-Krum (84.0%). The QAOA planner found the optimal agent subset in 98.7% of 1260 training rounds, and its trust memory separated honest from faulty agents with AUC up to 0.996. At the 12-agent scale tested, classical solvers are equally accurate and far faster, so no quantum speed-up is claimed.

QP-AIDSEMar 18, 20260 citations