Article ID Journal Published Year Pages File Type
10333893 Theoretical Computer Science 2014 9 Pages PDF
Abstract
Some quantum cryptographic protocols can be implemented with specially prepared metaphorical chocolate balls representing local hidden variables, others protected by value indefiniteness cannot. This latter feature, which follows from Bell- and Kochen-Specker type arguments, is only present in systems with three or more mutually exclusive outcomes. Conversely, there exist local hidden variable models based on chocolate ball configurations utilizable for cryptography which cannot be realized by quantum systems. The possibility that quantum cryptography supported by value indefiniteness (contextuality) has practical advantages over more conventional quantum cryptographic protocols remains highly speculative.
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
,