arXiv:1607.01084 · IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum

Performance Models for Split-Execution Computing Systems

Travis S. Humble, Alexander J. McCaskey, Jonathan Schrock, Hadayat Seddiqi, Keith A. Britt, Neena Imam

Published May 1, 2016• 5 citations

Abstract

Split-execution computing leverages the capabilities of multiple computational models to solve problems, but splitting program execution across different computational models incurs costs associated with the translation between domains. We analyze the performance of a split-execution computing system developed from conventional and quantum processing units (QPUs) by using behavioral models that track resource usage. We focus on asymmetric processing models built using conventional CPUs and a family of special-purpose QPUs that employ quantum computing principles. Our performance models account for the translation of a classical optimization problem into the physical representation required by the quantum processor while also accounting for hardware limitations and conventional processor speed and memory. We conclude that the bottleneck in this split-execution computing system lies at the quantum-classical interface and that the primary time cost is independent of quantum processor behavior.

DOI: 10.1109/ipdpsw.2016.113

Related papers

Simulated execution of hybrid quantum computing systems

Travis S. Humble, Ronadl J. Sadlier, Keith A. Britt

We use modeling and simulation to study the behavior and performance of hybrid quantum computing systems. Our approach is based on a layered design with abstract machine models, which identify the key components and interfaces for quantum processing units, quantum programming models, and hybrid execution models. We use discrete-event simulating to track the dynamical state of hierarchical abstract machine models while executing test programs, and we collect statistics on time and energy consumption to forecast the resources required by quantum processors for future scientific computation.

SPIE Quantum Information Science, Sensing, and ComputationMay 14, 20184 citations

Design and Implementation of a Novel Hybrid Quantum-Classical Processor for Enhanced Computation Speed

Mohammed Saleem Sultan, Mohammed Shahid Sultan

One of the primary focuses in the rapidly changing scenery of quantum computing is one of the most promising methodologies for transgressing the current feat of quantum technologies: a better mix of quantum and classical paradigms of computations.This paper suggests a new hybrid quantum-classical processor architecture that augments the computational speed and enhances efficiency by utilizing powers emanating from the quantum and classical processing units.The architecture proposed in the study incorporates quantum processing units with classical processing units, with CPUs interfaced tightly to support dynamic task allocation with a view toward computational requirements.Hybrid processor design caters to the performance of quantum algorithms that usually involve classical preprocessing and postprocessing, such as the Variational Quantum Eigensolver and Quantum Approximate Optimization Algorithm.These algorithms are essential for any complicated optimization, the simulation of quantum systems, and applications in machine learning.We provide an insightful processor architecture design, understanding the communication protocol details between QPU and CPU, the scheduling mechanism for hybrid tasks, and the optimization techniques employed to minimize data transfer overhead while maximizing computational throughput.A lot of these implementation challenges, like quantum error correction, managing the coherence time, and classical-quantum data conversion, are something that innovations in hardware design and software algorithms can achieve.In this paper, the performance of the hybrid processor is, for the first time, fully benchmarked based on simulation and experimental setups.Resultsshow that this hybrid approach outperforms standalone quantum and classical processors on specific computational tasks by ten times in optimization problems and five times for machine learning.These include case studies showing that for some problems, the processor can solve real-world problems much more efficiently than any existing quantum or classical system.Such case studies include quantum chemistry simulations, cryptographic tasks, and training machine learning models.We turn to the scalability and flexibility of the hybrid processor to extend the horizon of these case studies and to bridge the gap between the current quantum computing capabilities and the race toward fully functional quantum computers.This new hybrid quantum-classical processor architecture makes significant progress in quantum computing by providing a pragmatic, workable solution for harnessing quantum mechanics but using the maturity of classical computing.The results show how to proceed with the research involving the hybrid system and the many potential applications of such systems across optimization, cryptography, and artificial intelligence.This study is significant as it offers a practical approach to overcoming the limitations of current quantum and classical processors, providing a pathway to more efficient and scalable computational solutions.

