Thermal properties of nanomaterials are crucial to not only improving our fundamental understanding of condensed matter systems, but also to developing novel materials for applications spanning research and industry. Since quantum effects arise at the nano-scale, these systems are difficult to simulate on classical computers. Quantum computers can efficiently simulate quantum many-body systems, yet current quantum algorithms for calculating thermal properties of these systems incur significant computational costs in that they either prepare the full thermal state on the quantum computer, or they must sample a number of pure states from a distribution that grows with system size. Canonical thermal pure quantum (TPQ) states provide a promising path to estimating thermal properties of quantum materials as they neither require preparation of the full thermal state nor require a growing number of samples with system size. Here, we present an algorithm for preparing canonical TPQ states on quantum computers. We compare three different circuit implementations for the algorithm and demonstrate their capabilities in estimating thermal properties of quantum materials. Due to its increasing accuracy with system size and flexibility in implementation, we anticipate that this method will enable finite temperature explorations of relevant quantum materials on near-term quantum computers.
Thermal properties of nanomaterials are crucial to not only improving our fundamental understanding of condensed matter systems, but also to developing novel materials for applications spanning research and industry. Since quantum effects arise at the nano-scale, these systems are difficult to simulate on classical computers. Quantum computers can efficiently simulate quantum many-body systems, yet current quantum algorithms for calculating thermal properties of these systems incur significant computational costs in that they either prepare the full thermal state on the quantum computer, or they must sample a number of pure states from a distribution that grows with system size. Canonical thermal pure quantum (TPQ) states provide a promising path to estimating thermal properties of quantum materials as they neither require preparation of the full thermal state nor require a growing number of samples with system size. Here, we present an algorithm for preparing canonical TPQ states on quantum computers. We compare three different circuit implementations for the algorithm and demonstrate their capabilities in estimating thermal properties of quantum materials. Due to its increasing accuracy with system size and flexibility in implementation, we anticipate that this method will enable finite temperature explorations of relevant quantum materials on near-term quantum computers.
We propose a quantum algorithm to investigate finite-temperature properties of quantum many-body systems by implementing the microcanonical thermal pure quantum (TPQ) states [S. Sugiura and A. Shimizu, Phys. Rev. Lett. 108, 240401 (2012)] on a quantum computer. In the formalism, the TPQ state is constructed by applying the power of a rescaled Hamiltonian to a random state. We clarify that, using techniques based on quantum signal processing, the power operation can be efficiently realized when the ground-state energy of a quantum system of interest is given with some precision. Our algorithm has an advantage in calculating thermodynamic quantities at low temperatures.
We generalize the thermal pure quantum (TPQ) formulation of statistical mechanics, in such a way that it is applicable to systems whose Hilbert space is infinite dimensional. Assuming particle systems, we construct the grand-canonical TPQ (gTPQ) state, which is the counterpart of the grand-canonical Gibbs state of the ensemble formulation. A single realization of the gTPQ state gives all quantities of statistical-mechanical interest, with exponentially small probability of error. This formulation not only sheds new light on quantum statistical mechanics but also is useful for practical computations. As an illustration, we apply it to the Hubbard model, on a one-dimensional (1D) chain and on a two-dimensional (2D) triangular lattice. For the 1D chain, our results agree well with the exact solutions over wide ranges of temperature, chemical potential, and the on-site interaction. For the 2D triangular lattice, for which exact results are unknown, we obtain reliable results over a wide range of temperature. We also find that finite-size effects are much smaller in the gTPQ state than in the canonical TPQ state. This also shows that in the ensemble formulation the grand-canonical Gibbs state of a finite-size system simulates an infinite system much better than the canonical Gibbs state.
Computing finite temperature properties of a quantum many-body system is key to describing a broad range of correlated quantum many-body physics from quantum chemistry and condensed matter to thermal quantum field theories. Quantum computing, which has seen rapid developments in recent years, has a huge potential to impact the computation of quantum thermodynamics. To fulfill these potential impacts, it is crucial to design quantum algorithms that utilize the computation power of quantum computing devices. Here, we present a quantum kernel function expansion (QKFE) algorithm for solving thermodynamic properties of quantum many-body systems. In this quantum algorithm, the many-body density of states is approximated by a kernel Fourier expansion, whose expansion moments are obtained by random state sampling and quantum interferometric measurements. Compared to its classical counterpart, namely, the kernel polynomial method (KPM), QKFE has an exponential advantage in the cost of both time and memory. In computing low temperature properties, QKFE becomes inefficient, similar to classical KPM. To resolve this difficulty, we further construct a thermal ensemble iteration (THEI) protocol which starts from the trivial limit of an infinite temperature ensemble and approaches the low temperature regime step by step. For quantum Hamiltonians, whose ground states are preparable with polynomial quantum circuits, THEI has an overall polynomial complexity. We demonstrate its efficiency with applications to one- and two-dimensional quantum spin models and a fermionic lattice. With our analysis of the realization with digital and analog quantum devices, we believe the quantum algorithm is accessible to current quantum technology.
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.
Preparation of quantum thermal states of many-body systems is a key computational challenge for quantum processors, with applications in physics, chemistry, and classical optimization. We provide a simple and efficient algorithm for thermal state preparation, combining engineered bath resetting and modulated system-bath coupling to derive a quantum channel approximately satisfying quantum detailed balance relations. We show that the fixed point σ ^ of the channel approximates the Gibbs state as ∥ σ ^ − σ ^ β ∥ ∼ θ 2 , where θ is the system-bath coupling and σ ^ β ∝ e − β H ^ S . We provide extensive numerics, for the example of the 2D quantum Ising model, confirming that the protocol successfully prepares the thermal state throughout the finite-temperature phase diagram, including near the quantum phase transition. Simulations for free-fermion systems provide further evidence for the accuracy of the protocol for large system sizes in the weak-coupling limit. Our algorithm provides a path to efficient quantum simulation of quantum-correlated states at finite temperature with current and near-term quantum processors.
Nature is governed by precise physical laws, which can inspire the discovery of new computer-run simulation algorithms. Thermal states are the most ubiquitous for they are the equilibrium states of matter. Simulating thermal states of quantum matter has applications ranging from quantum machine learning to better understanding of high-temperature superconductivity and quantum chemistry. The computational complexity of this task is hopelessly hard for classical computers. The existing quantum algorithms come with caveats: most either require quantum phase estimation rendering them impractical for current noisy hardware, or are variational which face obstacles such as initialization, barren plateaus, and a general lack of provable guarantee. We provide two quantum algorithms with provable guarantees to prepare thermal states on (near-term) quantum computers that avoid these drawbacks. The first algorithm is inspired by the natural thermalization process where the ancilla qubits act as the infinite thermal bath. This algorithm can potentially run in polynomial time to sample thermal distributions of ergodic systems -- the vast class of physical systems that equilibrate in isolation with respect to local observables. The second algorithm works for any system and in general runs in exponential time. However, it requires significantly smaller quantum resources than previous such algorithms. In addition, we provide an error mitigation technique for both algorithms to fight back decoherence, which enables us to run our algorithms on the near-term quantum devices. To illustration, we simulate the thermal state of the hardcore Bose-Hubbard model on the latest generation of available quantum computers.