Non-commutativity as a Universal Characterization for Enhanced Quantum Metrology
Ningxin Kong, Haojie Wang, Mingsheng Tian, Yilun Xu, Geng Chen, Yu Xiang, Qiongyi He

TL;DR
This paper introduces the nilpotency index as a fundamental parameter linking non-commutativity to quantum metrology enhancements, revealing new scaling laws and practical protocols for surpassing classical precision limits.
Contribution
It establishes a universal connection between non-commutativity and quantum sensing improvements, providing a new theoretical framework and experimental protocols.
Findings
Finite nilpotency index $\\mathcal{K}$ enhances precision scaling as $N^{-(1+\mathcal{K})}$
Indefinite causal order is required only when nested commutators are constant
Exponential scaling $N^{-1}e^{-N}$ achievable as $\\mathcal{K} \to \infty$
Abstract
A central challenge in quantum metrology is to effectively harness quantum resources to surpass classical precision bounds. Although recent studies suggest that the indefinite causal order may enable sensitivities to attain the super-Heisenberg scaling, the physical origins of such enhancements remain elusive. Here, we introduce the nilpotency index , which quantifies the depth of non-commutativity between operators during the encoding process, can act as a fundamental parameter governing quantum-enhanced sensing. We show that a finite yields an enhanced scaling of root-mean-square error as . Meanwhile, the requirement for indefinite causal order arises only when the nested commutators become constant. Remarkably, in the limit , exponential precision scaling is achievable. We propose experimentally…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Mechanics and Applications · Quantum Computing Algorithms and Architecture
