Time-dependent unbounded Hamiltonian simulation with vector norm scaling
- URL: http://arxiv.org/abs/2012.13105v3
- Date: Fri, 21 May 2021 07:39:24 GMT
- Title: Time-dependent unbounded Hamiltonian simulation with vector norm scaling
- Authors: Dong An, Di Fang, Lin Lin
- Abstract summary: 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.
- Score: 2.973326951020451
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: The accuracy of quantum dynamics simulation is usually measured by the error
of the unitary evolution operator in the operator norm, which in turn depends
on certain norm of the Hamiltonian. For unbounded operators, after suitable
discretization, the norm of the Hamiltonian can be very large, which
significantly increases the simulation cost. However, the operator norm
measures the worst-case error of the quantum simulation, while practical
simulation concerns the error with respect to a given initial vector at hand.
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 as the norm of the Hamiltonian
increases using Trotter type methods. In this sense, our result outperforms all
previous error bounds in the quantum simulation literature. Our result extends
that of [Jahnke, Lubich, BIT Numer. Math. 2000] to the time-dependent setting.
We also clarify the existence and the importance of commutator scalings of
Trotter and generalized Trotter methods for time-dependent Hamiltonian
simulations.
Related papers
- Quantum simulation of time-dependent Hamiltonians via commutator-free quasi-Magnus operators [0.7799708033005247]
Magnus operator is a popular method for time-dependent Hamiltonian simulation in computational mathematics.
The development of commutator-free quasi-Magnus operators (CFQMs) circumvents this obstacle.
We show that CFQMs are often the most efficient product-formula technique available by more than an order of magnitude.
arXiv Detail & Related papers (2024-03-20T18:01:27Z) - Better bounds for low-energy product formulas [0.0]
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.
arXiv Detail & Related papers (2024-02-15T23:13:57Z) - 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) - Vectorization of the density matrix and quantum simulation of the von
Neumann equation of time-dependent Hamiltonians [65.268245109828]
We develop a general framework to linearize the von-Neumann equation rendering it in a suitable form for quantum simulations.
We show that one of these linearizations of the von-Neumann equation corresponds to the standard case in which the state vector becomes the column stacked elements of the density matrix.
A quantum algorithm to simulate the dynamics of the density matrix is proposed.
arXiv Detail & Related papers (2023-06-14T23:08:51Z) - 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) - 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) - Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
We present a constructive algorithm for generating quantum circuits with time-independent depth.
We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model.
In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
arXiv Detail & Related papers (2021-04-01T19:06:00Z) - Fast and differentiable simulation of driven quantum systems [58.720142291102135]
We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods.
We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
arXiv Detail & Related papers (2020-12-16T21:43:38Z) - Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware.
On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
arXiv Detail & Related papers (2020-04-15T05:16: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.