Approximate Equivalence Checking of Noisy Quantum Circuits

We study the fundamental design automation problem of equivalence checking in the NISQ (Noisy Intermediate-Scale Quantum) computing realm where quantum noise is present inevitably. The notion of approximate equivalence of (possibly noisy) quantum circuits is defined based on the Jamiolkowski fidelit...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2021 58th ACM/IEEE Design Automation Conference (DAC) s. 637 - 642
Hlavní autoři: Hong, Xin, Ying, Mingsheng, Feng, Yuan, Zhou, Xiangzhen, Li, Sanjiang
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 05.12.2021
Témata:
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 We study the fundamental design automation problem of equivalence checking in the NISQ (Noisy Intermediate-Scale Quantum) computing realm where quantum noise is present inevitably. The notion of approximate equivalence of (possibly noisy) quantum circuits is defined based on the Jamiolkowski fidelity which measures the average distance between output states of two super-operators when the input is chosen at random. By employing tensor network contraction, we present two algorithms, aiming at different situations where the number of noises varies, for computing the fidelity between an ideal quantum circuit and its noisy implementation. The effectiveness of our algorithms is demonstrated by experimenting on benchmarks of real NISQ circuits. When compared with the state-of-the-art implementation incorporated in Qiskit, experimental results show that the proposed algorithms outperform in both efficiency and scalability.
AbstractList We study the fundamental design automation problem of equivalence checking in the NISQ (Noisy Intermediate-Scale Quantum) computing realm where quantum noise is present inevitably. The notion of approximate equivalence of (possibly noisy) quantum circuits is defined based on the Jamiolkowski fidelity which measures the average distance between output states of two super-operators when the input is chosen at random. By employing tensor network contraction, we present two algorithms, aiming at different situations where the number of noises varies, for computing the fidelity between an ideal quantum circuit and its noisy implementation. The effectiveness of our algorithms is demonstrated by experimenting on benchmarks of real NISQ circuits. When compared with the state-of-the-art implementation incorporated in Qiskit, experimental results show that the proposed algorithms outperform in both efficiency and scalability.
Author Zhou, Xiangzhen
Li, Sanjiang
Ying, Mingsheng
Hong, Xin
Feng, Yuan
Author_xml – sequence: 1
  givenname: Xin
  surname: Hong
  fullname: Hong, Xin
  organization: University of Technology Sydney,Centre for Quantum Software and Information,Australia
– sequence: 2
  givenname: Mingsheng
  surname: Ying
  fullname: Ying, Mingsheng
  email: mingsheng.ying@uts.edu.au
  organization: University of Technology Sydney,Centre for Quantum Software and Information,Australia
– sequence: 3
  givenname: Yuan
  surname: Feng
  fullname: Feng, Yuan
  email: yuan.feng@uts.edu.au
  organization: University of Technology Sydney,Centre for Quantum Software and Information,Australia
– sequence: 4
  givenname: Xiangzhen
  surname: Zhou
  fullname: Zhou, Xiangzhen
  organization: University of Technology Sydney,Centre for Quantum Software and Information,Australia
– sequence: 5
  givenname: Sanjiang
  surname: Li
  fullname: Li, Sanjiang
  email: sanjiang.li@uts.edu.au
  organization: University of Technology Sydney,Centre for Quantum Software and Information,Australia
BookMark eNotj9tKw0AYhFdQUGueQIR9gcQ9_rvxLqytFkpF0OvyJ9nVxTaJOYh9ewP2ZgYGZvjmmpw3beMJueMs45zl94-F45YZlQkmeJZrC4KrM5LkxnIAraQwil2SZBhiyYBpq2a9Ig9F1_Xtbzzg6Onye4o_uPdN5an79NVXbD5oG-i2jcORvk7YjNOButhXUxyHG3IRcD_45OQL8r5avrnndPPytHbFJkVhzZjK2rISEHQNQWAN0qhgLGI5p1LXUoFnMmAVSmVn9DoEPVeUzjmHMgeUC3L7vxu997uun1n74-70UP4BSGNI4w
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/DAC18074.2021.9586214
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 9781665432740
1665432748
EndPage 642
ExternalDocumentID 9586214
Genre orig-research
GroupedDBID 6IE
6IH
ACM
ALMA_UNASSIGNED_HOLDINGS
CBEJK
RIE
RIO
ID FETCH-LOGICAL-a287t-3d80b6a65d6f2ad6374f78aab0b635d346e03facfb48021dff53d8459116b96a3
IEDL.DBID RIE
ISICitedReferencesCount 19
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000766079700107&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:28:29 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a287t-3d80b6a65d6f2ad6374f78aab0b635d346e03facfb48021dff53d8459116b96a3
PageCount 6
ParticipantIDs ieee_primary_9586214
PublicationCentury 2000
PublicationDate 2021-Dec.-5
PublicationDateYYYYMMDD 2021-12-05
PublicationDate_xml – month: 12
  year: 2021
  text: 2021-Dec.-5
  day: 05
