{"paper":{"title":"Maximal adaptive-decision speedups in quantum-state readout","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.mes-hall"],"primary_cat":"quant-ph","authors_text":"B. D'Anjou, L. Childress, L. Kuret, W. A. Coish","submitted_at":"2015-07-24T14:07:42Z","abstract_excerpt":"The average time $T$ required for high-fidelity readout of quantum states can be significantly reduced via a real-time adaptive decision rule. An adaptive decision rule stops the readout as soon as a desired level of confidence has been achieved, as opposed to setting a fixed readout time $t_f$. The performance of the adaptive decision is characterized by the \"adaptive-decision speedup,\" $t_f/T$. In this work, we reformulate this readout problem in terms of the first-passage time of a particle undergoing stochastic motion. This formalism allows us to theoretically establish the maximum achieva"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06846","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}