Prabha Mandayam

We discuss a recently proposed class of incompatibility measures for quantum measurements, which is based on quantifying the effect of measurements of one observable on the statistics of the outcome of another. We summarize the properties of this class of measures, and present a tight upper bound for the incompatibility of any set of projective measurements in finite dimensions. We also discuss non-projective measurements, and give a non-trivial upper bound on the mutual incompatibility of a pair of Lüders instruments. Using the example of incompatible observables that commute on a subspace, we elucidate how this class of measures goes beyond uncertainty relations in quantifying the mutual incompatibility of quantum measurements.

It is demonstrated here that local dynamics have the ability to strongly modify the entangling power of unitary quantum gates acting on a composite system. The scenario is common to numerous physical systems, in which the time evolution involves local operators and nonlocal interactions. To distinguish between distinct classes of gates with zero entangling power we introduce a complementary quantity called gate typicality and study its properties. Analyzing multiple, say n, applications of any entangling operator, U, interlaced with random local gates we prove that both investigated quantities approach their asymptotic values in a simple exponential form. These values coincide with the averages for random nonlocal operators on the full composite space and could be significantly larger than that of Un. This rapid convergence to equilibrium, valid for subsystems of arbitrary size, is illustrated by studying multiple actions of diagonal unitary gates and controlled unitary gates.

We consider a setting where qubits are processed sequentially, and derive fundamental limits on the rate at which classical information can be transmitted using quantum states that decohere in time. Specifically, we model the sequential processing of qubits using a single server queue, and derive explicit expressions for the capacity of such a 'queue-channel.' We also demonstrate a sweet-spot phenomenon with respect to the arrival rate to the queue, i.e., we show that there exists a value of the arrival rate of the qubits at which the rate of information transmission (in bits/sec) through the queue-channel is maximised. Next, we consider a setting where the average rate of processing qubits is fixed, and show that the capacity of the queue-channel is maximised when the processing time is deterministic. We also discuss design implications of these results on quantum information processing systems.

3-pulse DPS-QKD offers enhanced security compared to conventional DPS-QKD by decreasing the learning rate of an eavesdropper and unmasking her presence with an increased error rate upon application of intercept and resend attack. The probability of getting one bit of sifted key information using beamsplitter attack also reduces by 25% in our implentation compared to normal DPS.

We consider a setting where a stream of qubits is processed sequentially. We derive fundamental limits on the rate at which classical information can be transmitted using qubits that decohere as they wait to be processed. Specifically, we model the sequential processing of qubits using a single server queue, and derive expressions for the classical capacity of such a quantum 'queue-channel.' Focusing on quantum erasures, we obtain an explicit single-letter capacity formula in terms of the stationary waiting time of qubits in the queue. Our capacity proof also implies that a 'classical' coding/decoding strategy is optimal, i.e., an encoder which uses only orthogonal product states, and a decoder which measures in a fixed product basis, are sufficient to achieve the classical capacity of the quantum erasure queue-channel. More broadly, our work begins to quantitatively address the impact of decoherence on the performance limits of quantum information processing systems.

We demonstrated 3 pulse differential phase shift quantum key distribution with 30 km quantum channel with two different approaches, namely path superposition and time bin superposition.

We examine the role of quantum error correction (QEC) in achieving pretty good quantum state transfer over a class of one-dimensional spin Hamiltonians. Recasting the problem of state transfer as one of information transmission over an underlying quantum channel, we identify an adaptive QEC protocol that achieves pretty good state transfer. Using an adaptive recovery and approximate QEC code, we obtain explicit analytical and numerical results for the fidelity of transfer over ideal and disordered one-dimensional Heisenberg chains. In the case of a disordered chain, we study the distribution of the transition amplitude, which in turn quantifies the stochastic noise in the underlying quantum channel. Our analysis helps us to suitably modify the QEC protocol so as to ensure pretty good state transfer for small disorder strengths and indicates a threshold beyond which QEC does not help in improving the fidelity of state transfer.

We demonstrated 3 pulse differential phase shift quantum key distribution with 30 km quantum channel with two different approaches, namely path superposition and time bin superposition.

This paper proposes a measurement-device-independent quantum key distribution (MDI-QKD) scheme based on differential phase encoding. The differential phase shift MDI-QKD (DPS-MDI-QKD) couples the advantages of DPS-QKD with that of MDI-QKD. The proposed scheme offers resistance against photon number splitting attack and phase fluctuations as well as immunity against detector side-channel vulnerabilities. The design proposed in this paper uses weak coherent pulses in a superposition of three orthogonal states, corresponding to one of three distinct paths in a delay-line interferometer. The classical bit information is encoded in the phase difference between pulses traversing successive paths. This 3-pulse superposition offers enhanced security compared to using a train of pulses by decreasing the learning rate of an eavesdropper and unmasking her presence with an increased error rate upon application of intercept and resend attack and beamsplitter attack. The proposed scheme employs phase locking of the sources of the two trusted parties so as to maintain the coherence between their optical signal, and uses a beamsplitter (BS) at the untrusted node (Charlie) to extract the key information from the phase encoded signals.

We demonstrate a fundamental principle of disturbance tradeoff for quantum measurements, along the lines of the celebrated uncertainty principle: The disturbances associated with measurements performed on distinct yet identically prepared ensembles of systems in a pure state cannot all be made arbitrarily small. Indeed, we show that the average of the disturbances associated with a set of projective measurements is strictly greater than zero whenever the associated observables do not have a common eigenvector. For such measurements, we show an equivalence between disturbance tradeoff measured in terms of fidelity and the entropic uncertainty tradeoff formulated in terms of the Tsallis entropy (T2). We also investigate the disturbances associated with the class of nonprojective measurements, where the difference between the disturbance tradeoff and the uncertainty tradeoff manifests quite clearly.