Multidimensional Bell inequalities and quantum cryptography

DOI10.1007/978-3-319-18681-8_1MaRDI QIDQ2947060zbMATH OpenOpenAlexFDO

Authors François Arnault

Publication date 21 September 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-18681-8_1

zbMATH Keywords

Bell inequalitieskey distribution schemesquantum cryptographyrandom numbers

Mathematics Subject Classification ID

Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Recommendations

• Bell inequalities: what do we know about them and why should cryptographers care? (Invited talk)
• Quantum cryptography based on Bell’s theorem
• From Bell's theorem to secure quantum key distribution
• Quantum cryptography without Bell’s theorem
• BELL'S INEQUALITIES DETECT EFFICIENT ENTANGLEMENT

Cites work

• A complete set of multidimensional Bell inequalities
• Bell inequalities for arbitrarily high-dimensional systems
• Bell's theorem for general N-qubit states
• Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
• Proposed experiment to test local hidden-variable theories
• Quantum cryptography based on Bell’s theorem
• Quantum cryptography: public key distribution and coin tossing
• WRINGING OUT NEW BELL INEQUALITIES FOR THREE-DIMENSIONAL SYSTEMS (QUTRITS)

Cited in

(6)

• Turing, ciphers and quanta
• Bell inequalities: what do we know about them and why should cryptographers care? (Invited talk)
• Quantum cryptography based on Bell’s theorem
• Key distribution and the CHSH game
• BELL'S INEQUALITIES DETECT EFFICIENT ENTANGLEMENT
• Non-contextual chocolate balls versus value indefinite quantum cryptography

This page was built for publication: Multidimensional Bell inequalities and quantum cryptography

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