Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOmar Fawzi
Person information
- affiliation: Inria, Lyon, France
- affiliation: ENS Lyon, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j21]Bernardino Romera-Paredes
, Mohammadamin Barekatain, Alexander Novikov, Matej Balog, M. Pawan Kumar, Emilien Dupont, Francisco J. R. Ruiz, Jordan S. Ellenberg, Pengming Wang, Omar Fawzi, Pushmeet Kohli, Alhussein Fawzi:
Mathematical discoveries from program search with large language models. Nat. 625(7995): 468-475 (2024)- [j20]Omar Fawzi, Paul Fermé:
Multiple-Access Channel Coding With Non-Signaling Correlations. IEEE Trans. Inf. Theory 70(3): 1693-1719 (2024) - [i37]Omar Fawzi, Richard Kueng, Damian Markham, Aadil Oufkir:
Learning Properties of Quantum States Without the I.I.D. Assumption. CoRR abs/2401.16922 (2024) - 2023
- [j19]Hamza Fawzi, Omar Fawzi, Samuel O. Scalet:
A subpolynomial-time algorithm for the free energy of one-dimensional quantum systems in the thermodynamic limit. Quantum 7: 1011 (2023) - [c34]Omar Fawzi, Nicolas Flammarion, Aurélien Garivier, Aadil Oufkir:
Quantum Channel Certification with Incoherent Measurements. COLT 2023: 1822-1884 - [c33]Hamza Fawzi, Omar Fawzi, Samuel O. Scalet:
A Subpolynomial-Time Algorithm for the Free Energy of One-Dimensional Quantum Systems in the Thermodynamic Limit. ITCS 2023: 49:1-49:6 - [e1]Omar Fawzi, Michael Walter:
18th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2023, July 24-28, 2023, Aveiro, Portugal. LIPIcs 266, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-283-9 [contents] - [i36]Omar Fawzi, Aadil Oufkir, Daniel Stilck França:
Lower Bounds on Learning Pauli Channels. CoRR abs/2301.09192 (2023) - [i35]Omar Fawzi, Nicolas Flammarion, Aurélien Garivier, Aadil Oufkir:
Quantum Channel Certification with Incoherent Strategies. CoRR abs/2303.01188 (2023) - [i34]Omar Fawzi, Paul Fermé:
Broadcast Channel Coding: Algorithmic Aspects and Non-Signaling Assistance. CoRR abs/2310.05515 (2023) - 2022
- [j18]Siddharth Barman, Omar Fawzi, Suprovat Ghoshal, Emirhan Gürpinar:
Tight approximation bounds for maximum multi-coverage. Math. Program. 192(1): 443-476 (2022) - [j17]Mario Berta, Francesco Borderi, Omar Fawzi, Volkher B. Scholz:
Semidefinite programming hierarchies for constrained bilinear optimization. Math. Program. 194(1): 781-829 (2022) - [j16]Omar Fawzi, Ala Shayeghi, Hoang Ta:
A Hierarchy of Efficient Bounds on Quantum Capacities Exploiting Symmetry. IEEE Trans. Inf. Theory 68(11): 7346-7360 (2022) - [c32]Julien Devevey, Omar Fawzi, Alain Passelègue, Damien Stehlé:
On Rejection Sampling in Lyubashevsky's Signature Scheme. ASIACRYPT (4) 2022: 34-64 - [c31]Tony Metger, Omar Fawzi, David Sutter, Renato Renner:
Generalised entropy accumulation. FOCS 2022: 844-850 - [c30]Matthias Christandl, Omar Fawzi, Hoang Ta, Jeroen Zuiddam:
Larger Corner-Free Sets from Combinatorial Degenerations. ITCS 2022: 48:1-48:20 - [c29]Omar Fawzi, Alexander Müller-Hermes, Ala Shayeghi:
A Lower Bound on the Space Overhead of Fault-Tolerant Quantum Computation. ITCS 2022: 68:1-68:20 - [c28]Omar Fawzi, Paul Fermé:
Beating the Sum-Rate Capacity of the Binary Adder Channel with Non-Signaling Correlations. ISIT 2022: 2750-2755 - [i33]Omar Fawzi, Alexander Müller-Hermes, Ala Shayeghi:
A lower bound on the space overhead of fault-tolerant quantum computation. CoRR abs/2202.00119 (2022) - [i32]Tony Metger, Omar Fawzi, David Sutter, Renato Renner:
Generalised entropy accumulation. CoRR abs/2203.04989 (2022) - [i31]Omar Fawzi, Nicolas Flammarion, Aurélien Garivier, Aadil Oufkir:
Sequential algorithms for testing identity and closeness of distributions. CoRR abs/2205.06069 (2022) - [i30]Omar Fawzi, Paul Fermé:
Beating the Sum-Rate Capacity of the Binary Adder Channel with Non-Signaling Correlations. CoRR abs/2206.10968 (2022) - [i29]Julien Devevey, Omar Fawzi, Alain Passelègue, Damien Stehlé:
On Rejection Sampling in Lyubashevsky's Signature Scheme. IACR Cryptol. ePrint Arch. 2022: 1249 (2022) - 2021
- [j15]Omar Fawzi, Antoine Grospellier, Anthony Leverrier:
Constant overhead quantum fault tolerance with quantum expander codes. Commun. ACM 64(1): 106-114 (2021) - [j14]Hamza Fawzi, Omar Fawzi:
Defining quantum divergences via convex optimization. Quantum 5: 387 (2021) - [j13]David Sutter, Omar Fawzi, Renato Renner:
Bounds on Lyapunov Exponents via Entropy Accumulation. IEEE Trans. Inf. Theory 67(1): 10-24 (2021) - [c27]Hyejung H. Jee, Carlo Sparaciari, Omar Fawzi, Mario Berta:
Quasi-Polynomial Time Algorithms for Free Quantum Games in Bounded Dimension. ICALP 2021: 82:1-82:20 - [c26]Omar Fawzi, Ala Shayeghi, Hoang Ta:
A hierarchy of efficient bounds on quantum capacities exploiting symmetry. ISIT 2021: 272-277 - [c25]Aadil Oufkir, Omar Fawzi, Nicolas Flammarion, Aurélien Garivier:
Sequential Algorithms for Testing Closeness of Distributions. NeurIPS 2021: 11655-11664 - [c24]Siddharth Barman, Omar Fawzi, Paul Fermé:
Tight Approximation Guarantees for Concave Coverage Problems. STACS 2021: 9:1-9:17 - [i28]Matthias Christandl, Omar Fawzi, Hoang Ta, Jeroen Zuiddam:
Communication Complexity, Corner-Free Sets and the Symmetric Subrank of Tensors. CoRR abs/2104.01130 (2021) - [i27]Matthias Christandl, Omar Fawzi, Hoang Ta, Jeroen Zuiddam:
Larger Corner-Free Sets from Combinatorial Degenerations. CoRR abs/2111.08262 (2021) - 2020
- [c23]Siddharth Barman, Omar Fawzi, Suprovat Ghoshal, Emirhan Gürpinar:
Tight Approximation Bounds for Maximum Multi-coverage. IPCO 2020: 66-77 - [c22]Omar Fawzi, Lucien Grouès, Anthony Leverrier:
Linear programming decoder for hypergraph product quantum codes. ITW 2020: 1-5 - [i26]Siddharth Barman, Omar Fawzi, Paul Fermé:
Tight Approximation Guarantees for Concave Coverage Problems. CoRR abs/2010.00970 (2020)
2010 – 2019
- 2019
- [j12]Frédéric Dupuis, Omar Fawzi:
Entropy Accumulation With Improved Second-Order Term. IEEE Trans. Inf. Theory 65(11): 7596-7612 (2019) - [c21]Mario Berta, Francesco Borderi, Omar Fawzi, Volkher B. Scholz:
Quantum Coding via Semidefinite Programming. ISIT 2019: 260-264 - [c20]Omar Fawzi, Johanna Seif, Dániel Szilágyi:
Approximation algorithms for classical-quantum channel coding. ISIT 2019: 2569-2573 - [c19]Alhussein Fawzi, Mateusz Malinowski, Hamza Fawzi, Omar Fawzi:
Learning dynamic polynomial proofs. NeurIPS 2019: 4181-4190 - [i25]Siddharth Barman, Omar Fawzi, Suprovat Ghoshal, Emirhan Gürpinar:
Tight Approximation Bounds for Maximum Multi-Coverage. CoRR abs/1905.00640 (2019) - [i24]David Sutter, Omar Fawzi, Renato Renner:
Bounds on Lyapunov exponents. CoRR abs/1905.03270 (2019) - [i23]Alhussein Fawzi, Mateusz Malinowski, Hamza Fawzi, Omar Fawzi:
Learning dynamic polynomial proofs. CoRR abs/1906.01681 (2019) - [i22]Kun Fang, Omar Fawzi, Renato Renner, David Sutter:
A chain rule for the quantum relative entropy. CoRR abs/1909.05826 (2019) - 2018
- [j11]Alhussein Fawzi, Omar Fawzi, Pascal Frossard:
Analysis of classifiers' robustness to adversarial perturbations. Mach. Learn. 107(3): 481-508 (2018) - [j10]Siddharth Barman, Omar Fawzi:
Algorithmic Aspects of Optimal Channel Coding. IEEE Trans. Inf. Theory 64(2): 1038-1045 (2018) - [c18]Jean-Yves Franceschi, Alhussein Fawzi, Omar Fawzi:
Robustness of classifiers to uniform $\ell_p$ and Gaussian noise. AISTATS 2018: 1280-1288 - [c17]Omar Fawzi, Antoine Grospellier, Anthony Leverrier:
Constant Overhead Quantum Fault-Tolerance with Quantum Expander Codes. FOCS 2018: 743-754 - [c16]Seyed-Mohsen Moosavi-Dezfooli, Alhussein Fawzi, Omar Fawzi, Pascal Frossard, Stefano Soatto:
Robustness of Classifiers to Universal Perturbations: A Geometric Perspective. ICLR (Poster) 2018 - [c15]Alhussein Fawzi, Hamza Fawzi, Omar Fawzi:
Adversarial vulnerability for any classifier. NeurIPS 2018: 1186-1195 - [c14]Omar Fawzi, Antoine Grospellier, Anthony Leverrier:
Efficient decoding of random errors for quantum expander codes. STOC 2018: 521-534 - [i21]Jean-Yves Franceschi, Alhussein Fawzi, Omar Fawzi:
Robustness of classifiers to uniform 𝓁p and Gaussian noise. CoRR abs/1802.07971 (2018) - [i20]Alhussein Fawzi, Hamza Fawzi, Omar Fawzi:
Adversarial vulnerability for any classifier. CoRR abs/1802.08686 (2018) - [i19]Omar Fawzi, Antoine Grospellier, Anthony Leverrier:
Constant overhead quantum fault-tolerance with quantum expander codes. CoRR abs/1808.03821 (2018) - 2017
- [j9]Mario Berta, Omar Fawzi, Volkher B. Scholz:
Quantum-Proof Randomness Extractors via Operator Space Theory. IEEE Trans. Inf. Theory 63(4): 2480-2503 (2017) - [c13]Seyed-Mohsen Moosavi-Dezfooli, Alhussein Fawzi, Omar Fawzi, Pascal Frossard:
Universal Adversarial Perturbations. CVPR 2017: 86-94 - [i18]Anil Ada, Omar Fawzi, Raghav Kulkarni:
On the Spectral Properties of Symmetric Functions. CoRR abs/1704.03176 (2017) - [i17]Seyed-Mohsen Moosavi-Dezfooli, Alhussein Fawzi, Omar Fawzi, Pascal Frossard, Stefano Soatto:
Analysis of universal adversarial perturbations. CoRR abs/1705.09554 (2017) - [i16]Omar Fawzi, Antoine Grospellier, Anthony Leverrier:
Efficient decoding of random errors for quantum expander codes. CoRR abs/1711.08351 (2017) - 2016
- [j8]Mario Berta, Omar Fawzi, Volkher B. Scholz:
Quantum Bilinear Optimization. SIAM J. Optim. 26(3): 1529-1564 (2016) - [c12]Siddharth Barman, Omar Fawzi:
Algorithmic aspects of optimal channel coding. ISIT 2016: 905-909 - [c11]Mario Berta, Omar Fawzi, Marco Tomamichel:
Exploiting variational formulas for quantum relative entropy. ISIT 2016: 2844-2848 - [i15]Frédéric Dupuis, Omar Fawzi, Renato Renner:
Entropy accumulation. CoRR abs/1607.01796 (2016) - [i14]Seyed-Mohsen Moosavi-Dezfooli, Alhussein Fawzi, Omar Fawzi, Pascal Frossard:
Universal adversarial perturbations. CoRR abs/1610.08401 (2016) - 2015
- [j7]Anil Ada, Arkadev Chattopadhyay, Omar Fawzi, Phuong Nguyen:
The NOF Multiparty Communication Complexity of Composed Functions. Comput. Complex. 24(3): 645-694 (2015) - [j6]Frédéric Dupuis, Omar Fawzi, Stephanie Wehner:
Entanglement Sampling and Applications. IEEE Trans. Inf. Theory 61(2): 1093-1112 (2015) - [c10]Mario Berta, Omar Fawzi, Volkher B. Scholz:
Semidefinite Programs for Randomness Extractors. TQC 2015: 73-91 - [i13]Alhussein Fawzi, Omar Fawzi, Pascal Frossard:
Analysis of classifiers' robustness to adversarial perturbations. CoRR abs/1502.02590 (2015) - [i12]David Sutter, Omar Fawzi, Renato Renner:
Universal recovery map for approximate Markov chains. CoRR abs/1504.07251 (2015) - [i11]Siddharth Barman, Omar Fawzi:
Algorithmic Aspects of Optimal Channel Coding. CoRR abs/1508.04095 (2015) - [i10]Mario Berta, Omar Fawzi, Marco Tomamichel:
On Variational Expressions for Quantum Relative Entropies. CoRR abs/1512.02615 (2015) - 2014
- [j5]Mario Berta, Omar Fawzi, Stephanie Wehner:
Quantum to Classical Randomness Extractors. IEEE Trans. Inf. Theory 60(2): 1168-1192 (2014) - [c9]Mario Berta, Omar Fawzi, Volkher B. Scholz, Oleg Szehr:
Variations on classical and quantum extractors. ISIT 2014: 1474-1478 - 2013
- [j4]Omar Fawzi, Patrick M. Hayden, Pranab Sen:
From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking. J. ACM 60(6): 44:1-44:61 (2013) - [c8]Frédéric Dupuis, Omar Fawzi, Stephanie Wehner:
Achieving the Limits of the Noisy-Storage Model Using Entanglement Sampling. CRYPTO (2) 2013: 326-343 - [c7]Lukas Drescher, Omar Fawzi:
On simultaneous min-entropy smoothing. ISIT 2013: 161-165 - [c6]Winton Brown, Omar Fawzi:
Short random circuits define good quantum error correcting codes. ISIT 2013: 346-350 - [i9]Lukas Drescher, Omar Fawzi:
On simultaneous min-entropy smoothing. CoRR abs/1312.7642 (2013) - [i8]Winton Brown, Omar Fawzi:
Short random circuits define good quantum error correcting codes. CoRR abs/1312.7646 (2013) - [i7]Frédéric Dupuis, Omar Fawzi, Stephanie Wehner:
Achieving the limits of the noisy-storage model using entanglement sampling. IACR Cryptol. ePrint Arch. 2013: 360 (2013) - 2012
- [j3]Nicolas Broutin, Omar Fawzi:
Longest Path Distance in Random Circuits. Comb. Probab. Comput. 21(6): 856-881 (2012) - [j2]Luc Devroye, Omar Fawzi, Nicolas Fraiman:
Depth Properties of scaled attachment random recursive trees. Random Struct. Algorithms 41(1): 66-98 (2012) - [j1]Omar Fawzi, Patrick M. Hayden, Ivan Savov, Pranab Sen, Mark M. Wilde:
Classical Communication Over a Quantum Interference Channel. IEEE Trans. Inf. Theory 58(6): 3670-3691 (2012) - [c5]Anil Ada, Omar Fawzi, Hamed Hatami:
Spectral Norm of Symmetric Functions. APPROX-RANDOM 2012: 338-349 - [c4]Mario Berta, Omar Fawzi, Stephanie Wehner:
Quantum to Classical Randomness Extractors. CRYPTO 2012: 776-793 - [c3]Anil Ada, Arkadev Chattopadhyay, Omar Fawzi, Phuong Nguyen:
The NOF Multiparty Communication Complexity of Composed Functions. ICALP (1) 2012: 13-24 - [i6]Anil Ada, Omar Fawzi, Hamed Hatami:
Spectral Norm of Symmetric Functions. CoRR abs/1205.5282 (2012) - [i5]Omar Fawzi, Ivan Savov:
Rate-splitting in the presence of multiple receivers. CoRR abs/1207.0543 (2012) - 2011
- [c2]Omar Fawzi, Patrick M. Hayden, Ivan Savov, Pranab Sen, Mark M. Wilde:
Quantum interference channels. Allerton 2011: 609-616 - [c1]Omar Fawzi, Patrick M. Hayden, Pranab Sen:
From low-distortion norm embeddings to explicit uncertainty relations and efficient information locking. STOC 2011: 773-782 - [i4]Omar Fawzi, Patrick M. Hayden, Ivan Savov, Pranab Sen, Mark M. Wilde:
Classical communication over a quantum interference channel. CoRR abs/1102.2624 (2011) - [i3]Ivan Savov, Omar Fawzi, Mark M. Wilde, Pranab Sen, Patrick M. Hayden:
Quantum interference channels. CoRR abs/1102.2955 (2011) - [i2]Anil Ada, Arkadev Chattopadhyay, Omar Fawzi, Phuong Nguyen:
The NOF Multiparty Communication Complexity of Composed Functions. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [i1]Omar Fawzi, Patrick M. Hayden, Pranab Sen:
From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking. CoRR abs/1010.3007 (2010)
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-24 22:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
