Omar Fawzi

Bernardino Romera-Paredes

IEEE Trans. Inf. Theory, November, 2024

Mathematical discoveries from program search with large language models.

[BibT_eX]

[DOI]

Mohammadamin Barekatain

Nat., January, 2024

Multiple-Access Channel Coding With Non-Signaling Correlations.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2024

Generalized quantum asymptotic equipartition.

[BibT_eX]

[DOI]

Kun Fang

CoRR, 2024

Learning Properties of Quantum States Without the I.I.D. Assumption.

[BibT_eX]

[DOI]

CoRR, 2024

Optimality of Meta-Converse for Channel Simulation.

[BibT_eX]

[DOI]

Aadil Oufkir

Proceedings of the IEEE International Symposium on Information Theory, 2024

2023

A subpolynomial-time algorithm for the free energy of one-dimensional quantum systems in the thermodynamic limit.

[BibT_eX]

[DOI]

Samuel O. Scalet

Quantum, May, 2023

On Adaptivity in Quantum Testing.

[BibT_eX]

[DOI]

Trans. Mach. Learn. Res., 2023

Quantum Channel Certification with Incoherent Strategies.

[BibT_eX]

[DOI]

CoRR, 2023

Lower Bounds on Learning Pauli Channels.

[BibT_eX]

[DOI]

Aadil Oufkir

Daniel Stilck França

CoRR, 2023

Quantum Channel Certification with Incoherent Measurements.

[BibT_eX]

[DOI]

Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022

A Hierarchy of Efficient Bounds on Quantum Capacities Exploiting Symmetry.

[BibT_eX]

[DOI]

Ala Shayeghi

Hoang Ta

IEEE Trans. Inf. Theory, 2022

Semidefinite programming hierarchies for constrained bilinear optimization.

[BibT_eX]

[DOI]

Math. Program., 2022

Tight approximation bounds for maximum multi-coverage.

[BibT_eX]

[DOI]

Math. Program., 2022

On Rejection Sampling in Lyubashevsky's Signature Scheme.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Sequential algorithms for testing identity and closeness of distributions.

[BibT_eX]

[DOI]

CoRR, 2022

Beating the Sum-Rate Capacity of the Binary Adder Channel with Non-Signaling Correlations.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

A Lower Bound on the Space Overhead of Fault-Tolerant Quantum Computation.

[BibT_eX]

[DOI]

Alexander Müller-Hermes

Ala Shayeghi

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Larger Corner-Free Sets from Combinatorial Degenerations.

[BibT_eX]

[DOI]

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 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]

David Sutter

IEEE Trans. Inf. Theory, 2021

Defining quantum divergences via convex optimization.

[BibT_eX]

[DOI]

Quantum, 2021

Communication Complexity, Corner-Free Sets and the Symmetric Subrank of Tensors.

[BibT_eX]

[DOI]

CoRR, 2021

Constant overhead quantum fault tolerance with quantum expander codes.

[BibT_eX]

[DOI]

Antoine Grospellier

Anthony Leverrier

Commun. ACM, 2021

Tight Approximation Guarantees for Concave Coverage Problems.

[BibT_eX]

[DOI]

Siddharth Barman

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Sequential Algorithms for Testing Closeness of Distributions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Quasi-Polynomial Time Algorithms for Free Quantum Games in Bounded Dimension.

[BibT_eX]

[DOI]

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Linear programming decoder for hypergraph product quantum codes.

[BibT_eX]

[DOI]

Lucien Grouès

Anthony Leverrier

Proceedings of the IEEE Information Theory Workshop, 2020

2019

Entropy Accumulation With Improved Second-Order Term.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

A chain rule for the quantum relative entropy.

[BibT_eX]

[DOI]

CoRR, 2019

Bounds on Lyapunov exponents.

[BibT_eX]

[DOI]

David Sutter

CoRR, 2019

Learning dynamic polynomial proofs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Approximation algorithms for classical-quantum channel coding.

[BibT_eX]

[DOI]

Johanna Seif

Dániel Szilágyi

Proceedings of the IEEE International Symposium on Information Theory, 2019

Quantum Coding via Semidefinite Programming.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

Algorithmic Aspects of Optimal Channel Coding.

[BibT_eX]

[DOI]

Siddharth Barman

IEEE Trans. Inf. Theory, 2018

