arXiv subjects

Saikat Guha

Publications and source records attributed to Saikat Guha.

At least 145 records · Page 8Linked to original sources

arXiv2019

Approaching Quantum Limited Super-Resolution Imaging without Prior Knowledge of the Object Location

A recently identified class of receivers which demultiplex an optical field into a set of orthogonal spatial modes prior to detection can surpass canonical diffraction limits on spatial resolution for simple incoherent imaging tasks. However, these mode-sorting receivers tend to exhibit high sensitivity to contextual nuisance parameters (e.g., the centroid of a clustered or extended object), raising questions on their viability in realistic imaging scenarios where little or no prior information about the scene is available. We propose a multi-stage passive imaging strategy which segments the total recording time between different physical measurements to build up the required prior information for near quantum-optimal imaging performance at sub-Rayleigh length scales. We show via Monte Carlo simulations that an adaptive two-stage scheme which dynamically allocates the total recording time between a traditional direct detection measurement and a binary mode-sorting receiver outperforms idealized direct detection alone for simple estimation tasks when no prior knowledge of the object centroid is available, achieving one to two orders of magnitude improvement in mean squared error. Our scheme can be generalized for more sophisticated imaging tasks with multiple parameters and minimal prior information.

quant-ph↗

arXiv2019

On the Stochastic Analysis of a Quantum Entanglement Switch

We study a quantum entanglement switch that serves $k$ users in a star topology. We model variants of the system using Markov chains and standard queueing theory and obtain expressions for switch capacity and the expected number of qubits stored in memory at the switch. While it is more accurate to use a discrete-time Markov chain (DTMC) to model such systems, we quickly encounter practical constraints of using this technique and switch to using continuous-time Markov chains (CTMCs). Using CTMCs allows us to obtain a number of analytic results for systems in which the links are homogeneous or heterogeneous and for switches that have infinite or finite buffer sizes. In addition, we can model the effects of decoherence of quantum states fairly easily using CTMCs. We also compare the results we obtain from the DTMC against the CTMC in the case of homogeneous links and infinite buffer, and learn that the CTMC is a reasonable approximation of the DTMC. From numerical observations, we discover that decoherence has little effect on capacity and expected number of stored qubits for homogeneous systems. For heterogeneous systems, especially those operating close to stability constraints, buffer size and decoherence can have significant effects on performance metrics. We also learn that in general, increasing the buffer size from one to two qubits per link is advantageous to most systems, while increasing the buffer size further yields diminishing returns.

quant-ph↗

arXiv2019

Fundamental limits of quantum-secure covert communication over bosonic channels

We investigate the fundamental limit of quantum-secure covert communication over the lossy thermal noise bosonic channel, the quantum-mechanical model underlying many practical channels. We assume that the adversary has unlimited quantum information processing capabilities as well as access to all transmitted photons that do not reach the legitimate receiver. Given existence of noise that is uncontrolled by the adversary, the square root law (SRL) governs covert communication: up to c*sqrt{n} covert bits can be transmitted reliably in n channel uses. Attempting to surpass this limit results in detection with unity probability as n approaches infinity. Here we present the expression for c, characterizing the SRL for the bosonic channel. We also prove that discrete-valued coherent state quadrature phase shift keying (QPSK) constellation achieves the optimal c, which is the same as that achieved by a circularly-symmetric complex-valued Gaussian prior on coherent state amplitude. Finally, while binary phase shift keying (BPSK) achieves the Holevo capacity for non-covert bosonic channels in the low received signal-to-noise ratio regime, we show that it is strictly sub-optimal for covert communication.

cs.IT↗

arXiv2019

Continuous-variable entanglement distillation over a pure loss channel with multiple quantum scissors

Entanglement distillation is a key primitive for distributing high-quality entanglement between remote locations. Probabilistic noiseless linear amplification based on the quantum scissors is a candidate for entanglement distillation from noisy continuous-variable (CV) entangled states. Being a non-Gaussian operation, quantum scissors is challenging to analyze. We present a derivation of the non-Gaussian state heralded by multiple quantum scissors in a pure loss channel with two-mode squeezed vacuum input. We choose the reverse coherent information (RCI)---a proven lower bound on the distillable entanglement of a quantum state under one-way local operations and classical communication (LOCC), as our figure of merit. We evaluate a Gaussian lower bound on the RCI of the heralded state. We show that it can exceed the unlimited two-way LOCCassisted direct transmission entanglement distillation capacity of the pure loss channel. The optimal heralded Gaussian RCI with two quantum scissors is found to be significantly more than that with a single quantum scissors, albeit at the cost of decreased success probability. Our results fortify the possibility of a quantum repeater scheme for CV quantum states using the quantum scissors.

