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 accessPublished 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.
Integrity signals
Registry
Cites
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.
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
The hierarchical hidden Markov model: Analysis and applications
Fine, S., Singer, Y., & Tishby, N. (1998) · Machine Learning · doi:10.1023/a:1007469218079 · Cited by 906
Supervised Learning with Quantum Computers
Schuld, M., & Petruccione, F. (2018) · Quantum Science and Technology · doi:10.1007/978-3-319-96424-9 · Cited by 730
Computational Mechanics: Pattern and Prediction, Structure and Simplicity
Shalizi, C. R., & Crutchfield, J. P. (2001) · Journal of Statistical Physics · doi:10.1023/a:1010388907793 · Cited by 471
Tangent-space methods for uniform matrix product states
Vanderstraeten, L., Haegeman, J., & Verstraete, F. (2019) · SciPost Physics Lecture Notes · doi:10.21468/scipostphyslectnotes.7 · Cited by 233
Flagged first, then by citations
Research works printed but not linked: 55
- 10.1109/MASSP.1986.1165342 · DOI · Paper page
- 10.1109/5.18626 · DOI · Paper page
- 10.1073/pnas.91.3.1059 · DOI
- Z. Ghahramani, 1996, Advances in Neural Information Processing Systems
- K. Seymore, 1999, AAAI-99 Workshop on Machine Learning for Information Extraction
- 10.1006/jmbi.2000.4315 · DOI · Paper page
- 10.1093/bioinformatics/btg1080 · DOI · Paper page
- C. Karlof, 2003, International Workshop on Cryptographic Hardware and Embedded Systems
- R. Bhar, 2004, Hidden Markov Models: Applications to Financial Economics
- 10.1103/PhysRevA.89.043839 · DOI
- 10.1016/j.patcog.2004.03.020 · DOI
- P. Dupont, 2000, Proceedings of the International Conference on Machine Learning (ICML)
- 10.1038/ncomms1761 · DOI
- 10.1038/srep20495 · DOI
- 10.1103/PhysRevA.93.052317 · DOI
- 10.1103/PhysRevX.8.011025 · DOI
- 10.1103/PhysRevLett.120.240502 · DOI
- 10.1103/PhysRevA.99.062110 · DOI
- 10.1103/PhysRevA.103.052615 · DOI
- S. Adhikary, 2021, International Conference on Artificial Intelligence and Statistics
- 10.1103/PhysRevX.12.011007 · DOI
- 10.1088/1367-2630/addc10 · DOI
- 10.1103/PhysRevLett.121.260602 · DOI
- 10.1038/s41534-025-00978-2 · DOI
- 10.26421/QIC7.5-6-1 · DOI
- 10.1007/BF01449156 · DOI
- 10.1038/nphys2190 · DOI
- D. R. Upper, Theory and algorithms for hidden Markov models and generalized hidden Markov models, Ph.D. thesis, University of California, Berkeley, 1997.
- 10.1103/PhysRevLett.63.105 · DOI
- 10.1016/0167-2789(94)90273-9 · DOI
- 10.1103/PhysRevE.55.R1239 · DOI
- W. Löhr, 2009, International Conference on Complex Sciences
- 10.1063/1.5003041 · DOI
- 10.1126/sciadv.1601302 · DOI
- 10.1103/PhysRevX.9.041013 · DOI
- 10.1038/s41467-019-08951-2 · DOI
- 10.1038/s41467-023-37555-0 · DOI
- 10.1063/1.4936935 · DOI
- 10.1007/s00220-023-04913-4 · DOI
- 10.1088/1367-2630/aa82df · DOI
- 10.1038/s41598-017-04928-7 · DOI
- 10.1038/s41534-018-0064-4 · DOI
- 10.1088/1367-2630/aaf824 · DOI
- 10.1103/PhysRevLett.125.260501 · DOI
- 10.1103/PRXQuantum.2.020342 · DOI
- 10.1103/PhysRevA.109.022434 · DOI
- 10.1088/2632-2153/ad444a · DOI
- 10.1103/PhysRevE.101.062137 · DOI
- 10.3390/e17074891 · DOI
- 10.1109/TASSP.1980.1163420 · DOI · Paper page
- D. Sculley, 2010, Proceedings of the 19th International Conference on World Wide Web (WWW)
- 10.1111/j.2517-6161.1977.tb01600.x · DOI · Paper page
- 10.1103/PhysRevX.8.031012 · DOI
- 10.1088/2058-9565/aaba1a · DOI
- I. Glasser, 2019, Advances in Neural Information Processing Systems 32
Metadata
- Authors
- Sundar, R., & Elliott, T. J.
- Affiliations
- University of Manchester (GB)
- ORCID
- Elliott, Thomas J.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- 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
- hybrid
- doi.org
- Licence
- 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