mlsanityData to 7 Oct 2026

Learning Circular Hidden Quantum Markov Models: A Tensor Network Approach

arXiv 2111.01536 ↗First posted 29 Oct 2021quant-ph cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

In this paper, we propose circular Hidden Quantum Markov Models (c-HQMMs), which can be applied for modeling temporal data in quantum datasets (with classical datasets as a special case). We show that c-HQMMs are equivalent to a constrained tensor network (more precisely, circular Local Purified State with positive-semidefinite decomposition) model. This equivalence enables us to provide an efficient learning model for c-HQMMs. The proposed learning approach is evaluated on six real datasets and demonstrates the advantage of c-HQMMs on multiple datasets as compared to HQMMs, circular HMMs, and HMMs.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 12 of its 72 references that are in the map. First posted on arXiv 29 Oct 2021.

Builds on

12 of 72 references.

References · 12

  1. 2016Tensor Ring Decompositioncited by 125
  2. 2017Unsupervised Generative Modeling Using Matrix Product Statescited by 87
  3. 2019Expressive power of tensor-network factorizations for probabilistic modeling, with applications from hidden Markov models to quantum machine learningcited by 55
  4. 2018Wide Compression: Tensor Ring Netscited by 50
  5. 2017Efficient Low Rank Tensor Ring Completioncited by 45
  6. 2016Supervised Learning with Quantum-Inspired Tensor Networkscited by 35
  7. 2020Quantum Tensor Networks, Stochastic Processes, and Weighted Automatacited by 9
  8. 2019Expressiveness and Learning of Hidden Quantum Markov Modelscited by 7
  9. 2017Learning Hidden Quantum Markov Modelscited by 6
  10. 2021Memory compression and thermal efficiency of quantum implementations of non-deterministic hidden Markov modelscited by 4
  11. 2019Learning Quantum Graphical Models using Constrained Gradient Descent on the Stiefel Manifoldcited by 2
  12. 2017Enhancing speaker identification performance under the shouted talking condition using second-order circular hidden Markov modelscited by 1

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.