quant-ph↗

arXiv2019

Wave Function Engineering for Spectrally-Uncorrelated Biphotons in the Telecommunication Band based on a Machine-Learning Framework

Indistinguishable single photons are key ingredient for a plethora of quantum information processing applications ranging from quantum communications to photonic quantum computing. A mainstream platform to produce indistinguishable single photons over a wide spectral range is based on biphoton generation through spontaneous parametric down-conversion (SPDC) in nonlinear crystals. The purity of the SPDC biphotons, however, is limited by their spectral correlations. Here, we present a design recipe, based on a machine-learning framework, for the engineering of biphoton joint spectrum amplitudes over a wide spectral range. By customizing the poling profile of the KTiOPO$_4$ (KTP) crystal, we show, numerically, that spectral purities of 99.22%, 99.99%, and 99.82% can be achieved, respectively, in the 1310-nm, 1550-nm, and 1600-nm bands after applying a moderate 8-nm filter. The machine-learning framework thus enables the generation of near-indistinguishable single photons over the entire telecommunication band without resorting to KTP crystal's group-velocity-matching wavelength window near 1582 nm.

quant-ph↗

arXiv2019

Efficient representation of Gaussian states for multi-mode non-Gaussian quantum state engineering via subtraction of arbitrary number of photons

We introduce a complete description of a multi-mode bosonic quantum state in the coherent-state basis (which in this work is denoted as "$K$" function ), which---up to a phase---is the square root of the well-known Husimi "$Q$" representation. We express the $K$ function of any $N$-mode Gaussian state as a function of its covariance matrix and displacement vector, and also that of a general continuous-variable cluster state in terms of the modal squeezing and graph topology of the cluster. This formalism lets us characterize the non Gaussian state left over when one measures a subset of modes of a Gaussian state using photon number resolving detection, the fidelity of the obtained non-Gaussian state with any target state, and the associated heralding probability, all analytically. We show that this probability can be expressed as a Hafnian, re-interpreting the output state of a circuit claimed to demonstrate quantum supremacy termed Gaussian boson sampling. As an example-application of our formalism, we propose a method to prepare a two-mode coherent-cat-basis Bell state with fidelity close to unity and success probability that is fundamentally higher than that of a well-known scheme that splits an approximate single-mode cat state---obtained by photon number subtraction on a squeezed vacuum mode---on a balanced beam splitter. This formalism could enable exploration of efficient generation of cat-basis entangled states, which are known to be useful for quantum error correction against photon loss.

quant-ph↗

arXiv2019

Secret key distillation across a quantum wiretap channel under restricted eavesdropping

The theory of quantum cryptography aims to guarantee unconditional information-theoretic security against an omnipotent eavesdropper. In many practical scenarios, however, the assumption of an all-powerful adversary is excessive and can be relaxed considerably. In this paper we study secret key distillation across a lossy and noisy quantum wiretap channel between Alice and Bob, with a separately parameterized realistically lossy quantum channel to the eavesdropper Eve. We show that under such restricted eavesdropping, the key rates achievable can exceed the secret key distillation capacity against an unrestricted eavesdropper in the quantum wiretap channel. Further, we show upper bounds on the key rates based on the relative entropy of entanglement. This simple restricted eavesdropping model is widely applicable, e.g., to free-space quantum optical communication, where realistic collection of light by Eve is limited by the finite size of her optical aperture. Future work will include calculating bounds on the amount of light Eve can collect under various realistic scenarios.

cs.IT↗

arXiv2019

Quantum Networks For Open Science

The United States Department of Energy convened the Quantum Networks for Open Science (QNOS) Workshop in September 2018. The workshop was primarily focused on quantum networks optimized for scientific applications with the expectation that the resulting quantum networks could be extended to lay the groundwork for a generalized network that will evolve into a quantum internet.