International Journal of Science and Research (IJSR)Aug 5, 20240 citations

QPU-System Co-Design for Quantum HPC Accelerators

Karen Wintersperger, Hila Safi, Wolfgang Mauerer

The use of quantum processing units (QPUs) promises speed-ups for solving computational problems, but the quantum devices currently available possess only a very limited number of qubits and suffer from considerable imperfections. One possibility to progress towards practical utility is to use a co-design approach: Problem formulation and algorithm, but also the physical QPU properties are tailored to the specific application. Since QPUs will likely be used as accelerators for classical computers, details of systemic integration into existing architectures are another lever to influence and improve the practical utility of QPUs. In this work, we investigate the influence of different parameters on the runtime of quantum programs on tailored hybrid CPU-QPU-systems. We study the influence of communication times between CPU and QPU, how adapting QPU designs influences quantum and overall execution performance, and how these factors interact. Using a simple model that allows for estimating which design choices should be subjected to optimisation for a given task, we provide an intuition to the HPC community on potentials and limitations of co-design approaches. We also discuss physical limitations for implementing the proposed changes on real quantum hardware devices.

arXiv:2208.11449Aug 24, 20222 citations

Quantum Accelerators for High-Performance Computing Systems

Keith A. Britt, Fahd A. Mohiyaddin, Travis S. Humble

We define some of the programming and system-level challenges facing the application of quantum processing to high-performance computing. Alongside barriers to physical integration, prominent differences in the execution of quantum and conventional programs challenges the intersection of these computational models. Following a brief overview of the state of the art, we discuss recent advances in programming and execution models for hybrid quantum-classical computing. We discuss a novel quantum-accelerator framework that uses specialized kernels to offload select workloads while integrating with existing computing infrastructure. We elaborate on the role of the host operating system to manage these unique accelerator resources, the prospects for deploying quantum modules, and the requirements placed on the language hierarchy connecting these different system components. We draw on recent advances in the modeling and simulation of quantum computing systems with the development of architectures for hybrid high-performance computing systems and the realization of software stacks for controlling quantum devices. Finally, we present simulation results that describe the expected system-level behavior of high-performance computing systems composed from compute nodes with quantum processing units. We describe performance for these hybrid systems in terms of time-to-solution, accuracy, and energy consumption, and we use simple application examples to estimate the performance advantage of quantum acceleration.

arXiv:1712.01423IEEE International Conference on Rebooting Computing (ICRC)Nov 1, 201733 citations

A Hybrid Approach to Data Analysis: Performance Issues in Integrated Quantum and Cloud Computing

Dr Rajendirakumar S

