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

Evolutionary Intelligence

Quantum hidden Markov model for sequential analysis

Bitanuka Deb, Shyambabu Pandey, Partha Pakray

Published May 28, 2026• 0 citations
Publisher
DOI
10.1007/s12065-026-01205-3

Related papers

Explicit-duration Hidden Markov Models for quantum state estimation

Alessandra Luati, Marco Novelli

Computational Statistics & Data Analysis•Feb 10, 2021•2 citations

Entangled Hidden Markov Models

Abdessatar Souissi, El Gheteb Soueidi

Chaos Solitons & Fractals•Jul 19, 2023•16 citations

Phase transitions in Hidden Markov Models

John Bechhoefer, Emma Lathouwers

Bulletin of the American Physical Society•Mar 15, 2016•0 citations

Quantum Markov States and Quantum Hidden Markov States

Z. I. Bezhaeva, Валерий Иустинович Оселедец

Journal of Mathematical Sciences•Jun 26, 2019•1 citation

Hidden Quantum Markov Models and Open Quantum Systems with Instantaneous Feedback

Lewis A. Clark, Wei Huang, Thomas M. Barlow +1 more

arXiv:1406.5847•Emergence, complexity and computation•Aug 28, 2014•31 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 proceedings•Jan 1, 2012•5 citations
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.