MétaCan
Menu
← Back to cohort
Record W4390489652 · doi:10.48550/arxiv.2312.17450

Information Fragility or Robustness Under Quantum Channels

2023· preprint· en· W4390489652 on OpenAlexfundno aff
Nicholas LaRacuente, Graeme Smith

Bibliographic record

VenuearXiv (Cornell University) · 2023
Typepreprint
Languageen
FieldComputer Science
TopicQuantum Information and Cryptography
Canadian institutionsnot available
FundersIndiana University BloomingtonCanada First Research Excellence FundNational Science Foundation
KeywordsConverseMultiplicative functionUpper and lower boundsStatistical physicsQubitRobustness (evolution)DephasingMultiplicative noiseQuantumNoise (video)MathematicsPhysicsComputer scienceQuantum mechanicsMathematical analysisTelecommunicationsArtificial intelligence

Abstract

fetched live from OpenAlex

Quantum states naturally decay under noise. Many earlier works have quantified and demonstrated lower bounds on the decay rate, showing exponential decay in a wide variety of contexts. Here we study the converse question: are there uniform upper bounds on the ratio of post-noise to initial information quantities when noise is sufficiently weak? In several scenarios, including classical, we find multiplicative converse bounds. However, this is not always the case. Even for simple noise such as qubit dephasing or depolarizing, mutual information may fall by an unbounded factor under arbitrarily weak noise. As an application, we find families of channels with non-zero private capacity despite arbitrarily high probability of transmitting an arbitrarily good copy of the input to the environment.

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.006
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.006
Threshold uncertainty score0.034

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0060.055
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.002
Science and technology studies0.0020.009
Scholarly communication0.0040.011
Open science0.0020.004
Research integrity0.0030.005
Insufficient payload (model declined to judge)0.0040.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.106
GPT teacher head0.206
Teacher spread0.100 · 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

Citations0
Published2023
Admission routes1
Has abstractyes

Explore more

Same venuearXiv (Cornell University)→Same topicQuantum Information and Cryptography→French-language works237,207→