arXiv subjects

Saikat Guha

Publications and source records attributed to Saikat Guha.

At least 163 records · Page 9Linked to original sources

arXiv2017

On the minimum output entropy of single-mode phase-insensitive Gaussian channels

Recently de Palma et al. [IEEE Trans. Inf. Theory 63, 728 (2017)] proved---using Lagrange multiplier techniques---that under a non-zero input entropy constraint, a thermal state input minimizes the output entropy of a pure-loss bosonic channel. In this note, we present our attempt to generalize this result to all single-mode gauge-covariant Gaussian channels by using similar techniques. Unlike the case of the pure-loss channel, we cannot prove that the thermal input state is the only local extremum of the optimization problem. %It is unclear to us why the same techniques do not lead to a proof for amplifier channels. However, we do prove that, if the conjecture holds for gauge-covariant Gaussian channels, it would also hold for gauge-contravariant Gaussian channels. The truth of the latter leads to a solution of the triple trade-off and broadcast capacities of quantum-limited amplifier channels. We note that de Palma et al. [Phys. Rev. Lett. 118, 160503 (2017)] have now proven the conjecture for all single-mode gauge-covariant Gaussian channels by employing a different approach from what we outline here. Proving a multi-mode generalization of de Palma et al.'s above mentioned result---i.e., given a lower bound on the von Neumann entropy of the input to an $n$-mode lossy thermal-noise bosonic channel, an $n$-mode product thermal state input minimizes the output entropy---will establish an important special case of the conjectured Entropy Photon-number Inequality (EPnI). The EPnI, if proven true, would take on a role analogous to Shannon's EPI in proving coding theorem converses involving quantum limits of classical communication over bosonic channels.

quant-ph↗

arXiv2017

Covert Communication in the Presence of an Uninformed Jammer

Recent work has established that when transmitter Alice wishes to communicate reliably to recipient Bob without detection by warden Willie, with additive white Gaussian noise (AWGN) channels between all parties, communication is limited to $\mathcal{O}(\sqrt{n})$ bits in $n$ channel uses. However, this assumes Willie has an accurate statistical characterization of the channel. When Willie has uncertainty about such and his receiver is limited to a threshold test on the received power, Alice can transmit covertly with a power that does not decrease with $n$, thus conveying $\mathcal{O}(n)$ bits covertly and reliably in $n$ uses of an AWGN channel. Here, we consider covert communication of $\mathcal{O}(n)$ bits in $n$ channel uses while generalizing the environment and removing any restrictions on Willie's receiver. We assume an uninformed "jammer" is present to help Alice, and we consider AWGN and block fading channels. In some scenarios, Willie's optimal detector is a threshold test on the received power. When the channel between the jammer and Willie has multiple fading blocks per codeword, a threshold test on the received power is not optimal. However, we establish that Alice can remain covert with a transmit power that does not decrease with $n$ even when Willie employs an optimal detector.

cs.IT↗

arXiv2017

On capacity of optical communications over a lossy bosonic channel with a receiver employing the most general coherent electro-optic feedback control

We study the problem of designing optical receivers to discriminate between multiple coherent states using coherent processing receivers---i.e., one that uses arbitrary coherent feedback control and quantum-noise-limited direct detection---which was shown by Dolinar to achieve the minimum error probability in discriminating any two coherent states. We first derive and re-interpret Dolinar's binary-hypothesis minimum-probability-of-error receiver as the one that optimizes the information efficiency at each time instant, based on recursive Bayesian updates within the receiver. Using this viewpoint, we propose a natural generalization of Dolinar's receiver design to discriminate $M$ coherent states each of which could now be a codeword, i.e., a sequence of $N$ coherent states each drawn from a modulation alphabet. We analyze the channel capacity of the pure-loss optical channel with a general coherent-processing receiver in the low-photon number regime and compare it with the capacity achievable with direct detection and the Holevo limit (achieving the latter would require a quantum joint-detection receiver). We show compelling evidence that despite the optimal performance of Dolinar's receiver for the binary coherent-state hypothesis test (either in error probability or mutual information), the asymptotic communication rate achievable by such a coherent-processing receiver is only as good as direct detection. This suggests that in the infinitely-long codeword limit, all potential benefits of coherent processing at the receiver can be obtained by designing a good code and direct detection, with no feedback within the receiver.

