Breaking the exponential wall in classical simulations of fidelity
arXiv:1108.0173 · doi:10.1103/PhysRevE.84.066205
Abstract
We analyze the efficiency of available algorithms for the simulation of classical fidelity and show that their computational costs increase exponentially with the number of degrees of freedom for almost all initial states. Then we present an algorithm whose cost is independent of the system's dimensionality and show that, within a continuous family of algorithms, our algorithm is the only one with this property. Simultaneously we propose a general analytical approach to estimate efficiency of trajectory-based methods.
5 pages, 3 figures
References in corpus (7)
- Dynamics of Loschmidt echoes and fidelity decay
- Decoherence, Entanglement and Irreversibility in Quantum Dynamical Systems with Few Degrees of Freedom
- Dephasing representation of quantum fidelity for general pure and mixed states
- On the stability of classical chaotic motion under system's perturbations
- Decay of the classical Loschmidt echo in integrable systems
- Beating the efficiency of both quantum and classical simulations with semiclassics
- Quantum and Classical Fidelity for Singular Perturbations of the Inverted and Harmonic Oscillator