Measuring Trotter error and its application to precision-guaranteed Hamiltonian simulations

• URL: http://arxiv.org/abs/2307.05406v3
• Date: Wed, 3 Jul 2024 23:37:26 GMT
• Title: Measuring Trotter error and its application to precision-guaranteed Hamiltonian simulations
• Authors: Tatsuhiko N. Ikeda, Hideki Kono, Keisuke Fujii,
• Abstract summary: 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.
• Score: 0.8009842832476994
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Trotterization is the most common and convenient approximation method for Hamiltonian simulations on digital quantum computers, but estimating its error accurately is computationally difficult for large quantum systems. Here, we develop a method for measuring the Trotter error without ancillary qubits on quantum circuits by combining the $m$th- and $n$th-order ($m<n$) Trotterizations rather than consulting with mathematical error bounds. Using this method, we make Trotterization precision-guaranteed, developing an algorithm named Trotter$(m,n)$, in which the Trotter error at each time step is within an error tolerance $\epsilon$ preset for our purpose. Trotter$(m,n)$ is applicable to both time- independent and dependent Hamiltonians, and it adaptively chooses almost the largest stepsize $\mathrm{d}t$, which keeps quantum circuits shallowest within the error tolerance. Benchmarking it in a quantum spin chain, we find the adaptively chosen $\mathrm{d}t$ to be about ten times larger than that inferred from known upper bounds of Trotter errors.

Related papers

• Lower Bounds for the Trotter Error [39.58317527488534]
  The Trotter product formula is the most common approximation scheme. It is currently unknown what the minimum possible error is. This is an important quantity because upper bounds for the Trotter error are known to often be vast overestimates.
  arXiv  Detail & Related papers  (2024-10-04T00:39:42Z)
• 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)
• Simple and high-precision Hamiltonian simulation by compensating Trotter error with linear combination of unitary operations [17.908408323643915]
  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.
  arXiv  Detail & Related papers  (2022-12-08T21:14:12Z)
• Fidelity-based distance bounds for $N$-qubit approximate quantum error correction [0.0]
  Eastin-Knill theorem states that a quantum code cannot correct errors exactly, possess continuous symmetries, and implement a universal set of gates transversely. It is common to employ a complementary measure of fidelity as a way to quantify quantum state distinguishability and benchmark approximations in error correction. We address two distance measures based on the sub- and superfidelities as a way to bound error approximations, which in turn require a lower computational cost.
  arXiv  Detail & Related papers  (2022-12-08T16:10:58Z)
• Trotter Errors and the Emergence of Chaos in Quantum Simulation [0.0]
  We run quantum simulations on a small, highly accurate quantum processor. We show how one can optimize simulation accuracy by balancing algorithmic (Trotter) errors against native errors specific to the quantum hardware at hand.
  arXiv  Detail & Related papers  (2022-12-07T18:39:33Z)
• 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)
• Quantum Goemans-Williamson Algorithm with the Hadamard Test and Approximate Amplitude Constraints [62.72309460291971]
  We introduce a variational quantum algorithm for Goemans-Williamson algorithm that uses only $n+1$ qubits. Efficient optimization is achieved by encoding the objective matrix as a properly parameterized unitary conditioned on an auxilary qubit. We demonstrate the effectiveness of our protocol by devising an efficient quantum implementation of the Goemans-Williamson algorithm for various NP-hard problems.
  arXiv  Detail & Related papers  (2022-06-30T03:15:23Z)
• Quantum Error Correction with Gauge Symmetries [69.02115180674885]
  Quantum simulations of Lattice Gauge Theories (LGTs) are often formulated on an enlarged Hilbert space containing both physical and unphysical sectors. We provide simple fault-tolerant procedures that exploit such redundancy by combining a phase flip error correction code with the Gauss' law constraint.
  arXiv  Detail & Related papers  (2021-12-09T19:29:34Z)
• 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)
• 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)
• Exponential suppression of bit or phase flip errors with repetitive error correction [56.362599585843085]
  State-of-the-art quantum platforms typically have physical error rates near $10-3$. Quantum error correction (QEC) promises to bridge this divide by distributing quantum logical information across many physical qubits. We implement 1D repetition codes embedded in a 2D grid of superconducting qubits which demonstrate exponential suppression of bit or phase-flip errors.
  arXiv  Detail & Related papers  (2021-02-11T17:11:20Z)

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.