Non-contextual chocolate balls versus value indefinite quantum cryptography

DOI10.1016/J.TCS.2014.09.019zbMATH Open1306.81035OpenAlexW1975957432WikidataQ58620587 ScholiaQ58620587MaRDI QIDQ477174FDOQ477174

Karl Svozil

Publication date: 2 December 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.09.019

Recommendations

• A less known side of quantum cryptography
• Multidimensional Bell inequalities and quantum cryptography
• Turing, ciphers and quanta
• Quantum cryptography -- the issue of security in selected quantum protocols and the issue of data credibility
• Device-Independent Quantum Information Processing

zbMATH Keywords

entanglementquantum informationquantum cryptographycontextualityquantum non-localitysinglet statesvalue indefiniteness

Mathematics Subject Classification ID

Cryptography (94A60) Contextuality in quantum theory (81P13) Quantum coherence, entanglement, quantum correlations (81P40) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites Work

• Quantum cryptography based on Bell’s theorem
• Title not available (Why is that?)
• Proposed Experiment to Test Local Hidden-Variable Theories
• Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
• Title not available (Why is that?)
• Experimental quantum cryptography.
• Title not available (Why is that?)
• Quantum cryptography without Bell’s theorem
• Quantum Cryptography with 3-State Systems
• Quantum cryptography
• On the Problem of Hidden Variables in Quantum Mechanics
• Title not available (Why is that?)
• Orthomodular structures as quantum logics. Transl. from the Slovak
• Orthomodular lattices admitting no states
• The Pasting Constructions for Orthomodular Posets
• Title not available (Why is that?)
• Quantum Computer Science
• Finite Precision Measurement Nullifies the Kochen-Specker Theorem
• Bad and Good Ways of Post-processing Biased Physical Random Numbers
• Bell-Kochen-Specker theorem: a proof with \(18\) vectors.
• Title not available (Why is that?)
• Logical equivalence between generalized urn models and finite automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• How much contextuality?
• Title not available (Why is that?)
• Title not available (Why is that?)
• Infinite and finite Gleason’s theorems and the logic of indeterminacy
• Generalizations of Kochen and Specker's theorem and the effectiveness of Gleason's theorem
• Iterating von Neumann's procedure for extracting random bits
• Zweiwertige Wahrscheinlichkeitsfunktionen auf orthokomplementären Verbänden
• Boolean embeddings of orthomodular sets and quantum logic
• Contexts in quantum, classical and partition logic
• Post-Processing Functions for a Biased Physical Random Number Generator
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Efficient Construction of an Unbiased Random Sequence
• Noncontextuality in multipartite entanglement
• Title not available (Why is that?)

Cited In (1)

• Faithful orthogonal representations of graphs from partition logics

This page was built for publication: Non-contextual chocolate balls versus value indefinite quantum cryptography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477174)