Abstract The integration of cloud computing architectures with quantum computational models represents a significant paradigm shift in the field of large-scale data analysis. While quantum processors possess the theoretical capability to solve complex statistical and logistical problems exponentially faster than classical systems, deploying them within conventional cloud environments introduces severe performance bottlenecks. These challenges primarily revolve around network latency, quantum state decoherence, and the inadequacies of classical resource provisioning algorithms. In this paper, we explore the performance issues associated with hybrid quantum-cloud infrastructures and propose a structured decision-making and scheduling framework. By analyzing deployment constraints, cryptographic overheads, and hardware limitations, this study highlights the critical pathways and ethical considerations necessary for standardizing Quantum-as-a-Service (QaaS) in modern enterprise datacenters. Keywords: Quantum processors, Quantum-as-a-Service(QaaS), makespan 1.Introduction The integration of cloud computing and quantum computation represents a crucial frontier for the future of complex data analysis. Cloud computing has revolutionized the modern information technology landscape by transitioning computational resources from localized, purchased products to highly scalable, on-demand services delivered over the internet. Simultaneously, quantum computing offers unprecedented computational advantages through fundamental physical phenomena like entanglement and superposition, enabling the resolution of highly complex logistical, chemical, and statistical problems. However, merging these two distinct technological domains into a unified framework introduces severe performance bottlenecks related to dynamic resource provisioning, network communication latency, and task scheduling. The primary problem lies in the efficient execution of large-scale data analysis pipelines that make both classical datacenters and quantum processing units (QPUs). Existing approaches are demonstrably insufficient for managing this hybrid computing environment for two main reasons. First, conventional cloud load balancing and resource allocation algorithms are designed solely for deterministic classical virtual machines, fundamentally failing to account for the unique coherence times, error rates, and state preparation constraints of quantum hardware. Fig 1.1 shows Cloud balancing. Second,current cryptographic protocols designed for delegated quantum computing , while excellent at ensuring the blindness and security of user data, impose substantial communication and entangling overheads that severely degrade end-to-end performance in real-world datacenter along with Circuit diagram in Fig.1.2. Figure 1.1 Cloud Balancing with web servers To address these critical performance issues, this paper introduces a novel architectural approach designed specifically for hybrid quantum-cloud systems. We aim to bridge the gap between theoretical quantum potential and practical cloud deployment. Specifically, our work makes the following contributions: We propose a structured, hybrid decision-making and scheduling framework that dynamically partitions and routes data analysis tasks between classical cloud servers and quantum nodes. We formulate a comprehensive, hypothetical evaluation methodology to simulate the makespan and resource utilization of this hybrid system, identifying key latency bottlenecks in delegated quantum operations. Fig 1.2. Quantum Circuit diagram 2.Classical Cloud Computing The first category of related work focuses on resource management and provisioning in classical cloud computing. Traditional methods in this domain emphasize minimizing the computational makespan of tasks through selective heuristics, such as min-min and max-min scheduling algorithms, which allocate virtual machines based on fluctuating task demands. Furthermore, comprehensive load balancing schemes have been developed to ensure efficient resource utilization in accordance with strict Service Level Agreements (SLAs), allowing resources to be provisioned on a pay-as-you-go basis. While these classical models demonstrate robust strengths in minimizing computational wait times and maximizing server efficiency, their fundamental weakness is their inability to schedule probabilistic and highly sensitive quantum operations. In contrast to these purely classical frameworks, our proposed work directly integrates quantum-specific hardware constraints, such as state preparation delays and decoherence windows, into the provisioning logic. The second category addresses broader enterprise cloud adoption and organizational decision-making frameworks. Research in this area highlights the necessity for generic, multi-criteria decision frameworks that evaluate cloud infrastructures beyond mere cost considerations, factoring in specific enterprise risks, benefits, and IT support metrics. Additionally, numerous studies have developed strategic roadmaps for Small and Medium Enterprises (SMEs) to navigate complex interoperability, knowledge, and security challenges during cloud migration. Although these frameworks provide excellent strategic guidance for adopting standard classical services, they lack operational mechanisms for managing the performance issues introduced by bleeding-edge quantum co-processors. Our work builds upon these established enterprise decision-making structures by providing a functional, low-level deployment pipeline tailored for hybrid operations. The third category explores the theoretical foundations of delegated quantum computing and interdisciplinary quantum applications. Delegated quantum computing allows clients with extremely low computational capabilities to securely outsource demanding tasks to a powerful quantum server, often utilizing measurement-based models and complex prepare-and-send communication paradigms to preserve data blindness. Concurrently, quantum computing frameworks have been utilized to explore deep interdisciplinary problems—ranging from physics paradoxes to advanced chemical modeling—demonstrating vast analytical potential. The primary weakness of this category is that much of the academic research remains focused on abstract theoretical protocols or isolated quantum circuits, rather than addressing the physical infrastructure pitfalls and massive scale required for cloud integration. This paper bridges that gap by embedding delegated quantum paradigms within a concrete, performance-oriented enterprise cloud architecture. 3.Hybrid Quantum-Cloud To tackle the performance issues inherent in hybrid data analysis, we propose a modular Hybrid Quantum-Cloud Provisioning Framework. The system follows a structured, numbered pipeline designed to seamlessly route computational tasks across heterogeneous hardware. First, classical user requests are ingested by a central cloud load balancer that analyzes the computational complexity and algorithmic requirements of the incoming dataset. Second, the system employs a multi-criteria decision engine to partition the workflow; classical data preprocessing is routed to standard virtual machines, while complex optimization components are packaged as isolated quantum circuits. Third, the framework utilizes a delegated quantum computing protocol to securely transmit the quantum state from the classical node to the QPU, applying a prepare-and-send methodology to preserve data blindness during execution. Finally, the resulting quantum measurements are returned to the classical cloud for post-processing and aggregation before the final analysis is delivered to the end user. The core design choice in this approach is the adaptation of selective scheduling heuristics to manage the delicate interaction between classical datacenters and quantum nodes. Traditional task allocation algorithms are augmented to treat QPUs as highly specialized, time-shared resources with exceptionally strict execution windows dictated by qubit decoherence times. Furthermore, we utilize an ad hoc resource harvesting concept for the classical preprocessing stages, allowing sporadic, non-exclusive classical resources to rapidly feed structured data into the highly controlled quantum environment. This strict division of labor ensures that the expensive, high-maintenance quantum hardware is never left idle waiting for classical data transformations, thereby optimizing the overall makespan and mitigating critical performance bottlenecks. To validate the efficacy of this proposed framework, we outline a comprehensive hypothetical evaluation plan. We propose extending a standard cloud simulation environment, such as CloudSim, by integrating a custom quantum execution module that mathematically models qubit gate latencies, state preparation times, and network communication overheads. The hypothetical evaluation will benchmark our hybrid scheduling algorithm against strict First-Come-First-Serve (FCFS) provisioning policies across varying data analysis workload intensities. By tracking the total task makespan and server utilization rates, we anticipate demonstrating that intelligent algorithmic partitioning significantly reduces the performance degradation typically associated with delegated quantum computing overheads. 4.Practical implications The deployment of hybrid quantum-cloud systems carries significant practical implications for the future of enterprise IT infrastructure. From a deployment perspective, organizations will no longer need to invest heavily in fragile, independent quantum hardware; instead, they will consume computation through standardized cloud providers. This shift mandates a reevaluation of existing academic cloud research, pushing industry professionals to move beyond small-scale toy deployments and embrace complex, data-center-level abstractions that in

