At the Limits of Criticality-Based Quantum Metrology: Apparent Super-Heisenberg Scaling Revisited

We address the question of whether the super-Heisenberg scaling for quantum estimation is indeed realizable. We unify the results of two approaches. In the first one, the original system is compared with its copy rotated by the parameter-dependent dynamics. If the parameter is coupled to the one-body part of the Hamiltonian, the precision of its estimation is known to scale at most as N^{-1} (Heisenberg scaling) in terms of the number of elementary subsystems used N. The second approach compares the overlap between the ground states of the parameter-dependent Hamiltonian in critical systems, often leading to an apparent super-Heisenberg scaling. However, we point out that if one takes into account the scaling of time needed to perform the necessary operations, i.e., ensuring adiabaticity of the evolution, the Heisenberg limit given by the rotation scenario is recovered. We illustrate the general theory on a ferromagnetic Heisenberg spin chain example and show that it exhibits such super-Heisenberg scaling of ground-state fidelity around the critical value of the parameter (magnetic field) governing the one-body part of the Hamiltonian. Even an elementary estimator represented by a single-site magnetization already outperforms the Heisenberg behavior providing the N^{-1.5} scaling. In this case, Fisher information sets the ultimate scaling as N^{-1.75}, which can be saturated by measuring magnetization on all sites simultaneously. We discuss universal scaling predictions of the estimation precision offered by such observables, both at zero and finite temperatures, and support them with numerical simulations in the model. We provide an experimental proposal of realization of the considered model via mapping the system to ultracold bosons in a periodically shaken optical lattice. We explicitly derive that the Heisenberg limit is recovered when the time needed for preparation of quantum states involved is taken into account.

Abstract licence: CC BY

40 more references, whose wording the paper’s licence keeps private.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.