SearcharxivSearch

arXiv · 2304.14370

Heisenberg Limit beyond Quantum Fisher Information

Abstract

The Heisenberg limit provides a fundamental bound on the achievable estimation precision with a limited number of $N$ resources used (e.g., atoms, photons, etc.). Using entangled quantum states makes it possible to scale the precision with $N$ better than when resources would be used independently. Consequently, the optimal use of all resources involves accumulating them in a single execution of the experiment. Unfortunately, that implies that the most common theoretical tool used to analyze metrological protocols - quantum Fisher information (QFI) - does not allow for a reliable description of this problem, as it becomes operationally meaningful only with multiple repetitions of the experiment. In this thesis, using the formalism of Bayesian estimation and the minimax estimator, I derive asymptotically saturable bounds on the precision of the estimation for the case of noiseless unitary evolution. For the case where the number of resources $N$ is strictly constrained, I show that the final measurement uncertainty is $\pi$ times larger than would be implied by a naive use of QFI. I also analyze the case where a constraint is imposed only on the average amount of resources, the exact value of which may fluctuate (in which case QFI does not provide any universal bound for precision). In both cases, I study the asymptotic saturability and the rate of convergence of these bounds. In the following part, I analyze the problem of the Heisenberg limit when multiple parameters are measured simultaneously on the same physical system. In particular, I investigate the existence of a gain from measuring all parameters simultaneously compared to distributing the same amount of resources to measure them independently. I focus on two examples - the measurement of multiple phase shifts in a multi-arm interferometer and the measurement of three magnetic field components.

Explore related subjects

Keep this discovery

BibTeXRIS

Wojciech Górecki. 2023-04-27. Heisenberg Limit beyond Quantum Fisher Information. https://arxiv.org/abs/2304.14370

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph