activity
20222026
most citedLearning Properties of Quantum States Without the I.I.D. Assumption

5 citations · 24 across the 20 of their papers we have counts for

collaborators

21 papers

quant-ph2026

Near-optimal incoherent tomography of low-rank quantum channels

Kean Chen, Aadil Oufkir

We study tomography for quantum channels with input dimension , output dimension , and Kraus rank at most , to within diamond norm error , using adaptive…

quant-ph2026

Quantum channel tomography: optimal bounds and a Heisenberg-to-classical phase transition

Kean Chen, Filippo Girardi, Aadil Oufkir +2

How many black-box queries to a quantum channel are needed to learn its full classical description? This question lies at the heart of quantum channel tomography (also known as qua…

quant-ph2026

Certifying and learning local quantum Hamiltonians

Andreas Bluhm, Matthias C. Caro, Francisco Escudero Gutiérrez +4

In this work, we study the problems of certifying and learning quantum -local Hamiltonians, for a constant . Our main contributions are as follows: - Certification of Hamilto…

quant-ph2026

Improved Lower Bounds for Learning Quantum Channels in Diamond Distance

Aadil Oufkir, Filippo Girardi

We prove that learning an unknown quantum channel with input dimension , output dimension , and Choi rank to diamond distance requires $ Ω\!\left( \frac…

quant-ph2025

Shadow Tomography Against Adversaries

Maryam Aliakbarpour, Vladimir Braverman, Nai-Hui Chia +4

We study single-copy shadow tomography in the adversarial robust setting, where the goal is to learn the expectation values of observables with …

quant-ph2025

Strong converse exponent of channel interconversion

Aadil Oufkir, Yongsheng Yao, Mario Berta

In their seminal work, Bennett et al. [IEEE Trans. Inf. Theory (2002)] showed that, with sufficient shared randomness, one noisy channel can simulate another at a rate equal to the…

quant-ph2025

Certifying and learning quantum Ising Hamiltonians

Andreas Bluhm, Matthias C. Caro, Francisco Escudero Gutiérrez +2

In this work, we study the problems of certifying and learning quantum Ising Hamiltonians. Our main contributions are as follows: Certification of Ising Hamiltonians. We show that…

quant-ph2025

Quantum umlaut information

Filippo Girardi, Aadil Oufkir, Bartosz Regula +3

We study the quantum umlaut information, a correlation measure defined for bipartite quantum states as a reversed variant of the quantum mutual information: $U(A;B)_ρ= \mi…

cs.IT2025

Umlaut information

Filippo Girardi, Aadil Oufkir, Bartosz Regula +3

The sphere-packing bound quantifies the error exponent for noisy channel coding for rates above a critical value. Here, we study the zero-rate limit of the sphere-packing bound and…

quant-ph2024

Exponents for classical-quantum channel simulation in purified distance

Aadil Oufkir, Yongsheng Yao, Mario Berta

We determine the exact error and strong converse exponent for entanglement-assisted classical-quantum channel simulation in worst case input purified distance. The error exponent i…

quant-ph2024★ 4 cited

Optimality of meta-converse for channel simulation

Aadil Oufkir, Omar Fawzi, Mario Berta

We study the effect of shared non-signaling correlations for the problem of simulating a channel using noiseless communication in the one-shot setting. For classical channels, we s…

cs.IT2024

Exponents for Shared Randomness-Assisted Channel Simulation

Aadil Oufkir, Michael X. Cao, Hao-Chung Cheng +1

We determine the exact error and strong converse exponents of shared randomness-assisted channel simulation in worst case total-variation distance. Namely, we find that these expon…

quant-ph2024★ 1 cited

Error exponent of activated non-signaling assisted classical-quantum channel coding

Aadil Oufkir, Marco Tomamichel, Mario Berta

We provide a tight asymptotic characterization of the error exponent for classical-quantum channel coding assisted by activated non-signaling correlations. Namely, we find that the…

quant-ph2024★ 2 cited

Quantum channel coding: Approximation algorithms and strong converse exponents

Aadil Oufkir, Mario Berta

We study relaxations of entanglement-assisted quantum channel coding and establish that non-signaling assistance and a natural semi-definite programming relaxation\, -- \,termed me…

quant-ph2024★ 1 cited

Optimal Fidelity Estimation from Binary Measurements for Discrete and Continuous Variable Systems

Omar Fawzi, Aadil Oufkir, Robert Salzmann

Estimating the fidelity between a desired target quantum state and an actual prepared state is essential for assessing the success of experiments. For pure target states, we use fu…

quant-ph2024★ 2 cited

Hamiltonian Property Testing

Andreas Bluhm, Matthias C. Caro, Aadil Oufkir

Locality is a fundamental feature of many physical time evolutions. Assumptions on locality and related structural properties also underlie recently proposed procedures for learnin…

quant-ph2024★ 5 cited

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

Omar Fawzi, Richard Kueng, Damian Markham +1

We develop a framework for learning properties of quantum states beyond the assumption of independent and identically distributed (i.i.d.) input states. We prove that, given any le…

quant-ph2023

Quantum Channel Certification with Incoherent Strategies

Omar Fawzi, Nicolas Flammarion, Aurélien Garivier +1

In the problem of quantum channel certification, we have black box access to a quantum process and would like to decide if this process matches some predefined specification or is…

quant-ph2023★ 5 cited

Sample-Optimal Quantum Process Tomography with Non-Adaptive Incoherent Measurements

Aadil Oufkir

How many copies of a quantum process are necessary and sufficient to construct an approximate classical description of it? We extend the result of Surawy-Stepney, Kahn, Kueng, and…

quant-ph2023★ 4 cited

Lower Bounds on Learning Pauli Channels with Individual Measurements

Omar Fawzi, Aadil Oufkir, Daniel Stilck França

Understanding the noise affecting a quantum device is of fundamental importance for scaling quantum technologies. A particularly important class of noise models is that of Pauli ch…

cs.DS2022

Sequential algorithms for testing identity and closeness of distributions

Omar Fawzi, Nicolas Flammarion, Aurélien Garivier +1

What advantage do \emph{sequential} procedures provide over batch algorithms for testing properties of unknown distributions? Focusing on the problem of testing whether two distrib…