MétaCan
Menu
Back to cohort
Record W2963453098 · doi:10.26421/qic16.9-10-7

Optimal bounds on functions of quantum states under quantum channels

2016· article· en· W2963453098 on OpenAlexfundno aff
Chi-Kwong Li, Diane Christine Pelejo, Kuo-Zhong Wang

Bibliographic record

VenueQuantum Information and Computation · 2016
Typearticle
Languageen
FieldComputer Science
TopicComplexity and Algorithms in Graphs
Canadian institutionsnot available
FundersUniversity of WaterlooNational Natural Science Foundation of ChinaNational Science Foundation
KeywordsMathematicsUnitary stateQuantum channelQuantum capacityQuantumQuantum relative entropyQuantum operationAmplitude damping channelQuantum stateQuantum discordQuantum informationQuantum mechanicsPhysicsQuantum networkQuantum entanglementQuantum dynamics

Abstract

fetched live from OpenAlex

Let ρ1, ρ2 be quantum states and (ρ1, ρ2) 7→ D(ρ1, ρ2) be a scalar function such as the trace distance, the fidelity, and the relative entropy, etc. We determine optimal bounds for D(ρ1, Φ(ρ2)) for Φ blongs to S for different class of functions D(·, ·), where S is the set of unitary quantum channels, the set of mixed unitary channels, the set of unital quantum channels, and the set of all quantum channels.

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.009
metaresearch head score (Gemma)0.055
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.009
Threshold uncertainty score0.056

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0090.055
Meta-epidemiology (narrow)0.0030.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0030.002
Science and technology studies0.0020.006
Scholarly communication0.0060.013
Open science0.0030.007
Research integrity0.0030.004
Insufficient payload (model declined to judge)0.0060.001

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.024
GPT teacher head0.259
Teacher spread0.235 · 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

Citations2
Published2016
Admission routes1
Has abstractyes

Explore more

Same venueQuantum Information and ComputationSame topicComplexity and Algorithms in GraphsFrench-language works237,207