arXiv subjects

Jesni Shamsul Shaari

Publications and source records attributed to Jesni Shamsul Shaari.

9 recordsLinked to original sources

arXiv2026

Entropic Uncertainty Relations for Mutually Unbiased Operator Frames

We develop an operator-frame formulation of entropic uncertainty relations in the Hilbert-Schmidt space of operators. For general continuous indexed operator frames, we derive an entropic uncertainty relation for the associated coefficient distributions by combining endpoint norm estimates with Riesz-Thorin interpolation. We then identify a distinguished class of mutually unbiased operator frames, defined through constant-modulus trace overlaps. Under suitable structural conditions, the corresponding coefficient amplitudes are related by a bilinear Fourier transform, leading to a stronger Hirschman-Beckner-type entropic uncertainty relation. As canonical realizations, we consider Weyl displacement operators and Wigner kernels, as well as Cartesian dyadic frames generated by position and momentum eigenstates. These examples recover familiar continuous-variable Fourier dualities while extending entropic uncertainty relations beyond measurement outcomes to operator representations themselves.

quant-ph↗

arXiv2024

Information Disturbance Tradeoff in Bidirectional QKD

Making use of the Quantum Network formalism of \textit{Phys. Rev. A,} \textbf{82} (2010) 062305, we present the case for quantum networks with finite outcomes, more specifically one which could distinguish only between specific unitary operators in a given basis for operators. Despite its simplicity, we proceed to build a network derived from the optimal strategy in \textit{Phys. Rev. A,} \textbf{82} (2010) 062305 and show that the information-disturbance tradeoff in distinguishing between two operators acting on qubits, selected from mutually unbiased unitary bases is equal to the case of estimating an operator selected randomly from the set of SU($2$) based on the Haar measure. This suggests that such strategies in distinguishing between mutually unbiased operators is not any easier than estimating an operator derived from an infinite set. We then show how this network can be used as a natural attack strategy against a bidirectional quantum cryptographic protocol.

quant-ph↗

arXiv2021

Entropic Bounds For Unitary Testers and Mutually Unbiased Unitary Bases

We define the entropic bounds, i.e minimal uncertainty for pairs of unitary testers in distinguishing between unitary transformations not unlike the well known entropic bounds for observables. We show that in the case of specific sets of testers which pairwise saturate the trivial zero bound, the testers are all equivalent in the sense their statistics are the same. On the other hand, when maximal bounds are saturated by such sets of testers, the unitary operators would form unitary bases which are mutually unbiased. This resembles very much the role of mutually unbiased bases in maximizing the entropic bounds for observables. We show how such a bound can be useful in certain quantum cryptographic protocols.

quant-ph↗

arXiv2020

Entropic Bounds as Uncertainty Measure of Unitary Operators

We reformulate the notion of uncertainty of pairs of unitary operators within the context of guessing games and derive an entropic uncertainty relation for a pair of such operators. We show how distinguishable operators are compatible while maximal incompatibility of unitary operators can be connected to bases for some subspace of operators which are mutually unbiased.

quant-ph↗

arXiv2020

Mutually Unbiased Unitary Bases of Operators on $d$-dimensional Hilbert Space

Analogous to the notion of mutually unbiased bases for Hilbert spaces, we consider mutually unbiased unitary bases (MUUB) for the space of operators, $M(d, \mathbb{C})$, acting on such Hilbert spaces. The notion of MUUB reflects the equiprobable guesses of unitary in one bases of $M(d, \mathbb{C})$ when estimating a unitary operator in another. Though, for prime dimension $d$, the maximal number of MUUBs is known to be $d^{2}-1$, there is no known recipe for constructing them, assuming they exist. However, one can always construct a minimum of three MUUBs, and the maximal number is approached for very large values of $d$. MUUBs can also exists for some $d$-dimensional subspace of $M(d, \mathbb{C})$ with the maximal number being $d$.

quant-ph↗

arXiv2019

On the security of two-way quantum key distribution

An author (arXiv:1709.09262 [quant-ph] (2017), Nanoscale Research Letters (2017) 12:552) has recently questioned the security of two-way quantum key distribution schemes by referring to attack strategies which leave no errors in the (raw) key shared by the legitimate parties. We argue that the article is based on a flawed understanding of the actual workings of a two-way protocol, thus the erroneous conclusions drawn thereof.

quant-ph↗

arXiv2019

On Mutually Unbiased Unitary Bases in prime dimensional Hilbert spaces

Akin to the idea of complete sets of Mutually Unbiased Bases for prime dimensional Hilbert spaces, $\mathcal{H}_d$, we study its analogue for a $d$ dimensional subspace of $M (d,\mathbb{C})$, i.e. Mutually Unbiased Unitary Bases (MUUBs) comprising of unitary operators. We note an obvious isomorphism between the vector spaces and beyond that, we define a relevant monoid structure for $\mathcal{H}_d$ isomorphic to one for the subspace of $M (d,\mathbb{C})$. This provides us not only with the maximal number of such MUUBs, but also a recipe for its construction.

quant-ph↗

arXiv2016

Mutually Unbiased Unitaries Bases

We consider the notion of unitary transformations forming bases for subspaces of $M(d,\mathbb{C})$ such that the square of Hilbert-Schmidt inner product of matrices from the differing bases is a constant. Moving from the qubit case, weconstruct the maximal number of such bases for the 4 and 2 dimensional subspaces while proving the nonexistence of such a construction for the 3 dimensional case. Extending this to higher dimensions, we commit to such a construct for the case of qutrits and provide evidence for the existence of such unitaries for prime dimensional quantum systems. Focusing on the qubit case, we show that the average fidelity for estimating any of such a transformation is equal to the case for estimating a completely unknown unitary from $\text{SU}(2)$. This is then followed by a quick application for such unitaries in a quantum cryptographic setup.

quant-ph↗

arXiv2015

Finite key size analysis of two-way quantum cryptography

Quantum cryptographic protocols solve the longstanding problem of distributing a shared secret string to two distant users by typically making use of one-way quantum channel. However, alternative protocols exploiting two-way quantum channel have been proposed for the same goal and with potential advantages. Here we overview a security proof for two-way quantum key distribution protocols, against the most general eavesdropping attack, that utilize an entropic uncertainty relation. Then, by resorting to the `smooth' version of involved entropies, we extend such a proof to the case of finite key size. The results will be compared to those available for one-way protocols showing some advantages.

quant-ph↗