101 citations · 159 across the 12 of their papers we have counts for
17 papers
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…
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…
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…
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…
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…
On Covert Quantum Sensing and the Benefits of Entanglement
Mehrdad Tahmasbi, Matthieu Bloch
Motivated by applications to covert quantum radar, we analyze a covert quantum sensing problem, in which a legitimate user aims at estimating an unknown parameter taking finitely m…
Steganography Protocols for Quantum Channels
Mehrdad Tahmasbi, Matthieu Bloch
We study several versions of a quantum steganography problem, in which two legitimate parties attempt to conceal a cypher in a quantum cover transmitted over a quantum channel with…
Toward Undetectable Quantum Key Distribution over Bosonic Channels
Mehrdad Tahmasbi, Matthieu R. Bloch
We show that covert secret key expansion is possible using a public authenticated classical channel and a quantum channel largely under control of an adversary, which we precisely…
Covert Secret Key Generation with an Active Warden
Mehrdad Tahmasbi, Matthieu Bloch
We investigate the problem of covert and secret key generation over a state-dependent discrete memoryless channel with one-way public discussion in which an adversary, the warden,…
A framework for covert and secret key expansion over quantum channels
Mehrdad Tahmasbi, Matthieu R. Bloch
Covert and secret quantum key distribution aims at generating information-theoretically secret bits between distant legitimate parties in a manner that remains provably undetectabl…
Multilevel-Coded Pulse-Position Modulation for Covert Communications over Binary-Input Discrete Memoryless Channels
Ishaque Ashar Kadampot, Mehrdad Tahmasbi, Matthieu R Bloch
We develop a low-complexity coding scheme to achieve covert communications over binary-input discrete memoryless channels (BI-DMCs). We circumvent the impossibility of covert commu…
Covert Capacity of Non-Coherent Rayleigh-Fading Channels
Mehrdad Tahmasbi, Anne Savard, Matthieu R. Bloch
The covert capacity is characterized for a non-coherent fast Rayleigh-fading wireless channel, in which a legitimate user wishes to communicate reliably with a legitimate receiver…
Learning an Adversary's Actions for Secret Communication
Mehrdad Tahmasbi, Matthieu R. Bloch, Aylin Yener
Secure communication over a wiretap channel is investigated, in which an active adversary modifies the state of the channel and the legitimate transmitter has the opportunity to se…
First and Second Order Asymptotics in Covert Communication
Mehrdad Tahmasbi, Matthieu R. Bloch
We study the first- and second-order asymptotics of covert communication over binary-input DMC for three different covertness metrics and under maximum probability of error constra…
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…
On the Capacity Achieving Probability Measures for Molecular Receivers
Mehrdad Tahmasbi, Faramarz Fekri
In this paper, diffusion-based molecular commu- nication with ligand receptor receivers is studied. Information messages are assumed to be encoded via variations of the con- centra…
Critical Graphs in Index Coding
Mehrdad Tahmasbi, Amirbehshad Shahrasbi, Amin Gohari
In this paper we define critical graphs as minimal graphs that support a given set of rates for the index coding problem, and study them for both the one-shot and asymptotic setups…