Better bounds for low-energy product formulas

• URL: http://arxiv.org/abs/2402.10362v1
• Date: Thu, 15 Feb 2024 23:13:57 GMT
• Title: Better bounds for low-energy product formulas
• Authors: Kasra Hejazi, Modjtaba Shokrian Zini, Juan Miguel Arrazola
• Abstract summary: We rigorously consider the error induced by product formulas when the state undergoing time evolution lies in the low-energy sector. We show that in such a setting, the usual error bounds based on the operator norm of nested commutators can be replaced by those restricted to suitably chosen low-energy subspaces.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Product formulas are one of the main approaches for quantum simulation of the Hamiltonian dynamics of a quantum system. Their implementation cost is computed based on error bounds which are often pessimistic, resulting in overestimating the total runtime. In this work, we rigorously consider the error induced by product formulas when the state undergoing time evolution lies in the low-energy sector with respect to the Hamiltonian of the system. We show that in such a setting, the usual error bounds based on the operator norm of nested commutators can be replaced by those restricted to suitably chosen low-energy subspaces, yielding tighter error bounds. Furthermore, under some locality and positivity assumptions, we show that the simulation of generic product formulas acting on low-energy states can be done asymptotically more efficiently when compared with previous results.

Related papers

• Faster Algorithmic Quantum and Classical Simulations by Corrected Product Formulas [0.06425840142026841]
  Hamiltonian simulation using product formulas is arguably the most straightforward and practical approach for algorithmic simulation on a quantum computer. We present corrected product formulas (CPFs), a variation of product formulas achieved by injecting auxiliary terms called correctors into standard product formulas. CPFs could be a valuable algorithmic tool for early fault-tolerant quantum computers with limited computing resources.
  arXiv  Detail & Related papers  (2024-09-12T17:56:43Z)
• A protocol to characterize errors in quantum simulation of many-body physics [1.4028140181591504]
  We show that the symmetries of the target many-body Hamiltonian can be used to benchmark and characterize experimental errors in quantum simulation. We consider two forms of errors: (i) unitary errors arising out of systematic errors in the applied Hamiltonian and (ii) canonical non-Markovian errors arising out of random shot-to-shot fluctuations in the applied Hamiltonian.
  arXiv  Detail & Related papers  (2023-11-06T19:00:07Z)
• Real-time dynamics of false vacuum decay [49.1574468325115]
  We investigate false vacuum decay of a relativistic scalar field in the metastable minimum of an asymmetric double-well potential. We employ the non-perturbative framework of the two-particle irreducible (2PI) quantum effective action at next-to-leading order in a large-N expansion.
  arXiv  Detail & Related papers  (2023-10-06T12:44:48Z)
• Sparse random Hamiltonians are quantumly easy [105.6788971265845]
  A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. This paper shows that, for most random Hamiltonians, the maximally mixed state is a sufficiently good trial state. Phase estimation efficiently prepares states with energy arbitrarily close to the ground energy.
  arXiv  Detail & Related papers  (2023-02-07T10:57:36Z)
• Lower Bounding Ground-State Energies of Local Hamiltonians Through the Renormalization Group [0.0]
  We show how to formulate a tractable convex relaxation of the set of feasible local density matrices of a quantum system. The coarse-graining maps of the underlying renormalization procedure serve to eliminate a vast number of those constraints. This can be used to obtain rigorous lower bounds on the ground state energy of arbitrary local Hamiltonians.
  arXiv  Detail & Related papers  (2022-12-06T14:39:47Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Average-case Speedup for Product Formulas [69.68937033275746]
  Product formulas, or Trotterization, are the oldest and still remain an appealing method to simulate quantum systems. We prove that the Trotter error exhibits a qualitatively better scaling for the vast majority of input states. Our results open doors to the study of quantum algorithms in the average case.
  arXiv  Detail & Related papers  (2021-11-09T18:49:48Z)
• Time-dependent unbounded Hamiltonian simulation with vector norm scaling [2.973326951020451]
  The accuracy of quantum dynamics simulation is usually measured by the error of the unitary evolution operator in the operator norm. For unbounded operators, after suitable discretization, the norm of the Hamiltonian can be very large, which significantly increases the simulation cost. We demonstrate that under suitable assumptions of the Hamiltonian and the initial vector, if the error is measured in terms of the vector norm, the computational cost may not increase at all.
  arXiv  Detail & Related papers  (2020-12-24T05:01:58Z)
• Assessment of weak-coupling approximations on a driven two-level system under dissipation [58.720142291102135]
  We study a driven qubit through the numerically exact and non-perturbative method known as the Liouville-von equation with dissipation. We propose a metric that may be used in experiments to map the regime of validity of the Lindblad equation in predicting the steady state of the driven qubit.
  arXiv  Detail & Related papers  (2020-11-11T22:45:57Z)
• Benchmarking adaptive variational quantum eigensolvers [63.277656713454284]
  We benchmark the accuracy of VQE and ADAPT-VQE to calculate the electronic ground states and potential energy curves. We find both methods provide good estimates of the energy and ground state. gradient-based optimization is more economical and delivers superior performance than analogous simulations carried out with gradient-frees.
  arXiv  Detail & Related papers  (2020-11-02T19:52:04Z)
• Hamiltonian simulation in the low-energy subspace [0.12891210250935145]
  We study the problem of simulating the dynamics of spin systems when the initial state is supported on a subspace of low energy of a Hamiltonian $H$. We analyze error bounds induced by product formulas that approximate the evolution operator and show that these bounds depend on an effective low-energy norm of $H$.
  arXiv  Detail & Related papers  (2020-06-04T06:14:10Z)

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.