A general conic optimization solver computes finite-size QKD rates from Rényi entropies more reliably than prior Frank-Wolfe methods.
Security of quantum key distribution using d-level systems
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
abstract
We consider two quantum cryptographic schemes relying on encoding the key into qudits, i.e. quantum states in a d-dimensional Hilbert space. The first cryptosystem uses two mutually unbiased bases (thereby extending the BB84 scheme), while the second exploits all the d+1 available such bases (extending the six-state protocol for qubits). We derive the information gained by a potential eavesdropper applying a cloning-based individual attack, along with an upper bound on the error rate that ensures unconditional security against coherent attacks.
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Reviews paradigmatic entanglement quantifiers and state-of-the-art detection/certification methods, with emphasis on assumptions about states and measurements.
citing papers explorer
-
Finite-size quantum key distribution rates from R\'enyi entropies using conic optimization
A general conic optimization solver computes finite-size QKD rates from Rényi entropies more reliably than prior Frank-Wolfe methods.
-
Entanglement Certification $-$ From Theory to Experiment
Reviews paradigmatic entanglement quantifiers and state-of-the-art detection/certification methods, with emphasis on assumptions about states and measurements.