Hypersensitivity to perturbations in the quantum baker’s map
- 26 July 1993
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 71 (4) , 525-528
- https://doi.org/10.1103/physrevlett.71.525
Abstract
We analyze a randomly perturbed quantum version of the baker’s transformation, a prototype of an area-conserving chaotic map. By 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 grows very rapidly and becomes larger than the maximum statistical entropy given by the logarithm of the dimension of Hilbert space. The quantum baker’s map displays a hypersensitivity to perturbations analogous to behavior found in the classical case. This hypersensitivity characterizes ‘‘quantum chaos’’ in a way that is relevant to statistical physics.Keywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Information and entropyPhysical Review E, 1993
- Information and entropy in the baker’s mapPhysical Review Letters, 1992
- Chaos and quantum-nondemolition measurementsPhysical Review A, 1991
- Entropy of random quantum statesJournal of Physics A: General Physics, 1990
- Random quantum statesFoundations of Physics, 1990
- Classical structures in the quantized baker transformationAnnals of Physics, 1990
- Algorithmic randomness and physical entropyPhysical Review A, 1989
- Thermodynamic cost of computation, algorithmic complexity and the information metricNature, 1989
- Dissipation and noise immunity in computation and communicationNature, 1988
- How random is a coin toss?Physics Today, 1983