arXiv subjects

Tushita Prasad

Publications and source records attributed to Tushita Prasad.

5 recordsLinked to original sources

arXiv2026

Semi-Device-Independent Quantum Key Distribution from Operational Assumptions

Semi-device-independent quantum key distribution leaves the measurement devices uncharacterized while placing a trusted assumption on Alice's source. We formulate this source assumption operationally on Alice's four-preparation ensemble as a scalar bound on one of four physically motivated source tasks: full-label guessing, parity guessing, or their normalized composites with label exclusion. For the two-bit random-access code, we derive the exact classical frontier for each of the four source assumptions. Numerically, the BB84 strategy attains the maximal quantum deviation from all four frontiers, while the preparation-depolarized BB84 family and the direct-sum label-leakage family trace complementary branches of the arbitrary-dimensional quantum boundary for the two exclusion-assisted assumptions. Because all four task values are monotone under input-independent quantum channels, the same scalar source bound constrains every Bob--Eve extension compatible with the complete observed behavior. Using a three-setting extension that separates RAC testing from key generation, we obtain two dimension-independent security certificates over this feasible set: lower bounds on the conditional min-entropy and conditional von Neumann entropy, obtained respectively by direct optimization of Eve's key-guessing probability and by prepare-and-measure semidefinite relaxations based on the Brown--Fawzi--Fawzi variational bound. The exclusion-assisted assumptions certify positive key rates down to nearly vanishing preparation visibility, far beyond full-label or parity guessing alone. Under direct-sum label leakage, all four independently optimized rate bounds remain positive at every sampled incomplete-leakage point and vanish only at complete label revelation. These results show that robust semi-device-independent security depends not only on what Eve can identify, but also on what she can exclude.

quant-ph↗

arXiv2026

Space-sharing and Singleton Bounds for Entanglement-assisted Classical Coding

Recent work has noted that a space-sharing argument proves the tightness of the entropic quantum Singleton bounds, which was left open in the literature for various settings involving only-quantum messages, only-classical messages, or both classical and quantum messages. Focusing on the setting of entanglement-assisted classical coding (EACC), in this letter we first elaborate upon the space-sharing argument and the tight Singleton bound for this setting, and then establish a new tight entropic Singleton bound for EACC codes with entanglement assistance distributed across a subset of encoders when only local quantum operations are allowed at each encoder.

quant-ph↗

arXiv2026

Entanglement is not sufficient for most practical entanglement-based QKD protocols

Quantum key distribution (QKD) is the most explored application of quantum information theory. A central problem in entanglement-based QKD (EB-QKD), is whether every entangled state can be used to extract a key. We observe that entanglement is not sufficient for standard practical EB-QKD protocols where the input choices are announced by the parties that want to share a secure key, such as E91 or entanglement-based BB84 type protocols, when even an arbitrarily small amount of leakage of classical side information occurs. We do this by identifying a class of two-qubit isotropic states that are entangled but cannot be used to distil the key under such protocols for any possible measurement by the parties. Counter-intuitively, this gap persists even when the leakage occurs from the "junk" rounds of the protocol, i.e, rounds that cannot be used to generate any key. We then extend this result to arbitrary dimensions and parties by identifying a class of isotropic states that are not useful to extract a secure key under such protocols, even if they are entangled. Finally, we demonstrate that our approach provides a tool to upper-bound the scalability of repeater-based QKD architectures in a protocol-independent manner. Interestingly, we find that allowing for even a tiny noise in the preparation drastically reduces the scalability of the QKD network.

quant-ph↗

arXiv2025

Certifying semi-device-independent security via wave-particle duality experiments

Wave-particle duality is known to be equivalent to an entropic uncertainty relation based on the min- and max-entropies, which have a clear operational meaning in quantum cryptography. Here, we derive a connection between wave-particle relations and the semi-device-independent (SDI) security framework. In particular, we express an SDI witness entirely in terms of two complementary interferometric quantities: visibility and input distinguishability. Applying a symmetry condition to the interferometric quantities, we identify a scenario in which the classical bound is violated and the security condition is met in wave-particle experiments with a tunable beam splitter. This enables the certification of non-classicality and the positivity of the key rate directly from complementary interferometric quantities. Moreover, we perform a proof-of-principle experiment using orbital-angular-momentum encoded quantum states of light in a tunable interferometer, validating our theoretical predictions. Finally, we analyze an improved bound on the SDI security condition, effectively enlarging the parameter region where secure communication can be certified.

quant-ph↗

arXiv2024

Codes for entanglement-assisted classical communication

Entanglement-assisted classical communication (EACC) aims to enhance communication systems using entanglement as an additional resource. However, there is a scarcity of explicit protocols designed for finite transmission scenarios, which presents a challenge for real-world implementation. In response we introduce a new EACC scheme capable of correcting a fixed number of erasures/errors. It can be adjusted to the available amount of entanglement and sends classical information over a quantum channel. We establish a general framework to accomplish such a task by reducing it to a classical problem. Comparing with specific bounds we identify optimal parameter ranges. The scheme requires only the implementation of super-dense coding which has been demonstrated successfully in experiments. Furthermore, our results shows that an adaptable entanglement use confers a communication advantage. Overall, our work sheds light on how entanglement can elevate various finite-length communication protocols, opening new avenues for exploration in the field.

quant-ph↗