Amr Elsharkawy, Xiao-Ting Michelle To, Philipp Seitz, Yanbin Chen, Yannick Stade, Manuel Geiger, Qunsheng Huang, Xiaorang Guo, Muhammad Arslan Ansari, Christian B. Mendl, Dieter Kranzlmüller, Martin Schulz
{"title":"Integration of Quantum Accelerators with High Performance Computing $\\unicode{x2013}$ A Review of Quantum Programming Tools","authors":"Amr Elsharkawy, Xiao-Ting Michelle To, Philipp Seitz, Yanbin Chen, Yannick Stade, Manuel Geiger, Qunsheng Huang, Xiaorang Guo, Muhammad Arslan Ansari, Christian B. Mendl, Dieter Kranzlmüller, Martin Schulz","doi":"arxiv-2309.06167","DOIUrl":null,"url":null,"abstract":"Quantum computing (QC) introduces a novel mode of computation with the\npossibility of greater computational power that remains to be exploited\n$\\unicode{x2013}$ presenting exciting opportunities for high performance\ncomputing (HPC) applications. However, recent advancements in the field have\nmade clear that QC does not supplant conventional HPC, but can rather be\nincorporated into current heterogeneous HPC infrastructures as an additional\naccelerator, thereby enabling the optimal utilization of both paradigms. The\ndesire for such integration significantly affects the development of software\nfor quantum computers, which in turn influences the necessary software\ninfrastructure. To date, previous review papers have investigated various\nquantum programming tools (QPTs) (such as languages, libraries, frameworks) in\ntheir ability to program, compile, and execute quantum circuits. However, the\nintegration effort with classical HPC frameworks or systems has not been\naddressed. This study aims to characterize existing QPTs from an HPC\nperspective, investigating if existing QPTs have the potential to be\nefficiently integrated with classical computing models and determining where\nwork is still required. This work structures a set of criteria into an analysis\nblueprint that enables HPC scientists to assess whether a QPT is suitable for\nthe quantum-accelerated classical application at hand.","PeriodicalId":501256,"journal":{"name":"arXiv - CS - Mathematical Software","volume":"18 2","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Mathematical Software","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2309.06167","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Quantum computing (QC) introduces a novel mode of computation with the
possibility of greater computational power that remains to be exploited
$\unicode{x2013}$ presenting exciting opportunities for high performance
computing (HPC) applications. However, recent advancements in the field have
made clear that QC does not supplant conventional HPC, but can rather be
incorporated into current heterogeneous HPC infrastructures as an additional
accelerator, thereby enabling the optimal utilization of both paradigms. The
desire for such integration significantly affects the development of software
for quantum computers, which in turn influences the necessary software
infrastructure. To date, previous review papers have investigated various
quantum programming tools (QPTs) (such as languages, libraries, frameworks) in
their ability to program, compile, and execute quantum circuits. However, the
integration effort with classical HPC frameworks or systems has not been
addressed. This study aims to characterize existing QPTs from an HPC
perspective, investigating if existing QPTs have the potential to be
efficiently integrated with classical computing models and determining where
work is still required. This work structures a set of criteria into an analysis
blueprint that enables HPC scientists to assess whether a QPT is suitable for
the quantum-accelerated classical application at hand.