quant-ph↗

arXiv2017

A de Bruijn identity for discrete random variables

We discuss properties of the "beamsplitter addition" operation, which provides a non-standard scaled convolution of random variables supported on the non-negative integers. We give a simple expression for the action of beamsplitter addition using generating functions. We use this to give a self-contained and purely classical proof of a heat equation and de Bruijn identity, satisfied when one of the variables is geometric.

cs.IT↗

arXiv2017

Fundamental limits of quantum-secure covert optical sensing

We present a square root law for active sensing of phase $θ$ of a single pixel using optical probes that pass through a single-mode lossy thermal-noise bosonic channel. Specifically, we show that, when the sensor uses an $n$-mode covert optical probe, the mean squared error (MSE) of the resulting estimator $\hatθ_n$ scales as $\langle (θ-\hatθ_n)^2\rangle=\mathcal{O}(1/\sqrt{n})$; improving the scaling necessarily leads to detection by the adversary with high probability. We fully characterize this limit and show that it is achievable using laser light illumination and a heterodyne receiver, even when the adversary captures every photon that does not return to the sensor and performs arbitrarily complex measurement as permitted by the laws of quantum mechanics.

quant-ph↗

arXiv2017

Fundamental limit of resolving two point sources limited by an arbitrary point spread function

Estimating the angular separation between two incoherently radiating monochromatic point sources is a canonical toy problem to quantify spatial resolution in imaging. In recent work, Tsang {\em et al.} showed, using a Fisher Information analysis, that Rayleigh's resolution limit is just an artifact of the conventional wisdom of intensity measurement in the image plane. They showed that the optimal sensitivity of estimating the angle is only a function of the total photons collected during the camera's integration time but entirely independent of the angular separation itself no matter how small it is, and found the information-optimal mode basis, intensity detection in which achieves the aforesaid performance. We extend the above analysis, which was done for a Gaussian point spread function (PSF) to a hard-aperture pupil proving the information optimality of image-plane sinc-Bessel modes, and generalize the result further to an arbitrary PSF. We obtain new counterintuitive insights on energy vs. information content in spatial modes, and extend the Fisher Information analysis to exact calculations of minimum mean squared error, both for Gaussian and hard aperture pupils.

physics.optics↗

arXiv2017

Percolation thresholds for photonic quantum computing

Any quantum algorithm can be implemented by an adaptive sequence of single node measurements on an entangled cluster of qubits in a square lattice topology. Photons are a promising candidate for encoding qubits but assembling a photonic entangled cluster with linear optical elements relies on probabilistic operations. Given a supply of $n$-photon-entangled microclusters, using a linear optical circuit and photon detectors, one can assemble a random entangled state of photons that can be subsequently "renormalized" into a logical cluster for universal quantum computing. In this paper, we prove that there is a fundamental tradeoff between $n$ and the minimum success probability $λ_c^{(n)}$ that each two-photon linear-optical fusion operation must have, in order to guarantee that the resulting state can be renormalized: $λ_c^{(n)} \ge 1/(n-1)$. We present a new way of formulating this problem where $λ_c^{(n)}$ is the bond percolation threshold of a logical graph and provide explicit constructions to produce a percolated cluster using $n=3$ photon microclusters (GHZ states) as the initial resource. We settle a heretofore open question by showing that a renormalizable cluster can be created with $3$-photon microclusters over a 2D graph without feedforward, which makes the scheme extremely attractive for an integrated-photonic realization. We also provide lattice constructions, which show that $0.5 \le λ_c^{(3)} \le 0.5898$, improving on a recent result of $λ_c^{(3)} \le 0.625$. Finally, we discuss how losses affect the bounds on the threshold, using loss models inspired by a recently-proposed method to produce photonic microclusters using quantum dot emitters.

quant-ph↗

arXiv2016

Rate-distance tradeoff and resource costs for all-optical quantum repeaters

