MétaCan
Menu
Back to cohort

Improved decoy-state and flag-state squashing methods

2024· article· en· W4404920231 on OpenAlexafffund
Lars Kamin, Norbert Lütkenhaus

Bibliographic record

VenuePhysical Review Research · 2024
Typearticle
Languageen
FieldComputer Science
TopicQuantum Information and Cryptography
Canadian institutionsUniversity of Waterloo
FundersNatural Sciences and Engineering Research Council of CanadaUniversity of WaterlooInnovation, Science and Economic Development Canada
KeywordsFlag (linear algebra)DecoyState (computer science)Computer securityComputer scienceMathematicsMedicineAlgorithmInternal medicine

Abstract

fetched live from OpenAlex

In this work we present an improved analysis for decoy-state methods, enhancing both achievable key rates and recovering analytical results for the single intensity scenario. Our primary focus is improving the shortcomings observed in current decoy-state methods, in particular recovering results when employing no decoy intensities. Our methods enable the continuous interpolation across varying numbers of intensity settings. Additionally, we extend decoy-state techniques to encompass scenarios where intensities vary depending on the signal state, thereby relaxing the constraints on experimental implementations. Our findings demonstrate that a minimum of one decoy intensity is sufficient for high asymptotic secret key rates, thereby further softening experimental requirements. We also address inherent imperfections within detection setups like imperfect beamsplitters. We derive provable secure lower bounds on the subspace population estimation, which is required for certain squashing methods such as the flag-state squasher. These analytical bounds allow us to encompass arbitrary passive linear optical setups and, together with intensities varying with each signal state, let us include a broad class of experimental setups. Published by the American Physical Society 2024

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 distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.004
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.899
Threshold uncertainty score0.679

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0040.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.002
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0010.000
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.080
GPT teacher head0.495
Teacher spread0.415 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designOther design
Domainnot available
GenreMethods

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".

Quick stats

Citations8
Published2024
Admission routes2
Has abstractyes

Explore more

Same venuePhysical Review ResearchSame topicQuantum Information and CryptographyFrench-language works237,207