2000 character limit reached
Stability of the Trotter-Suzuki decomposition
Published 14 Mar 2014 in math-ph and math.MP | (1403.3469v3)
Abstract: The Trotter-Suzuki decomposition is an important tool for the simulation and control of physical systems. We provide evidence for the stability of the Trotter-Suzuki decomposition. We model the error in the decomposition and determine sufficiency conditions that guarantee the stability of this decomposition under this model. We relate these sufficiency conditions to precision limitations of computing and control in both classical and quantum cases. Furthermore we show that bounded-error Trotter-Suzuki decomposition can be achieved by a suitable choice of machine precision.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.