Higher Order Methods for Simulations on Quantum Computers
A. T. Sornborger, E. D. Stewart
Abstract
To efficiently implement many-qubit gates for use in quantum simulations on quantum computers we develop and present methods reexpressing exp[-i (H1 + H2 + ...) Δt] as a product of factors exp[-i H1 Δt], exp[-i H2 Δt], ... which is accurate to 3rd or 4th order in Δt. The methods we derive are an extended form of symplectic method and can also be used for the integration of classical Hamiltonians on classical computers. We derive both integral and irrational methods, and find the most efficient methods in both cases.
Create a lesson
Related papers
Spectral Fingerprints of Gauge Theories on a Quantum Computer
Graham Van Goffrier, Debasish Banerjee, Bipasha Chakraborty et al.
Dynamics of local quantum information in random unitary circuits
Ratul Thakur, Sthitadhi Roy
Factorized Boolean representations for efficient quantum synthesis
Mehul Shah, Robert Fiszer, Marek Perkowski
Detuning- and Stark-robust Rydberg gates
Elie Bataille, Gyohei Nomura, Manuel Endres
Krylov Break Times from an Inhomogeneous Lieb--Robinson Light Cone
Shunji Matsuura, Yoji Kawamura, Joseph Salfi et al.
Stochastic transport of a Goldstone mode in a self-organized atomic crystal
Zhanhai Yu, Di Xiang, Xiaotian Zhang et al.