Projected Dynamic Programming for Sequential Quantum State Discrimination

• URL: http://arxiv.org/abs/2604.15393v1
• Date: Thu, 16 Apr 2026 08:21:40 GMT
• Title: Projected Dynamic Programming for Sequential Quantum State Discrimination
• Abstract summary: Sequential Quantum State Discrimination (SQSD) can be naturally framed as a sequential decision-making problem.<n>In this paper, we cast SQSD into a static-hidden-state Partially Observable Markov Decision Process framework.<n>Our analysis confirms that the inherent trade-off between accuracy and complexity, as well as the curse of dimensionality regarding the number of hypotheses, are also prominently observed in the quantum regime.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Sequential Quantum State Discrimination (SQSD) can be naturally framed as a sequential decision-making problem: at each time step, an agent must decide whether to perform an additional measurement to gather more information or to conclude with an optimal decision based on the current belief. In this paper, we formally cast SQSD into a static-hidden-state Partially Observable Markov Decision Process (POMDP) framework. We demonstrate that this formulation precisely subsumes the conventional minimum-error discrimination (MED) scheme as a special one-step case. Furthermore, we apply a regular grid-based discretization to the continuous belief simplex and approximate the possibly continuous measurement space using a finite library. Then we provide rigorous mathematical bounds on the resulting errors and analyze the computational complexity for both offline planning and online execution. Our analysis confirms that the inherent trade-off between accuracy and complexity, as well as the curse of dimensionality regarding the number of hypotheses, are also prominently observed in the quantum regime. Finally, we provide a working example of binary state discrimination to derive explicit forms of various functions and present numerical simulations for trine state discrimination to visualize the sequential structure of our POMDP-based SQSD.

Related papers

• Diffusion-Based Stochastic Operator Networks for Uncertainty Quantification in Stochastic Partial Differential Equations [0.3290514527479967]
  We introduce a novel framework for uncertainty quantification of solution operators associated with partial differential equations (SPDEs)<n>The proposed method, namely the Operator Network (SON), is constructed by combining the structure of the Deep Operator Network (DeepONet) with Neural Networks (SNNs)<n> Numerical experiments on benchmark SPDEs under multiple uncertainty sources demonstrate the accuracy and robustness of the proposed method.
  arXiv  Detail & Related papers  (2026-05-16T18:19:45Z)
• Online identification of nonlinear time-varying systems with uncertain information [7.071760583269057]
  Digital twins (DTs) serve as the core enablers for real-time monitoring and predictive maintenance of complex cyber-physical systems.<n>Existing techniques struggle to meet these demands simultaneously.<n>This paper proposes a novel Bayesian Regression-based Symbolic Learning framework.
  arXiv  Detail & Related papers  (2026-01-15T13:33:48Z)
• On the Identifiability of Regime-Switching Models with Multi-Lag Dependencies [42.274922469778545]
  We develop a general theoretical framework for multi-lag Regime-Switching Models (RSMs)<n>We prove identifiability of both the number of regimes and the multi-lag transitions in a nonlinear-Gaussian setting.<n>Our results hold in a fully unsupervised setting through architectural and noise assumptions.
  arXiv  Detail & Related papers  (2026-01-06T15:12:39Z)
• Towards Inference-time Scaling for Continuous Space Reasoning [55.40260529506702]
  Inference-time scaling has proven effective for text-based reasoning in large language models.<n>This paper investigates whether such established techniques can be successfully adapted to reasoning in the continuous space.<n>We demonstrate the feasibility of generating diverse reasoning paths through dropout-based sampling.
  arXiv  Detail & Related papers  (2025-10-14T05:53:41Z)
• Quantizer Design for Finite Model Approximations, Model Learning, and Quantized Q-Learning for MDPs with Unbounded Spaces [0.0]
  We present refined upper bounds presented in [Kara et. al. JMLR'23] on finite model approximation errors.<n>We also consider implications on quantizer design for quantized Q-learning and empirical model learning.
  arXiv  Detail & Related papers  (2025-10-05T20:39:52Z)
• seqBench: A Tunable Benchmark to Quantify Sequential Reasoning Limits of LLMs [1.0519693622157462]
  We introduce seqBench, a benchmark for probing sequential reasoning limits in Large Language Models (LLMs)<n>We find that even top-performing models systematically fail on seqBench's structured reasoning tasks despite minimal search complexity.
  arXiv  Detail & Related papers  (2025-09-21T01:32:13Z)
• Provably Efficient UCB-type Algorithms For Learning Predictive State Representations [55.00359893021461]
  The sequential decision-making problem is statistically learnable if it admits a low-rank structure modeled by predictive state representations (PSRs) This paper proposes the first known UCB-type approach for PSRs, featuring a novel bonus term that upper bounds the total variation distance between the estimated and true models. In contrast to existing approaches for PSRs, our UCB-type algorithms enjoy computational tractability, last-iterate guaranteed near-optimal policy, and guaranteed model accuracy.
  arXiv  Detail & Related papers  (2023-07-01T18:35:21Z)
• Formal Controller Synthesis for Markov Jump Linear Systems with Uncertain Dynamics [64.72260320446158]
  We propose a method for synthesising controllers for Markov jump linear systems. Our method is based on a finite-state abstraction that captures both the discrete (mode-jumping) and continuous (stochastic linear) behaviour of the MJLS. We apply our method to multiple realistic benchmark problems, in particular, a temperature control and an aerial vehicle delivery problem.
  arXiv  Detail & Related papers  (2022-12-01T17:36:30Z)
• Reinforcement Learning with a Terminator [80.34572413850186]
  We learn the parameters of the TerMDP and leverage the structure of the estimation problem to provide state-wise confidence bounds. We use these to construct a provably-efficient algorithm, which accounts for termination, and bound its regret.
  arXiv  Detail & Related papers  (2022-05-30T18:40:28Z)
• Stein Variational Model Predictive Control [130.60527864489168]
  Decision making under uncertainty is critical to real-world, autonomous systems. Model Predictive Control (MPC) methods have demonstrated favorable performance in practice, but remain limited when dealing with complex distributions. We show that this framework leads to successful planning in challenging, non optimal control problems.
  arXiv  Detail & Related papers  (2020-11-15T22:36:59Z)
• SMT-based Safety Verification of Parameterised Multi-Agent Systems [78.04236259129524]
  We study the verification of parameterised multi-agent systems (MASs) In particular, we study whether unwanted states, characterised as a given state formula, are reachable in a given MAS.
  arXiv  Detail & Related papers  (2020-08-11T15:24:05Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.