Generalized Limits for Single-Parameter Quantum Estimation
Open accessAbstract
We develop generalized bounds for quantum single-parameter estimation problems for which the coupling to the parameter is described by intrinsic multisystem interactions. For a Hamiltonian with k-system parameter-sensitive terms, the quantum limit scales as 1/Nk, where N is the number of systems. These quantum limits remain valid when the Hamiltonian is augmented by any parameter-independent interaction among the systems and when adaptive measurements via parameter-independent coupling to ancillas are allowed.
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Exceptions to the limitation of m include the Dicke model, the Lipkin-Meshkov-Glick model, and the Mølmer-Sørensen interaction.
“Exceptions to this include the Dicke model [40] where collective coherence leads to superradiance, the Lipkin-Meshkov-Glick model [41], where all particles interact with each other, and the Mølmer-Sørensen interaction [42], in which an ensemble of ions are effectively coupled by a spatially uniform electromagnetic field.”
From Enhancing the Charging Power of Quantum Batteries (2017) · cites this paper as [40]
For N-qubit dephasing, the bound on minimum evolution time is given by Eq. (18).
“where α ( t ), β ( t ), and δ ( t ) are optimization variables. We get then [47]”
From Quantum Speed Limit for Physical Processes (2013) · cites this paper as [47]
Eq. (14) captures the fact that the evolved and initial states never become orthogonal for r under a critical value rcrit ≃ 2.6.
“Another feature of (14) is that it captures the fact that the evolved and initial states never become orthogonal for r under a critical value r crit ≃ 2 . 6 [47].”
From Quantum Speed Limit for Physical Processes (2013) · cites this paper as [47]
For Markovian dephasing, the minimum of CQ(t) over all Hermitian 2x2 operators hE(t), written in terms of the constant variance of Z, is given by Eq. (13).
“In order to find the best possible bound on τ within our approach, we now minimize C Q ( t ) over the whole set of Hermitian 2 × 2 operators ˆ h E ( t ). The minimum, written in terms of the (constant) variance of ˆ Z , is [47]”
From Quantum Speed Limit for Physical Processes (2013) · cites this paper as [47]
This transition to faster behavior can be corroborated via direct calculations on symmetric, separable states.
“This transition to faster behavior can be corroborated via direct calculations on symmetric, separable states [47].”
From Quantum Speed Limit for Physical Processes (2013) · cites this paper as [47]
For q=1, the bound on the minimum evolution time scales as τ ∼ 1/N throughout, a prediction validated by exact calculations with GHZ states.
“For q = 1, the bound on the minimum evolution time scales as τ ∼ 1 /N throughout, a prediction validated by exact calculations with GHZ states, see Supplemental Material [47].”
From Quantum Speed Limit for Physical Processes (2013) · cites this paper as [47]
The operator K_a := i(∂aU)U† = -iU∂aU† is an alternative operator to characterize the precision limit of unitary process.
“An alternative operator that can be used to characterize the precision limit of unitary process is [50,53,54]”
From Quantum Fisher information matrix and multiparameter estimation (2020) · cites this paper as [50]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
The citation lists haven’t been fetched yet
References 16 · Cited by 403
- Authors
- Boixo, S., Flammia, S. T., Caves, C. M., & Geremia, J.
- Affiliations
- University of New Mexico (US)
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2007-02-28
- Volume
- 98
- Issue
- 9
- Pages
- 090401-090401
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2160139326
- Cited by
- 403
- References
- 16
- Citations by year
- 2026: 25 · 2025: 43 · 2024: 29 · 2023: 22 · 2022: 23 · 2021: 28 · 2020: 26 · 2019: 18 · 2018: 17 · 2017: 22 · 2016: 17 · 2015: 12 · 2014: 27 · 2013: 13 · 2012: 19
- FWCI
- 19.33
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Physical Review Letters (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- arXiv (Cornell University)
- Bulletin of the American Physical Society
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- quantum parameter estimation, quantum Fisher information, adaptive measurement
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review