Quantum circuit verification -- a potential roadmap (invited talk)

DOI10.4230/LIPICS.FSTTCS.2025.1MaRDI QIDQ7391867zbMATH OpenFDO

Authors Parosh A. Abdulla, Yu-Fang Chen, Michal Hečko, Lukáš Holik, Ondřej Lengál, Jyun-Ao Lin, Ramanathan Thinniyam Srinivasan

Publication date 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2025.1

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cites work

• Composed Bisimulation for Tree Automata
• Computing Simulations over Tree Automata
• Counter-Example Guided Fence Insertion under TSO
• Quantum weakest preconditions

This page was built for publication: Quantum circuit verification -- a potential roadmap (invited talk)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7391867)