research-article

Accurate BDD-based unitary operator manipulation for scalable and robust quantum circuit verification

Authors:

Yuan-Hung Tsai,

Chiao-Shan Jhang,

Jie-Hong R. JiangAuthors Info & Claims

DAC '22: Proceedings of the 59th ACM/IEEE Design Automation Conference

Pages 523 - 528

https://doi.org/10.1145/3489517.3530481

Published: 23 August 2022 Publication History

Abstract

Quantum circuit verification is essential, ensuring that quantum program compilation yields a sequence of primitive unitary operators executable correctly and reliably on a quantum processor. Most prior quantum circuit equivalence checking methods rely on edge-weighted decision diagrams and suffer from scalability and verification accuracy issues. This work overcomes these issues by extending a recent BDD-based algebraic representation of state vectors to support unitary operator manipulation. Experimental results demonstrate the superiority of the new method in scalability and exactness in contrast to the inexactness of prior approaches. Also, our method is much more robust in verifying dissimilar circuits than previous work.

References

[1]

Héctor Abraham et al. 2019. Qiskit: An Open-source Framework for Quantum Computing.

[2]

Antonio Acín, E. Jané, and Guifré Vidal. 2001. Optimal estimation of quantum dynamics. Physical Review A 64 (2001), 050302.

[3]

Lukas Burgholzer and Robert Wille. 2021. Advanced Equivalence Checking for Quantum Circuits. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 40, 9 (2021), 1810--1824.

[4]

Cirq Developers. 2021. Cirq.

[5]

Alexei Gilchrist, Nathan K. Langford, and Michael A. Nielsen. 2005. Distance measures to compare real and ideal quantum processes. Physical Review A 71, 6 (2005).

[6]

Aram W. Harrow, Avinatan Hassidim, and Seth Lloyd. 2009. Quantum Algorithm for Linear Systems of Equations. Physical Review Letters 103, 15 (2009).

[7]

Xin Hong, Mingsheng Ying, Yuan Feng, Xiangzhen Zhou, and Sanjiang Li. 2021. Approximate Equivalence Checking of Noisy Quantum Circuits. In Proc. DAC. 637--642.

Digital Library

[8]

Xin Hong, Xiangzhen Zhou, Sanjiang Li, Yuan Feng, and Mingsheng Ying. 2020. A Tensor Network based Decision Diagram for Representation of Quantum Circuits. CoRR abs/2009.02618 (2020).

[9]

Gushu Li, Yufei Ding, and Yuan Xie. 2019. SANQ: A Simulation Framework for Architecting Noisy Intermediate-Scale Quantum Computing System.

[10]

Michael A. Nielsen and Isaac L. Chuang. 2000. Quantum Computation and Quantum Information.

Digital Library

[11]

Philipp Niemann, Robert Wille, David Michael Miller, Mitchell A. Thornton, and Rolf Drechsler. 2016. QMDDs: Efficient Quantum Function Representation and Manipulation. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 35, 1 (2016), 86--99.

Digital Library

[12]

Aditya K. Prasad, Vivek V. Shende, Igor L. Markov, John P. Hayes, and Ketan N. Patel. 2006. Data structures and algorithms for simplifying reversible circuits. J. Emerg. Technol. Comput. Syst. 2, 4 (2006), 277--293.

Digital Library

[13]

Fabio Somenzi. 2005. CUDD: CU Decision Diagram Package (release 2.4.2). University of Colorado at Boulder (2005).

[14]

Yuan-Hung Tsai, Jie-Hong R. Jiang, and Chiao-Shan Jhang. 2021. Bit-Slicing the Hilbert Space: Scaling Up Accurate Quantum Circuit Simulation. In Proc. DAC. 439--444.

Digital Library

[15]

Robert Wille, Daniel Große, Lisa Teuber, Gerhard W. Dueck, and Rolf Drechsler. 2008. RevLib: An Online Resource for Reversible Functions and Reversible Circuits. In Proc. ISMVL. 220--225.

Digital Library

[16]

Robert Wille, Nils Przigoda, and Rolf Drechsler. 2013. A compact and efficient SAT encoding for quantum circuits. In Proc. Africon. 1--6.

[17]

Shigeru Yamashita and Igor L. Markov. 2010. Fast Equivalence-Checking For Quantum Circuits. In Proc. NANOARCH. 23--28.

[18]

Alwin Zulehner, Stefan Hillmich, and Robert Wille. 2019. How to Efficiently Handle Complex Values? Implementing Decision Diagrams for Quantum Computing. In Proc. ICCAD. 1--7.

[19]

Alwin Zulehner, Philipp Niemann, Rolf Drechsler, and Robert Wille. 2019. Accuracy and Compactness in Decision Diagrams for Quantum Computation. In Proc. DATE. 280--283.

Cited By

Abdulla PChen YChen YHolík LLengál OLin JLo FTsai W(2025)Verifying Quantum Circuits with Level-Synchronized Tree AutomataProceedings of the ACM on Programming Languages10.1145/37048689:POPL(923-953)Online publication date: 9-Jan-2025
https://dl.acm.org/doi/10.1145/3704868
Bhattacharjee DSaha ALi JPhalak KChatterjee APope JGhosh SChattopadhyay A(2025)Software Flow for Quantum ComputingComputational Technologies and Electronics10.1007/978-3-031-81981-0_18(206-227)Online publication date: 4-Mar-2025
https://doi.org/10.1007/978-3-031-81981-0_18
Tan SXiang DLu LLu JJiang QChen MYin JTsafrir DMusuvathi MGupta RAbu-Ghazaleh N(2024)MorphQPV: Exploiting Isomorphism in Quantum Programs to Facilitate Confident VerificationProceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 310.1145/3620666.3651360(671-688)Online publication date: 27-Apr-2024
https://dl.acm.org/doi/10.1145/3620666.3651360
Show More Cited By

