Abstract
We analyze a randomly perturbed quantum version of the baker’s transformation, a prototype of an area-conserving chaotic map. By numerically simulating the perturbed evolution, we estimate the information needed to follow a perturbed Hilbert-space vector in time. We find that the Landauer erasure cost associated with this information grows very rapidly and becomes much larger than the maximum statistical entropy given by the logarithm of the dimension of Hilbert space. The quantum baker’s map thus displays a hypersensitivity to perturbations that is analogous to behavior found earlier in the classical case. This hypersensitivity characterizes “quantum chaos” in a way that is directly relevant to statistical physics.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
