REVIEW 3 cited by
Quantum Fisher Information: Variational principle and simple iterative algorithm for its efficient computation
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Quantum Fisher Information: Variational principle and simple iterative algorithm for its efficient computation
read the original abstract
We derive a new variational principle for the quantum Fisher information leading to a simple iterative alternating algorithm, the convergence of which is proved. The case of a fixed measurement, i.e. the classical Fisher information, is also discussed.
Forward citations
Cited by 3 Pith papers
-
Optimized Quantum States for Sensing in the Presence of Loss and Phase Noise
Numerical optimization identifies non-Gaussian quantum states that outperform Gaussian states for sensing under loss and phase noise, with up to 2.2 dB advantage persisting under homodyne detection.
-
Optimized Quantum States for Sensing in the Presence of Loss and Phase Noise
Numerical optimization identifies three classes of non-Gaussian states that outperform any Gaussian state by up to 2.2 dB under 5% loss and 200 mrad phase noise at mean photon number 5, with advantage persisting under...
-
Iterative optimization in quantum metrology and entanglement theory using semidefinite programming
An iterative semidefinite programming method maximizes quantum Fisher information over local Hamiltonians to optimize metrological performance of quantum states and solves related entanglement problems.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.