REVIEW 2 cited by
Quantum Advantage in Distributed Sensing with Noisy Quantum Networks
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
read the original abstract
We show that quantum advantage in distributed sensing can be achieved with noisy quantum networks which only distribute noisy entangled states. We derive a closed-form expression of the quantum Fisher information (QFI) for estimating the average of local parameters using GHZ-diagonal probe states, a representative distributed sensing scenario. From the QFI we obtain the necessary condition to achieve quantum advantage over the optimal local sensing strategy, which can also serve as an optimization-free entanglement detection criterion for multipartite states. We further explore the impacts from imperfect local entanglement generation and local measurement constraint, and our results imply that the quantum advantage is more robust against quantum network imperfections than local operation errors. Notably, these implications still hold when we explicitly consider dephasing during the sensing dynamics. Our results significantly advance the understanding of the achievability of quantum advantage in noisy distributed sensing. They also offer practical guidance for real-world implementation of quantum sensor networks.
Forward citations
Cited by 2 Pith papers
-
Enhancing Noisy Quantum Sensing by GHZ State Partitioning
Splitting a noisy GHZ sensor array into smaller independent GHZ sub-ensembles, with optimal sub-ensemble size set by the inverse error rate, maximizes the quantum Fisher information.
-
Design and Simulation of the Adaptive Continuous Entanglement Generation Protocol
A continuous, adaptively guided entanglement generation protocol with purification reduces request time-to-serve by 57 to 94 percent and boosts fidelity by 0.01 to 0.05 in quantum network simulations.
Discussion (0). Continue with ORCID to comment.