Pith. sign in

REVIEW

Provably Secure Experimental Quantum Bit-String Generation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv quant-ph/0408121 v2 pith:MDVBX47R submitted 2004-08-19 quant-ph

Provably Secure Experimental Quantum Bit-String Generation

classification quant-ph
keywords communicationquantumcoingenerationclassicalexperimentalpartiesprovably
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Coin tossing is a cryptographic task in which two parties who do not trust each other aim to generate a common random bit. Using classical communication this is impossible, but non trivial coin tossing is possible using quantum communication. Here we consider the case when the parties do not want to toss a single coin, but many. This is called bit string generation. We report the experimental generation of strings of coins which are provably more random than achievable using classical communication. The experiment is based on the ``plug and play'' scheme developed for quantum cryptography, and therefore well suited for long distance quantum communication.

discussion (0)

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