Related papers: Quantum Simulation of Finite Temperature Schwinger…
Understanding how interacting particles approach thermal equilibrium is a major challenge of quantum simulators. Unlocking the full potential of such systems toward this goal requires flexible initial state preparation, precise time…
Critical phenomena at finite temperature underpin a broad range of physical systems, yet their study remains challenging due to computational bottlenecks near phase transitions. Quantum annealers have attracted significant interest as a…
We use the evolution operator method to find the Schwinger pair-production rate at finite temperature in scalar and spinor QED by counting the vacuum production, the induced production and the stimulated annihilation from the initial…
Quantum computing has attracted the attention of the scientific community in the past few decades. However, despite some relevant advantages, near-term quantum devices remain severely limited by thermal effects, which induce decoherence and…
A variety of generative neural networks recently adopted from machine learning have provided promising strategies for studying quantum matter. In particular, the success of autoregressive models in natural language processing has motivated…
The Schwinger model, one-dimensional quantum electrodynamics, has CP symmetry at $\theta = \pi$ due to the topological nature of the $\theta$ term. At zero temperature, it is known that as increasing the fermion mass, the system undergoes a…
Various methods have been developed for the quantum computation of the ground and excited states of physical and chemical systems, but many of them require either large numbers of ancilla qubits or high-dimensional optimization. The quantum…
The imaginary-time evolution of quantum states is integral to various fields, ranging from natural sciences to classical optimization or machine learning. Since simulating quantum imaginary-time evolution generally requires storing an…
The preparation of thermal equilibrium states is important for the simulation of condensed-matter and cosmology systems using a quantum computer. We present a method to prepare such mixed states with unitary operators, and demonstrate this…
It is not possible, using standard lattice techniques in Euclidean space, to calculate the complete fermionic spectrum of a quantum field theory. Algorithms running on quantum computers have the potential to access the theory with real-time…
In this note we develop quantum circuits for exactly simulating the thermal properties of the quantum XY/Ising chain. These circuits are applicable to the simplest integrable lattice models for which the exact momentum-space…
In nature, everything occurs at finite temperature and quantum phase transitions (QPTs) cannot be an exception. Nevertheless, they are still mainly discussed and formulated at zero temperature. We show that the condensation QPTs recently…
The scaling of the transition temperature into an ordered phase close to a quantum critical point as well as the order parameter fluctuations inside the quantum critical region provide valuable information about universal properties of the…
Quantum thermalization describes how closed quantum systems can effectively reach thermal equilibrium, resolving the apparent incongruity between the reversibility of Schr\"odinger's equation and the second law of thermodynamics. Despite…
We calculate the fidelity susceptibility chi_f for the Luttinger model and show that there is a universal contribution linear in temperature T (or inverse length 1/L). Furthermore, we develop an algorithm - based on a lattice path integral…
Quantum Ising model is an exactly solvable model of quantum phase transition. This paper gives an exact solution when the system is driven through the critical point at finite rate. The evolution goes through a series of Landau-Zener level…
The success of the current generation of Noisy Intermediate-Scale Quantum (NISQ) hardware shows that quantum hardware may be able to tackle complex problems even without error correction. One outstanding issue is that of coherent errors…
Approximate combinatorial optimization is a promising use case for quantum computers. The quantum optimization algorithms often employ a fixed ansatz that evolves an unbiased initial state towards states with better values of the optimand,…
We present a quantum-classical algorithm to study the dynamics of the two-spatial-site Schwinger model on IBM's quantum computers. Using rotational symmetries, total charge, and parity, the number of qubits needed to perform computation is…
We present a quantum algorithm for the microcanonical thermal pure quantum (TPQ) method, which has an advantage in evaluating thermodynamic quantities at finite temperatures, by combining with some recently developed techniques derived from…