We present a resource-performance tradeoff of an all-optical quantum repeater that uses photon sources, linear optics, photon detectors and classical feedforward at each repeater node, but no quantum memories. We show that the quantum-secure key rate has the form $R(η) = Dη^s$ bits per mode, where $η$ is the end-to-end channel's transmissivity, and the constants $D$ and $s$ are functions of various device inefficiencies and the resource constraint, such as the number of available photon sources at each repeater node. Even with lossy devices, we show that it is possible to attain $s < 1$, and in turn outperform the maximum key rate attainable without quantum repeaters, $R_{\rm direct}(η) = -\log_2(1-η) \approx (1/\ln 2)η$ bits per mode for $η\ll 1$, beyond a certain total range $L$, where $η\sim e^{-αL}$ in optical fiber. We also propose a suite of modifications to a recently-proposed all-optical repeater protocol that ours builds upon, which lower the number of photon sources required to create photonic clusters at the repeaters so as to outperform $R_{\rm direct}(η)$, from $\sim 10^{11}$ to $\sim 10^{6}$ photon sources per repeater node. We show that the optimum separation between repeater nodes is independent of the total range $L$, and is around $1.5$ km for assumptions we make on various device losses.

quant-ph↗

arXiv2016

Quantum Key Distribution Using Multiple Gaussian Focused Beams

The secret key rate attained by a free-space QKD system in the {\em near-field} propagation regime (relevant for $1$-$10$ km range using $\approx 7$ cm radii transmit and receive apertures and $1.55~μ$m transmission center wavelenght) can benefit from the use of multiple spatial modes. A suite of theoretical research in recent years have suggested the use of orbital-angular-momentum (OAM) bearing spatial modes of light to obtain this improvement in rate. We show that most of the aforesaid rate improvement in the near field afforded by spatial-mode multiplexing can be realized by a simple-to-build overlapping Gaussian beam array (OGBA) and a pixelated detector array. With the current state-of-the-art in OAM-mode-sorting efficiencies, the key-rate performance of our OGBA architecture could come very close to, if not exceed, that of a system employing OAM modes, but at a fraction of the cost.

quant-ph↗

arXiv2016

Quantum-optimal detection of one-versus-two incoherent sources with arbitrary separation

We analyze the fundamental resolution of incoherent optical point sources from the perspective of a quantum detection problem: deciding whether the optical field on the image plane is generated by one source or two weaker sources with arbitrary separation. We investigate the detection performances of two measurement methods recently proposed by us to enhance the estimation of the separation. For the detection problem, we show that the method of binary spatial-mode demultiplexing is quantum-optimal for all values of separations, while the method of image-inversion interferometry is near-optimal for sub-Rayleigh separations. Unlike the proposal by Helstrom, our schemes do not require the separation to be given and can offer that information as a bonus in the event of a successful detection. For comparison, we also demonstrate the supremacy of our schemes over direct imaging for sub-Rayleigh separations. These results demonstrate that simple linear optical measurements can offer supremal performances for both detection and estimation.

quant-ph↗

arXiv2016

Attaining the quantum limit of passive imaging

We consider the problem, where a camera is tasked with determining one of two hypotheses: first with an incoherently-radiating quasi-monochromatic point source and the second with two identical closely spaced point sources. We are given that the total number of photons collected over an integration time is assumed to be the same under either hypothesis. For the one-source hypothesis, the source is taken to be on-axis along the line of sight and for the two-source hypothesis, we give ourselves the prior knowledge of the angular separation of the sources, and they are assumed to be identical and located symmetrically off-axis. This problem was studied by Helstrom in 1973, who evaluated the probability of error achievable using a sub-optimal optical measurement, with an unspecified structured realization. In this paper, we evaluate the quantum Chernoff bound, a lower bound on the minimum probability of error achievable by any physically-realizable receiver, which is exponentially tight in the regime that the integration time is high. We give an explicit structured receiver that separates three orthogonal spatial modes of the aperture field followed by quantum-noise-limited time-resolved photon measurement and show that this achieves the quantum Chernoff bound. In other words, the classical Chernoff bound of our mode-resolved detector exactly matches the quantum Chernoff bound for this problem. Finally, we evaluate the classical Chernoff bound on the error probability achievable using an ideal focal plane array---a signal shot-noise limited continuum photon-detection receiver with infinitely many infinitesimally-tiny pixels---and quantify its performance gap with the quantum limit.

quant-ph↗

arXiv2016