PublicationDecade 2020
PublicationTitle 2021 58th ACM/IEEE Design Automation Conference (DAC)
PublicationTitleAbbrev DAC
PublicationYear 2021
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssib060584060
Score 2.3282063
Snippet We study the fundamental design automation problem of equivalence checking in the NISQ (Noisy Intermediate-Scale Quantum) computing realm where quantum noise...
SourceID ieee
SourceType Publisher
StartPage 637
SubjectTerms Approximation algorithms
Benchmark testing
Design automation
equivalence checking
noise
Noise measurement
Quantum circuit
quantum circuits
Quantum computing
Scalability
Tensors
Title Approximate Equivalence Checking of Noisy Quantum Circuits
URI https://ieeexplore.ieee.org/document/9586214
WOSCitedRecordID wos000766079700107&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/eLvHCXMwlV1LT8MwDI7GxIEToA3xVg4cydY0TdJymwoTBzQNCdBuk5uH6IEVthbBvyfJyhASF26RlSiyHcV2nM9G6CLOUhs7N5QkQIEkhklSpMKQwkZCg1RchWYwT3dyMklns2zaQZcbLIwxJnw-MwM_DLl8XanGP5UNM-78b9-1ektKscZqfZ8dn91ztilqQTo0yobXo5z6Ui8uCIzpoF37q4lKsCHj3f_tvof6P2A8PN2YmX3UMYseuhr5WuAfpfM3Db55a0p3YMLM_Nko__qNK4snVbn6xPeNE17zgvNyqZqyXvXR4_jmIb8lbRsEAi6cqQnTaVQIEFwLG4MWTCZWpgCFozKuWSJMxCwoWySp41Rby92ShLtrTBSZAHaAuotqYQ4RBmkps7HQPLJOOTEISjPDqQLLOEh5hHqe7_nrutLFvGX5-G_yCdrxog2fO_gp6tbLxpyhbfVel6vleVDPFyxwkN4
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwEA9jCvqksonf9sFHszXNV-vbqBsTZ5kwZW8jzQf2Yatureh_b9LVieCLb-FICHcXcne5_O4AuAqi0ATWDYVEIAGJxhymIdMwNT5Tgksqq2YwzyOeJOF0Go0b4HqDhdFaV5_PdMcNq1y-ymXpnsq6EbX-t-tavUUJCfw1Wuv79Lj8nrVOfg3TQX7Uve3FyBV7sWFggDr16l9tVCorMtj73_77oP0Dx_PGG0NzABp60QI3PVcN_COzHqf2-m9lZo9MNTN-0dK9f3u58ZI8W316j6UVXzn34mwpy6xYtcHToD-Jh7BuhACFDWgKiFXop0wwqpgJhGKYE8NDIVJLxVRhwrSPjZAmJaHlVBlD7RJC7UXG0ogJfAiai3yhj4AnuEHYBExR31j1BIIhFGmKpDCYCs6PQcvxPXtd17qY1Syf_E2-BDvDycNoNrpL7k_BrhNz9dWDnoFmsSz1OdiW70W2Wl5UqvoC6FKUJQ
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=2021+58th+ACM%2FIEEE+Design+Automation+Conference+%28DAC%29&rft.atitle=Approximate+Equivalence+Checking+of+Noisy+Quantum+Circuits&rft.au=Hong%2C+Xin&rft.au=Ying%2C+Mingsheng&rft.au=Feng%2C+Yuan&rft.au=Zhou%2C+Xiangzhen&rft.date=2021-12-05&rft.pub=IEEE&rft.spage=637&rft.epage=642&rft_id=info:doi/10.1109%2FDAC18074.2021.9586214&rft.externalDocID=9586214