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.

The quantum computing devices of today have tens to hundreds of qubits that are highly susceptible to noise due to unwanted interactions with their environment. The theory of quantum error correction provides a scheme by which the effects of such noise on quantum states can be mitigated, paving the way for realising robust, scalable quantum computers. In this article we survey the current landscape of quantum error correcting (QEC) codes, focusing on recent theoretical advances in the domain of noise-adapted QEC, and highlighting some key open questions. We also discuss the interesting connections that have emerged between such adaptive QEC techniques and fundamental physics, especially in the areas of many-body physics and cosmology. We conclude with a brief review of the theory of quantum fault tolerance which gives a quantitative estimate of the physical noise threshold below which error-resilient quantum computation is possible.

Key generation efficiency, and security, in differential phase-shift quantum key distribution (DPS-QKD) improve with an increase in the number of optical delays or time-bin superpositions. We demonstrate the implementation of superposition states using time-bins, with two different approaches. In Type-A, we use an optical pulse and create superposition states with optical splitters and path delays. Similar superposition states are created, in Type-B, by applying direct phase modulation within a single weak coherent pulse. We establish the equivalence between both the approaches, and note that higher-order superposition states of Type-B are easier to generate for DPS-QKD. We set up DPS-QKD, over 105 km of single mode optical fiber, with a quantum bit error rate of less than 15% at a secure key rate of 2 kbps. With temporal guard bands, the QBER reduced to less than 10%, but with a 20% reduction in the key rate.

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.

We investigate the role of symmetric quantum cloning machines (QCMs) in quantifying the mutual incompatibility of quantum observables. Specifically, we identify a cloning-based incompatibility measure whereby the incompatibility of a set of observables maybe quantified in terms of how well a uniform ensemble of their eigenstates can be cloned via a symmetric QCM. We show that this new incompatibility measure Qc is faithful since it vanishes only for commuting observables.We prove an upper bound forQc for any set of observables in a finite-dimensional system and show that the upper bound is attained if and only if the observables are mutually unbiased. Finally, we use our formalism to obtain the optimal quantum cloner for a pair of qubit observables. Our work marks an important step in formalising the connection between two fundamental concepts in quantum information theory, namely, the no-cloning principle and the existence of incompatible observables in quantum theory.

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.

With the intense interest in small, noisy quantum computing devices comes the push for larger, more accurate - and hence more useful - quantum computers. While fully fault-tolerant quantum computers are, in principle, capable of achieving arbitrarily accurate calculations using devices subjected to general noise, they require immense resources far beyond our current reach. An intermediate step would be to construct quantum computers of limited accuracy enhanced by lower-level, and hence lower-cost, noise-removal techniques. This is the motivation for our paper, which looks into fault-tolerant encoded quantum computation targeted at the dominant noise afflicting the quantum device. Specifically, we develop a protocol for fault-tolerant encoded quantum computing components in the presence of amplitude-damping noise, using a 4-qubit code and a recovery procedure tailored to such noise. We describe a universal set of fault-tolerant encoded gadgets and compute the pseudothreshold for the noise, below which our scheme leads to more accurate computation. Our paper demonstrates the possibility of applying the ideas of quantum fault tolerance to targeted noise models, generalizing the recent pursuit of biased-noise fault tolerance beyond the usual Pauli noise models. We also illustrate how certain aspects of the standard fault tolerance intuition, largely acquired through Pauli-noise considerations, can fail in the face of more general noise.

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.