Cloud resource demands are rapidly increasing exponentially with the development of cloud computing. For this sake, new modern methods and techniques are needed to improve its quality of service. In this work, the problem of resource distribution management in cloud computing is formulated as an optimisation problem. To this end, we exploit the constrained quantum optimisation algorithm (CQOA) in resource distribution management by considering queueing aspect in order to optimise and improve its performance in terms of computational complexity, accuracy, and energy consumption. Next, we study the implementation and the configuration of the CQOA. After, we investigate the computational complexity of selecting the optimal distribution scenario that corresponds to minimum energy consumption. We also express the lower and upper bounds of the overall possible assignment scenarios within the database. Finally, we validate the efficiency of the proposed implemented CQOA by constructing a simulation environment.
Cloud resource demands are rapidly increasing exponentially with the development of cloud computing. For this sake, new modern methods and techniques are needed to improve its quality of service. In this work, the problem of resource distribution management in cloud computing is formulated as an optimisation problem. To this end, we exploit the constrained quantum optimisation algorithm (CQOA) in resource distribution management by considering queueing aspect in order to optimise and improve its performance in terms of computational complexity, accuracy, and energy consumption. Next, we study the implementation and the configuration of the CQOA. After, we investigate the computational complexity of selecting the optimal distribution scenario that corresponds to minimum energy consumption. We also express the lower and upper bounds of the overall possible assignment scenarios within the database. Finally, we validate the efficiency of the proposed implemented CQOA by constructing a simulation environment.
Cloud resource demands are rapidly increasing exponentially with the development of cloud computing. For this sake, new modern methods and techniques are needed to improve its quality of service. In this work, the problem of resource distribution management in cloud computing is formulated as an optimisation problem. To this end, we exploit the constrained quantum optimisation algorithm (CQOA) in resource distribution management by considering queueing aspect in order to optimise and improve its performance in terms of computational complexity, accuracy, and energy consumption. Next, we study the implementation and the configuration of the CQOA. After, we investigate the computational complexity of selecting the optimal distribution scenario that corresponds to minimum energy consumption. We also express the lower and upper bounds of the overall possible assignment scenarios within the database. Finally, we validate the efficiency of the proposed implemented CQOA by constructing a simulation environment.
The cloud computing field suffers from the heavy processing caused by the exponentially increasing data traffic. Therefore, optimizing the network performance and achieving a better quality of service (QoS) became a central goal. In cloud computing, the problem of energy consumption of resource distribution management system (RDMS) is presented as an optimization problem. Most of the existing classical optimization approaches, such as heuristic and metaheuristic have high computational complexity. In this work, we proposed a quantum optimization strategy that executes the tasks exponentially faster and with high accuracy named constrained quantum optimization algorithm (CQOA). We exploit the CQOA in RDMS as a toy example for pointing out the efficiency of the proposed quantum strategy in reducing energy consumption and computational complexity. Following that, we investigate the CQOA's implementation, setup, and computational complexity. Finally, we create a simulation environment to evaluate the efficiency of the suggested implemented constrained quantum strategy.
Cloud computing has transformed modern digital infrastructure by enabling on-demand access to scalable computational resources. However, the increasing complexity of dynamic workloads and the need for efficient resource allocation present persistent challenges in maintaining performance, cost efficiency, and energy sustainability. This paper introduces a Quantum-Driven Optimization (QDO) framework, a hybrid quantum-classical approach designed to enhance cloud resource allocation by integrating quantum computing techniques with classical optimization methods. The proposed framework leverages Quantum Annealing (QA) and the Variational Quantum Eigensolver (VQE) to optimize resource distribution, minimizing energy consumption and operational costs while maximizing throughput and utilization efficiency. Experimental evaluations demonstrate that the QDO framework achieves a 27% improvement in resource utilization, a 34% reduction in operational costs, and a 21% enhancement in task completion time compared to traditional heuristic-based approaches. Additionally, the hybrid model reduces Service Level Agreement (SLA) violations by 18%, ensuring robust Quality of Service (QoS) for cloud users. The framework employs classical algorithms for preprocessing and decision-making while delegating complex optimization tasks to quantum solvers, ensuring scalability across diverse cloud environments. This study highlights the transformative potential of hybrid quantum-classical computing in addressing cloud resource allocation challenges. The results indicate significant improvements in energy efficiency, cost-effectiveness, and system responsiveness, making the QDO framework a viable solution for next-generation cloud infrastructures. Future research directions include extending the framework to multi-cloud architectures and investigating advanced quantum algorithms for further optimization gains.
Abstract Integrating quantum network optimization with traditional cloud computing presents a groundbreaking approach to enhancing computational efficiency and resource management. This study investigates the quantifiable impact of quantum-classical hybrid systems in cloud environments, focusing on resource utilization enhancement and task scheduling optimization. Using a MATLAB-based simulation environment interfaced with Variational Quantum Eigensolver (VQE) simulations, this research implements a three-layer architecture across 50 nodes, combining quantum optimization algorithms with classical scheduling techniques through a GPS queue model. The hybrid quantum-classical framework achieves remarkable improvements, including a 180% increase in task throughput, 70% reduction in response time, 41.5% improvement in resource utilization, and 27.1% enhancement in energy efficiency while maintaining 85% efficiency under peak load conditions and demonstrating 99.5% success rate for short-term tasks and 97.8% for long-running operations. Despite hardware limitations of existing quantum processors and scalability constraints, the system establishes a foundation for future developments, including advanced error correction mechanisms, expanded system scalability beyond 50 nodes, and enhanced resource utilization. These findings establish quantum-enhanced cloud computing as a viable solution for next-generation cloud infrastructure, particularly in managing complex workloads and optimizing resource allocation.
Cloud computing has fundamentally transformed digital infrastructure by providing on-demand access to scalable computational resources. Yet the inherent unpredictability of workloads alongside surging demands for efficient resource distribution continues to present substantial operational hurdles. This investigation introduces a Quantum-Driven Optimization framework that synergistically combines quantum and classical computational paradigms to improve resource allocation efficacy within cloud ecosystems. The proposed methodology employs Quantum Annealing alongside Variational Quantum Eigensolver algorithms to optimize resource distribution through simultaneous minimization of energy expenditure and operational overhead while maximizing throughput and utilization rates. Empirical validation demonstrates that our framework achieves measurable improvements over conventional heuristic methodologies, specifically showing enhanced resource utilization, reduced operational costs, and accelerated task completion times. The hybrid architecture effectively distributes computational burden by delegating preprocessing and decision-making functions to classical systems while quantum processors tackle inherently complex optimization problems. The solution demonstrates scalability and adaptability across diverse cloud deployment scenarios while exhibiting reduced Service Level Agreement violations, thereby ensuring superior Quality of Service for end-users. This research contributes meaningful insights regarding the practical implementation of hybrid quantum-classical approaches for addressing contemporary resource allocation challenges within cloud computing infrastructures.
As the popularity of quantum computing continues to grow, efficient quantum machine access over the cloud is critical to both academic and industry researchers across the globe. And as cloud quantum computing demands increase exponentially, the analysis of resource consumption and execution characteristics are key to efficient management of jobs and resources at both the vendor-end as well as the client-end. While the analysis and optimization of job / resource consumption and management are popular in the classical HPC domain, it is severely lacking for more nascent technology like quantum computing.This paper proposes optimized adaptive job scheduling to the quantum cloud taking note of primary characteristics such as queuing times and fidelity trends across machines, as well as other characteristics such as quality of service guarantees and machine calibration constraints. Key components of the proposal include a) a prediction model which predicts fidelity trends across machine based on compiled circuit features such as circuit depth and different forms of errors, as well as b) queuing time prediction for each machine based on execution time estimations.Overall, this proposal is evaluated on simulated IBM machines across a diverse set of quantum applications and system loading scenarios, and is able to reduce wait times by over 3x and improve fidelity by over 40% on specific usecases, when compared to traditional job schedulers.