Jun 14, 20250 citations

Benchmarking the computational power of quantum computers

Timothy Proctor, Oliver Hart, Oliver Widzowski Maupin +27 more

Quantum computing hardware is advancing rapidly toward utility-scale machines that will enable scientific breakthroughs. Many teams are pursuing distinct and difficult-to-compare routes to this goal, using different qubit technologies and logical architectures. Tracking progress toward quantum utility therefore requires rigorous benchmarks that measure computational capability relative to utility-scale challenge problems and enable fair comparison across disparate platforms. Here we demonstrate direct, cross-platform measurement of quantum computational capability using a new benchmark that quantifies the size of the largest computationally relevant quantum circuits that a machine can execute successfully and the speed at which it can execute them. We apply this quantum universal operation performance system (QUOPS) experimentally to leading processors from Quantinuum, Google, and IBM, computing directly on physical qubits. Translating state-of-the-art resource requirements for recognized challenge problems that represent useful quantum computation into effective QUOPS circuit sizes shows that computational capability must grow by 5 orders of magnitude, motivating fault-tolerant approaches. We use the same benchmark to assess the performance of a simple fault-tolerant logical-qubit processor implemented on up to eight [[7,1,3]]-encoded logical qubits using Quantinuum Helios-1, and project the growth of capability across successive generations of fault-tolerant quantum computers to show how QUOPS can track progress toward quantum scientific utility.

quant-pharXiv:2609.12146Sep 14, 20260 citations