MétaCan
Menu
Back to cohort
Record W3104064455

Partially smoothed information measures

2021· article· en· W3104064455 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueUTS ePRESS (University of Technology Sydney) · 2021
Typearticle
Languageen
FieldComputer Science
TopicQuantum Computing Algorithms and Architecture
Canadian institutionsPerimeter InstituteUniversity of Waterloo
FundersAustralian Research CouncilScience and Engineering Research BoardNational Research Foundation Singapore
KeywordsSmoothingInformation theoryQuantum informationComputer scienceMathematicsQuantumCryptographyTheoretical computer scienceQuantum cryptographyStatistical physicsAlgorithmQuantum mechanicsStatisticsPhysics
DOInot available

Abstract

fetched live from OpenAlex

Smooth entropies are a tool for quantifying resource trade-offs in (quantum)
\ninformation theory and cryptography. In typical bi- and multi-partite problems,
\nhowever, some of the sub-systems are often left unchanged and this is not
\nreflected by the standard smoothing of information measures over a ball of
\nclose states. We propose to smooth instead only over a ball of close states
\nwhich also have some of the reduced states on the relevant sub-systems fixed.
\nThis partial smoothing of information measures naturally allows to give more
\nrefined characterizations of various information-theoretic problems in the
\none-shot setting. In particular, we immediately get asymptotic second-order
\ncharacterizations for tasks such as privacy amplification against classical
\nside information or classical state splitting. For quantum problems like state
\nmerging the general resource trade-off is tightly characterized by partially
\nsmoothed information measures as well. However, for quantum systems we can so
\nfar only give the asymptotic first-order expansion of these quantities.

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.

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.000
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: Empirical · Consensus signal: none
Teacher disagreement score0.823
Threshold uncertainty score0.440

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.001
Research integrity0.0000.000
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.007
GPT teacher head0.181
Teacher spread0.175 · 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