Analysis of classifiers' robustness to adversarial perturbations.

[BibT_eX]

[DOI]

Pascal Frossard

Mach. Learn., 2018

Robustness of classifiers to uniform 𝓁<sub>p</sub> and Gaussian noise.

[BibT_eX]

[DOI]

Jean-Yves Franceschi

CoRR, 2018

Efficient decoding of random errors for quantum expander codes.

[BibT_eX]

[DOI]

Antoine Grospellier

Anthony Leverrier

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Adversarial vulnerability for any classifier.

[BibT_eX]

[DOI]

Seyed-Mohsen Moosavi-Dezfooli

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Robustness of Classifiers to Universal Perturbations: A Geometric Perspective.

[BibT_eX]

[DOI]

Proceedings of the 6th International Conference on Learning Representations, 2018

Robustness of classifiers to uniform $\ell_p$ and Gaussian noise.

[BibT_eX]

[DOI]

Jean-Yves Franceschi

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

2017

Quantum-Proof Randomness Extractors via Operator Space Theory.

[BibT_eX]

[DOI]

Seyed-Mohsen Moosavi-Dezfooli

Volkher B. Scholz

IEEE Trans. Inf. Theory, 2017

Analysis of universal adversarial perturbations.

[BibT_eX]

[DOI]

CoRR, 2017

On the Spectral Properties of Symmetric Functions.

[BibT_eX]

[DOI]

Anil Ada

Seyed-Mohsen Moosavi-Dezfooli

Raghav Kulkarni

CoRR, 2017

Universal Adversarial Perturbations.

[BibT_eX]

[DOI]

Pascal Frossard

Proceedings of the 2017 IEEE Conference on Computer Vision and Pattern Recognition, 2017

2016

Quantum Bilinear Optimization.

[BibT_eX]

[DOI]

Volkher B. Scholz

SIAM J. Optim., 2016

Entropy accumulation.

[BibT_eX]

[DOI]

CoRR, 2016

Exploiting variational formulas for quantum relative entropy.

[BibT_eX]

[DOI]

Marco Tomamichel

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

Entanglement Sampling and Applications.

[BibT_eX]

[DOI]

Stephanie Wehner

IEEE Trans. Inf. Theory, 2015

Universal recovery map for approximate Markov chains.

[BibT_eX]

[DOI]

David Sutter

CoRR, 2015

On Variational Expressions for Quantum Relative Entropies.

[BibT_eX]

[DOI]

Marco Tomamichel

CoRR, 2015

The NOF Multiparty Communication Complexity of Composed Functions.

[BibT_eX]

[DOI]

Anil Ada

Arkadev Chattopadhyay

Phuong Nguyen

Comput. Complex., 2015

Semidefinite Programs for Randomness Extractors.

[BibT_eX]

[DOI]

Volkher B. Scholz

Proceedings of the 10th Conference on the Theory of Quantum Computation, 2015

2014

Quantum to Classical Randomness Extractors.

[BibT_eX]

[DOI]

Stephanie Wehner

IEEE Trans. Inf. Theory, 2014

Variations on classical and quantum extractors.

[BibT_eX]

[DOI]

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

2013

From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking.

[BibT_eX]

[DOI]

Patrick M. Hayden

Pranab Sen

J. ACM, 2013

Achieving the limits of the noisy-storage model using entanglement sampling.

[BibT_eX]

[DOI]

Stephanie Wehner

IACR Cryptol. ePrint Arch., 2013

On simultaneous min-entropy smoothing.

[BibT_eX]

[DOI]

Lukas Drescher

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

Short random circuits define good quantum error correcting codes.

[BibT_eX]

[DOI]

Winton Brown

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

2012

Classical Communication Over a Quantum Interference Channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Depth Properties of scaled attachment random recursive trees.

[BibT_eX]

[DOI]

Luc Devroye

Nicolas Fraiman

Random Struct. Algorithms, 2012

Longest Path Distance in Random Circuits.

[BibT_eX]

[DOI]

Nicolas Broutin

Comb. Probab. Comput., 2012

Rate-splitting in the presence of multiple receivers

[BibT_eX]

[DOI]

Ivan Savov

CoRR, 2012

Spectral Norm of Symmetric Functions.

[BibT_eX]

[DOI]

Anil Ada