Approximation Methods for Simulation and Equivalence Checking of Noisy Quantum Circuits

In the current NISQ (Noisy Intermediate-Scale Quantum) era, simulating and verifying noisy quantum circuits is crucial but faces challenges such as quantum state explosion and complex noise representations, constraining simulation and equivalence checking to circuits with a limited number of qubits....

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on computer-aided design of integrated circuits and systems s. 1
Hlavní autoři: Huang, Mingyu, Guan, Ji, Fang, Wang, Ying, Mingsheng
Médium: Journal Article
Jazyk:angličtina
Vydáno: IEEE 2025
Témata:
ISSN:0278-0070, 1937-4151
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 In the current NISQ (Noisy Intermediate-Scale Quantum) era, simulating and verifying noisy quantum circuits is crucial but faces challenges such as quantum state explosion and complex noise representations, constraining simulation and equivalence checking to circuits with a limited number of qubits. This paper introduces an approximation algorithm for simulating and assessing the equivalence of noisy quantum circuits, specifically designed to improve scalability under low-noise conditions. The approach utilizes a novel tensor network diagram combined with singular value decomposition to approximate the tensors of quantum noises. The implementation is based on Google's TensorNetwork Python package for contraction. Experimental results on realistic quantum circuits with realistic hardware noise models indicate that our algorithm can simulate and check the equivalence of QAOA (Quantum Approximate Optimization Algorithm) circuits with around 200 qubits and 20 noise operators, outperforming state-of-the-art approaches in scalability and speed.
AbstractList In the current NISQ (Noisy Intermediate-Scale Quantum) era, simulating and verifying noisy quantum circuits is crucial but faces challenges such as quantum state explosion and complex noise representations, constraining simulation and equivalence checking to circuits with a limited number of qubits. This paper introduces an approximation algorithm for simulating and assessing the equivalence of noisy quantum circuits, specifically designed to improve scalability under low-noise conditions. The approach utilizes a novel tensor network diagram combined with singular value decomposition to approximate the tensors of quantum noises. The implementation is based on Google's TensorNetwork Python package for contraction. Experimental results on realistic quantum circuits with realistic hardware noise models indicate that our algorithm can simulate and check the equivalence of QAOA (Quantum Approximate Optimization Algorithm) circuits with around 200 qubits and 20 noise operators, outperforming state-of-the-art approaches in scalability and speed.
Author Guan, Ji
Fang, Wang
Huang, Mingyu
Ying, Mingsheng
Author_xml – sequence: 1
  givenname: Mingyu
  orcidid: 0009-0000-3219-1380
  surname: Huang
  fullname: Huang, Mingyu
  email: huangmy@ios.ac.cn
  organization: Institute of Software, Key Laboratory of System Software (Chinese Academy of Sciences) and State Key Laboratory of Computer Science, Chinese Academy of Sciences, Beijing, China
– sequence: 2
  givenname: Ji
  surname: Guan
  fullname: Guan, Ji
  email: guanj@ios.ac.cn
  organization: Institute of Software, Key Laboratory of System Software (Chinese Academy of Sciences) and State Key Laboratory of Computer Science, Chinese Academy of Sciences, Beijing, China
– sequence: 3
  givenname: Wang
  surname: Fang
  fullname: Fang, Wang
  email: wang.fang@ed.ac.uk
  organization: School of Informatics, University of Edinburgh, Edinburgh, United Kingdom
– sequence: 4
  givenname: Mingsheng
  orcidid: 0000-0003-4847-702X
  surname: Ying
  fullname: Ying, Mingsheng
  email: Mingsheng.Ying@uts.edu.au
  organization: Centre for Quantum Software and Information, University of Technology Sydney, Ultimo, NSW, Australia
BookMark eNpFkN1KAzEUhINUsK0-gOBFXmDrOcn-5bKs9QeqIla8XLLZszbabmqyK_btbWnBq4FhZmC-ERu0riXGLhEmiKCuF8X0ZiJAJBOZChmr_IQNUcksijHBARuCyPIIIIMzNgrhEwDjRKghe59uNt792rXurGv5I3VLVwfeOM9f7bpfHWzd1nz23dsfvaLWEC-WZL5s-8Fdw5-cDVv-0uu269e8sN70tgvn7LTRq0AXRx2zt9vZoriP5s93D8V0HhmUSRcJY-IG6lrmtQQhKhQJScqUbnTSyDQDmaoaUZMWRmqK0yoxmFc5QpprRZUcMzzsGu9C8NSUG78747clQrknU-7JlHsy5ZHMrnN16Fgi-s-jgCxVKP8ARxJitA
CODEN ITCSDI
ContentType Journal Article
DBID 97E
RIA
RIE
AAYXX
CITATION
DOI 10.1109/TCAD.2025.3623498
DatabaseName IEEE Xplore (IEEE)
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1937-4151
EndPage 1
ExternalDocumentID 10_1109_TCAD_2025_3623498
11207691
Genre orig-research
GrantInformation_xml – fundername: Youth Innovation Promotion Association of the Chinese Academy of Sciences
  grantid: 2023116
  funderid: 10.13039/501100004739
– fundername: National Natural Science Foundation of China
  grantid: 62402485
  funderid: 10.13039/501100001809
