High-precision simulation of finite-size thermalizing systems at long times

• URL: http://arxiv.org/abs/2406.05399v1
• Date: Sat, 8 Jun 2024 08:39:21 GMT
• Title: High-precision simulation of finite-size thermalizing systems at long times
• Authors: Yichen Huang,
• Abstract summary: We propose a simple and efficient numerical method so that the simulation error is of higher order in $1/N$. This finite-size error scaling is proved by assuming the eigenstate thermalization hypothesis.
• Score: 6.907555940790131
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: To simulate thermalizing systems at long times, the most straightforward approach is to calculate the thermal properties at the corresponding energy. In a quantum many-body system of size $N$, for local observables and many initial states, this approach has an error of $O(1/N)$, which is reminiscent of the finite-size error of the equivalence of ensembles. In this paper, we propose a simple and efficient numerical method so that the simulation error is of higher order in $1/N$. This finite-size error scaling is proved by assuming the eigenstate thermalization hypothesis.

Related papers

• Efficient Simulation of 1D Long-Range Interacting Systems at Any Temperature [0.22499166814992444]
  We introduce a method that ensures efficient computation of one-dimensional quantum systems with long-range interactions across all temperatures. Our algorithm operates within a quasi-polynomial runtime for inverse temperatures up to $beta=rm poly(ln(n))$.
  arXiv  Detail & Related papers  (2024-09-04T15:37:54Z)
• Efficient Simulation of Low Temperature Physics in One-Dimensional Gapless Systems [0.0]
  We discuss the computational efficiency of the finite temperature simulation with the minimally entangled typical thermal states (METTS) We show that METTS provide a significant speedup compared to employing the purification method to analyze thermal equilibrium states at low temperatures in 1D gapless systems.
  arXiv  Detail & Related papers  (2023-09-05T18:09:41Z)
• An Optimization-based Deep Equilibrium Model for Hyperspectral Image Deconvolution with Convergence Guarantees [71.57324258813675]
  We propose a novel methodology for addressing the hyperspectral image deconvolution problem. A new optimization problem is formulated, leveraging a learnable regularizer in the form of a neural network. The derived iterative solver is then expressed as a fixed-point calculation problem within the Deep Equilibrium framework.
  arXiv  Detail & Related papers  (2023-06-10T08:25:16Z)
• Ground state preparation with shallow variational warm-start [5.526775342940154]
  This work provides a quantum ground state preparation scheme with shallow variational warm-start to tackle the bottlenecks of current algorithms. We demonstrate the effectiveness of our methods via extensive numerical simulations on spin-$1/2$ Heisenberg models. We extend research on the Hubbard model, demonstrating superior performance compared to the prevalent variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-03-20T15:36:23Z)
• Isometric tensor network representations of two-dimensional thermal states [0.0]
  We use the class of recently introduced tensor network states to represent thermal states of the transverse field Ising model. We find that this approach offers a different way with low computational complexity to represent states at finite temperatures.
  arXiv  Detail & Related papers  (2023-02-15T19:00:11Z)
• Gaussian process regression and conditional Karhunen-Lo\'{e}ve models for data assimilation in inverse problems [68.8204255655161]
  We present a model inversion algorithm, CKLEMAP, for data assimilation and parameter estimation in partial differential equation models. The CKLEMAP method provides better scalability compared to the standard MAP method.
  arXiv  Detail & Related papers  (2023-01-26T18:14:12Z)
• Entropic Neural Optimal Transport via Diffusion Processes [105.34822201378763]
  We propose a novel neural algorithm for the fundamental problem of computing the entropic optimal transport (EOT) plan between continuous probability distributions. Our algorithm is based on the saddle point reformulation of the dynamic version of EOT which is known as the Schr"odinger Bridge problem. In contrast to the prior methods for large-scale EOT, our algorithm is end-to-end and consists of a single learning step.
  arXiv  Detail & Related papers  (2022-11-02T14:35:13Z)
• Hybridized Methods for Quantum Simulation in the Interaction Picture [69.02115180674885]
  We provide a framework that allows different simulation methods to be hybridized and thereby improve performance for interaction picture simulations. Physical applications of these hybridized methods yield a gate complexity scaling as $log2 Lambda$ in the electric cutoff. For the general problem of Hamiltonian simulation subject to dynamical constraints, these methods yield a query complexity independent of the penalty parameter $lambda$ used to impose an energy cost.
  arXiv  Detail & Related papers  (2021-09-07T20:01:22Z)
• Uhlmann Fidelity and Fidelity Susceptibility for Integrable Spin Chains at Finite Temperature: Exact Results [68.8204255655161]
  We show that the proper inclusion of the odd parity subspace leads to the enhancement of maximal fidelity susceptibility in the intermediate range of temperatures. The correct low-temperature behavior is captured by an approximation involving the two lowest many-body energy eigenstates.
  arXiv  Detail & Related papers  (2021-05-11T14:08:02Z)
• Spectral Analysis of Product Formulas for Quantum Simulation [0.0]
  We show that the Trotter step size needed to estimate an energy eigenvalue within precision can be improved in scaling from $epsilon$ to $epsilon1/2$ for a large class of systems. Results partially generalize to diabatic processes, which remain in a narrow energy band separated from the rest of the spectrum by a gap.
  arXiv  Detail & Related papers  (2021-02-25T03:17:25Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)

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.