Variational Anonymous Quantum Sensing
Bibliographic record
Abstract
QSNs (QSNs) incorporate quantum sensing and quantum communication to achieve Heisenberg precision and unconditional security by leveraging quantum properties such as superposition and entanglement. However, the QSNs deploying noisy intermediate-scale quantum (NISQ) devices face near-term practical challenges. In this paper, we employ variational quantum sensing (VQS) to optimize sensing configurations in noisy environments for the physical quantity of interest, e.g., magnetic-field sensing for navigation, localization, or detection. The VQS algorithm is variationally and evolutionarily optimized using a genetic algorithm for tailoring a variational or parameterized quantum circuit (PQC) structure that effectively mitigates quantum noise effects. This genetic VQS algorithm designs the PQC structure possessing the capability to create a variational probe state that metrologically outperforms the maximally entangled or product quantum state under bit-flip, dephasing, and amplitude-damping quantum noise for both single-parameter and multiparameter NISQ sensing, specifically as quantified by the quantum Fisher information. Furthermore, the quantum anonymous broadcast (QAB) shares the sensing information in the VQS network, ensuring anonymity and untraceability of sensing data. The broadcast bit error probability (BEP) is further analyzed for the QAB protocol under quantum noise, showing its robustness—i.e., error-free resilience—against bit-flip noise as well as the low-noise BEP behavior. This work provides a scalable framework for integrated quantum anonymous sensing and communication, particularly in a variational and untraceable manner.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".