Formal Verification of Quantum Programs: Theory, Tools, and Challenges

被引:12
作者
Lewis, Marco [2 ]
Soudjani, Sadegh [2 ]
Zuliani, Paolo [1 ]
机构
[1] Univ Roma La Sapienza, Dipartimento Informat, Via Salaria 113, I-00198 Rome, Italy
[2] Newcastle Univ, Sch Comp, 1 Sci Sq, Newcastle Upon Tyne NE4 5TG, Tyne & Wear, England
来源
ACM TRANSACTIONS ON QUANTUM COMPUTING | 2024年 / 5卷 / 01期
基金
英国工程与自然科学研究理事会;
关键词
Quantum programming; formal verification; theorem provers; MODEL CHECKING; COMPUTATION; ADVANTAGE; STATE;
D O I
10.1145/3624483
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Over the past 27 years, quantum computing has seen a huge rise in interest from both academia and industry. At the current rate, quantum computers are growing in size rapidly backed up by the increase of research in the field. Significant efforts are being made to improve the reliability of quantum hardware and to develop suitable software to program quantum computers. In contrast, the verification of quantum programs has received relatively less attention. Verifying programs is especially important in the quantum setting due to how difficult it is to program complex algorithms correctly on resource-constrained and error-prone quantum hardware. Research into creating verification frameworks for quantum programs has seen recent development, with a variety of tools implemented using a collection of theoretical ideas. This survey aims to be a short introduction into the area of formal verification of quantum programs, bringing together theory and tools developed to date. Further, this survey examines some of the challenges that the field may face in the future, namely the development of complex quantum algorithms.
引用
收藏
页数:35
相关论文
共 113 条
[11]  
Barrett Clark, 2018, Handbook of Model Checking, P305, DOI DOI 10.1007/978-3-319-10575-8_11
[12]  
Bengtsson J., 1996, Hybrid Systems III. Verification and Control, P232, DOI 10.1007/BFb0020949
[13]   TELEPORTING AN UNKNOWN QUANTUM STATE VIA DUAL CLASSICAL AND EINSTEIN-PODOLSKY-ROSEN CHANNELS [J].
BENNETT, CH ;
BRASSARD, G ;
CREPEAU, C ;
JOZSA, R ;
PERES, A ;
WOOTTERS, WK .
PHYSICAL REVIEW LETTERS, 1993, 70 (13) :1895-1899
[14]   Quantum cryptography: Public key distribution and coin tossing [J].
Bennett, Charles H. ;
Brassard, Gilles .
THEORETICAL COMPUTER SCIENCE, 2014, 560 :7-11
[15]  
Bertot Y., 2013, Interactive theorem proving and program development: Coq'Art: the calculus of inductive constructions
[16]   On Relation Between Linear Temporal Logic and Quantum Finite Automata [J].
Bhatia, Amandeep Singh ;
Kumar, Ajay .
JOURNAL OF LOGIC LANGUAGE AND INFORMATION, 2020, 29 (02) :109-120
[17]   Silq: A High-Level Quantum Language with Safe Uncomputation and Intuitive Semantics [J].
Bichsel, Benjamin ;
Baader, Maximilian ;
Gehr, Timon ;
Vechev, Martin .
PROCEEDINGS OF THE 41ST ACM SIGPLAN CONFERENCE ON PROGRAMMING LANGUAGE DESIGN AND IMPLEMENTATION (PLDI '20), 2020, :286-300
[18]  
Biere A, 1999, LECT NOTES COMPUT SC, V1579, P193
[19]   Certified Quantum Computation in Isabelle/HOL [J].
Bordg, Anthony ;
Lachnitt, Hanna ;
He, Yijun .
JOURNAL OF AUTOMATED REASONING, 2021, 65 (05) :691-709
[20]  
Bordg Anthony, 2020, Isabelle marries dirac: A library for quantum computation and quantum information