Memory compression and thermal efficiency of quantum implementations of non-deterministic hidden Markov models

• URL: http://arxiv.org/abs/2105.06285v1
• Date: Thu, 13 May 2021 13:32:25 GMT
• Title: Memory compression and thermal efficiency of quantum implementations of non-deterministic hidden Markov models
• Authors: Thomas J. Elliott
• Abstract summary: We provide a systematic prescription for constructing quantum implementations of non-deterministic HMMs. We show that our implementations will both mitigate some of this dissipation, and achieve an advantage in memory compression.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Stochastic modelling is an essential component of the quantitative sciences, with hidden Markov models (HMMs) often playing a central role. Concurrently, the rise of quantum technologies promises a host of advantages in computational problems, typically in terms of the scaling of requisite resources such as time and memory. HMMs are no exception to this, with recent results highlighting quantum implementations of deterministic HMMs exhibiting superior memory and thermal efficiency relative to their classical counterparts. In many contexts however, non-deterministic HMMs are viable alternatives; compared to them the advantages of current quantum implementations do not always hold. Here, we provide a systematic prescription for constructing quantum implementations of non-deterministic HMMs that re-establish the quantum advantages against this broader class. Crucially, we show that whenever the classical implementation suffers from thermal dissipation due to its need to process information in a time-local manner, our quantum implementations will both mitigate some of this dissipation, and achieve an advantage in memory compression.

Related papers

• Quantum Latent Diffusion Models [65.16624577812436]
  We propose a potential version of a quantum diffusion model that leverages the established idea of classical latent diffusion models. This involves using a traditional autoencoder to reduce images, followed by operations with variational circuits in the latent space. The results demonstrate an advantage in using a quantum version, as evidenced by obtaining better metrics for the images generated by the quantum version.
  arXiv  Detail & Related papers  (2025-01-19T21:24:02Z)
• Time Symmetries of Quantum Memory Improve Thermodynamic Efficiency [49.1574468325115]
  Quantum memory offers a continuum of possible time-reversal symmetries. This enables the design of quantum memories that minimize irreversibility. As a result, quantum memory reduces energy dissipation several orders of magnitude below classical memory.
  arXiv  Detail & Related papers  (2025-01-08T22:30:35Z)
• Quantum Kernel-Based Long Short-term Memory for Climate Time-Series Forecasting [0.24739484546803336]
  We present the Quantum Kernel-Based Long short-memory (QK-LSTM) network, which integrates quantum kernel methods into classical LSTM architectures. QK-LSTM captures intricate nonlinear dependencies and temporal dynamics with fewer trainable parameters.
  arXiv  Detail & Related papers  (2024-12-12T01:16:52Z)
• Quantum Kernel-Based Long Short-term Memory [0.30723404270319693]
  We introduce the Quantum Kernel-Based Long Short-Term Memory (QK-LSTM) network to capture complex, non-linear patterns in sequential data. This quantum-enhanced architecture demonstrates efficient convergence, robust loss minimization, and model compactness. Benchmark comparisons reveal that QK-LSTM achieves performance on par with classical LSTM models, yet with fewer parameters.
  arXiv  Detail & Related papers  (2024-11-20T11:39:30Z)
• Applicability of Measurement-based Quantum Computation towards Physically-driven Variational Quantum Eigensolver [17.975555487972166]
  Variational quantum algorithms are considered one of the most promising methods for obtaining near-term quantum advantages. The roadblock to developing quantum algorithms with the measurement-based quantum computation scheme is resource cost. We propose an efficient measurement-based quantum algorithm for quantum many-body system simulation tasks, called measurement-based Hamiltonian variational ansatz (MBHVA)
  arXiv  Detail & Related papers  (2023-07-19T08:07:53Z)
• A Framework for Demonstrating Practical Quantum Advantage: Racing Quantum against Classical Generative Models [62.997667081978825]
  We build over a proposed framework for evaluating the generalization performance of generative models. We establish the first comparative race towards practical quantum advantage (PQA) between classical and quantum generative models. Our results suggest that QCBMs are more efficient in the data-limited regime than the other state-of-the-art classical generative models.
  arXiv  Detail & Related papers  (2023-03-27T22:48:28Z)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• A hybrid framework for estimating nonlinear functions of quantum states [2.0295402551142163]
  Estimating nonlinear functions of quantum states, such as the moment $tr(rhom)$, is of fundamental and practical interest in quantum science and technology. We show a quantum-classical hybrid framework to measure them, where the quantum part is constituted by the generalized swap test, and the classical part is realized by postprocessing the result from randomized measurements.
  arXiv  Detail & Related papers  (2022-08-17T17:22:26Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Quantum coarse-graining for extreme dimension reduction in modelling stochastic temporal dynamics [0.0]
  coarse-graining in quantum state space drastically reduces requisite memory dimension for modelling temporal dynamics. In contrast to classical coarse-graining, this compression is not based on temporal resolution, and brings memory-efficient modelling within reach of present quantum technologies.
  arXiv  Detail & Related papers  (2021-05-14T13:47:21Z)
• 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)

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.