Superadditivity of Quantum Channel Coding Rate with Finite Blocklength Joint Measurements

The maximum rate at which classical information can be reliably transmitted per use of a quantum channel strictly increases in general with $N$, the number of channel outputs that are detected jointly by the quantum joint-detection receiver (JDR). This phenomenon is known as superadditivity of the maximum achievable information rate over a quantum channel. We study this phenomenon for a pure-state classical-quantum (cq) channel and provide a lower bound on $C_N/N$, the maximum information rate when the JDR is restricted to making joint measurements over no more than $N$ quantum channel outputs, while allowing arbitrary classical error correction. We also show the appearance of a superadditivity phenomenon---of mathematical resemblance to the aforesaid problem---in the channel capacity of a classical discrete memoryless channel (DMC) when a concatenated coding scheme is employed, and the inner decoder is forced to make hard decisions on $N$-length inner codewords. Using this correspondence, we develop a unifying framework for the above two notions of superadditivity, and show that for our lower bound to $C_N/N$ to be equal to a given fraction of the asymptotic capacity $C$ of the respective channel, $N$ must be proportional to $V/C^2$, where $V$ is the respective channel dispersion quantity.

cs.IT↗

arXiv2016

Spanning connectivity in a multilayer network and its relationship to site-bond percolation

We analyze the connectivity of an $M$-layer network over a common set of nodes that are active only in a fraction of the layers. Each layer is assumed to be a subgraph (of an underlying connectivity graph $G$) induced by each node being active in any given layer with probability $q$. The $M$-layer network is formed by aggregating the edges over all $M$ layers. We show that when $q$ exceeds a threshold $q_c(M)$, a giant connected component appears in the $M$-layer network---thereby enabling far-away users to connect using `bridge' nodes that are active in multiple network layers---even though the individual layers may only have small disconnected islands of connectivity. We show that $q_c(M) \lesssim \sqrt{-\ln(1-p_c)}\,/{\sqrt{M}}$, where $p_c$ is the bond percolation threshold of $G$, and $q_c(1) \equiv q_c$ is its site percolation threshold. We find $q_c(M)$ exactly for when $G$ is a large random network with an arbitrary node-degree distribution. We find $q_c(M)$ numerically for various regular lattices, and find an exact lower bound for the kagome lattice. Finally, we find an intriguingly close connection between this multilayer percolation model and the well-studied problem of site-bond percolation, in the sense that both models provide a smooth transition between the traditional site and bond percolation models. Using this connection, we translate known analytical approximations of the site-bond critical region, which are functions only of $p_c$ and $q_c$ of the respective lattice, to excellent general approximations of the multilayer connectivity threshold $q_c(M)$.

cond-mat.stat-mech↗

arXiv2016

Thinning, photonic beamsplitting, and a general discrete entropy power inequality

Many partially-successful attempts have been made to find the most natural discrete-variable version of Shannon's entropy power inequality (EPI). We develop an axiomatic framework from which we deduce the natural form of a discrete-variable EPI and an associated entropic monotonicity in a discrete-variable central limit theorem. In this discrete EPI, the geometric distribution, which has the maximum entropy among all discrete distributions with a given mean, assumes a role analogous to the Gaussian distribution in Shannon's EPI. The entropy power of $X$ is defined as the mean of a geometric random variable with entropy $H(X)$. The crux of our construction is a discrete-variable version of Lieb's scaled addition $X \boxplus_ηY$ of two discrete random variables $X$ and $Y$ with $η\in (0, 1)$. We discuss the relationship of our discrete EPI with recent work of Yu and Johnson who developed an EPI for a restricted class of random variables that have ultra-log-concave (ULC) distributions. Even though we leave open the proof of the aforesaid natural form of the discrete EPI, we show that this discrete EPI holds true for variables with arbitrary discrete distributions when the entropy power is redefined as $e^{H(X)}$ in analogy with the continuous version. Finally, we show that our conjectured discrete EPI is a special case of the yet-unproven Entropy Photon-number Inequality (EPnI), which assumes a role analogous to Shannon's EPI in capacity proofs for Gaussian bosonic (quantum) channels.

cs.IT↗

arXiv2015

Rate-loss analysis of an efficient quantum repeater architecture

We analyze an entanglement-based quantum key distribution (QKD) architecture that uses a linear chain of quantum repeaters employing photon-pair sources, spectral-multiplexing, linear-optic Bell-state measurements, multi-mode quantum memories and classical-only error correction. Assuming perfect sources, we find an exact expression for the secret-key rate, and an analytical description of how errors propagate through the repeater chain, as a function of various loss and noise parameters of the devices. We show via an explicit analytical calculation, which separately addresses the effects of the principle non-idealities, that this scheme achieves a secret key rate that surpasses the TGW bound---a recently-found fundamental limit to the rate-vs.-loss scaling achievable by any QKD protocol over a direct optical link---thereby providing one of the first rigorous proofs of the efficacy of a repeater protocol. We explicitly calculate the end-to-end shared noisy quantum state generated by the repeater chain, which could be useful for analyzing the performance of other non-QKD quantum protocols that require establishing long-distance entanglement. We evaluate that shared state's fidelity and the achievable entanglement distillation rate, as a function of the number of repeater nodes, total range, and various loss and noise parameters of the system. We extend our theoretical analysis to encompass sources with non-zero two-pair-emission probability, using an efficient exact numerical evaluation of the quantum state propagation and measurements. We expect our results to spur formal rate-loss analysis of other repeater protocols, and also to provide useful abstractions to seed analyses of quantum networks of complex topologies.

quant-ph↗

arXiv2015

Optimal Measurements for Symmetric Quantum States with Applications to Optical Communication

The minimum probability of error (MPE) measurement discriminates between a set of candidate quantum states with the minimum average error probability allowed by quantum mechanics. Conditions for a measurement to be MPE were derived by Yuen, Kennedy and Lax (YKL). MPE measurements have been found for states that form a single orbit under a group action, i.e., there is a transitive group action on the states in the set. For such state sets, termed geometrically uniform (GU) by Forney, it was shown that the `pretty good measurement' (PGM) attains the MPE. Even so, evaluating the actual probability of error (and other performance metrics) attained by the PGM on a GU set involves inverting large matrices, and is not easy in general. Our first contribution is a formula for the MPE and conditional probabilities of GU sets, using group representation theory. Next, we consider sets of pure states that have multiple orbits under the group action. Such states are termed compound geometrically uniform (CGU). MPE measurements for general CGU sets are not known. In this paper, we show how our representation-theoretic description of optimal measurements for GU sets naturally generalizes to the CGU case. We show how to compute the MPE measurement for CGU sets by reducing the problem to solving a few simultaneous equations. The number of equations depends on the sizes of the multiplicity space of irreducible representations. For many common group representations (such as those of several practical good linear codes), this is much more tractable than solving large semi-definite programs---which is what is needed to solve the YKL conditions numerically for arbitrary state sets. We show how to evaluate MPE measurements for CGU states for some examples relevant to quantum-limited classical optical communication.

