{"id":"W2962961223","doi":"10.1103/physrevlett.107.233601","title":"Efficient Algorithm for Optimizing Adaptive Quantum Metrology Processes","year":2011,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"Alberta Innovates - Technology Futures; Natural Sciences and Engineering Research Council of Canada; Humboldt-Universität zu Berlin; Canadian Institute for Advanced Research","keywords":"Metrology; Computer science; Quantum decoherence; Quantum metrology; Algorithm; Quantum; Limit (mathematics); Quantum limit; SQL; Computer engineering; Quantum computer; Physics; Mathematics; Quantum mechanics; Quantum network","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002480279,0.0001584582,0.0003062846,0.00007667769,0.0001067963,0.00002915649,0.0005708548,0.000009584488,0.000007337487],"category_scores_gemma":[0.00005276889,0.0001238979,0.0002007155,0.0005651525,0.00006468896,0.0002129799,0.00008193484,0.0001163789,0.00006805587],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001524332,"about_ca_system_score_gemma":0.00002991665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004217164,"about_ca_topic_score_gemma":1.349499e-7,"domain_scores_codex":[0.9989282,0.00005293605,0.0002515929,0.0002665708,0.00019524,0.000305387],"domain_scores_gemma":[0.9992139,0.0001264589,0.0001570429,0.0002920709,0.000119728,0.00009080257],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003566398,0.001416411,0.000014907,0.003794116,0.0002921237,0.00001535709,0.006309575,0.001014085,0.0007949209,0.5821279,0.01433236,0.3898526],"study_design_scores_gemma":[0.0003044552,0.0002388404,0.00005007085,0.0003331035,0.00004933981,0.000006475086,0.00002746301,0.9897839,0.0005618178,0.002082808,0.00625329,0.0003084014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002664124,0.002011872,0.9930932,0.001245065,0.0001160469,0.0004480525,0.000003806774,0.0001237072,0.0002941555],"genre_scores_gemma":[0.2847809,0.001167014,0.6499558,0.06322155,0.0001768769,0.0006609287,0.000008265663,0.00002640573,0.000002221953],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9887698,"threshold_uncertainty_score":0.505241,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03645070856777657,"score_gpt":0.2776241565238244,"score_spread":0.2411734479560478,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}