pith. machine review for the scientific record. sign in

arxiv: quant-ph/0510094 · v1 · submitted 2005-10-13 · 🪐 quant-ph

Recognition: unknown

From Bell's Theorem to Secure Quantum Key Distribution

Authors on Pith no claims yet
classification 🪐 quant-ph
keywords quantumbellcorrelationdatadistributionmeasurementsprotocolsome
0
0 comments X
read the original abstract

Any Quantum Key Distribution (QKD) protocol consists first of sequences of measurements that produce some correlation between classical data. We show that these correlation data must violate some Bell inequality in order to contain distillable secrecy, if not they could be produced by quantum measurements performed on a separable state of larger dimension. We introduce a new QKD protocol and prove its security against any individual attack by an adversary only limited by the no-signaling condition.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Lower overhead fault-tolerant building blocks for noisy quantum computers

    quant-ph 2026-05 unverdicted novelty 5.0

    New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.