Meta-learning of Gibbs states for many-body Hamiltonians with applications to Quantum Boltzmann Machines
- URL: http://arxiv.org/abs/2507.16373v1
- Date: Tue, 22 Jul 2025 09:17:50 GMT
- Title: Meta-learning of Gibbs states for many-body Hamiltonians with applications to Quantum Boltzmann Machines
- Authors: Ruchira V Bhat, Rahul Bhowmick, Avinash Singh, Krishna Kumar Sabapathy,
- Abstract summary: We introduce two meta-learning algorithms for efficient thermal state preparation of parametrized Hamiltonians.<n>We validate our methods on upto 8-qubit Transverse Field Ising Model and the 2-qubit Heisenberg model with all field terms.<n>We apply our algorithms to train a Quantum Boltzmann Machine (QBM) on a 2-qubit Heisenberg model with all field terms.
- Score: 0.5892638927736115
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The preparation of quantum Gibbs states is a fundamental challenge in quantum computing, essential for applications ranging from modeling open quantum systems to quantum machine learning. Building on the Meta-Variational Quantum Eigensolver framework proposed by Cervera-Lierta et al.(2021) and a problem driven ansatz design, we introduce two meta-learning algorithms: Meta-Variational Quantum Thermalizer (Meta-VQT) and Neural Network Meta-VQT (NN-Meta VQT) for efficient thermal state preparation of parametrized Hamiltonians on Noisy Intermediate-Scale Quantum (NISQ) devices. Meta-VQT utilizes a fully quantum ansatz, while NN Meta-VQT integrates a quantum classical hybrid architecture. Both leverage collective optimization over training sets to generalize Gibbs state preparation to unseen parameters. We validate our methods on upto 8-qubit Transverse Field Ising Model and the 2-qubit Heisenberg model with all field terms, demonstrating efficient thermal state generation beyond training data. For larger systems, we show that our meta-learned parameters when combined with appropriately designed ansatz serve as warm start initializations, significantly outperforming random initializations in the optimization tasks. Furthermore, a 3- qubit Kitaev ring example showcases our algorithm's effectiveness across finite-temperature crossover regimes. Finally, we apply our algorithms to train a Quantum Boltzmann Machine (QBM) on a 2-qubit Heisenberg model with all field terms, achieving enhanced training efficiency, improved Gibbs state accuracy, and a 30-fold runtime speedup over existing techniques such as variational quantum imaginary time (VarQITE)-based QBM highlighting the scalability and practicality of meta-algorithm-based QBMs.
Related papers
- TensoMeta-VQC: A Tensor-Train-Guided Meta-Learning Framework for Robust and Scalable Variational Quantum Computing [60.996803677584424]
TensoMeta-VQC is a novel tensor-train (TT)-guided meta-learning framework designed to improve the robustness and scalability of VQC significantly.<n>Our framework fully delegates the generation of quantum circuit parameters to a classical TT network, effectively decoupling optimization from quantum hardware.
arXiv Detail & Related papers (2025-08-01T23:37:55Z) - VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [60.996803677584424]
Variational Quantum Circuits (VQCs) offer a novel pathway for quantum machine learning.<n>Their practical application is hindered by inherent limitations such as constrained linear expressivity, optimization challenges, and acute sensitivity to quantum hardware noise.<n>This work introduces VQC-MLPNet, a scalable and robust hybrid quantum-classical architecture designed to overcome these obstacles.
arXiv Detail & Related papers (2025-06-12T01:38:15Z) - RhoDARTS: Differentiable Quantum Architecture Search with Density Matrix Simulations [48.670876200492415]
Variational Quantum Algorithms (VQAs) are a promising approach for leveraging powerful Noisy Intermediate-Scale Quantum (NISQ) computers.<n>We propose $rho$DARTS, a differentiable Quantum Architecture Search (QAS) algorithm that models the search process as the evolution of a quantum mixed state.
arXiv Detail & Related papers (2025-06-04T08:30:35Z) - Enhancing variational quantum algorithms by balancing training on classical and quantum hardware [1.8377902806196762]
Variational Quantum Eigensolver (VQE) and quantum phase classification for up to 12-qubit Hamiltonians using quantum neural networks.<n>We numerically evaluate our approach for ground-state estimation of 6 to 18-qubit Hamiltonians using VQE and quantum phase classification for up to 12-qubit Hamiltonians using quantum neural networks.
arXiv Detail & Related papers (2025-03-20T17:17:58Z) - Applications of the Quantum Phase Difference Estimation Algorithm to the Excitation Energies in Spin Systems on a NISQ Device [0.0]
QPDE is a quantum algorithm designed to compute the differences of two eigenvalues of a unitary operator by exploiting the quantum superposition of two eigenstates.<n>We present the implementation and verification of a novel early fault-tolerant QPDE algorithm for determining energy gaps across diverse spin system configurations.<n>Our results on IBM quantum processors show remarkable accuracy ranging from 85% to 93%, demonstrating excellent agreement with classical calculations even in the presence of hardware noise.
arXiv Detail & Related papers (2025-02-27T06:31:47Z) - Variational quantum thermalizers based on weakly-symmetric nonunitary multi-qubit operations [0.0]
Variational Quantum Thermalizers (VQTs) generate the thermal (Gibbs) state of a given Hamiltonian.<n>Current algorithms struggle at intermediate temperatures, where the target state is nonpure but exhibits entanglement.<n>We devise multi-qubit nonunitary operations that harness weak symmetries and thereby improve the performance of the algorithm.
arXiv Detail & Related papers (2025-02-13T19:00:00Z) - Simulating electronic structure on bosonic quantum computers [34.84696943963362]
We propose an approach to map the electronic Hamiltonian into a qumode bosonic problem that can be solved on bosonic quantum devices.<n>This work establishes a new pathway for simulating many-fermion systems, highlighting the potential of hybrid qubit-qumode quantum devices.
arXiv Detail & Related papers (2024-04-16T02:04:11Z) - Scalable Quantum Ground State Preparation of the Heisenberg Model: A
Variational Quantum Eigensolver Approach [0.0]
Variational Quantumsolver (VQE) algorithm is a system composed of a quantum circuit and a classical Eigenational Quantumsolver.
We present an ansatz capable of preparing the ground states for all possible values of the coupling, including the critical states for the anisotropic XXZ model.
arXiv Detail & Related papers (2023-08-23T09:26:34Z) - Quantum Thermal State Preparation [39.91303506884272]
We introduce simple continuous-time quantum Gibbs samplers for simulating quantum master equations.
We construct the first provably accurate and efficient algorithm for preparing certain purified Gibbs states.
Our algorithms' costs have a provable dependence on temperature, accuracy, and the mixing time.
arXiv Detail & Related papers (2023-03-31T17:29:56Z) - Adaptive variational quantum minimally entangled typical thermal states
for finite temperature simulations [0.0]
We describe and benchmark a quantum computing version of the minimally entangled typical thermal states (METTS) algorithm.
The algorithm, which we name AVQMETTS, dynamically generates compact and problem-specific quantum circuits.
arXiv Detail & Related papers (2023-01-06T16:40:06Z) - A self-consistent field approach for the variational quantum
eigensolver: orbital optimization goes adaptive [52.77024349608834]
We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE)
This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
arXiv Detail & Related papers (2022-12-21T23:15:17Z) - Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the
Race to Practical Quantum Advantage [43.3054117987806]
We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits.
We show this method significantly improves the trainability and performance of PQCs on a variety of problems.
By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
arXiv Detail & Related papers (2022-08-29T15:24:03Z) - Quantum Neural Architecture Search with Quantum Circuits Metric and
Bayesian Optimization [2.20200533591633]
We propose a new quantum gates distance that characterizes the gates' action over every quantum state.
Our approach significantly outperforms the benchmark on three empirical quantum machine learning problems.
arXiv Detail & Related papers (2022-06-28T16:23:24Z) - An Introduction to Quantum Machine Learning for Engineers [36.18344598412261]
Quantum machine learning is emerging as a dominant paradigm to program gate-based quantum computers.
This book provides a self-contained introduction to quantum machine learning for an audience of engineers with a background in probability and linear algebra.
arXiv Detail & Related papers (2022-05-11T12:10:52Z) - TensorFlow Quantum: A Software Framework for Quantum Machine Learning [36.75544801185366]
We introduce Quantum (TFQ), an open source library for the rapid prototyping of hybrid quantum-classical models for classical or quantum data.
We demonstrate how one can apply TFQ to tackle advanced quantum learning tasks including meta-learning, layerwise learning, Hamiltonian learning, sampling thermal states, variational quantum eigensolvers, classification of quantum phase transitions, generative adversarial networks, and reinforcement learning.
arXiv Detail & Related papers (2020-03-06T01:31:43Z)
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.