Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userStability of the Trotter-Suzuki decomposition
124
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic 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.
rate research
Read More
The Trotter-Suzuki decomposition is one of the main approaches for realization of quantum simulations on digital quantum computers. Variance-based global sensitivity analysis (the Sobol method) is a wide used method which allows to decompose output variance of mathematical model into fractions allocated to different sources of uncertainty in inputs or sets of inputs of the model. Here we developed a method for application of the global sensitivity analysis to the optimization of Trotter-Suzuki decomposition. We show with a proof-of-concept example that this approach allows to reduce the number of exponentiations in the decomposition and provides a quantitative method for finding and truncation unimportant terms in the system Hamiltonian.
We derive Fredholm determinant and series representation of the tau function of the Fuji-Suzuki-Tsuda system and its multivariate extension, thereby generalizing to higher rank the results obtained for Painleve VI and the Garnier system. A special case of our construction gives a higher rank analog of the continuous hypergeometric kernel of Borodin and Olshanski. We also initiate the study of algebraic braid group dynamics of semi-degenerate monodromy, and obtain as a byproduct a direct isomonodromic proof of the AGT-W relation for $c=N-1$.
We consider the dynamics $tmapstotau_t$ of an infinite quantum lattice system that is generated by a local interaction. If the interaction decomposes into a finite number of terms that are themselves local interactions, we show that $tau_t$ can be efficiently approximated by a product of $n$ automorphisms, each of them being an alternating product generated by the individual terms. For any integer $m$, we construct a product formula (in the spirit of Trotter) such that the approximation error scales as $n^{-m}$. We do so in the strong topology of the operator algebra, namely by approximating $tau_t(O)$ for sufficiently localized observables $O$.
The Trotter-Suzuki approximation leads to an efficient algorithm for solving the time-dependent Schrodinger equation. Using existing highly optimized CPU and GPU kernels, we developed a distributed version of the algorithm that runs efficiently on a cluster. Our implementation also improves single node performance, and is able to use multiple GPUs within a node. The scaling is close to linear using the CPU kernels, whereas the efficiency of GPU kernels improve with larger matrices. We also introduce a hybrid kernel that simultaneously uses multicore CPUs and GPUs in a distributed system. This kernel is shown to be efficient when the matrix size would not fit in the GPU memory. Larger quantum systems scale especially well with a high number nodes. The code is available under an open source license.
We present a product formula to approximate the exponential of a skew-Hermitian operator that is a sum of generators of a Lie algebra. The number of terms in the product depends on the structure factors. When the generators have large norm with respect to the dimension of the Lie algebra, or when the norm of the effective operator resulting from nested commutators is less than the product of the norms, the number of terms in the product is significantly less than that obtained from well-known results. We apply our results to construct product formulas useful for the quantum simulation of some continuous-variable and bosonic physical systems, including systems whose potential is not quadratic. For many of these systems, we show that the number of terms in the product can be sublinear or subpolynomial in the dimension of the relevant local Hilbert spaces, where such a dimension is usually determined by an energy scale of the problem. Our results emphasize the power of quantum computers for the simulation of various quantum systems.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
