Simple and high-precision Hamiltonian simulation by compensating Trotter error with linear combination of unitary operations

• URL: http://arxiv.org/abs/2212.04566v1
• Date: Thu, 8 Dec 2022 21:14:12 GMT
• Title: Simple and high-precision Hamiltonian simulation by compensating Trotter error with linear combination of unitary operations
• Authors: Pei Zeng, Jinzhao Sun, Liang Jiang and Qi Zhao
• Abstract summary: We propose Hamiltonian simulation algorithms using LCU to compensate Trotter error. Our first algorithm exponentially improves the accuracy scaling of the Kth-order Trotter formula. For lattice Hamiltonians, the algorithm enjoys almost linear system-size dependence.
• Score: 17.908408323643915
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Trotter and linear-combination-of-unitary (LCU) are two popular Hamiltonian simulation methods. We propose Hamiltonian simulation algorithms using LCU to compensate Trotter error, which enjoy both of their advantages. By adding few gates after the Kth-order Trotter, we realize a better time scaling than 2Kth-order Trotter. Our first algorithm exponentially improves the accuracy scaling of the Kth-order Trotter formula. In the second algorithm, we consider the detailed structure of Hamiltonians and construct LCU for Trotter errors with commutator scaling. Consequently, for lattice Hamiltonians, the algorithm enjoys almost linear system-size dependence and quadratically improves the accuracy of the Kth-order Trotter.

Related papers

• Exponentially Reduced Circuit Depths Using Trotter Error Mitigation [0.0]
  Richardson and extrapolation have been proposed to mitigate the Trotter error incurred by use of these formulae. This work provides an improved, rigorous analysis of these techniques for calculating time-evolved expectation values. We demonstrate that, to achieve error $epsilon$ in a simulation of time $T$ using a $ptextth$-order product formula with extrapolation, circuits of depths $Oleft(T1+1/p textrmpolylog (1/epsilon)right)$ are sufficient.
  arXiv  Detail & Related papers  (2024-08-26T16:08:07Z)
• Efficient and practical Hamiltonian simulation from time-dependent product formulas [1.2534672170380357]
  We propose an approach for implementing time-evolution of a quantum system using product formulas. Our algorithms generate a decomposition of the evolution operator into a product of simple unitaries that are directly implementable on a quantum computer. Although the theoretical scaling is suboptimal compared with state-of-the-art algorithms, the performance of the algorithms we propose is highly competitive in practice.
  arXiv  Detail & Related papers  (2024-03-13T17:29:05Z)
• Measuring Trotter error and its application to precision-guaranteed Hamiltonian simulations [0.8009842832476994]
  We develop a method for measuring the Trotter error without ancillary qubits on quantum circuits. We make Trotterization precision-guaranteed, developing an algorithm named Trotter$(m,n)$. We find the adaptively chosen $mathrmdt$ to be about ten times larger than that inferred from known upper bounds of Trotter errors.
  arXiv  Detail & Related papers  (2023-07-11T16:12:38Z)
• On the complexity of implementing Trotter steps [2.1369834525800138]
  We develop methods to perform faster Trotter steps with complexity sublinear in number of terms. We also realize faster Trotter steps when certain blocks of Hamiltonian coefficients have low rank. Our result suggests the use of Hamiltonian structural properties as both necessary and sufficient to implement Trotter synthesis steps with lower gate complexity.
  arXiv  Detail & Related papers  (2022-11-16T19:00:01Z)
• Self-healing of Trotter error in digital adiabatic state preparation [52.77024349608834]
  We prove that the first-order Trotterization of a complete adiabatic evolution has a cumulative infidelity that scales as $mathcal O(T-2 delta t2)$ instead of $mathcal O(T2delta t2)$ expected from general Trotter error bounds. This result suggests a self-healing mechanism and explains why, despite increasing $T$, infidelities for fixed-$delta t$ digitized evolutions still decrease for a wide variety of Hamiltonians.
  arXiv  Detail & Related papers  (2022-09-13T18:05:07Z)
• Twisted hybrid algorithms for combinatorial optimization [68.8204255655161]
  Proposed hybrid algorithms encode a cost function into a problem Hamiltonian and optimize its energy by varying over a set of states with low circuit complexity. We show that for levels $p=2,ldots, 6$, the level $p$ can be reduced by one while roughly maintaining the expected approximation ratio.
  arXiv  Detail & Related papers  (2022-03-01T19:47:16Z)
• 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)
• Provably Faster Algorithms for Bilevel Optimization [54.83583213812667]
  Bilevel optimization has been widely applied in many important machine learning applications. We propose two new algorithms for bilevel optimization. We show that both algorithms achieve the complexity of $mathcalO(epsilon-1.5)$, which outperforms all existing algorithms by the order of magnitude.
  arXiv  Detail & Related papers  (2021-06-08T21:05:30Z)
• Single-Timescale Stochastic Nonconvex-Concave Optimization for Smooth Nonlinear TD Learning [145.54544979467872]
  We propose two single-timescale single-loop algorithms that require only one data point each step. Our results are expressed in a form of simultaneous primal and dual side convergence.
  arXiv  Detail & Related papers  (2020-08-23T20:36:49Z)
• 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)
• Term Grouping and Travelling Salesperson for Digital Quantum Simulation [6.945601123742983]
  Digital simulation of quantum dynamics by evaluating the time evolution of a Hamiltonian is the initially proposed application of quantum computing. The large number of quantum gates required for emulating the complete second quantization form of the Hamiltonian makes such an approach unsuitable for near-term devices. We propose a new term ordering strategy, max-commute-tsp, that simultaneously mitigates both algorithmic and physical errors.
  arXiv  Detail & Related papers  (2020-01-16T18:33:24Z)

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.