MétaCan
Menu
Back to cohort

Entanglement-Enhanced Classical Communication Over a Noisy Classical Channel

2011· article· en· W2963550666 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

VenuePhysical Review Letters · 2011
Typearticle
Languageen
FieldComputer Science
TopicQuantum Information and Cryptography
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsCommunication sourceQuantum entanglementDecoding methodsChannel (broadcasting)Computer scienceAmplitude damping channelQuantum channelPhotonTopology (electrical circuits)Encoding (memory)PhysicsQuantumProbability of errorPhoton entanglementBit (key)Quantum mechanicsAlgorithmComputer networkQuantum networkMathematicsCombinatorics

Abstract

fetched live from OpenAlex

We present and experimentally demonstrate a communication protocol that employs shared entanglement to reduce errors when sending a bit over a particular noisy classical channel. Specifically, it is shown that given a single use of this channel, one can transmit a bit with higher success probability when the sender and receiver share entanglement compared to the best possible strategy when they do not. The experiment is realized using polarization-entangled photon pairs, whose quantum correlations play a critical role in both the encoding and decoding of the classical message. Experimentally, we find that a bit can be successfully transmitted with probability 0.891±0.002, which is close to the theoretical maximum of (2+2(-1/2))/3≈0.902 and is significantly above the optimal classical strategy, which yields 5/6≈0.833.

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: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.819
Threshold uncertainty score0.709

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.001
Open science0.0010.000
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.031
GPT teacher head0.281
Teacher spread0.250 · 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