arXiv (All)
open access
Simple QKD keyrate computations from tangent-line bounds
Recent work in quantum key distribution (QKD) has yielded finite-size keyrates based on convex optimisation problems, using the framework of entropy accumulation. Multiple solvers have been developed to address these optimisations in recent years, but have been based on a somewhat elaborate framewor
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Entropy Estimation in Multi-Qutrit Systems via Variational and Classical Neural Networks#290567
- A Game Theoretic Approach for Optimizing Quantum Error Budget Distribution#31341
- Solving Multiple Discretization Portfolio Optimization Problem with Quantum-Classical Hybrid Algorithms#299215
- QuantumQUBO Agent: Automating Quadratic Unconstrained Binary Optimization (QUBO) Formulation Generation from Natural Language#999905
- Solving Graph Coloring Problems Using Feedback-Based Algorithm for Quantum Optimization#1105550
Record · ID 996664
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive