Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Proceedings of the ACM on Programming Languages

Quantum Probabilistic Model Checking for Time-Bounded Properties

Seungmin Jeon, Kyeongmin Cho, Chan Gu Kang, Janggun Lee, Hakjoo Oh, Jeehoon Kang

Published Oct 8, 2024• 10 citations
Publisher

Abstract

Probabilistic model checking (PMC) is a verification technique for analyzing the properties of probabilistic systems. However, existing techniques face challenges in verifying large systems with high accuracy. PMC struggles with state explosion , where the number of states grows exponentially with the size of the system, making large system verification infeasible. While statistical model checking (SMC) avoids PMC’s state explosion problem by using a simulation approach, it suffers from runtime explosion, requiring numerous samples for high accuracy. To address these limitations in verifying large systems with high accuracy, we present quantum probabilistic model checking (QPMC), the first method leveraging quantum computing for PMC with respect to timebounded properties. QPMC addresses state explosion by encoding PMC problems into quantum circuits that superpose states within qubits. Additionally, QPMC resolves runtime explosion through Quantum Amplitude Estimation, efficiently estimating the probabilities of specified properties. We prove that QPMC correctly solves PMC problems and achieves a quadratic speedup in time complexity compared to SMC.

DOI
10.1145/3689731

Related papers

Temporal Logic-Based Formal Verification of Quantum Circuits

Jincheng Zhang

This paper presents a novel approach to verifying the correctness of quantum circuits using temporal logic. Traditional verification methods often rely on gate-level simulation, which can be computationally expensive and insufficient for complex quantum algorithms. This work addresses this limitation by formally modeling quantum circuits as temporal logic systems. We leverage the expressive power of temporal logic to capture the desired behavior of quantum algorithms, including their evolution over time and the effects of quantum phenomena like superposition and entanglement. The core of our method involves mapping the circuit's operations onto temporal logic specifications and utilizing automated theorem proving and model checking techniques, tailored to the probabilistic nature of quantum systems. We demonstrate that this approach provides a more rigorous and scalable verification framework compared to existing methods, offering a pathway to ensuring the reliability of quantum computations. The key contributions of this work are the formalization of quantum circuits with temporal logic, the adaptation of theorem proving and model checking techniques for quantum systems, and the potential for significantly improving the trustworthiness of quantum algorithms.

•Aug 28, 2026•0 citations

Verifying Quantum Programs: From Quipper to QPMC

Linda Anticoli, Carla Piazza, Leonardo Taglialegne +1 more

In this paper we present a translation from the quantum programming language Quipper to the QPMC model checker, with the main aim of verifying Quipper programs. Quipper is an embedded functional programming language for quantum computation. It is above all a circuit description language, for this reason it uses the vector state formalism and its main purpose is to make circuit implementation easy providing high level operations for circuit manipulation. Quipper provides both an high-level circuit building interface and a simulator. QPMC is a model checker for quantum protocols based on the density matrix formalism. QPMC extends the probabilistic model checker IscasMC allowing to formally verify properties specified in the temporal logic QCTL on Quantum Markov Chains. We implemented and tested our translation on several quantum algorithms, including Grover's quantum search.

arXiv:1708.06312•Aug 21, 2017•4 citations

Tailored Quantum Device Calibration with Statistical Model Checking

Filip Mazurek, Marissa D’Onofrio, Andrew Van Horn +4 more

Quantum devices require precisely calibrated analog signals, a process that is complex and time-consuming. Many calibration strategies exist, and all require careful analysis and tuning to optimize system availability. To enable rigorous statistical evaluation of quantum calibration procedures, we leverage statistical model checking (SMC), a technique used in fields that require statistical guarantees. SMC allows for probabilistic evaluation of properties of interest, such as a certain parameter's time to failure. We extend the SMC for Processor Analysis (SPA) framework, which uses SMC for evaluation of classical systems, to create SPA for Quantum calibration (SPAQ) enabling simplified tuning and analysis of quantum system calibration. We focus on a directed acyclic graph-based calibration optimization scheme and demonstrate how to craft properties of interest for its analysis. We show how to use SPAQ to find lower bounds of time to failure information, hidden node dependencies, and parameter threshold values and use that information to improve simulated quantum system availability through calibration scheme adjustments.

arXiv:2507.12323•IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•0 citations

Quantum Monte Carlo Estimation via Probabilistic Programming

Seungmin Jeon, Jaeho Choi, Jonguk Jeon +4 more

