6
collaborators
2024–2026
years active
Contributions
QIP QCrypt TQC talk poster presenter award · △program ◇steering ○organizing · filled = chair
3 Posters
| Title | Conference | Co-authors |
|---|---|---|
|
Finite-size quantum key distribution rates from Rényi entropies using conic optimization ↗
|
QCRYPT 2026 | Mariana Navarro, Andrés González Lorente, Carlos Pascual-Garcia, Mateus Araújo |
Finite-size general security proofs for quantum key distribution based on Rényi entropies have recently been introduced. These approaches are more flexible and provide tighter bounds on the secret key rate than traditional formulations based on the von Neumann entropy. However, deploying them requires minimizing the conditional Rényi entropy, a difficult optimization problem that has hitherto been tackled using ad-hoc techniques based on the Frank-Wolfe algorithm, which are unstable and can only handle particular cases. In this work, we introduce a method based on non-symmetric conic optimization for solving this problem. Our technique is fast, reliable, and completely general. We illustrate its performance on several protocols, whose results represent an improvement over the state of the art. |
||
| Finite-size QKD rates from Rényi entropies using conic optimization | TQC 2026 | Mariana Navarro, Andrés González Lorente, Carlos Pascual García, Mateus Araújo |
Finite-size general security proofs for QKD based on Rényi entropies offer more flexible and provide tighter bounds on the secret key rate than traditional formulations based on the von Neumann entropy. However, deploying them requires minimizing the conditional Rényi entropy, a difficult optimization problem that has commonly been tackled using ad-hoc techniques based on the Frank-Wolfe algorithm, which are unstable and can only handle particular cases. In this work, we introduce a method based on non-symmetric conic optimization for solving this problem. Our technique is fast, reliable, and completely general. We illustrate its performance on several protocols, whose results represent an improvement over the state of the art. |
||
| Quantum key distribution rates from non-symmetric conic optimization | QCRYPT 2024 | Andrés González Lorente, Miguel Castillo-Celeita, Mateus Araújo |
Computing key rates in QKD numerically is essential to unlock more powerful protocols, that uses more sophisticated measurement bases or quantum systems of higher dimension. It is a difficult optimization problem, that depends on minimizing a convex non-linear function, the relative entropy. The gold standard for solving such problems is a primal-dual interior-point algorithm, that is highly efficient and inherently gives upper and lower bounds. Recently one such algorithm was discovered for non-symmetric cones, a category that includes the relative entropy, and was previously out of reach. |
||
Collaborators
| Co-author | Joint talks |
|---|---|
| Andrés González Lorente | 3 |
| Mateus Araújo | 3 |
| Mariana Navarro | 2 |
| Carlos Pascual García | 1 |
| Carlos Pascual-Garcia | 1 |
| Miguel Castillo-Celeita | 1 |