Oğuzcan Kırmemiş, Francisco Romão, Emmanouil Giortamis, Pramod Bhatotia
{"title":"Weaver: A Retargetable Compiler Framework for FPQA Quantum Architectures","authors":"Oğuzcan Kırmemiş, Francisco Romão, Emmanouil Giortamis, Pramod Bhatotia","doi":"arxiv-2409.07870","DOIUrl":null,"url":null,"abstract":"While the prominent quantum computing architectures are based on\nsuperconducting technology, new quantum hardware technologies are emerging,\nsuch as Trapped Ions, Neutral Atoms (or FPQAs), Silicon Spin Qubits, etc. This\ndiverse set of technologies presents fundamental trade-offs in terms of\nscalability, performance, manufacturing, and operating expenses. To manage\nthese diverse quantum technologies, there is a growing need for a retargetable\ncompiler that can efficiently adapt existing code to these emerging hardware\nplatforms. Such a retargetable compiler must be extensible to support new and\nrapidly evolving technologies, performant with fast compilation times and\nhigh-fidelity execution, and verifiable through rigorous equivalence checking\nto ensure the functional equivalence of the retargeted code. To this end, we present $Weaver$, the first extensible, performant, and\nverifiable retargetable quantum compiler framework with a focus on FPQAs due to\ntheir unique, promising features. $Weaver$ introduces WQASM, the first formal\nextension of the standard OpenQASM quantum assembly with FPQA-specific\ninstructions to support their distinct capabilities. Next, $Weaver$ implements\nthe WOptimizer, an extensible set of FPQA-specific optimization passes to\nimprove execution quality. Last, the WChecker automatically checks for\nequivalence between the original and the retargeted code. Our evaluation shows\nthat $Weaver$ improves compilation times by $10^3\\times$, execution times by\n$4.4\\times$, and execution fidelity by $10\\%$, on average, compared to\nsuperconducting and state-of-the-art (non-retargetable) FPQA compilers.","PeriodicalId":501226,"journal":{"name":"arXiv - PHYS - Quantum Physics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - PHYS - Quantum Physics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.07870","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
While the prominent quantum computing architectures are based on
superconducting technology, new quantum hardware technologies are emerging,
such as Trapped Ions, Neutral Atoms (or FPQAs), Silicon Spin Qubits, etc. This
diverse set of technologies presents fundamental trade-offs in terms of
scalability, performance, manufacturing, and operating expenses. To manage
these diverse quantum technologies, there is a growing need for a retargetable
compiler that can efficiently adapt existing code to these emerging hardware
platforms. Such a retargetable compiler must be extensible to support new and
rapidly evolving technologies, performant with fast compilation times and
high-fidelity execution, and verifiable through rigorous equivalence checking
to ensure the functional equivalence of the retargeted code. To this end, we present $Weaver$, the first extensible, performant, and
verifiable retargetable quantum compiler framework with a focus on FPQAs due to
their unique, promising features. $Weaver$ introduces WQASM, the first formal
extension of the standard OpenQASM quantum assembly with FPQA-specific
instructions to support their distinct capabilities. Next, $Weaver$ implements
the WOptimizer, an extensible set of FPQA-specific optimization passes to
improve execution quality. Last, the WChecker automatically checks for
equivalence between the original and the retargeted code. Our evaluation shows
that $Weaver$ improves compilation times by $10^3\times$, execution times by
$4.4\times$, and execution fidelity by $10\%$, on average, compared to
superconducting and state-of-the-art (non-retargetable) FPQA compilers.