Pith. sign in

REVIEW 1 cited by

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

arxiv 2104.09540 v2 pith:M3YHEE7O submitted 2021-04-19 quant-ph

Protocols for estimating multiple functions with quantum sensor networks: geometry and performance

classification quant-ph
keywords protocolfunctionssensorsequentialperformancequantumestimatinglocal
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We consider the problem of estimating multiple analytic functions of a set of local parameters via qubit sensors in a quantum sensor network. To address this problem, we highlight a generalization of the sensor symmetric performance bounds of Rubio et. al. [J. Phys. A: Math. Theor. 53 344001 (2020)] and develop a new optimized sequential protocol for measuring such functions. We compare the performance of both approaches to one another and to local protocols that do not utilize quantum entanglement, emphasizing the geometric significance of the coefficient vectors of the measured functions in determining the best choice of measurement protocol. We show that, in many cases, especially for a large number of sensors, the optimized sequential protocol results in more accurate measurements than the other strategies. In addition, in contrast to the the sensor symmetric approach, the sequential protocol is known to always be explicitly implementable. The sequential protocol is very general and has a wide range of metrological applications.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Aligning Implied Statements for Implicit Hate Speech Generalizability with Context-Bounded Semi-hard Negative Mining

    cs.CL 2026-06 unverdicted novelty 5.0

    ImpSH improves cross-domain generalization in implicit hate speech classification by aligning posts with implied statements and applying context-bounded semi-hard negative mining within a triplet learning setup.