QPU-System Co-Design for Quantum HPC Accelerators

• URL: http://arxiv.org/abs/2208.11449v4
• Date: Thu, 8 Sep 2022 17:55:02 GMT
• Title: QPU-System Co-Design for Quantum HPC Accelerators
• Authors: Karen Wintersperger, Hila Safi and Wolfgang Mauerer
• Abstract summary: We study the influence of different parameters on the runtime of quantum programs on tailored hybrid CPU-QPU-systems. We provide an intuition to the HPC community on potentials and limitations of co-design approaches.
• Score: 6.2543855067453675
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Multi-GPU-Enabled Hybrid Quantum-Classical Workflow in Quantum-HPC Middleware: Applications in Quantum Simulations [1.9922905420195367]
  This study introduces an innovative distribution-aware Quantum-Classical-Quantum architecture. It integrates cutting-edge quantum software framework works with high-performance classical computing resources. It addresses challenges in quantum simulation for materials and condensed matter physics.
  arXiv  Detail & Related papers  (2024-03-09T07:38:45Z)
• A Design Framework for the Simulation of Distributed Quantum Computing [2.969582361376132]
  Growing demand for large-scale quantum computers is pushing research on Distributed Quantum Computing (DQC) Recent experimental efforts have demonstrated some of the building blocks for such a design. DQC systems are clusters of quantum processing units connected by means of quantum network infrastructures.
  arXiv  Detail & Related papers  (2023-06-20T13:52:05Z)
• Influence of HW-SW-Co-Design on Quantum Computing Scalability [6.2543855067453675]
  We investigate how key figures - circuit depth and gate count - required to solve four NP-complete problems vary with tailored hardware properties. Our results reveal that achieving near-optimal performance and properties does not necessarily require optimal quantum hardware.
  arXiv  Detail & Related papers  (2023-06-07T08:36:33Z)
• Expressive Quantum Perceptrons for Quantum Neuromorphic Computing [1.7636846875530183]
  Quantum neuromorphic computing (QNC) is a sub-field of quantum machine learning (QML) We propose a building block for QNC architectures, what we call quantum perceptrons (QPs) QPs compute based on the analog dynamics of interacting qubits with tunable coupling constants. We show that QPs are, with restricted resources, a quantum equivalent to the classical perceptron, a simple mathematical model for a neuron.
  arXiv  Detail & Related papers  (2022-11-14T02:50:42Z)
• Potential and limitations of quantum extreme learning machines [55.41644538483948]
  We present a framework to model QRCs and QELMs, showing that they can be concisely described via single effective measurements. Our analysis paves the way to a more thorough understanding of the capabilities and limitations of both QELMs and QRCs.
  arXiv  Detail & Related papers  (2022-10-03T09:32:28Z)
• Learning capability of parametrized quantum circuits [2.51657752676152]
  Variational quantum algorithms (VQAs) and their applications in the field of quantum machine learning through parametrized quantum circuits (PQCs) are thought to be one major way of leveraging noisy intermediate-scale quantum computing devices. In this paper, we build upon the work by Schuld et al. and compare popular ans"atze for PQCs through the new measure of learning capability. We also examine dissipative quantum neural networks (dQNN) as introduced by Beer et al. and propose a data re-upload structure for dQNNs to increase their learning capability.
  arXiv  Detail & Related papers  (2022-09-21T13:26:20Z)
• 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)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• Quantum circuit architecture search on a superconducting processor [56.04169357427682]
  Variational quantum algorithms (VQAs) have shown strong evidences to gain provable computational advantages for diverse fields such as finance, machine learning, and chemistry. However, the ansatz exploited in modern VQAs is incapable of balancing the tradeoff between expressivity and trainability. We demonstrate the first proof-of-principle experiment of applying an efficient automatic ansatz design technique to enhance VQAs on an 8-qubit superconducting quantum processor.
  arXiv  Detail & Related papers  (2022-01-04T01:53:42Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)

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.