activity
20112026
most citedOptimal Blind Quantum Computation

88 citations · 316 across the 17 of their papers we have counts for

collaborators

19 papers

quant-ph2026

Black Hole Radiation Decoding in the Haar Random Oracle Model

Ezekiel Cochran, Atul Mantri

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…

quant-ph2026

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

Keshav Bhateja, Mehdi Esmaili, Atul Mantri

Random circuit sampling experiments, the leading demonstrations of quantum computational advantage, are tested with the linear cross-entropy benchmark (XEB), which scores outcomes…

quant-ph2026

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

Atul Mantri

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…

quant-ph2026

Oracle Separations in the Fourier Hierarchy

Atul Mantri

The Fourier hierarchy , introduced by Shi (TCS 2005), measures a quantum computation by the number of Hada…

quant-ph2025

The Quantum Internet (Technical Version)

Peter P. Rohde, Zixin Huang, Yingkai Ouyang +14

Following the emergence of quantum computing, the subsequent quantum revolution will be that of interconnecting individual quantum computers at global level. In the same way that c…

quant-ph2024

Security of Key-Alternating Ciphers: Quantum Lower Bounds and Quantum Walk Attacks

Chen Bai, Mehdi Esmaili, Atul Mantri

We study the quantum security of key-alternating ciphers (KAC), a natural multi-round generalization of the Even--Mansour construction. KAC abstracts the round structure of practic…