quant-ph↗

arXiv2015

Hiding Information in Noise: Fundamental Limits of Covert Wireless Communication

Widely-deployed encryption-based security prevents unauthorized decoding, but does not ensure undetectability of communication. However, covert, or low probability of detection/intercept (LPD/LPI) communication is crucial in many scenarios ranging from covert military operations and the organization of social unrest, to privacy protection for users of wireless networks. In addition, encrypted data or even just the transmission of a signal can arouse suspicion, and even the most theoretically robust encryption can often be defeated by a determined adversary using non-computational methods such as side-channel analysis. Various covert communication techniques were developed to address these concerns, including steganography for finite-alphabet noiseless applications and spread-spectrum systems for wireless communications. After reviewing these covert communication systems, this article discusses new results on the fundamental limits of their capabilities, as well as provides a vision for the future of such systems.

cs.IT↗

arXiv2015

Practical Quantum Repeaters with Parametric Down-Conversion Sources

Conventional wisdom suggests that realistic quantum repeaters will require quasi-deterministic sources of entangled photon pairs. In contrast, we here study a quantum repeater architecture that uses simple parametric down-conversion sources, as well as frequency-multiplexed multimode quantum memories and photon-number resolving detectors. We show that this approach can significantly extend quantum communication distances compared to direct transmission. This shows that important trade-offs are possible between the different components of quantum repeater architectures.

quant-ph↗