quant-ph↗

arXiv2018

Covert sensing using floodlight illumination

We propose a scheme for covert active sensing using floodlight illumination from a THz-bandwidth amplified spontaneous emission (ASE) source and heterodyne detection. We evaluate the quantum-estimation-theoretic performance limit of covert sensing, wherein a transmitter's attempt to sense a target phase is kept undetectable to a quantum-equipped passive adversary, by hiding the signal photons under the thermal noise floor. Despite the quantum state of each mode of the ASE source being mixed (thermal), and hence inferior compared to the pure coherent state of a laser mode, the thousand-times higher optical bandwidth of the ASE source results in achieving a substantially superior performance compared to a narrowband laser source by allowing the probe light to be spread over many more orthogonal temporal modes within a given integration time. Even though our analysis is restricted to single-mode phase sensing, this system could be applicable extendible for various practical optical sensing applications.

quant-ph↗

arXiv2018

Boosting Linear-Optical Bell Measurement Success Probability with Pre-Detection Squeezing and Imperfect Photon-Number-Resolving Detectors

Linear optical realizations of Bell state measurement (BSM) on two single-photon qubits succeed with probability $p_s$ no higher than $0.5$. However pre-detection quadrature squeezing, i.e., quantum noise limited phase sensitive amplification, in the usual linear-optical BSM circuit, can yield ${p_s \approx 0.643}$. The ability to achieve $p_s > 0.5$ has been found to be critical in resource-efficient realizations of linear optical quantum computing and all-photonic quantum repeaters. Yet, the aforesaid value of $p_s > 0.5$ is not known to be the maximum achievable using squeezing, thereby leaving it open whether close-to-$100\%$ efficient BSM might be achievable using squeezing as a resource. In this paper, we report new insights on why squeezing-enhanced BSM achieves $p_s > 0.5$. Using this, we show that the previously-reported ${p_s \approx 0.643}$ at single-mode squeezing strength $r=0.6585$---for unambiguous state discrimination (USD) of all four Bell states---is an experimentally unachievable point result, which drops to $p_s \approx 0.59$ with the slightest change in $r$. We however show that squeezing-induced boosting of $p_s$ with USD operation is still possible over a continuous range of $r$, with an experimentally achievable maximum occurring at $r=0.5774$, achieving ${p_s \approx 0.596}$. Finally, deviating from USD operation, we explore a trade-space between $p_s$, the probability with which the BSM circuit declares a "success", versus the probability of error $p_e$, the probability of an input Bell state being erroneously identified given the circuit declares a success. Since quantum error correction could correct for some $p_e > 0$, this tradeoff may enable better quantum repeater designs by potentially increasing the entanglement generation rates with $p_s$ exceeding what is possible with traditionally-studied USD operation of BSMs.

quant-ph↗

arXiv2018

Covert Wireless Communication with Artificial Noise Generation

Covert communication conceals the transmission of the message from an attentive adversary. Recent work on the limits of covert communication in additive white Gaussian noise (AWGN) channels has demonstrated that a covert transmitter (Alice) can reliably transmit a maximum of $\mathcal{O}\left(\sqrt{n}\right)$ bits to a covert receiver (Bob) without being detected by an adversary (Warden Willie) in $n$ channel uses. This paper focuses on the scenario where other friendly nodes distributed according to a two-dimensional Poisson point process with density $m$ are present in the environment. We propose a strategy where the friendly node closest to the adversary, without close coordination with Alice, produces artificial noise. We show that this method allows Alice to reliably and covertly send $\mathcal{O}(\min\{{n,m^{γ/2}\sqrt{n}}\})$ bits to Bob in $n$ channel uses, where $γ$ is the path-loss exponent. Moreover, we also consider a setting where there are $N_{\mathrm{w}}$ collaborating adversaries uniformly and randomly located in the environment and show that in $n$ channel uses, Alice can reliably and covertly send $\mathcal{O}\left(\min\left\{n,\frac{m^{γ/2} \sqrt{n}}{N_{\mathrm{w}}^γ}\right\}\right)$ bits to Bob when $γ>2$, and $\mathcal{O}\left(\min\left\{n,\frac{m \sqrt{n}}{N_{\mathrm{w}}^{2}\log^2 {N_{\mathrm{w}}}}\right\}\right)$ when $γ= 2$. Conversely, we demonstrate that no higher covert throughput is possible for $γ>2$.

