Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Theoretical Computer Science

Non-contextual chocolate balls versus value indefinite quantum cryptography

Karl Svozil

Published Sep 22, 2014• 10 citations
Publisher
DOI
10.1016/j.tcs.2014.09.019

Related papers

Cryptography with quanta and chocolate balls

Karl Svozil

•Mar 2, 2009•0 citations

Bertlmann's chocolate balls and quantum type cryptography

Karl Svozil

Some quantum cryptographic protocols can be implemented with specially prepared chocolate balls, others protected by value indefiniteness cannot. Similarities and differences of cryptography with quanta and chocolate are discussed. Motivated by these considerations it is proposed to certify quantum random number generators and quantum cryptographic protocols by value indefiniteness. This feature, which derives itself from Bell- and Kochen-Specker type arguments, is only present in systems with three or more mutually exclusive outcomes.

arXiv:0903.0231•Mar 2, 2009•14 citations

Staging quantum cryptography with chocolate balls

Karl Svozil

Moderated by a director, laypeople and students assume the role of quanta and enact a quantum cryptographic protocol. The performance is based on a generalized urn model capable of reproducing complementarity even for classical chocolate balls.

arXiv:physics/0510050•American Journal of Physics•Aug 30, 2006•36 citations

Quantum Candies and Quantum Cryptography

Junan Lin, Tal Mor

arXiv:2011.02837•Lecture notes in computer science•Jan 1, 2020•4 citations

Quantum Cryptography and Meta-Complexity

Taiga Hiroka, Tomoyuki Morimae

arXiv:2410.01369•Lecture notes in computer science•Jan 1, 2025•12 citations

Haunted Quantum Contextuality versus Value Indefiniteness

Karl Svozil

arXiv:1107.4359•Lecture notes in computer science•Jan 1, 2012•0 citations
Some quantum cryptographic protocols can be implemented with specially prepared chocolate balls, others protected by value indefiniteness cannot. Similarities and differences of cryptography with quanta and chocolate are discussed. Motivated by these considerations it is proposed to certify quantum random number generators and quantum cryptographic protocols by value indefiniteness. This feature, which derives itself from Bell- and Kochen-Specker type arguments, is only present in systems with three or more mutually exclusive outcomes.