Recommendations

Two-mode squeezing operator in circuit QED

We theoretically investigate the implementation of the two-mode squeezing operator in circuit quantum electrodynamics. Inspired by a previous scheme for optical cavities (Prado et al. in Phys Rev A 73:043803, 2006), we employ a superconducting qubit ...
Unambiguous unitary quantum channels

Unambiguous unitary maps and unambiguous unitary quantum channels are introducedand some of their properties are derived. These properties ensure certain simple form forthe measurements involved in realizing an unambiguous unitary quantum channel. ...
Asymptotically Optimal Circuit Depth for Quantum State Preparation and General Unitary Synthesis
The quantum state preparation problem aims to prepare an <inline-formula> <tex-math notation="LaTeX">$n$ </tex-math></inline-formula>-qubit quantum state <inline-formula> <tex-math notation="LaTeX">$|\psi _{v}\rangle =\sum _{k=0}^{2^{n}-1}v_{k}|k\rangle $ ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

DAC '22: Proceedings of the 59th ACM/IEEE Design Automation Conference

July 2022

1462 pages

ISBN:9781450391429

DOI:10.1145/3489517

General Chair:
Rob Oshana
NXP

Copyright © 2022 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGDA: ACM Special Interest Group on Design Automation
IEEE CEDA

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 August 2022

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Funding Sources

Ministry of Science and Technology, Taiwan
Ministry of Science and Technology, Taiwan

Conference

DAC '22

Sponsor:

SIGDA

DAC '22: 59th ACM/IEEE Design Automation Conference

July 10 - 14, 2022

California, San Francisco

Acceptance Rates

Overall Acceptance Rate 1,770 of 5,499 submissions, 32%

Upcoming Conference

DAC '25

Sponsor:
sigda

62nd ACM/IEEE Design Automation Conference

June 22 - 26, 2025

San Francisco , CA , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

14
Total Citations
View Citations
300
Total Downloads

Downloads (Last 12 months)80
Downloads (Last 6 weeks)5

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Abdulla PChen YChen YHolík LLengál OLin JLo FTsai W(2025)Verifying Quantum Circuits with Level-Synchronized Tree AutomataProceedings of the ACM on Programming Languages10.1145/37048689:POPL(923-953)Online publication date: 9-Jan-2025
https://dl.acm.org/doi/10.1145/3704868
Bhattacharjee DSaha ALi JPhalak KChatterjee APope JGhosh SChattopadhyay A(2025)Software Flow for Quantum ComputingComputational Technologies and Electronics10.1007/978-3-031-81981-0_18(206-227)Online publication date: 4-Mar-2025
https://doi.org/10.1007/978-3-031-81981-0_18
Tan SXiang DLu LLu JJiang QChen MYin JTsafrir DMusuvathi MGupta RAbu-Ghazaleh N(2024)MorphQPV: Exploiting Isomorphism in Quantum Programs to Facilitate Confident VerificationProceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 310.1145/3620666.3651360(671-688)Online publication date: 27-Apr-2024
https://dl.acm.org/doi/10.1145/3620666.3651360
Lu CChoudhury NBanerjee USaki ABasu K(2024)QuBEC: Boosting Equivalence Checking for Quantum Circuits With QEC EmbeddingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2024.336140243:7(2037-2042)Online publication date: Jul-2024
https://doi.org/10.1109/TCAD.2024.3361402
Mei JMartens JLaarman A(2024)Disentangling the Gap Between Quantum and #SATTheoretical Aspects of Computing – ICTAC 202410.1007/978-3-031-77019-7_2(17-40)Online publication date: 22-Nov-2024
https://doi.org/10.1007/978-3-031-77019-7_2
Thanos DVilloria ABrand SQuist AMei JCoopmans TLaarman A(2024)Automated Reasoning in Quantum Circuit CompilationModel Checking Software10.1007/978-3-031-66149-5_6(106-134)Online publication date: 13-Oct-2024
https://doi.org/10.1007/978-3-031-66149-5_6
Mei JCoopmans TBonsangue MLaarman A(2024)Equivalence Checking of Quantum Circuits by Model CountingAutomated Reasoning10.1007/978-3-031-63501-4_21(401-421)Online publication date: 2-Jul-2024
https://doi.org/10.1007/978-3-031-63501-4_21
Quetschlich NBurgholzer LWille R(2023)MQT Bench: Benchmarking Software and Design Automation Tools for Quantum ComputingQuantum10.22331/q-2023-07-20-10627(1062)Online publication date: 20-Jul-2023
https://doi.org/10.22331/q-2023-07-20-1062
Lewis MSoudjani SZuliani P(2023)Formal Verification of Quantum Programs: Theory, Tools, and ChallengesACM Transactions on Quantum Computing10.1145/36244835:1(1-35)Online publication date: 16-Dec-2023
https://dl.acm.org/doi/10.1145/3624483
Chen YChung KLengál OLin JTsai WYen D(2023)An Automata-Based Framework for Verification and Bug Hunting in Quantum CircuitsProceedings of the ACM on Programming Languages10.1145/35912707:PLDI(1218-1243)Online publication date: 6-Jun-2023
https://dl.acm.org/doi/10.1145/3591270
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten