Skip to content

4 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

Black Hole Radiation Decoding in the Haar Random Oracle Model

We prove optimal query bounds for recovering a single qubit from black-hole radiation in the Haar random oracle model, when the remaining black hole contains at most one sixteenth of the system's qubits. Recovery with any constant Haar-averaged advantage over trivial decoding requires queries proportional to the Hilber...

Ezekiel Cochran, A. Mantri · 0 citations
Preprint Sep 2026

Oracle Separations in the Fourier Hierarchy

The Fourier hierarchy $\mathrm{FH}_0\subseteq\mathrm{FH}_1\subseteq\mathrm{FH}_2\subseteq\cdots$, introduced by Shi (TCS 2005), measures a quantum computation by the number of Hadamard layers it uses. Between two layers the circuit may permute basis states and attach phases, but it may not create superposition; the lay...

A. Mantri · 0 citations
Preprint Oct 2026

Tight Query Lower Bounds for Quantum Sampling, with an Application to Certified Randomness

In the quantum query model, it is shown that the honest sampler's ideal score acts as a Tsirelson bound for efficient devices and certified randomness and proves an earlier conjecture for Haar-random states and extends it to Fourier sampling.

Keshav Bhateja, Mehdi Esmaili, A. Mantri · 0 citations
Preprint Sep 2026

EFI Pairs Without One-Way Puzzles: Oracle Separations from Communication Complexity

EFI pairs (Brakerski, Canetti, and Qian, ITCS 2023) and one-way puzzles (Khurana and Tomer, STOC 2024) are the leading candidates for the minimal assumption of quantum cryptography. The first are efficiently preparable quantum states, statistically far yet computationally indistinguishable; the second are classical puz...

A. Mantri · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.