cs.IT↗

arXiv2018

On a Class of Stochastic Multilayer Networks

In this paper, we introduce a new class of stochastic multilayer networks. A stochastic multilayer network is the aggregation of $M$ networks (one per layer) where each is a subgraph of a foundational network $G$. Each layer network is the result of probabilistically removing links and nodes from $G$. The resulting network includes any link that appears in at least $K$ layers. This model is an instance of a non-standard site-bond percolation model. Two sets of results are obtained: first, we derive the probability distribution that the $M$-layer network is in a given configuration for some particular graph structures (explicit results are provided for a line and an algorithm is provided for a tree), where a configuration is the collective state of all links (each either active or inactive). Next, we show that for appropriate scalings of the node and link selection processes in a layer, links are asymptotically independent as the number of layers goes to infinity, and follow Poisson distributions. Numerical results are provided to highlight the impact of having several layers on some metrics of interest (including expected size of the cluster a node belongs to in the case of the line). This model finds applications in wireless communication networks with multichannel radios, multiple social networks with overlapping memberships, transportation networks, and, more generally, in any scenario where a common set of nodes can be linked via co-existing means of connectivity.

cs.SI↗

arXiv2018

Multi-Hop Routing in Covert Wireless Networks

In covert communication, Alice tries to communicate with Bob without being detected by a warden Willie. When the distance between Alice and Bob becomes large compared to the distance between Alice and Willie(s), the performance of covert communication will be degraded. In this case, multi-hop message transmission via intermediate relays can help to improve performance. Hence, in this work multi-hop covert communication over a moderate size network and in the presence of multiple collaborating Willies is considered. The relays can transmit covertly using either a single key for all relays, or different independent keys at the relays. For each case, we develop efficient algorithms to find optimal paths with maximum throughput and minimum end-to-end delay between Alice and Bob. As expected, employing multiple hops significantly improves the ability to communicate covertly versus the case of a single-hop transmission. Furthermore, at the expense of more shared key bits, analytical results and numerical simulations demonstrate that multi-hop covert communication with different independent keys at the relays has better performance than multi-hop covert communication with a single key.

cs.NI↗

arXiv2018

Attaining the quantum limit of super resolution in imaging an object's length via pre-detection spatial mode sorting

Recent work considered the ultimate (quantum) limit of the precision of estimating the distance between two point objects. It was shown that the performance gap between the quantum limit and that of ideal continuum image-plane direct detection is the largest for highly sub-Rayleigh separation of the objects, and that a pre-detection mode sorting could attain the quantum limit. Here we extend this to a more general problem of estimating the length of an incoherently radiating extended (line) object. We find, as expected by the Rayleigh criterion, the Fisher information (FI) per integrated photon vanishes in the limit of small length for ideal image plane direct detection. Conversely, for a Hermite-Gaussian (HG) pre-detection mode sorter, this normalized FI does not decrease with decreasing object length, similar to the two point object case. However, unlike in the two-object problem, the FI per photon of both detection strategies gradually decreases as the object length greatly exceeds the Rayleigh limit, due to the relative inefficiency of information provided by photons emanating from near the center of the object about its length. We evaluate the quantum Fisher information per unit integrated photons and find that the HG mode sorter exactly achieves this limit at all values of the object length. Further, a simple binary mode sorter maintains the advantage of the full mode sorter at highly sub-Rayleigh length. In addition to this FI analysis, we quantify improvement in terms of the actual mean squared error of the length estimate. Finally, we consider the effect of imperfect mode sorting, and show that the performance improvement over direct detection is robust over a range of sub-Rayleigh lengths.

physics.optics↗

arXiv2018

Noisy Feedback and Loss Unlimited Private Communication

