Cited by 0Quantum Computing Algorithms and ArchitectureQuantum many-body systemsQuantum Information and Cryptography

The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.

Quantum dimension reduction of hidden Markov models

Open access
Sundar, Rishi, Elliott, Thomas J.·2026·Physical Review A

Published version of a preprint

Abstract

Hidden Markov models (HMMs) are ubiquitous in time-series modeling, with applications ranging from chemical reaction modeling to speech recognition. These HMMs are often large, with high-dimensional memories. A recently proposed application of quantum technologies is to execute quantum analogs 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 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 favorable memory-accuracy tradeoffs in the examples studied, relative to a simple classical state-merging baseline.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/plt9-cm1x

Cites

4 of 4 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Research works printed but not linked: 55

  1. 10.1109/MASSP.1986.1165342 · DOI · Paper page
  2. 10.1109/5.18626 · DOI · Paper page
  3. 10.1073/pnas.91.3.1059 · DOI
  4. Z. Ghahramani, 1996, Advances in Neural Information Processing Systems
  5. K. Seymore, 1999, AAAI-99 Workshop on Machine Learning for Information Extraction
  6. 10.1006/jmbi.2000.4315 · DOI · Paper page
  7. 10.1093/bioinformatics/btg1080 · DOI · Paper page
  8. C. Karlof, 2003, International Workshop on Cryptographic Hardware and Embedded Systems
  9. R. Bhar, 2004, Hidden Markov Models: Applications to Financial Economics
  10. 10.1103/PhysRevA.89.043839 · DOI
  11. 10.1016/j.patcog.2004.03.020 · DOI
  12. P. Dupont, 2000, Proceedings of the International Conference on Machine Learning (ICML)
  13. 10.1038/ncomms1761 · DOI
  14. 10.1038/srep20495 · DOI
  15. 10.1103/PhysRevA.93.052317 · DOI
  16. 10.1103/PhysRevX.8.011025 · DOI
  17. 10.1103/PhysRevLett.120.240502 · DOI
  18. 10.1103/PhysRevA.99.062110 · DOI
  19. 10.1103/PhysRevA.103.052615 · DOI
  20. S. Adhikary, 2021, International Conference on Artificial Intelligence and Statistics
  21. 10.1103/PhysRevX.12.011007 · DOI
  22. 10.1088/1367-2630/addc10 · DOI
  23. 10.1103/PhysRevLett.121.260602 · DOI
  24. 10.1038/s41534-025-00978-2 · DOI
  25. 10.26421/QIC7.5-6-1 · DOI
  26. 10.1007/BF01449156 · DOI
  27. 10.1038/nphys2190 · DOI
  28. D. R. Upper, Theory and algorithms for hidden Markov models and generalized hidden Markov models, Ph.D. thesis, University of California, Berkeley, 1997.
  29. 10.1103/PhysRevLett.63.105 · DOI
  30. 10.1016/0167-2789(94)90273-9 · DOI
  31. 10.1103/PhysRevE.55.R1239 · DOI
  32. W. Löhr, 2009, International Conference on Complex Sciences
  33. 10.1063/1.5003041 · DOI
  34. 10.1126/sciadv.1601302 · DOI
  35. 10.1103/PhysRevX.9.041013 · DOI
  36. 10.1038/s41467-019-08951-2 · DOI
  37. 10.1038/s41467-023-37555-0 · DOI
  38. 10.1063/1.4936935 · DOI
  39. 10.1007/s00220-023-04913-4 · DOI
  40. 10.1088/1367-2630/aa82df · DOI
  41. 10.1038/s41598-017-04928-7 · DOI
  42. 10.1038/s41534-018-0064-4 · DOI
  43. 10.1088/1367-2630/aaf824 · DOI
  44. 10.1103/PhysRevLett.125.260501 · DOI
  45. 10.1103/PRXQuantum.2.020342 · DOI
  46. 10.1103/PhysRevA.109.022434 · DOI
  47. 10.1088/2632-2153/ad444a · DOI
  48. 10.1103/PhysRevE.101.062137 · DOI
  49. 10.3390/e17074891 · DOI
  50. 10.1109/TASSP.1980.1163420 · DOI · Paper page
  51. D. Sculley, 2010, Proceedings of the 19th International Conference on World Wide Web (WWW)
  52. 10.1111/j.2517-6161.1977.tb01600.x · DOI · Paper page
  53. 10.1103/PhysRevX.8.031012 · DOI
  54. 10.1088/2058-9565/aaba1a · DOI
  55. I. Glasser, 2019, Advances in Neural Information Processing Systems 32

Metadata

Authors
Sundar, R., & Elliott, T. J.
Affiliations
University of Manchester (GB)
Venue
Physical Review A
Published
2026-06-25
Volume
113
Issue
6
ISSN
  • 0556-2791 (ISSN-L)
  • 2469-9926
  • 2469-9934
OpenAlex
W7160907773
Cited by
0
References
4
FWCI
0.00
Type
journal article
Language
en
Open access
Locations
  • Physical Review A (publishedVersion, cc-by)
  • Research Explorer (The University of Manchester) (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
University of Manchester
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
Keywords
hidden Markov models, model compression, tensor networks, ergodic Markov chains, state merging, speech recognition, time series modeling

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review