The following pages link to R. Renner (Q387024):
Displaying 50 items.
- The impossibility of non-signaling privacy amplification (Q387025) (← links)
- Towards characterizing the non-locality of entangled quantum states (Q387027) (← links)
- Ernst Specker and the hidden variables (Q452478) (← links)
- Quantum conditional mutual information and approximate Markov chains (Q500059) (← links)
- Min- and max-entropy in infinite dimensions (Q635840) (← links)
- The quantum reverse Shannon theorem based on one-shot information theory (Q717117) (← links)
- Toward an algebraic theory of systems (Q1786609) (← links)
- Linking classical and quantum key agreement: Is there a classical analog to bound entanglement? (Q1871826) (← links)
- Universal recovery maps and approximate sufficiency of quantum relative entropy (Q1991512) (← links)
- Necessary criterion for approximate recoverability (Q1991514) (← links)
- Classical leakage resilience from fault-tolerant quantum computation (Q2010581) (← links)
- Entropy accumulation (Q2206013) (← links)
- One-and-a-half quantum de Finetti theorems (Q2384755) (← links)
- One-shot decoupling (Q2452200) (← links)
- Efficient One-Way Secret-Key Agreement and Private Channel Coding via Polarization (Q2867219) (← links)
- Generalized entropies (Q2929273) (← links)
- Composable Security of Delegated Quantum Computation (Q2936621) (← links)
- Non-Signaling Parallel Repetition Using de Finetti Reductions (Q2976980) (← links)
- Efficient Approximation of Quantum Channel Capacities (Q2977087) (← links)
- Efficient Quantum Polar Codes Requiring No Preshared Entanglement (Q2977147) (← links)
- Full Security of Quantum Key Distribution From No-Signaling Constraints (Q2986235) (← links)
- Smooth Max-Information as One-Shot Generalization for Mutual Information (Q2986482) (← links)
- Chain Rules for Smooth Min- and Max-Entropies (Q2989237) (← links)
- Quantum-Resilient Randomness Extraction (Q3002101) (← links)
- (Q3059395) (← links)
- A Conceptually Simple Proof of the Quantum Reverse Shannon Theorem (Q3070982) (← links)
- Hidden Variable Models for Quantum Theory Cannot Have Any Local Part (Q3107651) (← links)
- Trevisan's Extractor in the Presence of Quantum Side Information (Q3143297) (← links)
- (Q3166028) (← links)
- From Indifferentiability to Constructive Cryptography (and Back) (Q3179350) (← links)
- A de Finetti representation for finite symmetric quantum states (Q3438704) (← links)
- SECURITY OF QUANTUM KEY DISTRIBUTION (Q3525381) (← links)
- On the Power of Quantum Memory (Q3547157) (← links)
- Efficient Device-Independent Quantum Key Distribution (Q3563837) (← links)
- Simplifying information-theoretic arguments by post-selection (Q3589462) (← links)
- On the Impossibility of Extracting Classical Randomness Using a Quantum Computer (Q3591416) (← links)
- Unifying Classical and Quantum Key Distillation (Q3596397) (← links)
- Indistinguishability Amplification (Q3612547) (← links)
- A Tight High-Order Entropic Quantum Uncertainty Relation with Applications (Q3612559) (← links)
- Trade-Offs in Information-Theoretic Multi-party One-Way Key Agreement (Q3649187) (← links)
- (Q4408003) (← links)
- (Q4434899) (← links)
- Approximate Degradable Quantum Channels (Q4566613) (← links)
- Simple and Tight Device-Independent Security Proofs (Q4629390) (← links)
- Communication Complexity of One-Shot Remote State Preparation (Q4682799) (← links)
- The Operational Meaning of Min- and Max-Entropy (Q4974001) (← links)
- A Fully Quantum Asymptotic Equipartition Property (Q4974118) (← links)
- Smooth Entropies and the Quantum Information Spectrum (Q4975898) (← links)
- Inadequacy of von Neumann entropy for characterizing extractable work (Q5135847) (← links)
- Tsirelson's bound from a generalized data processing inequality (Q5137664) (← links)
