Fetching the paper…
Reading the bibliography…
Over the past 27 years, quantum computing has seen a huge rise in interest from both academia and industry.
CertiQ: A Mostly-automated Verification of a Realistic Quantum Compiler
Yunong Shi, Runzhou Tao, Xupeng Li, Ali Javadi-Abhari, Andrew W. Cross, Frederic T. Chong, and Ronghui Gu. 2020 · 1908
Earlier work this paper cites.
Nengkun Yu. 2019 · 1908
Earlier work this paper cites.
Proposed Experiment to Test Local Hidden-Variable Theories
John F. Clauser, Michael A. Horne, Abner Shimony, and Richard A. Holt. 1969 · 1969
Earlier work this paper cites.
An Axiomatic Basis for Computer Programming
C. A. R. Hoare. 1969 · 1969
Earlier work this paper cites.
Guarded Commands, Nondeterminacy and Formal Derivation of Programs
Edsger W. Dijkstra. 1975 · 1975
Earlier work this paper cites.
The Temporal Logic of Programs. In Proceedings of the 18th Annual Symposium on Foundations of Computer Science (SFCS ’77) . IEEE Computer Society, USA, 46–57
Amir Pnueli. 1977 · 1977
Earlier work this paper cites.
Design and synthesis of synchronization skeletons using branching time temporal logic. In Logics of Programs , Dexter Kozen (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 52–71
Edmund M. Clarke and E. Allen Emerson. 1982 · 1982
Earlier work this paper cites.
Results on the propositional μ \mu -calculus. In Automata, Languages and Programming , Mogens Nielsen and Erik Meineche Schmidt (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 348–359
Dexter Kozen. 1982 · 1982
Earlier work this paper cites.
A single quantum cannot be cloned
William K. Wootters and Wojciech H. Zurek. 1982 · 1982
Earlier work this paper cites.
Rapid Solution of Problems by Quantum Computation
David Deutsch and Richard Jozsa. 1992 · 1992
Earlier work this paper cites.
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Charles H. Bennett, Gilles Brassard, Claude Crépeau, Richard Jozsa, Asher Peres, and William K. Wootters. 1993 · 1993
Earlier work this paper cites.
Model Checking and Abstraction
Edmund M. Clarke, Orna Grumberg, and David E. Long. 1994 · 1994
Earlier work this paper cites.
An Introduction to the Conjugate Gradient Method Without the Agonizing Pain
Jonathan R Shewchuk. 1994 · 1994
Earlier work this paper cites.
UPPAAL — a tool suite for automatic verification of real-time systems. In Hybrid Systems III , Rajeev Alur, Thomas A. Henzinger, and Eduardo D. Sontag (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 232–243
Johan Bengtsson, Kim Larsen, Fredrik Larsson, Paul Pettersson, and Wang Yi. 1996 · 1996
Earlier work this paper cites.
A Fast Quantum Mechanical Algorithm for Database Search. In Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing (Philadelphia, Pennsylvania, USA) (STOC ’96) . Association for Computing Machinery, New York, NY, USA, 212–219
Lov K. Grover. 1996 · 1996
Earlier work this paper cites.
Conventions for quantum pseudocode
Emanuel Knill. 1996 · 1996
Earlier work this paper cites.
On the Power of Quantum Finite State Automata. In 38th Annual Symposium on Foundations of Computer Science, FOCS ’97, Miami Beach, Florida, USA, October 19-22, 1997 . IEEE Computer Society, 66–75
Attila Kondacs and John Watrous. 1997 · 1997
Earlier work this paper cites.
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
Peter W. Shor. 1997 · 1997
Earlier work this paper cites.
The Heisenberg representation of quantum computers
D Gottesman. 1998 · 1998
Earlier work this paper cites.
Quantum Computational Advantage via 60-Qubit 24-Cycle Random Circuit Sampling
Qingling Zhu et al · 1998
Earlier work this paper cites.
Symbolic Model Checking without BDDs. In Tools and Algorithms for the Construction and Analysis of Systems , W. Rance Cleaveland (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 193–207
Armin Biere, Alessandro Cimatti, Edmund Clarke, and Yunshan Zhu. 1999 · 1999
Earlier work this paper cites.
Model checking
Edmund M Clarke, Orna Grumberg, and Doron A. Peled. 1999 · 1999
Earlier work this paper cites.
Counterexample-Guided Abstraction Refinement. In Computer Aided Verification , E. Allen Emerson and Aravinda Prasad Sistla (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 154–169
Edmund Clarke, Orna Grumberg, Somesh Jha, Yuan Lu, and Helmut Veith. 2000 · 2000
Earlier work this paper cites.
Quantum Programming. In Mathematics of Program Construction , Roland Backhouse and José Nuno Oliveira (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 80–99
Jeff W. Sanders and Paolo Zuliani. 2000 · 2000
Earlier work this paper cites.
NuSMV 2: An OpenSource Tool for Symbolic Model Checking. In Proceedings of the 14th International Conference on Computer Aided Verification (CAV ’02) . Springer-Verlag, Berlin, Heidelberg, 359–364
Alessandro Cimatti, Edmund M. Clarke, Enrico Giunchiglia, Fausto Giunchiglia, Marco Pistore, Marco Roveri, Roberto Sebastiani, and Armando Tacchella. 2002 · 2002
Earlier work this paper cites.
Exponential Algorithmic Speedup by a Quantum Walk. In Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing (San Diego, CA, USA) (STOC ’03) . Association for Computing Machinery, New York, NY, USA, 59–68
Andrew M. Childs, Richard Cleve, Enrico Deotto, Edward Farhi, Sam Gutmann, and Daniel A. Spielman. 2003 · 2003
Earlier work this paper cites.
Towards a quantum programming language
Peter Selinger. 2004 · 2004
Earlier work this paper cites.
Communicating Quantum Processes
Simon J. Gay and Rajagopal Nagarajan. 2005 · 2005
Earlier work this paper cites.
Quantum weakest preconditions
Ellie D’Hondt and Prakash Panangaden. 2006 · 2006
Earlier work this paper cites.
Relations among quantum processes: bisimilarity and congruence
Marie Lalire. 2006 · 2006
Earlier work this paper cites.
The Seventeen Provers of the World: Foreword by Dana S. Scott (Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence)
Freek Wiedijk. 2006 · 2006
Earlier work this paper cites.
Fault-Tolerant Quantum Computation with Constant Error Rate
Dorit Aharonov and Michael Ben-Or. 2008 · 2008
Earlier work this paper cites.
Quantum Computation Tree Logic — Model Checking and Complete Calculus
Pedro Baltazar, Rohit Chadha, and Paulo Mateus. 2008 · 2008
Earlier work this paper cites.
Z3: An Efficient SMT Solver. In Proceedings of the Theory and Practice of Software, 14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Budapest, Hungary) (TACAS’08/ETAPS’08) . Springer-Verlag, Berlin, Heidelberg, 337–340
Leonardo De Moura and Nikolaj Bjørner. 2008 · 2008
Earlier work this paper cites.
Extending Classical Logic for Reasoning About Quantum Systems
Rohit Chadha, Paulo Mateus, Amílcar Sernadas, and Cristina Sernadas. 2009 · 2009
Earlier work this paper cites.
Satisfiability Modulo Theories: An Appetizer. In Formal Methods: Foundations and Applications , Marcel Vinícius Medeiros Oliveira and Jim Woodcock (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 23–36
Leonardo de Moura and Nikolaj Bjørner. 2009 · 2009
Earlier work this paper cites.
Quantum Algorithm for Linear Systems of Equations
Aram W. Harrow, Avinatan Hassidim, and Seth Lloyd. 2009 · 2009
Earlier work this paper cites.
A Logic for Formal Verification of Quantum Programs. In Advances in Computer Science - ASIAN 2009. Information Security and Privacy , Anupam Datta (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 79–93
Yoshihiko Kakutani. 2009 · 2009
Cited alongside, same era.
Temporal Logics for Reasoning about Quantum Systems
Paulo Mateus, Jaime Ramos, Amílcar Sernadas, and Cristina Sernadas. 2009 · 2009
Cited alongside, same era.
An Algebra of Quantum Processes
Mingsheng Ying, Yuan Feng, Runyao Duan, and Zhengfeng Ji. 2009 · 2009
Cited alongside, same era.
Software Model Checking Takes Off
Steven P. Miller, Michael W. Whalen, and Darren D. Cofer. 2010 · 2010
Cited alongside, same era.
Model Checking and the State Explosion Problem. In Tools for Practical Software Verification: LASER, International Summer School 2011, Elba Island, Italy, Revised Tutorial Lectures , Bertrand Meyer and Martin Nordio (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 1–30
Edmund M. Clarke, William Klieber, Miloš Nováček, and Paolo Zuliani. 2012 · 2011
Q#: Enabling Scalable Quantum Computing and Development with a High-Level DSL. In Proceedings of the Real World Domain Specific Languages Workshop 2018 (Vienna, Austria) (RWDSL2018) . Association for Computing Machinery, New York, NY, USA, Article 7, 10 pages
Krysta Svore, Alan Geller, Matthias Troyer, John Azariah, Christopher Granade, Bettina Heim, Vadym Kliuchnikov, Mariia Mykhailova, Andres Paz, and Martin Roetteler. 2018 · 2018
Later among the works it cites.
Model Checking Quantum Systems — A Survey
Mingsheng Ying and Yuan Feng. 2018 · 2018
Later among the works it cites.
Qiskit: An Open-source Framework for Quantum Computing
Héctor Abraham et al · 2019
Later among the works it cites.
Towards Large-scale Functional Verification of Universal Quantum Circuits
Matthew Amy. 2019b · 2019
Later among the works it cites.
Quantum Supremacy using a Programmable Superconducting Processor
Frank Arute et al · 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Interacting quantum observables: categorical algebra and diagrammatics
Bob Coecke and Ross Duncan. 2011 · 2011
Cited alongside, same era.
SpaceEx: Scalable Verification of Hybrid Systems. In Computer Aided Verification , Ganesh Gopalakrishnan and Shaz Qadeer (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 379–395
Goran Frehse, Colas Le Guernic, Alexandre Donzé, Scott Cotton, Rajarshi Ray, Olivier Lebeltel, Rodolfo Ripado, Antoine Girard, Thao Dang, and Oded Maler. 2011 · 2011
Cited alongside, same era.
The SPIN Model Checker: Primer and Reference Manual (1st ed.)
Gerard Holzmann. 2011 · 2011
Cited alongside, same era.
PRISM 4.0: Verification of Probabilistic Real-Time Systems. In Computer Aided Verification , Ganesh Gopalakrishnan and Shaz Qadeer (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 585–591
Marta Kwiatkowska, Gethin Norman, and David Parker. 2011 · 2011
Cited alongside, same era.
Quantum Computation and Quantum Information: 10th Anniversary Edition (10th ed.)
Michael A. Nielsen and Isaac L. Chuang. 2011 · 2011
Cited alongside, same era.
Simulation of electronic structure Hamiltonians using quantum computers
James D. Whitfield, Jacob Biamonte, and Alán Aspuru-Guzik. 2011 · 2011
Cited alongside, same era.
Floyd-Hoare logic for Quantum Programs
Mingsheng Ying. 2011 · 2011
Cited alongside, same era.
Later among the works it cites.
Quantum Chemistry in the Age of Quantum Computing
Yudong Cao, Jonathan Romero, Jonathan P. Olson, Matthias Degroote, Peter D. Johnson, Mária Kieferová, Ian D. Kivlichan, Tim Menke, Borja Peropadre, Nicolas P. D. Sawaya, Sukin Sim, Libor Veis, and Alán Aspuru-Guzik. 2019 · 2019
Later among the works it cites.
SZX-Calculus: Scalable Graphical Quantum Reasoning. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 138) , Peter Rossmanith, Pinar Heggernes, and Joost-Pieter Katoen (Eds.). Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 55:1–55:15
Titouan Carette, Dominic Horsman, and Simon Perdrix. 2019 · 2019
Later among the works it cites.
Deductive Software Verification: From Pen-and-Paper Proofs to Industrial Tools. In Computing and Software Science: State of the Art and Perspectives , Bernhard Steffen and Gerhard Woeginger (Eds.). Springer International Publishing, Cham, 345–373
Reiner Hähnle and Marieke Huisman. 2019 · 2019
Later among the works it cites.
Quantum Hoare Logic
Junyi Liu, Bohua Zhan, Shuling Wang, Shenggang Ying, Tao Liu, Yangjia Li, Mingsheng Ying, and Naijun Zhan. 2019b · 2019
Later among the works it cites.
Quantum error correction: an introductory guide
Joschka Roffe. 2019 · 2019
Later among the works it cites.
Quantum Relational Hoare Logic
Dominique Unruh. 2019 · 2019
Later among the works it cites.
On Relation Between Linear Temporal Logic and Quantum Finite Automata
Amandeep Singh Bhatia and Ajay Kumar. 2020 · 2020
Later among the works it cites.
Silq: A High-Level Quantum Language with Safe Uncomputation and Intuitive Semantics. In Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation (London, UK) (PLDI 2020) . Association for Computing Machinery, New York, NY, USA, 286–300
Benjamin Bichsel, Maximilian Baader, Timon Gehr, and Martin Vechev. 2020 · 2020
Later among the works it cites.
Certified Quantum Computation in Isabelle/HOL
Anthony Bordg, Hanna Lachnitt, and Yijun He. 2020a · 2020
Later among the works it cites.
Isabelle Marries Dirac: a Library for Quantum Computation and Quantum Information
Anthony Bordg, Hanna Lachnitt, and Yijun He. 2020b · 2020
Later among the works it cites.
Advanced Equivalence Checking for Quantum Circuits
Lukas Burgholzer and Robert Wille. 2021 · 2020
Later among the works it cites.
Property-Based Testing of Quantum Programs in Q#. In Proceedings of the IEEE/ACM 42nd International Conference on Software Engineering Workshops (Seoul, Republic of Korea) (ICSEW’20) . Association for Computing Machinery, New York, NY, USA, 430–435
Shahin Honarvar, Mohammad Reza Mousavi, and Rajagopal Nagarajan. 2020 · 2020
Later among the works it cites.
PyZX: Large Scale Automated Diagrammatic Reasoning
Aleks Kissinger and John van de Wetering. 2020 · 2020
Later among the works it cites.
Quantum computational advantage using photons
Han-Sen Zhong, Hui Wang, Yu-Hao Deng, Ming-Cheng Chen, Li-Chao Peng, Yi-Han Luo, Jian Qin, Dian Wu, Xing Ding, Yi Hu, Peng Hu, Xiao-Yan Yang, Wei-Jun Zhang, Hao Li, Yuxuan Li, Xiao Jiang, Lin Gan, Guangwen Yang, Lixing You, Zhen Wang, Li Li, Nai-Le Liu, Chao-Yang Lu, and Jian-Wei Pan. 2020 · 2020
Later among the works it cites.
EasyPQC: Verifying Post-Quantum Cryptography. In Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security (Virtual Event, Republic of Korea) (CCS ’21) . Association for Computing Machinery, New York, NY, USA, 2564–2586
Manuel Barbosa, Gilles Barthe, Xiong Fan, Benjamin Grégoire, Shih-Han Hung, Jonathan Katz, Pierre-Yves Strub, Xiaodi Wu, and Li Zhou. 2021 · 2021
Closest in time.
Quantum Algorithms and Oracles with the Scalable ZX-calculus
Titouan Carette, Yohann D'Anello, and Simon Perdrix. 2021 · 2021
Closest in time.
Quantum projective measurements and the CHSH inequality
Mnacho Echenim. 2021 · 2021
Closest in time.
Quantum projective measurements and the CHSH inequality in Isabelle/HOL
Mnacho Echenim and Mehdi Mhalla. 2021 · 2021
Closest in time.
Quantum Hoare Logic with Classical Variables
Yuan Feng and Mingsheng Ying. 2021 · 2021
Closest in time.
Proving Quantum Programs Correct. In 12th International Conference on Interactive Theorem Proving (ITP 2021) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 193) , Liron Cohen and Cezary Kaliszyk (Eds.). Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 21:1–21:19
Kesha Hietala, Robert Rand, Shih-Han Hung, Liyi Li, and Michael Hicks. 2021 · 2021
Closest in time.
Bit-Slicing the Hilbert Space: Scaling up Accurate Quantum Circuit Simulation
Yuan Hung Tsai, Jie Hong R. Jiang, and Chiao Shan Jhang. 2021 · 2021
Closest in time.
Toward A Quantum Programming Language for Higher-Level Formal Verification. In Informal Proceedings of the Workshop on Programming Languages and Quantum Computing (PLanQC)
Finn Voichick and Michael Hicks. 2021 · 2021
Closest in time.
An Algebraic Method to Fidelity-based Model Checking over Quantum Markov Chains
Ming Xu, Jianling Fu, Jingyi Mei, and Yuxin Deng. 2021 · 2021
Closest in time.
Partial Equivalence Checking of Quantum Circuits
Tian-Fu Chen, Jie-Hong R. Jiang, and Min-Hsiu Hsieh. 2022 · 2022
Closest in time.
On Dynamic Lifting and Effect Typing in Circuit Description Languages (Extended Version)
Andrea Colledan and Ugo Dal Lago. 2022 · 2022
Closest in time.
Proto-Quipper with dynamic lifting
Peng Fu, Kohei Kishida, Neil J. Ross, and Peter Selinger. 2022 · 2022
Closest in time.
The probabilistic model checker Storm
Christian Hensel, Sebastian Junges, Joost-Pieter Katoen, Tim Quatmann, and Matthias Volk. 2022 · 2022
Closest in time.
Accurate BDD-Based Unitary Operator Manipulation for Scalable and Robust Quantum Circuit Verification. In Proceedings of the 59th ACM/IEEE Design Automation Conference (San Francisco, California) (DAC ’22) . Association for Computing Machinery, New York, NY, USA, 523–528
Chun-Yu Wei, Yuan-Hung Tsai, Chiao-Shan Jhang, and Jie-Hong R. Jiang. 2022 · 2022
Closest in time.
Tools for Quantum Computing Based on Decision Diagrams
Robert Wille, Stefan Hillmich, and Lukas Burgholzer. 2022 · 2022
Closest in time.
Twist: Sound Reasoning for Purity and Entanglement in Quantum Programs
Charles Yuan, Christopher McNally, and Michael Carbin. 2022 · 2022
Closest in time.
CoqQ: Foundational Verification of Quantum Programs
Li Zhou, Gilles Barthe, Pierre-Yves Strub, Junyi Liu, and Mingsheng Ying. 2022 · 2022
Closest in time.