Back to News
quantum-computing

Projected Dynamic Programming for Sequential Quantum State Discrimination

arXiv Quantum Physics
Loading...
3 min read
0 likes
⚡ Quantum Brief
Researchers from South Korea introduced a novel framework for Sequential Quantum State Discrimination (SQSD) by modeling it as a Partially Observable Markov Decision Process (POMDP), treating it as a sequential decision-making challenge. The study demonstrates that this POMDP approach generalizes traditional minimum-error discrimination (MED) as a single-step case, unifying classical and quantum decision-making paradigms under one theoretical roof. The team applied grid-based discretization to continuous belief states and finite measurement approximations, providing rigorous error bounds and computational complexity analyses for both offline planning and real-time execution. Findings confirm quantum systems face the same accuracy-complexity trade-offs and curse of dimensionality as classical systems, particularly as the number of hypotheses grows. Numerical simulations of binary and trine state discrimination illustrate the framework’s practical viability, offering explicit functional forms and visualizing the sequential decision structure.
Projected Dynamic Programming for Sequential Quantum State Discrimination

Summarize this article with:

Quantum Physics arXiv:2604.15393 (quant-ph) [Submitted on 16 Apr 2026] Title:Projected Dynamic Programming for Sequential Quantum State Discrimination Authors:Jaehun Jeong, Donghwa Ji, Hyunjun Jang, Kabgyun Jeong View a PDF of the paper titled Projected Dynamic Programming for Sequential Quantum State Discrimination, by Jaehun Jeong and 3 other authors View PDF HTML (experimental) 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. Comments: Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2604.15393 [quant-ph] (or arXiv:2604.15393v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2604.15393 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Jaehun Jeong [view email] [v1] Thu, 16 Apr 2026 08:21:40 UTC (29,728 KB) Full-text links: Access Paper: View a PDF of the paper titled Projected Dynamic Programming for Sequential Quantum State Discrimination, by Jaehun Jeong and 3 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-04 References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Read Original

Tags

quantum-investment

Source Information

Source: arXiv Quantum Physics