Implementation and Learning of Quantum Hidden Markov Models
- URL: http://arxiv.org/abs/2212.03796v2
- Date: Thu, 6 Jul 2023 17:14:36 GMT
- Title: Implementation and Learning of Quantum Hidden Markov Models
- Authors: Vanio Markov, Vladimir Rastunkov, Amol Deshmukh, Daniel Fry, Charlee
Stefanski
- Abstract summary: We use the theory of quantum channels and open quantum systems to provide an efficient unitary characterization of a class of generators known as quantum hidden Markov models (QHMMs)
We prove that QHMMs are more efficient definitions of process languages compared to the equivalent classical hidden Markov Models (HMMs)
We propose two practical learning algorithms for QHMMs.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In this article we use the theory of quantum channels and open quantum
systems to provide an efficient unitary characterization of a class of
stochastic generators known as quantum hidden Markov models (QHMMs). By
utilizing the unitary characterization, we demonstrate that any QHMM can be
implemented as a quantum circuit with mid-circuit measurement. We prove that
QHMMs are more efficient definitions of stochastic process languages compared
to the equivalent classical hidden Markov Models (HMMs). Starting with the
formulation of QHMMs as quantum channels, we employ Stinespring's construction
to represent these models as unitary quantum circuits with mid-circuit
measurement. By utilizing the unitary parameterization of QHMMs, we define a
formal QHMM learning model. The model formalizes the empirical distributions of
target stochastic process languages, defines hypothesis space of quantum
circuits, and introduces an empirical stochastic divergence measure -
hypothesis fitness - as a success criterion for learning. We demonstrate that
the learning model has a smooth search landscape due to the continuity of
Stinespring's dilation. The smooth mapping between the hypothesis and fitness
spaces enables the development of efficient heuristic and gradient descent
learning algorithms.
We propose two practical learning algorithms for QHMMs. The first algorithm
is a hyperparameter-adaptive evolutionary search. The second algorithm learns
the QHMM as a quantum ansatz circuit using a multi-parameter non-linear
optimization technique.
Related papers
- Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
Quantum computing sets the foundation for new ways of designing algorithms.
New challenges arise concerning which field quantum speedup can be achieved.
Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
arXiv Detail & Related papers (2024-02-26T09:32:07Z) - A new quantum machine learning algorithm: split hidden quantum Markov
model inspired by quantum conditional master equation [14.978135681940387]
We introduce the split HQMM (SHQMM) for implementing the hidden quantum Markov process.
Experimental results suggest our model outperforms previous models in terms of scope of applications and robustness.
arXiv Detail & Related papers (2023-07-17T16:55:26Z) - Classical-to-Quantum Transfer Learning Facilitates Machine Learning with Variational Quantum Circuit [62.55763504085508]
We prove that a classical-to-quantum transfer learning architecture using a Variational Quantum Circuit (VQC) improves the representation and generalization (estimation error) capabilities of the VQC model.
We show that the architecture of classical-to-quantum transfer learning leverages pre-trained classical generative AI models, making it easier to find the optimal parameters for the VQC in the training stage.
arXiv Detail & Related papers (2023-05-18T03:08:18Z) - Variational Quantum Algorithms for Simulation of Lindblad Dynamics [0.0]
We introduce a variational hybrid classical-quantum algorithm to simulate the Lindblad master equation and its adjoint for time-evolving Markovian open quantum systems and quantum observables.
We design and optimize low-depth variational quantum circuits that efficiently capture the unitary and non-unitary dynamics of the solutions.
arXiv Detail & Related papers (2023-05-04T13:25:44Z) - QNEAT: Natural Evolution of Variational Quantum Circuit Architecture [95.29334926638462]
We focus on variational quantum circuits (VQC), which emerged as the most promising candidates for the quantum counterpart of neural networks.
Although showing promising results, VQCs can be hard to train because of different issues, e.g., barren plateau, periodicity of the weights, or choice of architecture.
We propose a gradient-free algorithm inspired by natural evolution to optimize both the weights and the architecture of the VQC.
arXiv Detail & Related papers (2023-04-14T08:03:20Z) - Provably efficient variational generative modeling of quantum many-body
systems via quantum-probabilistic information geometry [3.5097082077065003]
We introduce a generalization of quantum natural gradient descent to parameterized mixed states.
We also provide a robust first-order approximating algorithm, Quantum-Probabilistic Mirror Descent.
Our approaches extend previously sample-efficient techniques to allow for flexibility in model choice.
arXiv Detail & Related papers (2022-06-09T17:58:15Z) - Theory of Quantum Generative Learning Models with Maximum Mean
Discrepancy [67.02951777522547]
We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs)
We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution.
Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
arXiv Detail & Related papers (2022-05-10T08:05:59Z) - Quantum agents in the Gym: a variational quantum algorithm for deep
Q-learning [0.0]
We introduce a training method for parametrized quantum circuits (PQCs) that can be used to solve RL tasks for discrete and continuous state spaces.
We investigate which architectural choices for quantum Q-learning agents are most important for successfully solving certain types of environments.
arXiv Detail & Related papers (2021-03-28T08:57:22Z) - Error mitigation and quantum-assisted simulation in the error corrected
regime [77.34726150561087]
A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations.
We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
arXiv Detail & Related papers (2021-03-12T20:58:41Z) - Chaos and Complexity from Quantum Neural Network: A study with Diffusion
Metric in Machine Learning [0.0]
We study the phenomena of quantum chaos and complexity in the machine learning dynamics of Quantum Neural Network (QNN)
We employ a statistical and differential geometric approach to study the learning theory of QNN.
arXiv Detail & Related papers (2020-11-16T10:41:47Z) - Quantum-optimal-control-inspired ansatz for variational quantum
algorithms [105.54048699217668]
A central component of variational quantum algorithms (VQA) is the state-preparation circuit, also known as ansatz or variational form.
Here, we show that this approach is not always advantageous by introducing ans"atze that incorporate symmetry-breaking unitaries.
This work constitutes a first step towards the development of a more general class of symmetry-breaking ans"atze with applications to physics and chemistry problems.
arXiv Detail & Related papers (2020-08-03T18:00:05Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.