REVIEW 26 cited by
Security of Quantum Key Distribution
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
We propose various new techniques in quantum information theory, including a de Finetti style representation theorem for finite symmetric quantum states. As an application, we give a proof for the security of quantum key distribution which applies to arbitrary protocols.
Forward citations
Cited by 26 Pith papers
-
Error Exponents for Quantum Packing Problems via An Operator Layer Cake Theorem
The authors prove the Burnashev-Holevo conjecture by deriving a finite-blocklength random coding bound with a dimension-independent prefactor for classical-quantum channels, using a new operator layer cake theorem.
-
Universal chain rules from entropic triangle inequalities
A universal chain rule for the smooth min-entropy and an unstructured approximate entropy accumulation theorem are proven.
-
Flood of multipartite Rains entanglement
New multipartite Rains-type entanglement measures are defined, with one-shot and asymptotic pure-state distillation bounds proven in terms of them.
-
Device-independent Quantum Key Distribution in the commuting operator framework
DIQKD key rates are rigorously computable via NPA hierarchies in the commuting-operator framework after a POVM-to-PVM dilation and a von Neumann-algebra Frenkel integral for relative entropy.
-
Efficient Energy-Constrained Semi-Device-Independent QRNG with an Integrated Heterodyne Receiver
Experimental realization of a continuous-variable semi-device-independent QRNG with four-state coherent states and heterodyne detection, certifying 0.223 bits of Shannon entropy per measurement using an integrated pho...
-
Chain rules for conditional entropies in quantum cryptography: limitations and improvements
The authors prove a no-go result on tightening the Dupuis et al. chain rule in the device-independent setting and introduce a new chain rule that slightly improves the Rényi EAT in certain contexts, while unifying exi...
-
New approaches to almost i.i.d. information theory
Introduces two alternative definitions of almost i.i.d. states in quantum information theory and proves a strict hierarchy with a previously proposed notion, separated by explicit examples.
-
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.
-
Energy-independent tomography of Gaussian states
A tomography protocol estimates Gaussian states in trace distance with sample complexity independent of energy (up to doubly logarithmic factors), a doubly exponential improvement over prior methods.
-
Maximal intrinsic randomness of noisy quantum measurements
Any two-outcome qubit measurement and any white-noise-affected projective measurement have exact, closed-form maximal intrinsic randomness, given by formulas in terms of the trace of the square root of one POVM element.
-
Improved finite-size effects in QKD protocols with applications to decoy-state QKD
A finite-size QKD proof with per-observation statistical constraints and sifted-round-scaled correction terms yields improved key rates for decoy-state and coherent-attack protocols.
-
Uhlmann's theorem for relative entropies
For all alpha in [1/2, infinity], the regularized alpha-Renyi divergence from a bipartite state to the set of extensions of a fixed marginal equals the marginal divergence, and the measured version lies between the me...
-
Impossibility of Quantum Private Queries
No cheat-sensitive quantum private query protocol can be both secure for the user and protect the database owner, even when small errors are tolerated, because a dishonest user can retrieve all entries.
-
Doubly minimized Petz and sandwiched Renyi mutual information: Properties
Proves additivity of doubly minimized Petz Renyi mutual information for alpha in [1/2,2] and a novel duality plus additivity for the sandwiched version for alpha in [2/3, infinity] via Sion's minimax theorem.
-
"Nonlocality-of-a-single-photon" based Quantum Key Distribution and Random Number Generation schemes and their device-independent security analysis
Presents a single-photon DI-QKD scheme and self-testing QRNG whose security rests on no-signaling polytope decomposition and a Clauser-Horne inequality involving on/off weak homodyne settings.
-
Robustness of Entanglement Manipulation for almost i.i.d. sources
Robustness theorems establish that asymptotic entanglement manipulation rates for MSR almost i.i.d. sources equal those of their i.i.d. references, with universal protocols for pure states.
-
Entropy Concentration and Universal Typicality for Weakly Almost i.i.d. Quantum Sources
Establishes noncommutative weak law of large numbers and universal entropy concentration for weakly almost i.i.d. quantum sources.
-
Quantum Shannon theory made robust: a tale of three protocols for almost i.i.d. sources
Robust protocols exist for hypothesis testing, compression, and channel coding that attain optimal rates for arbitrary almost i.i.d. sources, via a new club distance and almost i.i.d. process notion.
-
Robust generalized quantum Stein's lemma
The generalized quantum Stein's lemma remains valid for almost-iid states via a new continuity bound on relative entropy of entanglement with respect to quantum Wasserstein distance.
-
Erasure cost of a quantum process: A thermodynamic meaning of the dynamical min-entropy
The adversarial erasure cost of a quantum channel equals, in the zero-error limit, the negative of the channel's min-entropy times k_B T ln 2.
-
Doubly minimized Petz and sandwiched Renyi mutual information: Operational interpretation from binary quantum state discrimination
The direct exponent in binary quantum state discrimination for correlation detection equals the doubly minimized Petz Renyi mutual information for alpha in (1/2,1), while the strong converse exponent equals the doubly...
-
Composable and Finite Computational Security of Quantum Message Transmission
Secure quantum message transmission can be defined and proven in a finite, composable way, and common game-based definitions are stronger than necessary.
-
randextract: a Reference Library to Test and Validate Privacy Amplification Implementations
A reference Python library for privacy amplification extractors is introduced, together with test vectors and demonstrations that it caught real bugs in existing high-performance QKD/QRNG implementations.
-
Drone- and Vehicle-Based Quantum Key Distribution
First demonstrations of drone-to-drone, drone-to-vehicle, and vehicle-to-vehicle quantum key distribution, with finite-key secure rates of 1.6 to 20 kbps over short free-space links.
-
Information storage and transmission under Markovian noise
Quantum Markov semigroups on d-dimensional systems have infinite-time capacities determined by peripheral space structure, with convergence after time t ≳ d² ln(d), and explicit bounds showing n-qubit memories fail af...
-
From Fundamental Dynamics to Applied Cryptography: Studies on the Quantum Speed Limit and Fully Passive Quantum Key Distribution
Thesis exploring quantum speed limits on dynamical evolution alongside a fully passive quantum key distribution scheme.
Discussion (0). Continue with ORCID to comment.