Monte Carlo methods are fundamental to finance, system verification, and scientific simulation, but converge slowly: achieving an additive error of є requires O (1/є 2 ) samples. Quantum Amplitude Estimation (QAE) offers a quadratic speedup by encoding the target probabilistic model into a quantum circuit. However, constructing such a circuit demands low-level quantum expertise, and existing tools for this task all sacrifice at least one of generality, usability, or efficiency. To address these, we design QPPL (Quantum Probabilistic Programming Language), a simple imperative language, and a compiler that translates probabilistic programs into quantum circuits. The key insight is that the circuit construction amounts to specifying a probability distribution, precisely the task that probabilistic programming addresses. QPPL achieves generality by supporting joint distributions, conditional updates, dynamic probabilities, and real-valued expectations in a single language; usability by offering a sequential, imperative syntax with named variables and direct arithmetic that hides all quantum details; and efficiency by modularly compiling each construct into reversible circuit primitives, achieving scalable circuit synthesis. We prove that the compilation is semantics-preserving. On benchmarks spanning finance and probabilistic model checking, QPPL is the only tool that covers all benchmarks, while producing circuits with up to 8.8× fewer gates and 26× shallower depth than existing tools.

Proceedings of the ACM on Programming Languages•Oct 1, 2026•0 citations

Quantum-Inspired Probabilistic Programming for Uncertainty Quantification

Jincheng Zhang

This paper introduces a novel approach to uncertainty quantification (UQ) by drawing inspiration from quantum mechanics. Traditional UQ methods, particularly Monte Carlo simulations, often struggle with the curse of dimensionality, exhibiting diminishing returns as the number of variables increases. We propose a framework utilizing simulated quantum measurement processes to efficiently explore probability spaces, aiming for significant improvements in both speed and accuracy. The core concept involves translating probabilistic programming logic into a sequence of simulated quantum measurements, mimicking the principles of superposition and entanglement. This approach moves beyond the limitations of classical sampling techniques and potentially unlocks exponential speedups in complex system modeling. The presented methodology focuses on a new programming language and runtime designed specifically for this quantum-inspired probabilistic programming paradigm. We explore the theoretical underpinnings and outline the key components of this system, highlighting the advantages it offers over conventional UQ methods. The design prioritizes computational efficiency and scalability, crucial aspects for tackling real-world problems characterized by high-dimensional uncertainty. The ultimate goal is to develop a robust and practical tool for accurately assessing risk and making informed decisions in complex, uncertain environments.

•Aug 28, 2026•0 citations

Formal Verification of Abstract Interpreters for Quantum Circuits

Jincheng Zhang

Abstract interpreters are widely employed in quantum circuit simulation to provide efficient approximations of complex quantum states. However, ensuring the correctness of these abstractions—that is, guaranteeing the accuracy of the simulated quantum state—is a significant challenge. Traditional verification methods often struggle with the inherent complexity and probabilistic nature of quantum systems. This paper presents a novel formal verification framework that combines abstract interpretation, runtime monitoring, and probabilistic reasoning. The core idea is to build a layer of runtime monitoring that detects discrepancies between the abstract simulation and the underlying quantum circuit, leveraging probabilistic models to quantify the uncertainty introduced by the abstraction. This allows for a rigorous assessment of the simulation's accuracy, even for intricate quantum circuits. The framework provides a quantifiable measure of confidence in the simulation results, enabling developers to make informed decisions regarding the trade-off between accuracy and computational cost. We outline the key components of the framework, highlighting the integration of each technique and demonstrating its potential for enhancing the reliability of quantum circuit simulators.

•Sep 6, 2026•0 citations
Probabilistic model checking (PMC) is a verification technique for analyzing the properties of probabilistic systems. However, existing techniques face challenges in verifying large systems with high accuracy. PMC struggles with state explosion , where the number of states grows exponentially with the size of the system, making large system verification infeasible. While statistical model checking (SMC) avoids PMC’s state explosion problem by using a simulation approach, it suffers from runtime explosion, requiring numerous samples for high accuracy. To address these limitations in verifying large systems with high accuracy, we present quantum probabilistic model checking (QPMC), the first method leveraging quantum computing for PMC with respect to timebounded properties. QPMC addresses state explosion by encoding PMC problems into quantum circuits that superpose states within qubits. Additionally, QPMC resolves runtime explosion through Quantum Amplitude Estimation, efficiently estimating the probabilities of specified properties. We prove that QPMC correctly solves PMC problems and achieves a quadratic speedup in time complexity compared to SMC.
This paper presents a novel approach to verifying the correctness of quantum circuits using temporal logic. Traditional verification methods often rely on gate-level simulation, which can be computationally expensive and insufficient for complex quantum algorithms. This work addresses this limitation by formally modeling quantum circuits as temporal logic systems. We leverage the expressive power of temporal logic to capture the desired behavior of quantum algorithms, including their evolution over time and the effects of quantum phenomena like superposition and entanglement. The core of our method involves mapping the circuit's operations onto temporal logic specifications and utilizing automated theorem proving and model checking techniques, tailored to the probabilistic nature of quantum systems. We demonstrate that this approach provides a more rigorous and scalable verification framework compared to existing methods, offering a pathway to ensuring the reliability of quantum computations. The key contributions of this work are the formalization of quantum circuits with temporal logic, the adaptation of theorem proving and model checking techniques for quantum systems, and the potential for significantly improving the trustworthiness of quantum algorithms.
In this paper we present a translation from the quantum programming language Quipper to the QPMC model checker, with the main aim of verifying Quipper programs. Quipper is an embedded functional programming language for quantum computation. It is above all a circuit description language, for this reason it uses the vector state formalism and its main purpose is to make circuit implementation easy providing high level operations for circuit manipulation. Quipper provides both an high-level circuit building interface and a simulator. QPMC is a model checker for quantum protocols based on the density matrix formalism. QPMC extends the probabilistic model checker IscasMC allowing to formally verify properties specified in the temporal logic QCTL on Quantum Markov Chains. We implemented and tested our translation on several quantum algorithms, including Grover's quantum search.
Quantum devices require precisely calibrated analog signals, a process that is complex and time-consuming. Many calibration strategies exist, and all require careful analysis and tuning to optimize system availability. To enable rigorous statistical evaluation of quantum calibration procedures, we leverage statistical model checking (SMC), a technique used in fields that require statistical guarantees. SMC allows for probabilistic evaluation of properties of interest, such as a certain parameter's time to failure. We extend the SMC for Processor Analysis (SPA) framework, which uses SMC for evaluation of classical systems, to create SPA for Quantum calibration (SPAQ) enabling simplified tuning and analysis of quantum system calibration. We focus on a directed acyclic graph-based calibration optimization scheme and demonstrate how to craft properties of interest for its analysis. We show how to use SPAQ to find lower bounds of time to failure information, hidden node dependencies, and parameter threshold values and use that information to improve simulated quantum system availability through calibration scheme adjustments.
Monte Carlo methods are fundamental to finance, system verification, and scientific simulation, but converge slowly: achieving an additive error of є requires O (1/є 2 ) samples. Quantum Amplitude Estimation (QAE) offers a quadratic speedup by encoding the target probabilistic model into a quantum circuit. However, constructing such a circuit demands low-level quantum expertise, and existing tools for this task all sacrifice at least one of generality, usability, or efficiency. To address these, we design QPPL (Quantum Probabilistic Programming Language), a simple imperative language, and a compiler that translates probabilistic programs into quantum circuits. The key insight is that the circuit construction amounts to specifying a probability distribution, precisely the task that probabilistic programming addresses. QPPL achieves generality by supporting joint distributions, conditional updates, dynamic probabilities, and real-valued expectations in a single language; usability by offering a sequential, imperative syntax with named variables and direct arithmetic that hides all quantum details; and efficiency by modularly compiling each construct into reversible circuit primitives, achieving scalable circuit synthesis. We prove that the compilation is semantics-preserving. On benchmarks spanning finance and probabilistic model checking, QPPL is the only tool that covers all benchmarks, while producing circuits with up to 8.8× fewer gates and 26× shallower depth than existing tools.
This paper introduces a novel approach to uncertainty quantification (UQ) by drawing inspiration from quantum mechanics. Traditional UQ methods, particularly Monte Carlo simulations, often struggle with the curse of dimensionality, exhibiting diminishing returns as the number of variables increases. We propose a framework utilizing simulated quantum measurement processes to efficiently explore probability spaces, aiming for significant improvements in both speed and accuracy. The core concept involves translating probabilistic programming logic into a sequence of simulated quantum measurements, mimicking the principles of superposition and entanglement. This approach moves beyond the limitations of classical sampling techniques and potentially unlocks exponential speedups in complex system modeling. The presented methodology focuses on a new programming language and runtime designed specifically for this quantum-inspired probabilistic programming paradigm. We explore the theoretical underpinnings and outline the key components of this system, highlighting the advantages it offers over conventional UQ methods. The design prioritizes computational efficiency and scalability, crucial aspects for tackling real-world problems characterized by high-dimensional uncertainty. The ultimate goal is to develop a robust and practical tool for accurately assessing risk and making informed decisions in complex, uncertain environments.
Abstract interpreters are widely employed in quantum circuit simulation to provide efficient approximations of complex quantum states. However, ensuring the correctness of these abstractions—that is, guaranteeing the accuracy of the simulated quantum state—is a significant challenge. Traditional verification methods often struggle with the inherent complexity and probabilistic nature of quantum systems. This paper presents a novel formal verification framework that combines abstract interpretation, runtime monitoring, and probabilistic reasoning. The core idea is to build a layer of runtime monitoring that detects discrepancies between the abstract simulation and the underlying quantum circuit, leveraging probabilistic models to quantify the uncertainty introduced by the abstraction. This allows for a rigorous assessment of the simulation's accuracy, even for intricate quantum circuits. The framework provides a quantifiable measure of confidence in the simulation results, enabling developers to make informed decisions regarding the trade-off between accuracy and computational cost. We outline the key components of the framework, highlighting the integration of each technique and demonstrating its potential for enhancing the reliability of quantum circuit simulators.