activity
20132024
most citedFirst and Second Order Asymptotics in Covert Communication

101 citations · 159 across the 12 of their papers we have counts for

collaborators
Showing quant-phShow all

6 papers · 1 filter

quant-ph2024

Improved bounds for testing low stabilizer complexity states

Saeed Mehraban, Mehrdad Tahmasbi

Stabilizer states are fundamental families of quantum states with crucial applications such as error correction, quantum computation, and simulation of quantum circuits. In this pa…

quant-ph2023

Quadratic Lower bounds on the Approximate Stabilizer Rank: A Probabilistic Approach

Saeed Mehraban, Mehrdad Tahmasbi

The approximate stabilizer rank of a quantum state is the minimum number of terms in any approximate decomposition of that state into stabilizer states. Bravyi and Gosset showed th…

quant-ph2022

Parallel repetition of local simultaneous state discrimination

Llorenç Escolà-Farràs, Jaròn Has, Maris Ozols +2

Local simultaneous state discrimination (LSSD) is a recently introduced problem in quantum information processing. Its classical version is a non-local game played by non-communica…

quant-ph2021★ 2 cited

Local simultaneous state discrimination

Christian Majenz, Maris Ozols, Christian Schaffner +1

Quantum state discrimination is one of the most fundamental problems studied in quantum information theory. Applications range from channel coding to metrology and cryptography. In…

quant-ph2021★ 1 cited

Limitations on Uncloneable Encryption and Simultaneous One-Way-to-Hiding

Christian Majenz, Christian Schaffner, Mehrdad Tahmasbi

We study uncloneable quantum encryption schemes for classical messages as recently proposed by Broadbent and Lord. We focus on the information-theoretic setting and give several li…

quant-ph2016

Fundamental Limits of Covert Communication over Classical-Quantum Channels

Michael S. Bullock, Azadeh Sheikholeslami, Mehrdad Tahmasbi +3

We investigate covert communication over general memoryless classical-quantum channels with fixed finite-size input alphabets. We show that the square root law (SRL) governs covert…