The following pages link to David Sutter (Q521993):
Displaying 13 items.
- Multivariate trace inequalities (Q521995) (← links)
- Capacity of random channels with large alphabets (Q1691253) (← links)
- Universal recovery maps and approximate sufficiency of quantum relative entropy (Q1991512) (← links)
- Necessary criterion for approximate recoverability (Q1991514) (← links)
- Quantitative lower bounds on the Lyapunov exponent from multivariate matrix inequalities (Q2066358) (← links)
- Efficient One-Way Secret-Key Agreement and Private Channel Coding via Polarization (Q2867219) (← links)
- Strengthened Monotonicity of Relative Entropy via Pinched Petz Recovery Map (Q2976877) (← links)
- Efficient Approximation of Quantum Channel Capacities (Q2977087) (← links)
- Efficient Quantum Polar Codes Requiring No Preshared Entanglement (Q2977147) (← links)
- Efficient Approximation of Channel Capacities (Q2978670) (← links)
- Pretty Good Measures in Quantum Information Theory (Q2989657) (← links)
- Universal recovery map for approximate Markov chains (Q5363506) (← links)
- Quantum Brascamp-Lieb dualities (Q6110168) (← links)
