arXiv:2605.18912

Quantum Viterbi Algorithm

Luigi Accardi, Abdessatar Souissi, El Gheteb Soueidi, Farrukh Mukhamedov, Mohamed Rhaima

quant-phmath-phmath.PRSubmitted May 17, 2026• Announced May 19, 2026• 0 citations

Abstract

We introduce a quantum Viterbi decoding algorithm for hidden quantum Markov models (HQMMs) motivated by quantum information processing and quantum algorithms. Given a finite sequence of measurement outcomes, the algorithm identifies hidden quantum trajectories that maximize a joint decoding functional, serving as a genuine quantum analogue of the classical Viterbi score. Unlike classical hidden Markov models, where decoding optimizes over a finite discrete state space, our method performs optimization over a continuous manifold of pure quantum effects, thereby exploiting coherent superpositions in the hidden memory. We prove a strict quantum advantage: coherent hidden trajectories can achieve decoding scores that strictly exceed any classical strategy constrained to diagonal (commuting) effects, even when both models share the same observed statistics. These results position quantum Viterbi decoding as a concrete quantum algorithmic primitive for sequential decision-making, with direct applications to quantum memories, quantum communication with memory, and near-term quantum machine learning on NISQ devices.

Related papers

Causal Architecture in Hidden Quantum Markov Models

Abdessatar Souissi, Abdessatar Barhoumi

We introduce a class of causal hidden quantum Markov models (cHQMMs) that reverse the usual order of hidden updates and emissions compared to conventional HQMMs. Using a simple qubit model with a rotating hidden state and sharp measurements, we show that these two architectures-emission then transition versus transition then emission-generally produce different quantum processes. They can be distinguished by measurements at arbitrarily late times, no matter how the hidden system is initialized, and even when the two models start from different initial states. This means that the two orders of operations lead to genuinely different observable behaviors that cannot be reconciled by waiting longer or by choosing special initial conditions. At the same time, we prove that the two architectures become equivalent when they arise from entangled liftings of classical hidden Markov models, sharing the same classical statistics. This identifies a clear dividing line between classical and genuinely quantum hidden memory. Our findings highlight causal HQMMs as a useful tool for studying and distinguishing quantum memory effects in sequential processes.

arXiv:2602.19120Feb 22, 20260 citations

Learning Hidden Quantum Markov Models

Siddarth Srinivasan, Gordon, Geoff, Byron Boots

Hidden Quantum Markov Models (HQMMs) can be thought of as quantum probabilistic graphical models that can model sequential data. We extend previous work on HQMMs with three contributions: (1) we show how classical hidden Markov models (HMMs) can be simulated on a quantum circuit, (2) we reformulate HQMMs by relaxing the constraints for modeling HMMs on quantum circuits, and (3) we present a learning algorithm to estimate the parameters of an HQMM from data. While our algorithm requires further optimization to handle larger datasets, we are able to evaluate our algorithm using several synthetic datasets. We show that on HQMM generated data, our algorithm learns HQMMs with the same number of hidden states and predictive accuracy as the true HQMMs, while HMMs learned with the Baum-Welch algorithm require more states to match the predictive accuracy.

arXiv:1710.09016International Conference on Artificial Intelligence and StatisticsOct 24, 201716 citations

Quantum Dimension Reduction of Hidden Markov Models

Rishi Sundar, Thomas J. Elliott

Hidden Markov models (HMMs) are ubiquitous in time-series modelling, with applications ranging from chemical reaction modelling to speech recognition. These HMMs are often large, with high-dimensional memories. A recently-proposed application of quantum technologies is to execute quantum analogues of HMMs. Such quantum HMMs (QHMMs) are strictly more expressive than their classical counterparts, enabling the construction of more parsimonious models of stochastic processes. However, state-of-the-art techniques for QHMM compression, based on tensor networks, are only applicable for a restricted subset of HMMs, where the transitions are deterministic. In this work we introduce a pipeline by which \emph{any} finite, ergodic HMM can be compressed in this manner, providing a route for effective quantum dimension reduction of general HMMs. We demonstrate the method on both a simple toy model, and on a speech-derived HMM trained from data, obtaining favourable memory--accuracy trade-offs in the examples studied, relative to a simple classical state-merging baseline.

quant-pharXiv:2601.16126Physical Review AJan 23, 20260 citations

A new quantum machine learning algorithm: split hidden quantum Markov model inspired by quantum conditional master equation

Xiaoyu Li, Qin-Sheng Zhu, Yong Hu +4 more

The Hidden Quantum Markov Model (HQMM) has significant potential for analyzing time-series data and studying stochastic processes in the quantum domain as an upgrading option with potential advantages over classical Markov models. In this paper, we introduced the split HQMM (SHQMM) for implementing the hidden quantum Markov process, utilizing the conditional master equation with a fine balance condition to demonstrate the interconnections among the internal states of the quantum system. The experimental results suggest that our model outperforms previous models in terms of scope of applications and robustness. Additionally, we establish a new learning algorithm to solve parameters in HQMM by relating the quantum conditional master equation to the HQMM. Finally, our study provides clear evidence that the quantum transport system can be considered a physical representation of HQMM. The SHQMM with accompanying algorithms present a novel method to analyze quantum systems and time series grounded in physical implementation.

arXiv:2307.08640QuantumJan 24, 20249 citations

Expressiveness and Learning of Hidden Quantum Markov Models

Sandesh Adhikary, Siddarth Srinivasan, Gordon, Geoff +1 more

Extending classical probabilistic reasoning using the quantum mechanical view of probability has been of recent interest, particularly in the development of hidden quantum Markov models (HQMMs) to model stochastic processes. However, there has been little progress in characterizing the expressiveness of such models and learning them from data. We tackle these problems by showing that HQMMs are a special subclass of the general class of observable operator models (OOMs) that do not suffer from the \emph{negative probability problem} by design. We also provide a feasible retraction-based learning algorithm for HQMMs using constrained gradient descent on the Stiefel manifold of model parameters. We demonstrate that this approach is faster and scales to larger models than previous learning algorithms.

arXiv:1912.02098International Conference on Artificial Intelligence and StatisticsDec 2, 20197 citations

Hidden quantum Markov models with one qubit

Ben O'Neill, Thomas M. Barlow, Dominik Šafránek +1 more

Hidden Markov Models (HMMs) have become very popular as a computational tool for the analysis of sequential data. They are memoryless machines which transition from one internal state to another, while producing symbols. These symbols constitute the output of the machine and form an infinite time series. Analogously, Hidden Quantum Markov Models (HQMM) produce an infinite time series, while progressing from one quantum state to another through stochastic quantum operations. Here we compare 1-bit HMMs and 1-qubit HQMMs and show that the latter can produce stronger correlations, although both machines are, in principle, comparable in resources.

AIP conference proceedingsJan 1, 20125 citations