MétaCan
Menu
Back to cohort
Record W2020582875 · doi:10.1007/s00220-014-1990-4

One-Shot Decoupling

2014· article· en· W2020582875 on OpenAlexafffund
Frédéric Dupuis, Mario Berta, Jürg Wullschleger, Renato Renner

Bibliographic record

VenueCommunications in Mathematical Physics · 2014
Typearticle
Languageen
FieldComputer Science
TopicQuantum Computing Algorithms and Architecture
Canadian institutionsUniversité de MontréalMcGill University
FundersEngineering and Physical Sciences Research CouncilCHIST-ERANatural Sciences and Engineering Research Council of CanadaUniversity of BristolSchweizerischer Nationalfonds zur Förderung der Wissenschaftlichen ForschungAgence Nationale de la RechercheNational Science Foundation
KeywordsDecoupling (probability)Quantum entanglementCorrelationQuantumMathematicsStatistical physicsComputer scienceQuantum discordTotal correlationApplied mathematicsPhysicsQuantum mechanicsGeometry

Abstract

fetched live from OpenAlex

If a quantum system A , which is initially correlated to another system, E , undergoes an evolution separated from E , then the correlation to E generally decreases. Here, we study the conditions under which the correlation disappears (almost) completely, resulting in a decoupling of A from E . We give a criterion for decoupling in terms of two smooth entropies, one quantifying the amount of initial correlation between A and E , and the other characterizing the mapping that describes the evolution of A . The criterion applies to arbitrary such mappings in the general one-shot setting. Furthermore, the criterion is tight for mappings that satisfy certain natural conditions. One-shot decoupling has a number of applications both in physics and information theory, e.g., as a building block for quantum information processing protocols. As an example, we give a one-shot state merging protocol and show that it is essentially optimal in terms of its entanglement consumption/production.

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 imitation

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

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.006
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.005
Threshold uncertainty score0.016

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.006
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0000.000
Science and technology studies0.0010.003
Scholarly communication0.0010.004
Open science0.0010.003
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0050.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.081
GPT teacher head0.329
Teacher spread0.248 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

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

Citations142
Published2014
Admission routes2
Has abstractyes

Explore more

Same venueCommunications in Mathematical PhysicsSame topicQuantum Computing Algorithms and ArchitectureFrench-language works237,207