◍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 2011Show all

4 papers · 1 filter

quant-ph2011★ 27 cited

Quantum to Classical Randomness Extractors

Mario Berta, Omar Fawzi, Stephanie Wehner

The goal of randomness extraction is to distill (almost) perfect randomness from a weak source of randomness. When the source yields a classical string X, many extractor constructi…

quant-ph2011★ 8 cited

Quantum interference channels

Ivan Savov, Omar Fawzi, Mark M. Wilde +2

The discrete memoryless interference channel is modelled as a conditional probability distribution with two outputs depending on two inputs and has widespread applications in pract…

quant-ph2011★ 35 cited

Classical communication over a quantum interference channel

Omar Fawzi, Patrick Hayden, Ivan Savov +2

Calculating the capacity of interference channels is a notorious open problem in classical information theory. Such channels have two senders and two receivers, and each sender wou…

math.PR2011★ 8 cited

Longest path distance in random circuits

Nicolas Broutin, Omar Fawzi

We study distance properties of a general class of random directed acyclic graphs (DAGs). In a DAG, many natural notions of distance are possible, for there exists multiple paths b…

◍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.