David Sutter

IEEE Trans. Inf. Theory, April, 2024

The complexity of quantum support vector machines.

[BibT_eX]

[DOI]

Quantum, January, 2024

A Two-Scale Complexity Measure for Deep Learning Models.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Quantum Kernel Alignment with Stochastic Gradient Descent.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2023

2022

Generalised entropy accumulation.

[BibT_eX]

[DOI]

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021

Bounds on Lyapunov Exponents via Entropy Accumulation.

[BibT_eX]

[DOI]

Omar Fawzi

IEEE Trans. Inf. Theory, 2021

The power of quantum neural networks.

[BibT_eX]

[DOI]

Nat. Comput. Sci., 2021

Effective dimension of machine learning models.

[BibT_eX]

[DOI]

CoRR, 2021

2020

Quantum Legendre-Fenchel Transform.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Generalized Maximum Entropy Estimation.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2019

A chain rule for the quantum relative entropy.

[BibT_eX]

[DOI]

CoRR, 2019

Efficient template matching in quantum circuits.

[BibT_eX]

[DOI]

Raban Iten

Stefan Woerner

CoRR, 2019

An information-theoretic treatment of quantum dichotomies.

[BibT_eX]

[DOI]

Francesco Buscemi

CoRR, 2019

Bounds on Lyapunov exponents.

[BibT_eX]

[DOI]

Omar Fawzi

CoRR, 2019

2018

Approximate quantum Markov chains.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Approximate Degradable Quantum Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Pretty Good Measures in Quantum Information Theory.

[BibT_eX]

[DOI]

Raban Iten

IEEE Trans. Inf. Theory, 2017

Capacity of random channels with large alphabets.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2017

Quantum Markov chains and logarithmic trace inequalities.

[BibT_eX]

[DOI]

Mario Berta

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016

Strengthened Monotonicity of Relative Entropy via Pinched Petz Recovery Map.

[BibT_eX]

[DOI]

Aram W. Harrow

IEEE Trans. Inf. Theory, 2016

Efficient Approximation of Quantum Channel Capacities.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Alignment of Polarized Sets.

[BibT_eX]

[DOI]

Seyed Hamed Hassani

IEEE J. Sel. Areas Commun., 2016

Multivariate Trace Inequalities.

[BibT_eX]

[DOI]

Mario Berta

CoRR, 2016

Universal recoverability in quantum information.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

Efficient Approximation of Channel Capacities.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

Efficient Quantum Polar Codes Requiring No Preshared Entanglement.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

Universal recovery map for approximate Markov chains.

[BibT_eX]

[DOI]

Omar Fawzi

CoRR, 2015

Universal recovery from a decrease of quantum relative entropy.

[BibT_eX]

[DOI]

CoRR, 2015

Approximate degradable quantum channels.

[BibT_eX]

[DOI]

Volkher B. Scholz

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

Universal polar codes for more capable and less noisy channels and sources.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Capacity approximation of memoryless channels with countable output alphabets.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Efficient approximation of discrete memoryless channel capacities.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Asymptotic capacity of a random channel.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2013

Efficient quantum channel coding scheme requiring no preshared entanglement.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Efficient One-Way Secret-Key Agreement and Private Channel Coding via Polarization.

[BibT_eX]

[DOI]