标题： 在保真度经典模拟中打破指数壁垒 显示英文标题

标题： Breaking the exponential wall in classical simulations of fidelity

摘要： 我们分析了用于模拟经典保真度的现有算法的效率，并表明对于几乎所有初始状态，其计算成本随着自由度数量的增加呈指数增长。 然后我们提出了一种与系统维度无关的算法，并表明在连续的一类算法中，我们的算法是唯一具有此特性的算法。 同时我们提出了一种一般的解析方法来估计基于轨迹的方法的效率。 显示英文摘要

摘要： 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.