Abstract We propose incorporating multi-qubit nonunitary operations in variational quantum thermalizers (VQTs). VQTs are hybrid quantum–classical algorithms that generate the thermal (Gibbs) state of a given Hamiltonian, with applications in quantum algorithms and simulations. However, current algorithms struggle at intermediate temperatures, where the target state is nonpure but exhibits entanglement. We devise multi-qubit nonunitary operations that harness weak symmetries and thereby improve the performance of the algorithm. Utilizing dissipation engineering, we create these nonunitary multi-qubit operations without the need for measurements or additional qubits. To train the ansatz, we develop and benchmark novel methods for entropy estimation of quantum states, expanding the toolbox for quantum state characterization. We demonstrate that our approach can prepare thermal states of paradigmatic spin models at all temperatures. Our work thus creates new opportunities for simulating open quantum many-body systems.
Abstract We propose incorporating multi-qubit nonunitary operations in variational quantum thermalizers (VQTs). VQTs are hybrid quantum–classical algorithms that generate the thermal (Gibbs) state of a given Hamiltonian, with applications in quantum algorithms and simulations. However, current algorithms struggle at intermediate temperatures, where the target state is nonpure but exhibits entanglement. We devise multi-qubit nonunitary operations that harness weak symmetries and thereby improve the performance of the algorithm. Utilizing dissipation engineering, we create these nonunitary multi-qubit operations without the need for measurements or additional qubits. To train the ansatz, we develop and benchmark novel methods for entropy estimation of quantum states, expanding the toolbox for quantum state characterization. We demonstrate that our approach can prepare thermal states of paradigmatic spin models at all temperatures. Our work thus creates new opportunities for simulating open quantum many-body systems.
We introduce a new class of generative quantum-neural-network-based models called Quantum Hamiltonian-Based Models (QHBMs). In doing so, we establish a paradigmatic approach for quantum-probabilistic hybrid variational learning, where we efficiently decompose the tasks of learning classical and quantum correlations in a way which maximizes the utility of both classical and quantum processors. In addition, we introduce the Variational Quantum Thermalizer (VQT) for generating the thermal state of a given Hamiltonian and target temperature, a task for which QHBMs are naturally well-suited. The VQT can be seen as a generalization of the Variational Quantum Eigensolver (VQE) to thermal states: we show that the VQT converges to the VQE in the zero temperature limit. We provide numerical results demonstrating the efficacy of these techniques in illustrative examples. We use QHBMs and the VQT on Heisenberg spin systems, we apply QHBMs to learn entanglement Hamiltonians and compression codes in simulated free Bosonic systems, and finally we use the VQT to prepare thermal Fermionic Gaussian states for quantum simulation.
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. 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 use collective optimization over a finite set of training parameter values to prepare approximate Gibbs states at held-out parameter values within the sampled parameter domain. We validate our methods on Transverse Field Ising Models (TFIM) with up to eight qubits and on a two-qubit Heisenberg model with all field terms. Within these finite-size benchmarks, the trained models accurately prepare thermal states at test points inside the training interval. For the six and eight qubit cases of TFIM, 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 practicality of meta-algorithm-based QBMs.
Abstract We present a variational quantum thermalizer (VQT), called quantum-VQT (qVQT), which extends the variational quantum eigensolver to finite temperatures. The qVQT makes use of an intermediate measurement between two variational circuits to encode a density matrix on a quantum device. A classical optimization provides the thermal state and, simultaneously, all associated excited states of a quantum mechanical system. We demonstrate the capabilities of the qVQT for two different spin systems. First, we analyze the performance of qVQT as a function of the circuit depth and the temperature for a one-dimensional Heisenberg chain. Second, we use the excited states to map the complete, temperature dependent phase diagram of a two-dimensional J1–J2 Heisenberg model. Numerical experiments on both quantum simulators and real quantum hardware demonstrate the efficiency of our approach, which can be readily applied to study various quantum many-body systems at finite temperatures on currently available noisy intermediate-scale quantum devices.
The preparation of an equilibrium thermal state of a quantum many-body system on noisy intermediate-scale quantum (NISQ) devices is an important task in order to extend the range of applications of quantum computation. Faithful Gibbs state preparation would pave the way to investigate protocols such as thermalization and out-of-equilibrium thermodynamics and provide useful resources for quantum algorithms, where sampling from Gibbs states constitutes a key subroutine. We propose a variational quantum algorithm (VQA) to prepare Gibbs states of a quantum many-body system. The novelty of our VQA consists of implementing a parameterized quantum circuit acting on two distinct, yet connected (via cnot gates), quantum registers. The VQA evaluates the Helmholtz free energy, where the von Neumann entropy is obtained via postprocessing of computational-basis measurements on one register, while the Gibbs state is prepared on the other register via a unitary rotation in the energy basis. Finally, we benchmark our VQA by preparing Gibbs states of the transverse-field Ising and Heisenberg XXZ models and achieve remarkably high fidelities across a broad range of temperatures in state-vector simulations. We also assess the performance of the VQA on IBM quantum computers, showcasing its feasibility on current NISQ devices.
In recent years, variational quantum algorithms have gained significant attention due to their adaptability and efficiency on near-term quantum hardware. They have shown potential in a variety of tasks, including linear algebra, search problems, Gibbs, and ground state preparation. Nevertheless, the presence of noise in current day quantum hardware severely limits their performance. In this work, we introduce dissipative variational quantum algorithms (D-VQAs) by incorporating dissipative operations, such as qubit RESET and stochastic gates, as an intrinsic part of a variational quantum circuit. We argue that such dissipative variational algorithms possess some natural resilience to dissipative noise. We demonstrate how such algorithms can prepare Gibbs states over a wide range of quantum many-body Hamiltonians and temperatures, while significantly reducing errors due to both coherent and noncoherent noise. An additional advantage of our approach is that no ancilla qubits are need. Our results highlight the potential of D-VQAs to enhance the robustness and accuracy of variational quantum computations on noisy intermediate-scale quantum (NISQ) devices.
The study of quantum many-body systems is crucial to our understanding of nature at the microscopic scale. As analytical solutions quickly become intractable, the development of efficient computational simulation techniques is indispensable to predict the behaviour of quantum systems. This task is particularly challenging as the dimension of the underlying Hilbert space grows exponentially with the system size. While classical computational methods have achieved remarkable success in specific regimes, their applicability is fundamentally limited by this exponential scaling. Quantum computers offer a natural platform for representing and simulating quantum systems, but current devices are constrained by noise and limited qubit counts, drastically restricting the algorithms that can be run. In this context, hybrid quantum-classical algorithms provide a promising approach to combine the strengths of both paradigms. This thesis develops hybrid quantum-classical algorithms for the simulation of quantum many-body systems. The key idea is to perform classically difficult tasks on near-term quantum devices, while leveraging classical computational power to control, correct, and extend the obtained results. Within this framework, we introduce two complementary approaches for the simulation of quantum dynamics. The first method employs circuit knitting techniques to distribute variational quantum simulations across multiple quantum devices. The entanglement between weakly coupled clusters of highly correlated spins is recovered in classical post-processing, where the overhead is controlled through a constrained optimisation problem. The second method combines a simplified, Trotterised quantum dynamics simulation with a parametrised classical ansatz trained to correct for the approximations made on the quantum device. We show that this method can be employed to correct Trotter errors, implement long-range gates with hardware-efficient circuits, or simulate larger systems by incorporating additional degrees of freedom purely classically. In addition, we present a hybrid approach to computing thermal properties of quantum many-body systems via the Quantum Finite Temperature Lanczos Method. A Krylov subspace is generated on a quantum computer by combining the efficient preparation of typical states with real-time evolution. A classical computer then diagonalises the system in the low-dimensional subspace and estimates the finite-temperature expectation values through trace estimation. The results presented in this thesis demonstrate that hybrid quantum-classical algorithms can expand the range of systems that can be studied on near-term quantum devices. Conversely, we show that incorporating quantum subroutines into classical simulation techniques can improve their efficiency. These results suggest that, rather than treating classical and quantum simulation as competing paradigms, their careful integration can provide a more effective route toward practical quantum many-body simulation.