Simplifying the simulation of local Hamiltonian dynamics

• URL: http://arxiv.org/abs/2310.07054v2
• Date: Tue, 30 Apr 2024 11:51:17 GMT
• Title: Simplifying the simulation of local Hamiltonian dynamics
• Authors: Ayaka Usui, Anna Sanpera, María García Díaz,
• Abstract summary: Local Hamiltonians, $H_k$, describe non-trivial $k$-body interactions in quantum many-body systems. We build upon known methods to derive examples of $H_k$ and $H_k'$ that simulate the same physics. We propose a method to search for the $k'$-local Hamiltonian that simulates, with the highest possible precision, the short time dynamics of a given $H_k$ Hamiltonian.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Local Hamiltonians, $H_k$, describe non-trivial $k$-body interactions in quantum many-body systems. Here, we address the dynamical simulatability of a $k$-local Hamiltonian by a simpler one, $H_{k'}$, with $k'<k$, under the realistic constraint that both Hamiltonians act on the same Hilbert space. When it comes to exact simulation, we build upon known methods to derive examples of $H_k$ and $H_{k'}$ that simulate the same physics. We also address the most realistic case of approximate simulation. There, we upper-bound the error up to which a Hamiltonian can simulate another one, regardless of their internal structure, and prove, by means of an example, that the accuracy of a $(k'=2)$-local Hamiltonian to simulate $H_{k}$ with $k>2$ increases with $k$. Finally, we propose a method to search for the $k'$-local Hamiltonian that simulates, with the highest possible precision, the short time dynamics of a given $H_k$ Hamiltonian.

Related papers

• Slow Mixing of Quantum Gibbs Samplers [47.373245682678515]
  We present a quantum generalization of these tools through a generic bottleneck lemma. This lemma focuses on quantum measures of distance, analogous to the classical Hamming distance but rooted in uniquely quantum principles. Even with sublinear barriers, we use Feynman-Kac techniques to lift classical to quantum ones establishing tight lower bound $T_mathrmmix = 2Omega(nalpha)$.
  arXiv  Detail & Related papers  (2024-11-06T22:51:27Z)
• Improved Time-independent Hamiltonian Simulation [0.0]
  We describe a simple method for simulating time-independent Hamiltonian $H$ that could be decomposed as $H = sum_i=1m H_i$. We employ the recently introduced quantum singular value transformation framework to utilize the ability to simulate $H_i$ in an alternative way.
  arXiv  Detail & Related papers  (2024-10-20T02:49:14Z)
• Predicting Ground State Properties: Constant Sample Complexity and Deep Learning Algorithms [48.869199703062606]
  A fundamental problem in quantum many-body physics is that of finding ground states of local Hamiltonians. We introduce two approaches that achieve a constant sample complexity, independent of system size $n$, for learning ground state properties.
  arXiv  Detail & Related papers  (2024-05-28T18:00:32Z)
• Hamiltonian simulation for low-energy states with optimal time dependence [45.02537589779136]
  We consider the task of simulating time evolution under a Hamiltonian $H$ within its low-energy subspace. We present a quantum algorithm that uses $O(tsqrtlambdaGamma + sqrtlambda/Gammalog (1/epsilon))$ queries to the block-encoding for any $Gamma$.
  arXiv  Detail & Related papers  (2024-04-04T17:58:01Z)
• Simulating LDPC code Hamiltonians on 2D lattices [0.0]
  We build a simulation of LDPC codes using only 2D nearest-neighbour interactions at the cost of an energy penalty in the system size. We derive guarantees for the simulation that allows us to approximately reproduce the ground state of the code Hamiltonian.
  arXiv  Detail & Related papers  (2023-08-25T09:59:47Z)
• Composite QDrift-Product Formulas for Quantum and Classical Simulations in Real and Imaginary Time [0.18374319565577155]
  Recent work has shown that it can be advantageous to implement a composite channel that partitions the Hamiltonian $H$ for a given simulation problem into subsets. We show that this approach holds in imaginary time, making it a candidate classical algorithm for quantum Monte-Carlo calculations. We provide exact numerical simulations of algorithmic cost by counting the number of gates of the form $e-iH_j t$ and $e-H_j beta$ to meet a certain error tolerance.
  arXiv  Detail & Related papers  (2023-06-28T21:31:26Z)
• On the Impossibility of General Parallel Fast-forwarding of Hamiltonian Simulation [4.925967492198012]
  Hamiltonian simulation is one of the most important problems in the field of quantum computing. Existing simulation algorithms require running time at least linear in the evolution time $T$. It is intriguing whether we can achieve fast Hamiltonian simulation with the power of parallelism.
  arXiv  Detail & Related papers  (2023-05-21T12:30:00Z)
• Systematics of quasi-Hermitian representations of non-Hermitian quantum models [0.0]
  This paper introduces and describes a set of constructive returns of the description to one of the correct and eligible physical Hilbert spaces $cal R_N(0)$. In the extreme of the theory the construction is currently well known and involves solely the inner product metric $Theta=Theta(H)$. At $j=N$ the inner-product metric remains trivial and only the Hamiltonian must be Hermitized, $H to mathfrakh = Omega,H,Omega-1=mathfrak
  arXiv  Detail & Related papers  (2022-12-07T20:10:58Z)
• Some Remarks on the Regularized Hamiltonian for Three Bosons with Contact Interactions [77.34726150561087]
  We discuss some properties of a model Hamiltonian for a system of three bosons interacting via zero-range forces in three dimensions. In particular, starting from a suitable quadratic form $Q$, the self-adjoint and bounded from below Hamiltonian $mathcal H$ can be constructed. We show that the threshold value $gamma_c$ is optimal, in the sense that the quadratic form $Q$ is unbounded from below if $gammagamma_c$.
  arXiv  Detail & Related papers  (2022-07-01T10:01:14Z)
• Hamiltonian simulation with random inputs [74.82351543483588]
  Theory of average-case performance of Hamiltonian simulation with random initial states. Numerical evidence suggests that this theory accurately characterizes the average error for concrete models.
  arXiv  Detail & Related papers  (2021-11-08T19:08:42Z)
• 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.