Optimal statistical ensembles for quantum thermal state preparation within the quantum singular value transformation framework

• URL: http://arxiv.org/abs/2505.06216v2
• Date: Thu, 22 May 2025 07:46:32 GMT
• Title: Optimal statistical ensembles for quantum thermal state preparation within the quantum singular value transformation framework
• Authors: Yasushi Yoneta,
• Abstract summary: In statistical mechanics, microstates in thermal equilibrium can be obtained from statistical ensembles.<n>We present a quantum algorithm for implementing generalized ensembles within the framework of quantum singular value transformation.<n>We numerically demonstrate that our approach achieves a significant reduction in the computational cost even for small finite-size systems.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Preparing thermal equilibrium states is an essential task for finite-temperature quantum simulations. In statistical mechanics, microstates in thermal equilibrium can be obtained from statistical ensembles. To date, numerous ensembles have been devised, ranging from Gibbs ensembles such as the canonical and microcanonical ensembles to a variety of generalized ensembles. Since these ensembles yield equivalent thermodynamic predictions, one can freely choose an ensemble for computational convenience. In this paper, we exploit this flexibility to develop an efficient quantum algorithm for preparing thermal equilibrium states. We first present a quantum algorithm for implementing generalized ensembles within the framework of quantum singular value transformation. We then perform a detailed analysis of the computational cost and elucidate its dependence on the choice of the ensemble. Our analysis shows that employing an appropriate ensemble can significantly mitigate ensemble-dependent overhead and yield improved scaling of the computational cost with system size compared to existing methods based on the canonical ensemble. We also numerically demonstrate that our approach achieves a significant reduction in the computational cost even for small finite-size systems. Our algorithm applies to arbitrary thermodynamic systems at any temperature and is thus expected to offer a practical and versatile method for computing finite-temperature properties of quantum many-body systems. These results highlight the potential of ensemble design as a powerful tool for enhancing the efficiency of a broad class of quantum algorithms.

Related papers

• Solving wave equation problems on D-Wave quantum annealers [44.99833362998488]
  We solve the one-dimensional Helmholtz equation in several scenarios using the quantum annealer provided by the D-Wave systems within a pseudospectral scheme.<n>We assess the performance of different strategies of encoding based on algebraic arguments and the adiabatic condition.
  arXiv  Detail & Related papers  (2025-07-18T08:06:43Z)
• Reweight-annealing method for evaluating the partition function via quantum Monte Carlo calculations [4.595034707642593]
  We present an unbiased but low-technical-barrier algorithm within the quantum Monte Carlo framework, which has exceptionally high accuracy and no systemic error. This method can be widely used in both classical and quantum Monte Carlo simulations and is easy to be parallelized on computer.
  arXiv  Detail & Related papers  (2024-03-13T15:54:57Z)
• Spectral chaos bounds from scaling theory of maximally efficient quantum-dynamical scrambling [44.99833362998488]
  A key conjecture about the evolution of complex quantum systems towards an ergodic steady state, known as scrambling, is that this process acquires universal features when it is most efficient.<n>We develop a single- parameter scaling theory for the spectral statistics in this scenario, which embodies exact self-similarity of the spectral correlations along the complete scrambling dynamics.<n>We establish that scaling predictions are matched by a privileged process and serve as bounds for other dynamical scrambling scenarios, allowing one to quantify inefficient or incomplete scrambling on all time scales.
  arXiv  Detail & Related papers  (2023-10-17T15:41:50Z)
• Algorithmic Cluster Expansions for Quantum Problems [0.0]
  We establish a general framework for developing approximation algorithms for a class of counting problems. We apply our framework to approximating probability amplitudes of a class of quantum circuits close to the identity. We show that our algorithmic condition is almost optimal for expectation values and optimal for thermal expectation values in the sense of zero freeness.
  arXiv  Detail & Related papers  (2023-06-15T09:11:48Z)
• 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)
• Calculating the many-body density of states on a digital quantum computer [58.720142291102135]
  We implement a quantum algorithm to perform an estimation of the density of states on a digital quantum computer. We use our algorithm to estimate the density of states of a non-integrable Hamiltonian on the Quantinuum H1-1 trapped ion chip for a controlled register of 18bits.
  arXiv  Detail & Related papers  (2023-03-23T17:46:28Z)
• 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)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Implementation of a two-stroke quantum heat engine with a collisional model [50.591267188664666]
  We put forth a quantum simulation of a stroboscopic two-stroke thermal engine in the IBMQ processor. The system consists of a quantum spin chain connected to two baths at their boundaries, prepared at different temperatures using the variational quantum thermalizer algorithm.
  arXiv  Detail & Related papers  (2022-03-25T16:55:08Z)
• Optimizing thermalizations [0.0]
  We present a rigorous approach, based on the concept of continuous thermomajorisation, to algorithmically characterise the full set of energy occupations of a quantum system. We illustrate this by finding optimal protocols in the context of cooling, work extraction and optimal sequences. The same tools also allow one to quantitatively assess the role played by memory effects in the performance of thermodynamic protocols.
  arXiv  Detail & Related papers  (2022-02-25T11:05:39Z)
• Detailed Account of Complexity for Implementation of Some Gate-Based Quantum Algorithms [55.41644538483948]
  In particular, some steps of the implementation, as state preparation and readout processes, can surpass the complexity aspects of the algorithm itself. We present the complexity involved in the full implementation of quantum algorithms for solving linear systems of equations and linear system of differential equations.
  arXiv  Detail & Related papers  (2021-06-23T16:33:33Z)
• Quantum Markov Chain Monte Carlo with Digital Dissipative Dynamics on Quantum Computers [52.77024349608834]
  We develop a digital quantum algorithm that simulates interaction with an environment using a small number of ancilla qubits. We evaluate the algorithm by simulating thermal states of the transverse Ising model.
  arXiv  Detail & Related papers  (2021-03-04T18:21:00Z)
• Variational preparation of finite-temperature states on a quantum computer [0.0]
  Preparation of thermal equilibrium states is important for the simulation of condensed-matter and cosmology systems. We present a method to prepare such mixed states with unitary operators, and demonstrate this technique experimentally using a gate-based quantum processor.
  arXiv  Detail & Related papers  (2020-12-07T18:19:58Z)

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.