QuraTest: Integrating Quantum Specific Features in Quantum Program Testing
The recent fast development of quantum computers breaks several computation limitations that are difficult for conventional computers. Up to the present, although many approaches and tools have been proposed to test quantum programs, the fundamental features of quantum programs, i.e., magnitude, pha...
Uloženo v:
| Vydáno v: | IEEE/ACM International Conference on Automated Software Engineering : [proceedings] s. 1149 - 1161 |
|---|---|
| Hlavní autoři: | , , , , , , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina japonština |
| Vydáno: |
IEEE
11.09.2023
|
| Témata: | |
| ISSN: | 2643-1572 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | The recent fast development of quantum computers breaks several computation limitations that are difficult for conventional computers. Up to the present, although many approaches and tools have been proposed to test quantum programs, the fundamental features of quantum programs, i.e., magnitude, phase, and entanglement, have been largely overlooked, leading to limited fault detection capability and reduced testing effectiveness. To address this problem, we propose an automated testing framework named QURATEST, equipped with three test case generators (including two newly proposed techniques, UCNOT and IQFT in this paper, as well as one based on Random techniques) to test quantum programs. Overall, the proposed generators enable the generation of diverse test inputs by considering the quantum features of quantum programs. In the experiments, we perform an in-depth evaluation of QURATEST from three aspects: generated test case diversity, output coverage of the program under test, and fault detection capability. The results demonstrate the potential of our newly proposed techniques in that IQFT can generate the most diverse test cases regarding magnitude, phase, and entanglement, with 66% cell coverage. Comparatively, the Random approach only has 10% cell coverage. Regarding the evaluations of the output coverage, IQFT can achieve the highest output coverage in 70.2% (33 out of 47) of all quantum programs. In terms of fault detection, UCNOT outperforms the other two techniques. Specifically, the test cases generated by UCNOT have the best mutation score in 88.4% (23 out of 26) quantum programs. |
|---|---|
| AbstractList | The recent fast development of quantum computers breaks several computation limitations that are difficult for conventional computers. Up to the present, although many approaches and tools have been proposed to test quantum programs, the fundamental features of quantum programs, i.e., magnitude, phase, and entanglement, have been largely overlooked, leading to limited fault detection capability and reduced testing effectiveness. To address this problem, we propose an automated testing framework named QURATEST, equipped with three test case generators (including two newly proposed techniques, UCNOT and IQFT in this paper, as well as one based on Random techniques) to test quantum programs. Overall, the proposed generators enable the generation of diverse test inputs by considering the quantum features of quantum programs. In the experiments, we perform an in-depth evaluation of QURATEST from three aspects: generated test case diversity, output coverage of the program under test, and fault detection capability. The results demonstrate the potential of our newly proposed techniques in that IQFT can generate the most diverse test cases regarding magnitude, phase, and entanglement, with 66% cell coverage. Comparatively, the Random approach only has 10% cell coverage. Regarding the evaluations of the output coverage, IQFT can achieve the highest output coverage in 70.2% (33 out of 47) of all quantum programs. In terms of fault detection, UCNOT outperforms the other two techniques. Specifically, the test cases generated by UCNOT have the best mutation score in 88.4% (23 out of 26) quantum programs. |
| Author | Arcaini, Paolo Xia, Shangzhou Ma, Lei Ishikawa, Fuyuki Zhang, Fuyuan Ye, Jiaming Zhao, Jianjun |
| Author_xml | – sequence: 1 givenname: Jiaming surname: Ye fullname: Ye, Jiaming organization: Kyushu University – sequence: 2 givenname: Shangzhou surname: Xia fullname: Xia, Shangzhou organization: Kyushu University – sequence: 3 givenname: Fuyuan surname: Zhang fullname: Zhang, Fuyuan organization: Kyushu University – sequence: 4 givenname: Paolo surname: Arcaini fullname: Arcaini, Paolo organization: National Institute of Informatics – sequence: 5 givenname: Lei surname: Ma fullname: Ma, Lei organization: The University of Tokyo – sequence: 6 givenname: Jianjun surname: Zhao fullname: Zhao, Jianjun organization: Kyushu University – sequence: 7 givenname: Fuyuki surname: Ishikawa fullname: Ishikawa, Fuyuki organization: National Institute of Informatics |
| BookMark | eNo9TstOwkAUHY0mAvIFuugPtN6503m5IwQUQ6IEXJPp9JaMkYG004V_b43G1Tkn55EzZlfxFImxOw4F52AfZtuFVIi2QEBRAHCrLtjUamuEBIHWqvKSjVCVIudS4w0bd90HgByEHrGXTd-6HXXpMVvFRIfWpRAP2aZ3MfXHbHsmH5rgsyW51LfUZSH-m2_tacgfs5_6ULpl14377Gj6hxP2vlzs5s_5-vVpNZ-tcye0TXnDpdGE3pQOcCCNd7qE4bepTG0qhcKhqKgE66EiZb0B5KpujPJGNa4WE3b_uxuIaH9uw9G1X3sOaI2UQnwD6PhPdA |
| CODEN | IEEPAD |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/ASE56229.2023.00196 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Xplore url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISBN | 9798350329964 |
| EISSN | 2643-1572 |
| EndPage | 1161 |
| ExternalDocumentID | 10298553 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: Natural Sciences and Engineering Research Council funderid: 10.13039/501100000038 – fundername: JST grantid: JPMJMI20B8,JPMJFS2132,JPMJER1603,JPMJMI20B8 funderid: 10.13039/501100001695 |
| GroupedDBID | 6IE 6IF 6IH 6IK 6IL 6IM 6IN 6J9 AAJGR AAWTH ABLEC ACREN ADYOE ADZIZ AFYQB ALMA_UNASSIGNED_HOLDINGS AMTXH BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO IEGSK IPLJI M43 OCL RIE RIL |
| ID | FETCH-LOGICAL-a379t-f1587e2c84a027e2fca7400018b8d8b623a23be409c0be69c80216df86c86fad3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 11 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001103357200092&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Aug 27 02:32:28 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English Japanese |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a379t-f1587e2c84a027e2fca7400018b8d8b623a23be409c0be69c80216df86c86fad3 |
| PageCount | 13 |
| ParticipantIDs | ieee_primary_10298553 |
| PublicationCentury | 2000 |
| PublicationDate | 2023-09-11 |
| PublicationDateYYYYMMDD | 2023-09-11 |
| PublicationDate_xml | – month: 09 year: 2023 text: 2023-09-11 day: 11 |
| PublicationDecade | 2020 |
| PublicationTitle | IEEE/ACM International Conference on Automated Software Engineering : [proceedings] |
| PublicationTitleAbbrev | ASE |
| PublicationYear | 2023 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0051577 ssib057256115 |
| Score | 2.3024316 |
| Snippet | The recent fast development of quantum computers breaks several computation limitations that are difficult for conventional computers. Up to the present,... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 1149 |
| SubjectTerms | Computers entanglement Fault detection Generators magnitude phase Quantum computing Quantum entanglement Quantum program Reliability engineering Software testing test case generation |
| Title | QuraTest: Integrating Quantum Specific Features in Quantum Program Testing |
| URI | https://ieeexplore.ieee.org/document/10298553 |
| WOSCitedRecordID | wos001103357200092&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwED7RioGpPIp4ywNroHbiR9gQagUMVSuK1K3yU-pAitqG38_ZTduJgS1y4ii6-Px9l9x3B3DvdMlk3P2QGggMUILOjHA6KxwtpVW8MEqnZhNyOFTTaTlqxOpJC-O9T8ln_iEepn_5bmHr-KkMPZyVivO8BS0pxUastV08XCJ4U7rjvojTUjZlhmivfHz-6CPUs6hNYbGoKU1l-vcNVRKeDDr_fJJj6O6VeWS0w5wTOPDVKXS2rRlI46ln8D6ul3qCO_4TeWsKQuD1ZFyjIesvkrrOh7klkQHWGHGTebU7OdqkbJE4HSd14XPQn7y8Zk3bhEznslxngXIlPbOq0BhzehaslkXkcsoopwzyHc1y4zGwsz3jRWkV4rxwQQmrRNAuP4d2taj8BRDJEawCd7pnRRE013gv9NjCsCCcMe4SutE2s-9NZYzZ1ixXf4xfw1E0f8y3oPQG2utl7W_h0P6s56vlXXqfv1iuoJg |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8JAEN4omugJHxjf7sFrld12H_VmDAQUCURMuJF9JhwoBqm_39mlwMmDt6btNs1sZ7-Z7cz3IXRvVU5FWP0gNOCQoHiVaG5VklmSCyNZpqWKYhOi35fjcT6omtVjL4xzLhafuYdwGP_l27kpw1YZeDjNJWPpLtoL0llVu9b682EC4JuQTfQLSC1ERTREmvnj80cLwJ6G7hQaaE1JJOrfSqpERGnX__kuR6ix7c3Dgw3qHKMdV5yg-lqcAVe-eopeh-VCjWDNf8LdihIC7sfDEkxZznDUnfdTg0MMWELOjafF5uJgVbSFw3AY1ECf7dbopZNUwgmJSkW-TDxhUjhqZKYg63TUGyWyEM1JLa3UEPEommoHqZ1pasdzIwHpufWSG8m9sukZqhXzwp0jLBjAlWdWNQ3PvGIKngU-m2nqudXaXqBGsM3ka8WNMVmb5fKP83fooDN670163f7bFToMUxGqLwi5RrXlonQ3aN_8LKffi9s4t7_moaPh |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=IEEE%2FACM+International+Conference+on+Automated+Software+Engineering+%3A+%5Bproceedings%5D&rft.atitle=QuraTest%3A+Integrating+Quantum+Specific+Features+in+Quantum+Program+Testing&rft.au=Ye%2C+Jiaming&rft.au=Xia%2C+Shangzhou&rft.au=Zhang%2C+Fuyuan&rft.au=Arcaini%2C+Paolo&rft.date=2023-09-11&rft.pub=IEEE&rft.eissn=2643-1572&rft.spage=1149&rft.epage=1161&rft_id=info:doi/10.1109%2FASE56229.2023.00196&rft.externalDocID=10298553 |