Understanding the ultimate rate at which information propagates is a pivotal issue in nonequilibrium physics. Nevertheless, the task of elucidating the propagation speed inherent in quantum bosonic systems presents challenges due to the unbounded nature of their interactions. In this study, we tackle the problem of macroscopic particle transport in a long-range generalization of the lattice Bose-Hubbard model through the lens of the quantum speed limit. By developing a unified approach based on optimal transport theory, we rigorously prove that the minimum time required for macroscopic particle transport is always bounded by the distance between the source and target regions, while retaining its significance even in the thermodynamic limit. Furthermore, we derive an upper bound for the probability of observing a specific number of bosons inside the target region, thereby providing additional insights into the dynamics of particle transport. Our results hold true for arbitrary initial states under both long-range hopping and long-range interactions, thus resolving an open problem of particle transport in generic bosonic systems.
Comments on `Stable Quantum Computation of Unstable Classical Chaos,' `Efficient Quantum Computing Insensitive to Phase Errors,' and `Quantum Computer Inverting Time Arrow for Macroscopic Systems'
最近,论文B。乔治和D.L. Shepelyansky,Phys. Rev. 86_,5393(2001)中提出的[C. Zalka,quant-ph/0110019; L. Di'osi,quant-ph/0110026]。这封信声称,当在量子计算机上执行Arnold猫映射下的相空间密度演化时,误差敏感性将呈指数级加速和降低。一方面,有些观点以前的答复者尚未提出。另一方面,作者的反应[quant-ph/0110142]提出了新的问题。本说明述及这两个问题。