We derive new bounds on achievable precision in the most general adaptive quantum metrological scenarios. The bounds are proven to be asymptotically saturable and equivalent to the known parallel scheme bounds in the limit of a large number of channel uses. This completely solves a long-standing conjecture in the field of quantum metrology on the asymptotic equivalence between parallel and adaptive strategies. The new bounds also allow us to easily assess the potential benefits of invoking nonstandard causal superposition strategies, for which we prove, similarly to the adaptive case, the lack of asymptotic advantage over the parallel ones.
We derive new bounds on achievable precision in the most general adaptive quantum metrological scenarios. The bounds are proven to be asymptotically saturable and equivalent to the known parallel scheme bounds in the limit of a large number of channel uses. This completely solves a long-standing conjecture in the field of quantum metrology on the asymptotic equivalence between parallel and adaptive strategies. The new bounds also allow us to easily assess the potential benefits of invoking nonstandard causal superposition strategies, for which we prove, similarly to the adaptive case, the lack of asymptotic advantage over the parallel ones.
Quantum metrology with indefinite causal order (ICO) has attracted intense interest due to its potential to surpass the limitations of conventional fixed-order strategies. A key open question is whether ICO can fundamentally enhance asymptotic precision scaling. In this work, we bridge this gap for the estimation of a single parameter encoded in N identical uses of a finite-dimensional quantum channel. We first establish a universal Heisenberg-scaling upper bound for the full general ICO process-matrix class and show that for unitary channels its optimal quantum Fisher information (QFI) coincides exactly with that of parallel strategies. For noisy channels, a structurally refined bound shows that channels restricted to the standard quantum limit (SQL) under parallel strategies remain SQL-limited under general ICO strategies. Most significantly, an asymptotically tight (AT) bound is derived to close the remaining possibility of an asymptotic ICO advantage by showing that general ICO and optimal parallel strategies have exactly the same leading QFI coefficient in both the SQL and Heisenberg regimes. For the operationally motivated class of quantum circuits with quantum control of causal order, we further obtain an iterative constraint on finite-query precision whose asymptotic limit agrees with that of the AT bound. Our results clarify the ultimate role of indefinite causality as a metrological resource for quantum channel estimation.
In quantum metrology, adaptive and causal-superposition strategies are proven to be beneficial over parallel schemes for a finite number of channel uses, but their advantages disappear in the asymptotic limit. We show that quantum operations with indefinite time direction, specifically, time-flip (TF)-assisted strategies, referred to as indefinite time-directed metrology (ITDM), can overcome this asymptotic equivalence. Using semidefinite programming, we rigorously demonstrate that TF-assisted protocols can achieve quantum Fisher information (QFI) strictly exceeding the maximum value attainable by parallel, adaptive, and causal-superposition strategies, both for finite and asymptotically many channel uses. Moreover, we identify a class of Pauli noise channels for which ITDM achieves Heisenberg scaling, while all parallel, adaptive, and causal-superposition strategies remain restricted to standard scaling. We call this phenomenon as metrological activation. Interestingly, this activation can be used to exhibit that the quantum time-flip and transposition supermaps cannot be simulated by conventional quantum circuits or causal-superposition strategies using any finite number of channel queries, thereby establishing indefinite time direction as a genuine resource for quantum metrology.
For a generic set of Markovian noise models, the estimation precision of a parameter associated with the Hamiltonian is limited by the 1 / \sqrt{t} scaling, where t is the total probing time, in which case the maximal possible quantum improvement in the asymptotic limit of large t is restricted to a constant factor. However, situations arise where the constant factor improvement could be significant, yet no effective quantum strategies are known. Here we propose an optimal approximate quantum error correction (AQEC) strategy asymptotically saturating the precision lower bound in the most general adaptive parameter estimation scheme, where arbitrary and frequent quantum controls are allowed. We also provide an efficient numerical algorithm finding the optimal code. Finally, we consider highly biased noise and show that using the optimal AQEC strategy, strong noises are fully corrected, while the estimation precision depends only on the strength of weak noises in the limiting case.
We derive ultimate precision bounds for estimating parameters encoded in \emph{time-dependent} Hamiltonians in the presence of general Markovian noise, allowing for arbitrary adaptive protocols with fast controls and noiseless ancillas. Extending the minimization-over-purifications framework to time-varying continuous channels, we obtain a differential upper bound on the achievable quantum Fisher information (QFI) that can be evaluated at all times via semidefinite programming. For parameter-independent noise, we prove a universal long-time scaling law: if the coherent (noiseless) dynamics yields Qcoh(T)∼T2k, then under Markovian noise the QFI scales at most as Q(T)∼T2k in the DHNLS regime, whereas in the DHLS regime it is fundamentally limited to Q(T)∼T2k−1. We illustrate these behaviors on paradigmatic driven-qubit sensors, exhibiting T4 and T3 scalings under dephasing and spontaneous emission, respectively. Finally, we provide explicit continuous exact and approximate quantum error correction constructions -- supplemented by spin-squeezed probes -- that asymptotically saturate the bounds, establishing their tightness.
This thesis explores various protocols which can be applied to quantum metrology, such that precision of the measurement can beat the best classical approaches. We first demonstrate that ancilla-assisted schemes can improve phase estimation in the presence of noise, and we propose an experiment to demonstrate these effects. Given that the use of ancillae helps, it is no surprise that there are noisy channels for which the optimal strategy may depend on the noise level. We show that there is a non-trivial crossover between the ancilla-assisted strategy and the parallel-entangled strategy for Pauli noise channels and the amplitude damping channel. We see that under certain circumstances, the environment cannot access the parameter of interest. We then integrated techniques from quantum communication, to derive a general framework that renders quantum metrology protocols into cryptographic ones. Here the protocol is unconditionally secure if the trusted parties wish only to achieve the standard quantum limit. If Heisenberg-limited precision is to be achieved, they sacrifice some security, where adversaries can access information, but only at the risk of getting caught at it (cheat-sensitivity). In many scenarios, the quantum Fisher information is achieved for only one value of the phase. In a particular phase estimation scheme that measures the parity at the output of a Mach-Zehnder interferometer where the input is a two-mode squeezed vacuum, this problem is particularly imminent. We apply an adaptive technique to resolve this issue, showing that one can achieve precisions substantially below the shot noise limit. The key to a quadratically enhanced improvement in quantum metrology is entanglement. Finally, we demonstrate in a photonic system how high-dimensional entanglement can be certified, and provide an alternate interpretation of entanglement from an information-theoretic perspective.
We show that quantification of the performance of quantum-enhanced measurement schemes based on the concept of quantum Fisher information (QFI) yields results that are asymptotically equivalent to those from the rigorous Bayesian approach, provided generic uncorrelated noise is present in the setup. At the same time, we show that for the problem of decoherence-free phase estimation this equivalence breaks down, and the achievable estimation uncertainty calculated within the Bayesian approach is larger by a factor of π than that predicted from the QFI even in the large prior knowledge (small parameter fluctuation) regime, where the QFI is conventionally regarded as a reliable figure of merit. We conjecture that an analogous discrepancy is present in the arbitrary decoherence-free unitary parameter estimation scheme, and propose a general formula for the asymptotically achievable precision limit. We also discuss protocols utilizing states with an indefinite number of particles, and show that within the Bayesian approach it is legitimate to replace the number of particles with the mean number of particles in the formulas for the asymptotic precision, which as a consequence provides another argument for proposals based on the properties of the QFI of indefinite particle number states leading to sub-Heisenberg precisions not being practically feasible.