Lower Bounds for the Trotter Error
- URL: http://arxiv.org/abs/2410.03059v1
- Date: Fri, 4 Oct 2024 00:39:42 GMT
- Title: Lower Bounds for the Trotter Error
- Authors: Alexander Hahn, Paul Hartung, Daniel Burgarth, Paolo Facchi, Kazuya Yuasa,
- Abstract summary: 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.
- Score: 39.58317527488534
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: In analog and digital simulations of practically relevant quantum systems, the target dynamics can only be implemented approximately. The Trotter product formula is the most common approximation scheme as it is a generic method which allows tuning accuracy. The Trotter simulation precision will always be inexact for non-commuting operators, but 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. Here, we present explicit lower bounds on the error, in norm and on states, allowing to derive minimum resource requirements. Numerical comparison with the true error shows that our bounds offer accurate and tight estimates.
Related papers
- Estimating Trotter Approximation Errors to Optimize Hamiltonian
Partitioning for Lower Eigenvalue Errors [0.0]
Trotter approximation error estimation based on perturbation theory up to a second order in the time-step for eigenvalues provides estimates with very good correlations with the Trotter approximation errors.
The developed perturbative estimates can be used for practical time-step and Hamiltonian partitioning selection protocols.
arXiv Detail & Related papers (2023-12-20T18:59:15Z) - Predicting generalization performance with correctness discriminators [64.00420578048855]
We present a novel model that establishes upper and lower bounds on the accuracy, without requiring gold labels for the unseen data.
We show across a variety of tagging, parsing, and semantic parsing tasks that the gold accuracy is reliably between the predicted upper and lower bounds.
arXiv Detail & Related papers (2023-11-15T22:43:42Z) - 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) - Improved Accuracy for Trotter Simulations Using Chebyshev Interpolation [0.5729426778193399]
We show how errors due to Trotterized time evolution can be mitigated through the use of algorithmic techniques.
Our approach is to extrapolate to zero Trotter step size, akin to zero-noise extrapolation techniques for mitigating hardware errors.
arXiv Detail & Related papers (2022-12-29T01:21:26Z) - A Universal Error Measure for Input Predictions Applied to Online Graph
Problems [57.58926849872494]
We introduce a novel measure for quantifying the error in input predictions.
The measure captures errors due to absent predicted requests as well as unpredicted actual requests.
arXiv Detail & Related papers (2022-05-25T15:24:03Z) - 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) - First-Order Trotter Error from a Second-Order Perspective [0.0]
Simulating quantum dynamics beyond the reach of classical computers is one of the main envisioned applications of quantum computers.
The approximation error of these algorithms is often poorly understood, even in the most basic cases, which are particularly relevant for experiments.
Recent studies have reported anomalously low approximation error with unexpected scaling in such cases, which they attribute to quantum interference between the errors from different steps of the algorithm.
Our method generalizes state-of-the-art error bounds without the technical caveats of prior studies, and elucidates how each part of the total error arises from the underlying quantum circuit.
arXiv Detail & Related papers (2021-07-16T17:53:44Z) - How Low Can We Go: Trading Memory for Error in Low-Precision Training [52.94003953419242]
Low-precision arithmetic trains deep learning models using less energy, less memory and less time.
We pay a price for the savings: lower precision may yield larger round-off error and hence larger prediction error.
We borrow ideas from meta-learning to learn the tradeoff between memory and error.
arXiv Detail & Related papers (2021-06-17T17:38:07Z) - Rao-Blackwellizing the Straight-Through Gumbel-Softmax Gradient
Estimator [93.05919133288161]
We show that the variance of the straight-through variant of the popular Gumbel-Softmax estimator can be reduced through Rao-Blackwellization.
This provably reduces the mean squared error.
We empirically demonstrate that this leads to variance reduction, faster convergence, and generally improved performance in two unsupervised latent variable models.
arXiv Detail & Related papers (2020-10-09T22:54:38Z) - Optimal noise estimation from syndrome statistics of quantum codes [0.7264378254137809]
Quantum error correction allows to actively correct errors occurring in a quantum computation when the noise is weak enough.
Traditionally, this information is obtained by benchmarking the device before operation.
We address the question of what can be learned from only the measurements done during decoding.
arXiv Detail & Related papers (2020-10-05T18:00:26Z)
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.