◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Omar Fawzi

57 papers hereh-index 306.5k citations86 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author1
  • first author13
  • middle author28
  • last author15

Across the 57 of 57 papers where every author was matched, so the position is known.

fields
  • quant-ph38
  • cs.CC4
  • cs.LG4
  • cs.DS3
  • cs.IT3
  • cs.CV2
same name
  • Omar Fawzi — 12 papers, h 5
  • Omar Fawzi — 10 papers, h 5
  • Omar Fawzi — 6 papers, h 1
  • Omar Fawzi — 4 papers, h 2
  • Omar Fawzi — 1 paper, h 3

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20102023
most citedQuantum conditional mutual information and approximate Markov chains

268 citations · 1.9k across the 55 of their papers we have counts for

collaborators
Showing 2019Show all

4 papers · 1 filter

quant-ph2019★ 65 cited

A chain rule for the quantum relative entropy

Kun Fang, Omar Fawzi, Renato Renner +1

The chain rule for the classical relative entropy ensures that the relative entropy between probability distributions on multipartite systems can be decomposed into a sum of relati…

cs.LG2019★ 3 cited

Learning dynamic polynomial proofs

Alhussein Fawzi, Mateusz Malinowski, Hamza Fawzi +1

Polynomial inequalities lie at the heart of many mathematical disciplines. In this paper, we consider the fundamental computational task of automatically searching for proofs of po…

math-ph2019★ 7 cited

Bounds on Lyapunov exponents via entropy accumulation

David Sutter, Omar Fawzi, Renato Renner

Lyapunov exponents describe the asymptotic behavior of the singular values of large products of random matrices. A direct computation of these exponents is however often infeasible…

cs.DS2019

Tight Approximation Bounds for Maximum Multi-Coverage

Siddharth Barman, Omar Fawzi, Suprovat Ghoshal +1

In the classic maximum coverage problem, we are given subsets T1​,…,Tm​ of a universe [n] along with an integer k and the objective is to find a subset $S \subseteq [m]…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.