Alice is transmitting a private message to Bob across a bosonic wiretap channel with the help of a public feedback channel to which all parties, including the fully-quantum equipped Eve, have completely noiseless access. We find that by altering the model such that Eve's copy of the initial round of feedback is corrupted by an iota of noise, one step towards physical relevance, the capacity can be increased dramatically. It is known that the private capacity with respect to the original model for a pure-loss bosonic channel is at most $- \log(1-η)$ bits per mode, where $η$ is the transmissivity, in the limit of infinite input photon number. This is a very pessimistic result as there is a finite rate limit even with an arbitrarily large number of input photons. We refer to this as a loss limited rate. However, in our altered model we find that we can achieve a rate of $(1/2) \log(1 + 4 ηN_S)$ bits per mode, where $N_S$ is the input photon number. This rate diverges with $N_S$, in sharp contrast to the result for the original model. This suggests that physical considerations behind the eavesdropping model should be taken more seriously, as they can create strong dependencies of the achievable rates on the model. For by a seemingly inconsequential weakening of Eve, we obtain a loss-unlimited rate. Our protocol also works verbatim for arbitrary i.i.d. noise (not even necessarily Gaussian) injected by Eve in every round, and even if Eve is given access to copies of the initial transmission and noise. The error probability of the protocol decays super-exponentially with the blocklength.

quant-ph↗

arXiv2017

Covert Single-hop Communication in a Wireless Network with Distributed Artificial Noise Generation

Covert communication, also known as low probability of detection (LPD) communication, prevents the adversary from knowing that a communication is taking place. Recent work has demonstrated that, in a three-party scenario with a transmitter (Alice), intended recipient (Bob), and adversary (Warden Willie), the maximum number of bits that can be transmitted reliably from Alice to Bob without detection by Willie, when additive white Gaussian noise (AWGN) channels exist between all parties, is on the order of the square root of the number of channel uses. In this paper, we begin consideration of network scenarios by studying the case where there are additional "friendly" nodes present in the environment that can produce artificial noise to aid in hiding the communication. We establish achievability results by considering constructions where the system node closest to the warden produces artificial noise and demonstrate a significant improvement in the throughput achieved covertly, without requiring close coordination between Alice and the noise-generating node. Conversely, under mild restrictions on the communication strategy, we demonstrate no higher covert throughput is possible. Extensions to the consideration of the achievable covert throughput when multiple wardens randomly located in the environment collaborate to attempt detection of the transmitter are also considered.

cs.IT↗

arXiv2017

Bounding the quantum limits of precision for phase estimation with loss and thermal noise

We consider the problem of estimating an unknown but constant carrier phase modulation $θ$ using a general -- possibly entangled -- $n$-mode optical probe through $n$ independent and identical uses of a lossy bosonic channel with additive thermal noise. We find an upper bound to the quantum Fisher information (QFI) of estimating $θ$ as a function of $n$, the mean and variance of the total number of photons $N_{\rm S}$ in the $n$-mode probe, the transmissivity $η$ and mean thermal photon number per mode ${\bar n}_{\rm B}$ of the bosonic channel. Since the inverse of QFI provides a lower bound to the mean-squared error (MSE) of an unbiased estimator $\tildeθ$ of $θ$, our upper bound to the QFI provides a lower bound to the MSE. It already has found use in proving fundamental limits of covert sensing, and could find other applications requiring bounding the fundamental limits of sensing an unknown parameter embedded in a correlated field.

quant-ph↗

arXiv2017

Routing entanglement in the quantum internet

Remote quantum entanglement can enable numerous applications including distributed quantum computation, secure communication, and precision sensing. In this paper, we consider how a quantum network-nodes equipped with limited quantum processing capabilities connected via lossy optical links-can distribute high-rate entanglement simultaneously between multiple pairs of users (multiple flows). We develop protocols for such quantum "repeater" nodes, which enable a pair of users to achieve large gains in entanglement rates over using a linear chain of quantum repeaters, by exploiting the diversity of multiple paths in the network. Additionally, we develop repeater protocols that enable multiple user pairs to generate entanglement simultaneously at rates that can far exceed what is possible with repeaters time sharing among assisting individual entanglement flows. Our results suggest that the early-stage development of quantum memories with short coherence times and implementations of probabilistic Bell-state measurements can have a much more profound impact on quantum networks than may be apparent from analyzing linear repeater chains. This framework should spur the development of a general quantum network theory, bringing together quantum memory physics, quantum information theory, and computer network theory.

quant-ph↗