Advantages of Co-locating Quantum-HPC Platforms: A Survey for Near-Future Industrial Applications

• URL: http://arxiv.org/abs/2508.04171v1
• Date: Wed, 06 Aug 2025 07:49:48 GMT
• Title: Advantages of Co-locating Quantum-HPC Platforms: A Survey for Near-Future Industrial Applications
• Authors: Daigo Honda, Yuta Nishiyama, Junya Ishikawa, Kenichi Matsuzaki, Satoshi Miyata, Tadahiro Chujo, Yasuhisa Yamamoto, Masahiko Kiminami, Taro Kato, Jun Towada, Naoki Yoshioka, Naoto Aoki, Nobuyasu Ito,
• Abstract summary: We examined the impact of co-location on latency reduction, bandwidth enhancement, and advanced job scheduling.<n>Our findings demonstrate that co-locating quantum and HPC systems can yield measurable improvements in overall hybrid job throughput.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We conducted a systematic survey of emerging quantum-HPC platforms, which integrate quantum computers and High-Performance Computing (HPC) systems through co-location. Currently, it remains unclear whether such platforms provide tangible benefits for near-future industrial applications. To address this, we examined the impact of co-location on latency reduction, bandwidth enhancement, and advanced job scheduling. Additionally, we assessed how HPC-level capabilities could enhance hybrid algorithm performance, support large-scale error mitigation, and facilitate complex quantum circuit partitioning and optimization. Our findings demonstrate that co-locating quantum and HPC systems can yield measurable improvements in overall hybrid job throughput. We also observe that large-scale real-world problems can require HPC-level computational resources for executing hybrid algorithms.

Related papers

• Dynamic Solutions for Hybrid Quantum-HPC Resource Allocation [1.2178560464083517]
  This paper presents a novel malleability-based approach, alongside a workflow-based strategy, to optimize resource utilization in hybrid HPC-quantum workloads.<n>Our experiments with a hybrid HPC-quantum use case show the benefits of dynamic allocation, highlighting the potential of those solutions.
  arXiv  Detail & Related papers  (2025-08-06T08:50:27Z)
• Assessing the Elephant in the Room in Scheduling for Current Hybrid HPC-QC Clusters [0.19165511108619068]
  Quantum computing resources are among the most promising candidates for extending the computational capabilities of High-Performance Computing systems.<n>In this work, we highlight these critical issues in the context of integrating quantum computers with operational HPC environments.<n>We propose a set of conceptual strategies aimed at addressing these challenges and paving the way for practical HPC-QC integration in the near future.
  arXiv  Detail & Related papers  (2025-04-11T08:44:42Z)
• Hardware-level Interfaces for Hybrid Quantum-Classical Computing Systems [0.4697760524661718]
  Hybrid Quantum-Classical computing systems is neither straightforward nor standardized while crucial for unlocking the real potential of QCs.<n>This study focuses on hardware approaches that enable effective hybrid quantum-classical operation.
  arXiv  Detail & Related papers  (2025-03-24T16:43:42Z)
• Programming tools for Analogue Quantum Computing in the High-Performance Computing Context -- A Review [0.0]
  We conduct a comprehensive survey of existing quantum software tools with analogue capabilities.<n>We introduce a classification and rating system to assess the readiness of these tools for HPC integration.
  arXiv  Detail & Related papers  (2025-01-28T13:36:52Z)
• Integrating Quantum Computing Resources into Scientific HPC Ecosystems [29.1407119677928]
  Quantum Computing offers significant potential to enhance scientific discovery in fields such as quantum chemistry, optimization, and artificial intelligence. QC faces challenges due to the noisy intermediate-scale quantum era's inherent external noise issues. This paper outlines plans to unlock new computational possibilities, driving forward scientific inquiry and innovation in a wide array of research domains.
  arXiv  Detail & Related papers  (2024-08-28T22:44:54Z)
• Enhancing Dropout-based Bayesian Neural Networks with Multi-Exit on FPGA [20.629635991749808]
  This paper proposes an algorithm and hardware co-design framework that can generate field-programmable gate array (FPGA)-based accelerators for efficient BayesNNs. At the algorithm level, we propose novel multi-exit dropout-based BayesNNs with reduced computational and memory overheads. At the hardware level, this paper introduces a transformation framework that can generate FPGA-based accelerators for the proposed efficient BayesNNs.
  arXiv  Detail & Related papers  (2024-06-20T17:08:42Z)
• Quantum Computing Enhanced Service Ecosystem for Simulation in Manufacturing [56.61654656648898]
  We propose a framework for a quantum computing-enhanced service ecosystem for simulation in manufacturing. We analyse two high-value use cases with the aim of a quantitative evaluation of these new computing paradigms for industrially-relevant settings.
  arXiv  Detail & Related papers  (2024-01-19T11:04:14Z)
• Probabilistic Sampling of Balanced K-Means using Adiabatic Quantum Computing [93.83016310295804]
  AQCs allow to implement problems of research interest, which has sparked the development of quantum representations for computer vision tasks. In this work, we explore the potential of using this information for probabilistic balanced k-means clustering. Instead of discarding non-optimal solutions, we propose to use them to compute calibrated posterior probabilities with little additional compute cost. This allows us to identify ambiguous solutions and data points, which we demonstrate on a D-Wave AQC on synthetic tasks and real visual data.
  arXiv  Detail & Related papers  (2023-10-18T17:59:45Z)
• Elastic Entangled Pair and Qubit Resource Management in Quantum Cloud Computing [73.7522199491117]
  Quantum cloud computing (QCC) offers a promising approach to efficiently provide quantum computing resources. The fluctuations in user demand and quantum circuit requirements are challenging for efficient resource provisioning. We propose a resource allocation model to provision quantum computing and networking resources.
  arXiv  Detail & Related papers  (2023-07-25T00:38:46Z)
• DQC$^2$O: Distributed Quantum Computing for Collaborative Optimization in Future Networks [54.03701670739067]
  We propose an adaptive distributed quantum computing approach to manage quantum computers and quantum channels for solving optimization tasks in future networks. Based on the proposed approach, we discuss the potential applications for collaborative optimization in future networks, such as smart grid management, IoT cooperation, and UAV trajectory planning.
  arXiv  Detail & Related papers  (2022-09-16T02:44:52Z)
• Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
  We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources. The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
  arXiv  Detail & Related papers  (2022-09-16T02:37:32Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• Scaling Quantum Approximate Optimization on Near-term Hardware [49.94954584453379]
  We quantify scaling of the expected resource requirements by optimized circuits for hardware architectures with varying levels of connectivity. We show the number of measurements, and hence total time to synthesizing solution, grows exponentially in problem size and problem graph degree. These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.
  arXiv  Detail & Related papers  (2022-01-06T21:02:30Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00: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.