GroupedDBID --Z
-~X
0R~
29I
4.4
5GY
6IK
97E
AAJGR
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACGFS
ACIWK
ACNCT
AENEX
AGQYO
AHBIQ
AKJIK
AKQYR
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
EBS
HZ~
IFIPE
IPLJI
JAVBF
LAI
M43
O9-
OCL
P2P
PZZ
RIA
RIE
RNS
TN5
5VS
AAYXX
AETIX
AGSQL
AI.
AIBXA
ALLEH
CITATION
EJD
H~9
IBMZZ
ICLAB
IFJZH
VH1
VJK
ID FETCH-LOGICAL-c135t-2cc4f0dd38d3022b125e3e79afa5f3670369d11aea2c3ae46b5c18b81068a9eb3
IEDL.DBID RIE
ISSN 0278-0070
IngestDate Sat Nov 29 07:05:25 EST 2025
Wed Oct 29 06:12:40 EDT 2025
IsPeerReviewed true
IsScholarly true
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
https://doi.org/10.15223/policy-029
https://doi.org/10.15223/policy-037
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c135t-2cc4f0dd38d3022b125e3e79afa5f3670369d11aea2c3ae46b5c18b81068a9eb3
ORCID 0009-0000-3219-1380
0000-0003-4847-702X
PageCount 1
ParticipantIDs crossref_primary_10_1109_TCAD_2025_3623498
ieee_primary_11207691
PublicationCentury 2000
PublicationDate 2025-00-00
PublicationDateYYYYMMDD 2025-01-01
PublicationDate_xml – year: 2025
  text: 2025-00-00
PublicationDecade 2020
PublicationTitle IEEE transactions on computer-aided design of integrated circuits and systems
PublicationTitleAbbrev TCAD
PublicationYear 2025
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0014529
Score 2.4361362
Snippet In the current NISQ (Noisy Intermediate-Scale Quantum) era, simulating and verifying noisy quantum circuits is crucial but faces challenges such as quantum...
SourceID crossref
ieee
SourceType Index Database
Publisher
StartPage 1
SubjectTerms approximation algorithm
Approximation algorithms
Circuit faults
Circuits
equivalence checking
Logic gates
Noise
Noise measurement
noisy simulation
Quantum circuit
Quantum circuits
Quantum computing
Qubit
tensor network
Tensors
Title Approximation Methods for Simulation and Equivalence Checking of Noisy Quantum Circuits
URI https://ieeexplore.ieee.org/document/11207691
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Electronic Library (IEL)
  customDbUrl:
  eissn: 1937-4151
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0014529
  issn: 0278-0070
  databaseCode: RIE
  dateStart: 19820101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV05T8MwFLagYoCBs4hyyQMTUtokzmGPVdWKASoQRXSLnGdbZGhSmgTBv8d2ApSBgS3KISWfX_KufN9D6AoifcAPlAOUECdQoJxUidSJfe4B59pDSquufxtPp3Q-Z_ctWd1yYaSU9ucz2TebtpcvCqhNqWygYwOddhuu-mYcRw1Z67tlYDqItqBiJGO1IbctTM9lg5l-Kp0K-mFff65JwOgvJ7Q2VcU6lcneP29nH-220SMeNst9gDZkfoh21jQFj9Dz0KiEv2cNJRHf2QnRJdaxKX7MFu2wLsxzgcevdabtzLzaePQiwRTNcaHwtMjKD_xQa8zrBR5lK6izquyip8l4Nrpx2ukJDngkrBwfIFCuEIQKoh11qiMZSWTMuOKhMrJtJGLC87jkPhAugygNwaMp1Tki5Uzn2Meokxe5PEHYsF2D1JUUFA9ErBgADSPKZMyp4jTtoesvOJNlI5KR2OTCZYnBPjHYJy32PdQ1UP6c2KJ4-sf-M7RtLm_KHueoU61qeYG24K3KytWltYFPfNOxmQ
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NT4MwGG7MNFEPfs44P3vwZMIGtEB7XJYtM25E44y7kVLayGGgA4z-e9uCOg8evBEgBJ6-8H7xPC8AV9xXB1wsLU4QsrDk0oplEluByxzOmPKQwqjrT4IwJPM5vWvI6oYLI4QwP5-Jrt40vfwk55UulfVUbKDSbs1VX_cwdu2arvXdNNA9RFNS0aKxypSbJqZj095MPZdKBl2vqz7YCFPyyw2tzFUxbmW0-88b2gM7TfwI-_WC74M1kR2A7RVVwUPw1Nc64e9pTUqEUzMjuoAqOoUP6aIZ1wVZlsDha5UqS9MvNxw8C67L5jCXMMzT4gPeVwr1agEH6ZJXaVm0weNoOBuMrWZ-gsUd5JWWyzmWdpIgkiDlqmMVywgkAsok86QWbkM-TRyHCeZyxAT2Y487JCYqSySMqiz7CLSyPBPHAGq-K45tQbhkOAkk5Zx4PqEiYEQyEnfA9Rec0UstkxGZ9MKmkcY-0thHDfYd0NZQ_pzYoHjyx_5LsDmeTSfR5Ca8PQVb-lJ1EeQMtMplJc7BBn8r02J5YezhE-jutOA
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%3Ajournal&rft.genre=article&rft.atitle=Approximation+Methods+for+Simulation+and+Equivalence+Checking+of+Noisy+Quantum+Circuits&rft.jtitle=IEEE+transactions+on+computer-aided+design+of+integrated+circuits+and+systems&rft.au=Huang%2C+Mingyu&rft.au=Guan%2C+Ji&rft.au=Fang%2C+Wang&rft.au=Ying%2C+Mingsheng&rft.date=2025&rft.issn=0278-0070&rft.eissn=1937-4151&rft.spage=1&rft.epage=1&rft_id=info:doi/10.1109%2FTCAD.2025.3623498&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TCAD_2025_3623498
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0278-0070&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0278-0070&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0278-0070&client=summon